Oly Reflection Journal
By taking Project management module, the author has learnt the importance of time. The author realised that every project is a time critical mission. On 24 January 2010, the group should attend a web meeting. However, the author has totally forgotten about it. Therefore, the group was not able to proceed without the author to coordinate the meeting; the team ended up wasting time.
Following the schedule and keep promises about time is a practice of discipline, self-awareness, and respect for others. A person can only gain trust from others by first keeping promise, especially one which is time critical. When the author remember about the meeting, it is already too late, time will never go back.
The author also learned self-motivation skill. No one else can inspire him if he is not self-motivated. The author motivated himself to balance between his studying, personal time, commitment for employer and family leisure. While time passes by, the author finds gaps between time to complete the assignment; gradually the author delivers the product. For this assignment, no one act as the manager or supervisor to give deadline, goals, award or punishment; the author has to be self-supervised.
The author is currently in his first semester of the final year. This is the first time the author become a part time student. The author experienced that doing part time requires razor sharp time management. The author appreciates this opportunity as a training to manage time effectively.
Around January 25, the author felt that time passes very fast, and the deadline of project is approaching. The author has no other choice but to decrease the time for entertainment, and sacrificed some of personal and family time, in order to catch up with time.
Time management skills helps the author to respect and keep promises to appointments in any projects, because the author will meet clients, CEO of companies, or even Prime Minister in the future. The author will lose chances forever in lifetime by missing an appointment.
The author will use time management tools like spreadsheets and collaboration software, examples are Google Spreadsheet, Facebook Calendar and Huddle.net Workspace. The author can use these tools to upload planned schedules online, and share part of the calendar to colleagues, project stakeholders, friends, and family. Therefore, others can see his activities over specific period of time; the author can accept or reject an appointment based on the agenda in the calendar.
When completing PMGT assignment, the author treated his team mates as customers. The author believed that by doing the author’s best, the customers will be satisfied. Besides, they can perform better if a good product is delivered to them. For example, the author is responsible to create Work Breakdown Structure (WBS). Other team mates need WBS to create cost estimation table, Gantt chart, and others. The author took just 1 day like what he had promised to other team mates to finish WBS. Therefore, other team mates can deliver their product in time as well. In other hand, the author felt satisfied working with team mates, because they treated the author like how the author treated them.
In real business scenario, the author can bring more customer satisfaction to the business. If the author’s colleagues treat each other as customers, the company will grow better in shorter time. “Customer satisfaction number one” becomes the shared assumption, which yields the result of Total Quality Management, because all employees know how to satisfy customers by meeting or exceeding their expectations when rendering a service or delivering a product.
With this inspiration, the author can treat everything related to work as the author’s own work. That means the author is responsible for the job’s outcome, no matter success or failure. The author will not blame other people when comes to any failure in any aspect of living.
The author realised that life can be better by improving a little a day. The author strives for continuous improvement when doing PMGT assignment, by setting goals, then plan strategies to achieve them. For example, the author planned to complete justification for assignment and discover mistakes and omissions. The author also realised that learning goes on for the entire life. The author will continue to learn and explore skill sets in the field of Project Management even the author has finished assignment for PMGT.
Things can also be improved by self-appraisal. The author always ask himself is there anything wrong with the product that the author delivered, can it be improved, or there will sure be something missing even if it looks perfect. By asking these questions, the author can correct minor mistakes in the product, thus improving its quality to win customer’s confidence. Other than that, the author listens to others’ opinion. Opinions that hurt are the best opinion for improvement. The author did not rebuke the opinion, but thanked the person who gave it, and accepted the opinion appreciatively and thankfully.
There was once the author rewarded low in a class tutorial, the question was related to activities done during project scheduling. The lecturer gave comment that too little points were explained in the answer. The author looked for mistakes he has done, and referred to answers given by classmates, and realised that the lecturer’s comment was true. Therefore, the author will be able to give better explanation during exam.
The author experienced that little more effort can make a big difference. The author tried to attend all classes, and be early in each class. The author found that he benefited from better preparation for absorbing knowledge, calmness during the class, and better comprehension of the lecturer’s teaching.
Lastly, the author learned to discipline himself to do a little work a day to achieve a complex task. This is very important for a successful final year project. The author needs this discipline to deliver a good product in any undertakings in the future.
(987 words)
Sunday, January 31, 2010
Friday, January 29, 2010
28 jan oly reflection journal pmgt pgmt assignment
Oly Reflection Journal
By taking Project management module, the author has learnt the importance of time. The author realised that every project is a time critical mission. On 24 January 2010, the group should attend a meeting online, but the author has totally forgotten about the meeting. Therefore, the group is not able to proceed as the author plays a role as leader; the team ended up wasting time.
Following the schedule and keep promises about time is a practice of discipline, self-awareness, and respect for others. The author learnt that, a person can gain trust from others by first keeping promise, especially one which is time critical. When the author realise that he has missed the meeting, it is already too late, because time will never go back.
In real life scenario, this lesson can be applied to any meetings, phone calls, or appointments in any projects, because the author will meet clients, CEO of other company, or even Prime Minister of a country in the future. The author may lose a chance forever in lifetime by missing an appointment. This chance may be a business deal, or even other future business related prospects.
Around January 25, the author felt that time passes very fast, and the deadline of project is approaching. The author has no other choice but to decrease the time for entertainment, and sacrificed some of personal and family time, in order to catch up with time.
From the lesson learnt, the author will use time management tools like spreadsheets and collaboration software, examples are Google Spreadsheet, Facebook Calendar and Huddle.net Workspace. The author can use these tools to upload planned schedules online, and share part of the calendar to colleagues, project team member, friends, and family. Therefore, others can see our activities on a specific period of time, and be able to justify a rejection based on agenda on the calendar.
When completing MGT assignment, the author treated team mates as customers. The author believed that by doing the author’s best, the customers will be satisfied. Besides, they can perform better if a good product is delivered to them. For example, the author is responsible to create Work Breakdown Structure (WBS). Other teammates need WBS to create cost estimation matrix, Gantt chart, and etc. The author took just 1 day like what he had promised to other teammates. Therefore, other teammates can deliver their product in time. In other hand, the author felt satisfied working with teammates, because they treated the author like how author treated them.
In real business scenario, the author can play a role model of realising customer satisfaction. If the author’s colleagues treat each other as customers, the company will grow better in shorter time. “Customer satisfaction number one” becomes the shared assumption, which yields the result of Total Quality Management, because all employees know how to satisfy customers by meeting or exceeding their expectations when rendering a service or delivering a product.
The author also learned self-motivation. If one is not motivated, no one else can inspire him. While completing PMGT assignment, the author has other commitments like career and family leisure too. The author’s self has to find out any gaps between these times to complete the assignment, and gradually deliver the product. For this assignment, no one act as the author’s manager or supervisor to give deadline, goals, award or punishment. The author has to be self-supervised.
With this inspiration, the author can treat everything related to work as the author’s own work. That means the author is responsible for the job’s outcome, no matter success or failure. The author will not blame other people when comes to any failure in any aspect of living.
The author realised that life can be better by improving a little a day. The author strives for continuous improvement when doing PMGT assignment, by setting goals, then plan strategies to achieve them. For example, the author planned to complete justification for assignment and discover mistakes and omissions. The author also realised that learning goes on for the entire life. The author will continue to learn and explore skill sets in the field of Project Management even the author has finished assignment for PMGT.
Things can also be improved by self-appraisal. The author always ask himself is there anything wrong with the product that the author delivered, can it be improved, or there will sure be something missing even if it looks perfect. By asking these questions, the author can correct minor mistakes in the product, thus improving its quality to win customer’s confidence. Other than that, the author listens to others’ opinion. Opinions that hurt are the best opinion for improvement. The author did not rebuke the opinion, but thanked the person who gave it, and accepted the opinion appreciatively and thankfully.
There was once the author rewarded low in a class tutorial, the question was related to activities done during project scheduling. The lecturer gave comment that too little points were explained in the answer. The author looked for mistakes he has done, and referred to answers given by classmates, and realised that the lecturer’s comment was true. Therefore, the author will be able to give better explanation during exam.
The author experienced that little more effort can make a big difference. The author tried to attend all classes, and be early in each class. The author found that he benefited from better preparation for absorbing knowledge, calmness during the class, and better comprehension of the lecturer’s teaching.
- studying part time, working full time
- do a little work a day
By taking Project management module, the author has learnt the importance of time. The author realised that every project is a time critical mission. On 24 January 2010, the group should attend a meeting online, but the author has totally forgotten about the meeting. Therefore, the group is not able to proceed as the author plays a role as leader; the team ended up wasting time.
Following the schedule and keep promises about time is a practice of discipline, self-awareness, and respect for others. The author learnt that, a person can gain trust from others by first keeping promise, especially one which is time critical. When the author realise that he has missed the meeting, it is already too late, because time will never go back.
In real life scenario, this lesson can be applied to any meetings, phone calls, or appointments in any projects, because the author will meet clients, CEO of other company, or even Prime Minister of a country in the future. The author may lose a chance forever in lifetime by missing an appointment. This chance may be a business deal, or even other future business related prospects.
Around January 25, the author felt that time passes very fast, and the deadline of project is approaching. The author has no other choice but to decrease the time for entertainment, and sacrificed some of personal and family time, in order to catch up with time.
From the lesson learnt, the author will use time management tools like spreadsheets and collaboration software, examples are Google Spreadsheet, Facebook Calendar and Huddle.net Workspace. The author can use these tools to upload planned schedules online, and share part of the calendar to colleagues, project team member, friends, and family. Therefore, others can see our activities on a specific period of time, and be able to justify a rejection based on agenda on the calendar.
When completing MGT assignment, the author treated team mates as customers. The author believed that by doing the author’s best, the customers will be satisfied. Besides, they can perform better if a good product is delivered to them. For example, the author is responsible to create Work Breakdown Structure (WBS). Other teammates need WBS to create cost estimation matrix, Gantt chart, and etc. The author took just 1 day like what he had promised to other teammates. Therefore, other teammates can deliver their product in time. In other hand, the author felt satisfied working with teammates, because they treated the author like how author treated them.
In real business scenario, the author can play a role model of realising customer satisfaction. If the author’s colleagues treat each other as customers, the company will grow better in shorter time. “Customer satisfaction number one” becomes the shared assumption, which yields the result of Total Quality Management, because all employees know how to satisfy customers by meeting or exceeding their expectations when rendering a service or delivering a product.
The author also learned self-motivation. If one is not motivated, no one else can inspire him. While completing PMGT assignment, the author has other commitments like career and family leisure too. The author’s self has to find out any gaps between these times to complete the assignment, and gradually deliver the product. For this assignment, no one act as the author’s manager or supervisor to give deadline, goals, award or punishment. The author has to be self-supervised.
With this inspiration, the author can treat everything related to work as the author’s own work. That means the author is responsible for the job’s outcome, no matter success or failure. The author will not blame other people when comes to any failure in any aspect of living.
The author realised that life can be better by improving a little a day. The author strives for continuous improvement when doing PMGT assignment, by setting goals, then plan strategies to achieve them. For example, the author planned to complete justification for assignment and discover mistakes and omissions. The author also realised that learning goes on for the entire life. The author will continue to learn and explore skill sets in the field of Project Management even the author has finished assignment for PMGT.
Things can also be improved by self-appraisal. The author always ask himself is there anything wrong with the product that the author delivered, can it be improved, or there will sure be something missing even if it looks perfect. By asking these questions, the author can correct minor mistakes in the product, thus improving its quality to win customer’s confidence. Other than that, the author listens to others’ opinion. Opinions that hurt are the best opinion for improvement. The author did not rebuke the opinion, but thanked the person who gave it, and accepted the opinion appreciatively and thankfully.
There was once the author rewarded low in a class tutorial, the question was related to activities done during project scheduling. The lecturer gave comment that too little points were explained in the answer. The author looked for mistakes he has done, and referred to answers given by classmates, and realised that the lecturer’s comment was true. Therefore, the author will be able to give better explanation during exam.
The author experienced that little more effort can make a big difference. The author tried to attend all classes, and be early in each class. The author found that he benefited from better preparation for absorbing knowledge, calmness during the class, and better comprehension of the lecturer’s teaching.
- studying part time, working full time
- do a little work a day
Thursday, January 28, 2010
APLC assignment
%check if a windows is xp.
isxp(xphome).
isxp(xpprofessional).
isxp(xpmediacenter).
isxp(xptabletpc).
%checks if a windows is vista.
isvista(vistastarter).
isvista(vistahomebasic).
isvista(vistahomepremium).
isvista(vistabusiness).
isvista(vistaenterprise).
isvista(vistaultimate).
%check if a windows is 7
is7('7starter').
is7('7homepremium').
is7('7professional').
is7('7enterprise').
is7('7ultimate').
%xp to vista upgrade
xptovista(xphome, vistahomebasic) .
xptovista(xphome, vistahomepremium).
xptovista(xpmediacenter,vistahomepremium).
xptovista(Xp, vistabusiness) :- xptobusiness(Xp).
xptovista(Xp, vistaultimate) :- xptoultimate(Xp).
%xp to vista, where it requires two times upgrade
twotimesupgrade(xphome,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xpprofessional,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xptabletpc,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xphome,vistato7(vistahomebasic,'7homepremium')).
twotimesupgrade(xphome,vistato7(vistahomebasic,'7ultimate')).
twotimesupgrade(xphome,vistato7(vistahomepremium,'7homepremium')).
twotimesupgrade(xphome,vistato7(vistahomepremium,'7ultimate')).
twotimesupgrade(xphome,vistato7(vistabusiness,'7professional')).
twotimesupgrade(xphome,vistato7(vistabusiness,'7ultimate')).
twotimesupgrade(xphome,vistato7(vistaultimate,'7ultimate')).
twotimesupgrade(xpprofessional,vistato7(vistabusiness,'7professional')).
twotimesupgrade(xpprofessional,vistato7(vistabusiness,'7ultimate')).
twotimesupgrade(xpprofessional,vistato7(vistaultimate,'7ultimate')).
twotimesupgrade(xpmediacenter,vistato7(vistahomepremium,'7homepremium')).
twotimesupgrade(xpmediacenter,vistato7(vistahomepremium,'7ultimate')).
twotimesupgrade(xpmediacenter,vistato7(vistaultimate,'7ultimate')).
twotimesupgrade(xptabletpc,vistato7(vistabusiness,'7professional')).
twotimesupgrade(xptabletpc,vistato7(vistabusiness,'7ultimate')).
twotimesupgrade(xptabletpc,vistato7(vistaultimate,'7ultimate')).
%twotimesupgrade(Xp,vistato7(Vista, W7)) :- isxp(Xp),xptovista(Xp,Vista),vistato7(Vista,W7).
twotimesupgrade(vistaenterprise,vistato7(vistaultimate,'7ultimate')).
%http://ebiquity.umbc.edu/blogger/2006/03/12/eliminating-duplicate-answers-in-prolog/
%Accessed [27 Jan 2010]
%upgrading among vista versions
vistatovista(vistabusiness,vistaenterprise).
vistatovista(vistahomebasic,vistahomepremium).
vistatovista(Vista,vistaultimate) :- vistatoultimate(Vista).
%vista to 7
%information available from
%http://arstechnica.com/microsoft/news/2009/02/upgrading-to-windows-7-what-xp-and-vista-users-need-to-know.ars
%[Accessed 21-Jan-2010]
vistato7(vistahomebasic,'7homepremium').
vistato7(vistahomepremium,'7homepremium').
vistato7(vistabusiness,'7professional').
vistato7(Vista,W7) :- Vista \= vistastarter, isvista(Vista), W7 == '7ultimate'.
%windows 7 to windows 7
%http://windows.microsoft.com/en-us/windows7/products/windows-anytime-upgrade
%[Accessed 21-Jan-2010]
w7to7('7starter', W7) :- is7(W7), W7 \= '7starter'.
%all xp can upgrade to Vista, except those that requires Format.
upgrade(Xp,Vista) :- xptovista(Xp,Vista).
upgrade(Vista, W7) :- vistato7(Vista,W7).
upgrade(Vista1,Vista2) :- vistatovista(Vista1,Vista2).
upgrade(W7, Wseven) :- w7to7(W7, Wseven).
%considering two time upgrade
multistageupgrade(Xp, Vista) :- isxp(Xp), xptovista(Temp), vistatovista(Temp,Vista).
%all vista can upgrade to ultimate directly, except vista ultimate itself.
vistatoultimate(V) :- isvista(V), V \= vistaultimate.
%all xp, except media center version, can directly upgrade to vista business
xptobusiness(Xp) :- isxp(Xp), Xp \= xpmediacenter.
%all xp can upgrade to vista ultimate directly.
xptoultimate(Xp) :- isxp(Xp).
/*
http://www.ifcomputer.co.jp/en/manuals5.2/refman/node482.html
[Accessed 23 Jan 2010]
Below are all Queries
upgrade(X,Y).
*/
isxp(xphome).
isxp(xpprofessional).
isxp(xpmediacenter).
isxp(xptabletpc).
%checks if a windows is vista.
isvista(vistastarter).
isvista(vistahomebasic).
isvista(vistahomepremium).
isvista(vistabusiness).
isvista(vistaenterprise).
isvista(vistaultimate).
%check if a windows is 7
is7('7starter').
is7('7homepremium').
is7('7professional').
is7('7enterprise').
is7('7ultimate').
%xp to vista upgrade
xptovista(xphome, vistahomebasic) .
xptovista(xphome, vistahomepremium).
xptovista(xpmediacenter,vistahomepremium).
xptovista(Xp, vistabusiness) :- xptobusiness(Xp).
xptovista(Xp, vistaultimate) :- xptoultimate(Xp).
%xp to vista, where it requires two times upgrade
twotimesupgrade(xphome,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xpprofessional,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xptabletpc,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xphome,vistato7(vistahomebasic,'7homepremium')).
twotimesupgrade(xphome,vistato7(vistahomebasic,'7ultimate')).
twotimesupgrade(xphome,vistato7(vistahomepremium,'7homepremium')).
twotimesupgrade(xphome,vistato7(vistahomepremium,'7ultimate')).
twotimesupgrade(xphome,vistato7(vistabusiness,'7professional')).
twotimesupgrade(xphome,vistato7(vistabusiness,'7ultimate')).
twotimesupgrade(xphome,vistato7(vistaultimate,'7ultimate')).
twotimesupgrade(xpprofessional,vistato7(vistabusiness,'7professional')).
twotimesupgrade(xpprofessional,vistato7(vistabusiness,'7ultimate')).
twotimesupgrade(xpprofessional,vistato7(vistaultimate,'7ultimate')).
twotimesupgrade(xpmediacenter,vistato7(vistahomepremium,'7homepremium')).
twotimesupgrade(xpmediacenter,vistato7(vistahomepremium,'7ultimate')).
twotimesupgrade(xpmediacenter,vistato7(vistaultimate,'7ultimate')).
twotimesupgrade(xptabletpc,vistato7(vistabusiness,'7professional')).
twotimesupgrade(xptabletpc,vistato7(vistabusiness,'7ultimate')).
twotimesupgrade(xptabletpc,vistato7(vistaultimate,'7ultimate')).
%twotimesupgrade(Xp,vistato7(Vista, W7)) :- isxp(Xp),xptovista(Xp,Vista),vistato7(Vista,W7).
twotimesupgrade(vistaenterprise,vistato7(vistaultimate,'7ultimate')).
%http://ebiquity.umbc.edu/blogger/2006/03/12/eliminating-duplicate-answers-in-prolog/
%Accessed [27 Jan 2010]
%upgrading among vista versions
vistatovista(vistabusiness,vistaenterprise).
vistatovista(vistahomebasic,vistahomepremium).
vistatovista(Vista,vistaultimate) :- vistatoultimate(Vista).
%vista to 7
%information available from
%http://arstechnica.com/microsoft/news/2009/02/upgrading-to-windows-7-what-xp-and-vista-users-need-to-know.ars
%[Accessed 21-Jan-2010]
vistato7(vistahomebasic,'7homepremium').
vistato7(vistahomepremium,'7homepremium').
vistato7(vistabusiness,'7professional').
vistato7(Vista,W7) :- Vista \= vistastarter, isvista(Vista), W7 == '7ultimate'.
%windows 7 to windows 7
%http://windows.microsoft.com/en-us/windows7/products/windows-anytime-upgrade
%[Accessed 21-Jan-2010]
w7to7('7starter', W7) :- is7(W7), W7 \= '7starter'.
%all xp can upgrade to Vista, except those that requires Format.
upgrade(Xp,Vista) :- xptovista(Xp,Vista).
upgrade(Vista, W7) :- vistato7(Vista,W7).
upgrade(Vista1,Vista2) :- vistatovista(Vista1,Vista2).
upgrade(W7, Wseven) :- w7to7(W7, Wseven).
%considering two time upgrade
multistageupgrade(Xp, Vista) :- isxp(Xp), xptovista(Temp), vistatovista(Temp,Vista).
%all vista can upgrade to ultimate directly, except vista ultimate itself.
vistatoultimate(V) :- isvista(V), V \= vistaultimate.
%all xp, except media center version, can directly upgrade to vista business
xptobusiness(Xp) :- isxp(Xp), Xp \= xpmediacenter.
%all xp can upgrade to vista ultimate directly.
xptoultimate(Xp) :- isxp(Xp).
/*
http://www.ifcomputer.co.jp/en/manuals5.2/refman/node482.html
[Accessed 23 Jan 2010]
Below are all Queries
upgrade(X,Y).
*/
APLC lab session lab 9 28 Jan 2010
import Prelude
--question 1
data Shape = Rectangle Float Float | Circle Float | Triangle Float Float
area :: Shape -> Float
area (Circle r) = pi * r * r
area (Rectangle w h) = w*h
area (Triangle w h) = 0.5 * w * h
--question 2
perimeter::Shape -> Float
perimeter (Circle r) = 2 * pi * r
perimeter (Rectangle w h) = (2 * w) + (2 * h)
perimeter (Triangle w h) = w + h + sqrt (w^2 + h^2)
--question 3
data Tree = Nil | Node Float Tree Tree
tree2list :: Tree -> [Float]
tree2list Nil = []
tree2list (Node val left right) = [val]++ tree2list left ++ tree2list right
maxintree :: Tree -> Float
maxintree tr = maximum (tree2list tr)
--sample data
--maxintree (Node 1 (Node 2 (Node 4 Nil Nil) (Node 5 (Node 6 Nil Nil) (Node 7 Nil Nil)))(Node 3 Nil Nil))
minintree :: Tree -> Float
minintree tr = minimum (tree2list tr)
--sample data
--minintree (Node 1 (Node 2 (Node 4 Nil Nil) (Node 5 (Node 6 Nil Nil) (Node 7 Nil Nil)))(Node 3 Nil Nil))
maximini :: Tree -> (Float,Float)
maximini tr = (maximum (tree2list tr) , minimum (tree2list tr))
--sample data
--maximini (Node 1 (Node 2 (Node 4 Nil Nil) (Node 5 (Node 6 Nil Nil) (Node 7 Nil Nil)))(Node 3 Nil Nil))
--question 1
data Shape = Rectangle Float Float | Circle Float | Triangle Float Float
area :: Shape -> Float
area (Circle r) = pi * r * r
area (Rectangle w h) = w*h
area (Triangle w h) = 0.5 * w * h
--question 2
perimeter::Shape -> Float
perimeter (Circle r) = 2 * pi * r
perimeter (Rectangle w h) = (2 * w) + (2 * h)
perimeter (Triangle w h) = w + h + sqrt (w^2 + h^2)
--question 3
data Tree = Nil | Node Float Tree Tree
tree2list :: Tree -> [Float]
tree2list Nil = []
tree2list (Node val left right) = [val]++ tree2list left ++ tree2list right
maxintree :: Tree -> Float
maxintree tr = maximum (tree2list tr)
--sample data
--maxintree (Node 1 (Node 2 (Node 4 Nil Nil) (Node 5 (Node 6 Nil Nil) (Node 7 Nil Nil)))(Node 3 Nil Nil))
minintree :: Tree -> Float
minintree tr = minimum (tree2list tr)
--sample data
--minintree (Node 1 (Node 2 (Node 4 Nil Nil) (Node 5 (Node 6 Nil Nil) (Node 7 Nil Nil)))(Node 3 Nil Nil))
maximini :: Tree -> (Float,Float)
maximini tr = (maximum (tree2list tr) , minimum (tree2list tr))
--sample data
--maximini (Node 1 (Node 2 (Node 4 Nil Nil) (Node 5 (Node 6 Nil Nil) (Node 7 Nil Nil)))(Node 3 Nil Nil))
Wednesday, January 27, 2010
aplc prolog
%check if a windows is xp.
isxp(xphome).
isxp(xpprofessional).
isxp(xpmediacenter).
isxp(xptabletpc).
%checks if a windows is vista.
isvista(vistastarter).
isvista(vistahomebasic).
isvista(vistahomepremium).
isvista(vistabusiness).
isvista(vistaenterprise).
isvista(vistaultimate).
%check if a windows is 7
is7('7starter').
is7('7homepremium').
is7('7professional').
is7('7enterprise').
is7('7ultimate').
%xp to vista upgrade
xptovista(xphome, vistahomebasic) .
xptovista(xphome, vistahomepremium).
xptovista(xpmediacenter,vistahomepremium).
xptovista(Xp, vistabusiness) :- xptobusiness(Xp).
xptovista(Xp, vistaultimate) :- xptoultimate(Xp).
%xp to vista, where it requires two times upgrade
twotimesupgrade(xphome,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xpprofessional,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xptabletpc,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xphome,vistato7(vistahomebasic,'7homepremium')).
twotimesupgrade(xphome,vistato7(vistahomepremium,'7homepremium')).
twotimesupgrade(xphome,vistato7(vistabusiness,'7professional')).
twotimesupgrade(xphome,vistato7(vistaultimate,'7ultimate')).
%twotimesupgrade(xpprofessional,vistato7(vistabusiness
%twotimesupgrade(Xp,vistato7(Vista, W7)) :- isxp(Xp),xptovista(Xp,Vista),vistato7(Vista,W7).
twotimesupgrade(vistaenterprise,vistato7(vistaultimate,'7ultimate')).
%http://ebiquity.umbc.edu/blogger/2006/03/12/eliminating-duplicate-answers-in-prolog/
%Accessed [27 Jan 2010]
%upgrading among vista versions
vistatovista(vistabusiness,vistaenterprise).
vistatovista(vistahomebasic,vistahomepremium).
vistatovista(Vista,vistaultimate) :- vistatoultimate(Vista).
%vista to 7
%information available from
%http://arstechnica.com/microsoft/news/2009/02/upgrading-to-windows-7-what-xp-and-vista-users-need-to-know.ars
%[Accessed 21-Jan-2010]
vistato7(vistahomebasic,'7homepremium').
vistato7(vistahomepremium,'7homepremium').
vistato7(vistabusiness,'7professional').
vistato7(Vista,W7) :- Vista \= vistastarter, isvista(Vista), W7 == '7ultimate'.
%windows 7 to windows 7
%http://windows.microsoft.com/en-us/windows7/products/windows-anytime-upgrade
%[Accessed 21-Jan-2010]
w7to7('7starter', W7) :- is7(W7), W7 \= '7starter'.
%all xp can upgrade to Vista, except those that requires Format.
upgrade(Xp,Vista) :- xptovista(Xp,Vista).
upgrade(Vista, W7) :- vistato7(Vista,W7).
upgrade(Vista1,Vista2) :- vistatovista(Vista1,Vista2).
upgrade(W7, Wseven) :- w7to7(W7, Wseven).
%considering two time upgrade
multistageupgrade(Xp, Vista) :- isxp(Xp), xptovista(Temp), vistatovista(Temp,Vista).
%all vista can upgrade to ultimate directly, except vista ultimate itself.
vistatoultimate(V) :- isvista(V), V \= vistaultimate.
%all xp, except media center version, can directly upgrade to vista business
xptobusiness(Xp) :- isxp(Xp), Xp \= xpmediacenter.
%all xp can upgrade to vista ultimate directly.
xptoultimate(Xp) :- isxp(Xp).
/*
http://www.ifcomputer.co.jp/en/manuals5.2/refman/node482.html
[Accessed 23 Jan 2010]
Below are all Queries
upgrade(X,Y).
*/
isxp(xphome).
isxp(xpprofessional).
isxp(xpmediacenter).
isxp(xptabletpc).
%checks if a windows is vista.
isvista(vistastarter).
isvista(vistahomebasic).
isvista(vistahomepremium).
isvista(vistabusiness).
isvista(vistaenterprise).
isvista(vistaultimate).
%check if a windows is 7
is7('7starter').
is7('7homepremium').
is7('7professional').
is7('7enterprise').
is7('7ultimate').
%xp to vista upgrade
xptovista(xphome, vistahomebasic) .
xptovista(xphome, vistahomepremium).
xptovista(xpmediacenter,vistahomepremium).
xptovista(Xp, vistabusiness) :- xptobusiness(Xp).
xptovista(Xp, vistaultimate) :- xptoultimate(Xp).
%xp to vista, where it requires two times upgrade
twotimesupgrade(xphome,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xpprofessional,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xptabletpc,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xphome,vistato7(vistahomebasic,'7homepremium')).
twotimesupgrade(xphome,vistato7(vistahomepremium,'7homepremium')).
twotimesupgrade(xphome,vistato7(vistabusiness,'7professional')).
twotimesupgrade(xphome,vistato7(vistaultimate,'7ultimate')).
%twotimesupgrade(xpprofessional,vistato7(vistabusiness
%twotimesupgrade(Xp,vistato7(Vista, W7)) :- isxp(Xp),xptovista(Xp,Vista),vistato7(Vista,W7).
twotimesupgrade(vistaenterprise,vistato7(vistaultimate,'7ultimate')).
%http://ebiquity.umbc.edu/blogger/2006/03/12/eliminating-duplicate-answers-in-prolog/
%Accessed [27 Jan 2010]
%upgrading among vista versions
vistatovista(vistabusiness,vistaenterprise).
vistatovista(vistahomebasic,vistahomepremium).
vistatovista(Vista,vistaultimate) :- vistatoultimate(Vista).
%vista to 7
%information available from
%http://arstechnica.com/microsoft/news/2009/02/upgrading-to-windows-7-what-xp-and-vista-users-need-to-know.ars
%[Accessed 21-Jan-2010]
vistato7(vistahomebasic,'7homepremium').
vistato7(vistahomepremium,'7homepremium').
vistato7(vistabusiness,'7professional').
vistato7(Vista,W7) :- Vista \= vistastarter, isvista(Vista), W7 == '7ultimate'.
%windows 7 to windows 7
%http://windows.microsoft.com/en-us/windows7/products/windows-anytime-upgrade
%[Accessed 21-Jan-2010]
w7to7('7starter', W7) :- is7(W7), W7 \= '7starter'.
%all xp can upgrade to Vista, except those that requires Format.
upgrade(Xp,Vista) :- xptovista(Xp,Vista).
upgrade(Vista, W7) :- vistato7(Vista,W7).
upgrade(Vista1,Vista2) :- vistatovista(Vista1,Vista2).
upgrade(W7, Wseven) :- w7to7(W7, Wseven).
%considering two time upgrade
multistageupgrade(Xp, Vista) :- isxp(Xp), xptovista(Temp), vistatovista(Temp,Vista).
%all vista can upgrade to ultimate directly, except vista ultimate itself.
vistatoultimate(V) :- isvista(V), V \= vistaultimate.
%all xp, except media center version, can directly upgrade to vista business
xptobusiness(Xp) :- isxp(Xp), Xp \= xpmediacenter.
%all xp can upgrade to vista ultimate directly.
xptoultimate(Xp) :- isxp(Xp).
/*
http://www.ifcomputer.co.jp/en/manuals5.2/refman/node482.html
[Accessed 23 Jan 2010]
Below are all Queries
upgrade(X,Y).
*/
Tuesday, January 26, 2010
Saturday, January 23, 2010
XpVista backup
%check if a windows is xp.
isxp(xphome).
isxp(xpprofessional).
isxp(xpmediacenter).
isxp(xpmediacentre).
isxp(xptabletpc).
%checks if a windows is vista.
isvista(vistastarter).
isvista(vistahomebasic).
isvista(vistahomepremium).
isvista(vistabusiness).
isvista(vistaenterprise).
isvista(vistaultimate).
%check if a windows is 7
is7('7starter').
is7('7homepremium').
is7('7professional').
is7('7enterprise').
is7('7ultimate').
%xp to vista upgrade
xptovista(xphome, vistahomebasic) .
xptovista(xpmediacenter,vistahomepremium).
xptovista(xpmediacentre,vistahomepremium).
xptovista(Xp, vistabusiness) :- Xp \= xpmediacenter, Xp \= xpmediacentre, isxp(Xp).
xptovista(Xp, vistaultimate) :- xptoultimate(Xp).
%xp to vista, where it requires two times upgrade
twotimesupgrade(xphome,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xphome,vistatovista(vistahomebasic,vistahomepremium)).
twotimesupgrade(xpprofessional,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xptabletpc,vistatovista(vistabusiness,vistaenterprise)).
%upgrading among vista versions
vistatovista(vistabusiness,vistaenterprise).
vistatovista(vistahomebasic,vistahomepremium).
vistatovista(Vista,vistaultimate) :- vistatoultimate(Vista).
%vista to 7
%information available from
%http://arstechnica.com/microsoft/news/2009/02/upgrading-to-windows-7-what-xp-and-vista-users-need-to-know.ars
%[Accessed 21-Jan-2010]
vistato7(vistahomebasic,'7homepremium').
vistato7(vistahomepremium,'7homepremium').
vistato7(vistabusiness,'7professional').
vistato7(Vista,'7ultimate') :- Vista \= vistastarter, isvista(Vista).
%windows 7 to windows 7
%http://windows.microsoft.com/en-us/windows7/products/windows-anytime-upgrade
%[Accessed 21-Jan-2010]
w7to7('7starter', W7) :- is7(W7), W7 \= '7starter'.
%all xp can upgrade to Vista, except those that requires Format.
upgrade(Xp,Vista) :- xptovista(Xp,Vista).
upgrade(Vista, W7) :- vistato7(Vista,W7).
upgrade(Vista1,Vista2) :- vistatovista(Vista1,Vista2).
%considering two time upgrade
multistageupgrade(Xp, Vista) :- isxp(Xp), xptovista(Temp), vistatovista(Temp,Vista).
%all vista can upgrade to ultimate directly, except vista ultimate itself.
vistatoultimate(V) :- isvista(V), V \= vistaultimate.
%all xp can direct upgrade to vista ultimate directly.
xptoultimate(Xp) :- isxp(Xp).
/*
http://www.ifcomputer.co.jp/en/manuals5.2/refman/node482.html
[Accessed 23 Jan 2010]
Below are all Queries
upgrade(X,Y).
*/
isxp(xphome).
isxp(xpprofessional).
isxp(xpmediacenter).
isxp(xpmediacentre).
isxp(xptabletpc).
%checks if a windows is vista.
isvista(vistastarter).
isvista(vistahomebasic).
isvista(vistahomepremium).
isvista(vistabusiness).
isvista(vistaenterprise).
isvista(vistaultimate).
%check if a windows is 7
is7('7starter').
is7('7homepremium').
is7('7professional').
is7('7enterprise').
is7('7ultimate').
%xp to vista upgrade
xptovista(xphome, vistahomebasic) .
xptovista(xpmediacenter,vistahomepremium).
xptovista(xpmediacentre,vistahomepremium).
xptovista(Xp, vistabusiness) :- Xp \= xpmediacenter, Xp \= xpmediacentre, isxp(Xp).
xptovista(Xp, vistaultimate) :- xptoultimate(Xp).
%xp to vista, where it requires two times upgrade
twotimesupgrade(xphome,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xphome,vistatovista(vistahomebasic,vistahomepremium)).
twotimesupgrade(xpprofessional,vistatovista(vistabusiness,vistaenterprise)).
twotimesupgrade(xptabletpc,vistatovista(vistabusiness,vistaenterprise)).
%upgrading among vista versions
vistatovista(vistabusiness,vistaenterprise).
vistatovista(vistahomebasic,vistahomepremium).
vistatovista(Vista,vistaultimate) :- vistatoultimate(Vista).
%vista to 7
%information available from
%http://arstechnica.com/microsoft/news/2009/02/upgrading-to-windows-7-what-xp-and-vista-users-need-to-know.ars
%[Accessed 21-Jan-2010]
vistato7(vistahomebasic,'7homepremium').
vistato7(vistahomepremium,'7homepremium').
vistato7(vistabusiness,'7professional').
vistato7(Vista,'7ultimate') :- Vista \= vistastarter, isvista(Vista).
%windows 7 to windows 7
%http://windows.microsoft.com/en-us/windows7/products/windows-anytime-upgrade
%[Accessed 21-Jan-2010]
w7to7('7starter', W7) :- is7(W7), W7 \= '7starter'.
%all xp can upgrade to Vista, except those that requires Format.
upgrade(Xp,Vista) :- xptovista(Xp,Vista).
upgrade(Vista, W7) :- vistato7(Vista,W7).
upgrade(Vista1,Vista2) :- vistatovista(Vista1,Vista2).
%considering two time upgrade
multistageupgrade(Xp, Vista) :- isxp(Xp), xptovista(Temp), vistatovista(Temp,Vista).
%all vista can upgrade to ultimate directly, except vista ultimate itself.
vistatoultimate(V) :- isvista(V), V \= vistaultimate.
%all xp can direct upgrade to vista ultimate directly.
xptoultimate(Xp) :- isxp(Xp).
/*
http://www.ifcomputer.co.jp/en/manuals5.2/refman/node482.html
[Accessed 23 Jan 2010]
Below are all Queries
upgrade(X,Y).
*/
Thursday, January 21, 2010
Lab Session, APLC, polymorphism
combine:: a -> a -> [a]
combine n k = [n, k]
data H2o = Steam Float | Water Float Float
getStatus::H2o -> IO ()
getStatus (Steam tem) = do
putStr "The steam is "
print tem
putStr " degree Celcius\n"
getStatus (Water tem volume) = do
putStr "The "
print volume
putStr "liter water is "
print tem
putStr " degree Celcius."
combine n k = [n, k]
data H2o = Steam Float | Water Float Float
getStatus::H2o -> IO ()
getStatus (Steam tem) = do
putStr "The steam is "
print tem
putStr " degree Celcius\n"
getStatus (Water tem volume) = do
putStr "The "
print volume
putStr "liter water is "
print tem
putStr " degree Celcius."
XpVista.pro prolog assignment
%check if a windows is xp.
isxp(xphome).
isxp(xpprofessional).
isxp(xpmediacenter).
isxp(xpmediacentre).
isxp(xptabletpc).
%checks if a windows is vista.
isvista(vistastarter).
isvista(vistahomebasic).
isvista(vistahomepremium).
isvista(vistabusiness).
isvista(vistaenterprise).
isvista(vistaultimate).
%check if a windows is 7
is7('7starter').
is7('7homepremium').
is7('7professional').
is7('7enterprise').
is7('7ultimate').
%xp to vista, where it requires two times upgrade
%twotimesupgrade(xphome,vistatovista(vistabusiness,vistaenterprise)).
%twotimesupgrade(xphome,vistatovista(vistahomebasic,vistahomepremium)).
%twotimesupgrade(xpprofessional,vistatovista(vistabusiness,vistaenterprise)).
%twotimesupgrade(xptabletpc,vistatovista(vistabusiness,vistaenterprise)).
%some xp needs to clean install (Format) in order to upgrade to vista.
needs_clean_install(xpprofessional,vistahomebasic).
needs_clean_install(xpprofessional,vistahomepremium).
needs_clean_install(xpmediacenter,vistabusiness).
needs_clean_install(xpmediacenter,vistahomebasic).
needs_clean_install(xptabletpc,vistahomebasic).
needs_clean_install(xptabletpc,vistahomepremium).
%upgrading among vista versions
vistatovista(vistabusiness,vistaenterprise).
vistatovista(vistahomebasic,vistahomepremium).
%vista to 7
%information available from
%http://arstechnica.com/microsoft/news/2009/02/upgrading-to-windows-7-what-xp-and-vista-users-need-to-know.ars
%[Accessed 21-Jan-2010]
%vistato7(vistahomepremium,7homepremium).
%vistato7(vistabusiness,7professional).
%vistato7(vistaultimate,7ultimate).
%windows 7 to windows 7
%http://windows.microsoft.com/en-us/windows7/products/windows-anytime-upgrade
%[Accessed 21-Jan-2010]
%w7to7('7starter', W7) :- is7(W7), W7 \= 7starter.
%all xp can upgrade to Vista, except those that requires Format.
upgrade(Xp, Vista) :- isxp(Xp), Vista \= vistastarter, not(clean_install(Xp,Vista)).
%upgrade(Vista, W7) :- vistato7(Vista,W7).
%upgrade(Vista1,Vista2) :- vistatovista(Vista1,Vista2).
%create synonyms for clean install
clean_install(X,Y) :- needs_clean_install(X,Y).
require_format(X,Y) :- needs_clean_install(X,Y).
%check if a windwos is vista, except ultimate version.
isnotultimate(V):- isvista(V), V \= vistaultimate.
%all vista can upgrade to ultimate directly, except vista ultimate itself.
toultimate(V) :- isnotultimate(V).
%all xp can direct upgrade to vista ultimate directly.
toultimate(Xp) :- isxp(Xp).
isxp(xphome).
isxp(xpprofessional).
isxp(xpmediacenter).
isxp(xpmediacentre).
isxp(xptabletpc).
%checks if a windows is vista.
isvista(vistastarter).
isvista(vistahomebasic).
isvista(vistahomepremium).
isvista(vistabusiness).
isvista(vistaenterprise).
isvista(vistaultimate).
%check if a windows is 7
is7('7starter').
is7('7homepremium').
is7('7professional').
is7('7enterprise').
is7('7ultimate').
%xp to vista, where it requires two times upgrade
%twotimesupgrade(xphome,vistatovista(vistabusiness,vistaenterprise)).
%twotimesupgrade(xphome,vistatovista(vistahomebasic,vistahomepremium)).
%twotimesupgrade(xpprofessional,vistatovista(vistabusiness,vistaenterprise)).
%twotimesupgrade(xptabletpc,vistatovista(vistabusiness,vistaenterprise)).
%some xp needs to clean install (Format) in order to upgrade to vista.
needs_clean_install(xpprofessional,vistahomebasic).
needs_clean_install(xpprofessional,vistahomepremium).
needs_clean_install(xpmediacenter,vistabusiness).
needs_clean_install(xpmediacenter,vistahomebasic).
needs_clean_install(xptabletpc,vistahomebasic).
needs_clean_install(xptabletpc,vistahomepremium).
%upgrading among vista versions
vistatovista(vistabusiness,vistaenterprise).
vistatovista(vistahomebasic,vistahomepremium).
%vista to 7
%information available from
%http://arstechnica.com/microsoft/news/2009/02/upgrading-to-windows-7-what-xp-and-vista-users-need-to-know.ars
%[Accessed 21-Jan-2010]
%vistato7(vistahomepremium,7homepremium).
%vistato7(vistabusiness,7professional).
%vistato7(vistaultimate,7ultimate).
%windows 7 to windows 7
%http://windows.microsoft.com/en-us/windows7/products/windows-anytime-upgrade
%[Accessed 21-Jan-2010]
%w7to7('7starter', W7) :- is7(W7), W7 \= 7starter.
%all xp can upgrade to Vista, except those that requires Format.
upgrade(Xp, Vista) :- isxp(Xp), Vista \= vistastarter, not(clean_install(Xp,Vista)).
%upgrade(Vista, W7) :- vistato7(Vista,W7).
%upgrade(Vista1,Vista2) :- vistatovista(Vista1,Vista2).
%create synonyms for clean install
clean_install(X,Y) :- needs_clean_install(X,Y).
require_format(X,Y) :- needs_clean_install(X,Y).
%check if a windwos is vista, except ultimate version.
isnotultimate(V):- isvista(V), V \= vistaultimate.
%all vista can upgrade to ultimate directly, except vista ultimate itself.
toultimate(V) :- isnotultimate(V).
%all xp can direct upgrade to vista ultimate directly.
toultimate(Xp) :- isxp(Xp).
APLC Assignment
1.0 ¬¬¬¬¬¬¬¬¬¬¬¬¬¬¬COURSEWORK TITLE
A simple application development using functional and logical programming languages.
2.0 LEARNING OUTCOMES
At the end of this coursework, you should be able to:
• Express queries, facts and rules in a logic programming language.
• Implement primitive recursion and higher-order functions in a functional language.
3.0 THE COURSEWORK OVERVIEW
You are required to develop a simple application using Haskell for Functional Programming Concepts and Prolog for Logic Programming Concepts. You can use any application scenario of your choice but your applications should have the following parts:
Haskell Application:
i) Suitable user interface (Text based Menu).
ii) Business logic (certain transactions/ data manipulations) – at least 5 modules/functions need to be used; each module should have specific functionality.
iii) Higher Order functions – all the above modules should have higher order functions. Library functions also can be considered. Wherever it is not possible can be exempted but to score higher marks use higher order functions.
iv) Primitive recursion – Wherever is possible/necessary need to be used.
Prolog Application:
i) Facts (minimum 20) – at least some facts should have structures.
ii) Rules (minimum 10) – at least some rules should have AND/OR logics.
iii) Queries (minimum 10) – test all queries without any duplicates.
Possible sample scenarios are given below but these are just for guidance. You do not need to stick rigidly to this idea:
Haskell application:
Simple banking application with the following functionalities:
• Check account details
• Money deposit
• Money transfer
• Money withdraw
• Check balance
Hints: All the above functionalities should have to implement higher order functions. Create a text based menu to handle these functionalities; recursion technique can be used in the text based menu.
Prolog application:
Create a set of Prolog rules which, given a set of basic facts about a family tree, define family relationships through bloodlines.
Hints: i) Facts should have structures.
eg: daughter (Z,married_couple(X,Y)).
ii)Rules should have AND/OR logics.
eg: mother_in_law(Z,X):- married_couple(X,Y),mother(Z,Y) AND logic.
Instructions:
• Create the file family.pl with given facts.
• Create rules in the given order and put them in family.pl.
• Test your rules. Make sure they give a complete result set and there are no duplicates.
4.0 DELIVERABLES:
Submission should be in printed form (documentation) and softcopy of the application.
Printed form (Documentation)
Standard format
Font Size: 12
Font: Times New Roman
Line Spacing: Single
Justify: Align text to both left and right margins.
Paper: White A4 Size Only
Soft bound binding: Comb binding
The document should have the following:
A) Cover Page:
All reports must be prepared with a front cover. For printed copy, a protective transparent plastic sheet can be placed in front of the report to protect the front cover. The front cover should be presented with the following details:
Module
Coursework Title
Intake
Students’ names and id’s
Date Assigned (the date the report was handed out).
Date Completed (the date the report is due to be handed in).
B) Contents:
Abstract/Overview of the system.
All the screen shots with explanation.
System limitation and enhancement.
Test Plan with expected results.
Full source codes with proper comments
Conclusion
Reference
C) References
You may source algorithms and information from the Internet or books. Proper referencing of the resources should be evident in the document.
All references must be made using the Harvard Naming Convention as shown below:
The theory was first propounded in 1970 (Larsen, A.E. 1971), but since then has been refuted; M.K. Larsen (1983) is among those most energetic in their opposition……….
/**
* Following source code obtained from (Danang, S.N. 2002)
*/
int noshape=2;
noshape=GetShape();
List of references at the end of your document or source code must be specified in the following format:
Larsen, A.E. 1971, A Guide to the Aquatic Science Literature, McGraw-Hill, London.
Larsen, M.K. 1983, British Medical Journal [Online], Available from http://libinfor.ume.maine.edu/acquatic.htm (Accessed 19 November 1995)
Danang, S.N., 2002, Finding Similar Images [Online], The Code Project, *Available from http://www.codeproject.com/bitmap/cbir.asp, [Accessed 14th *September 2006]
Further information on other types of citation is available in Petrie, A., 2003, UWE Library Services Study Skills: How to reference [online], England, University of Western England, Available from http://www.uweac.uk/library/resources/general/info_study_skills/harvard2.htm, [Accessed 4th September 2003].
SOFTCOPY:
Your CD should contain the following files:
i) Documentation file (i.e. .doc file if using Ms-word)
ii) Program file (Haskell source code and Prolog file with tested query results)
SUBMISSION:
All documentation and CD must be submitted on the due date at 7.00 p.m. or earlier to the administration department.
5.0 ASSIGNMENT ASSESSMENT CRITERIA
The marks allocation of the assignment is divided into four parts. 50% marks are allocated to the Haskell application development, 20% marks are allocated to the Prolog application development, 20% marks for the report (documentation) to accompany the application and 10% marks for presentation.
Assessment of applications (70 marks)
This will be assessed by your lecturer during presentation/demonstration. To award 70% of marks the following criteria will be considered:
Haskell: 50 Marks
• Idea / Logic : 5 Marks
• User Interface(Such as Text Based Menu): 5 Marks
• Minimum 5 Modules / functions: 15 Marks
• Implementation of Higher Order Functions in all modules: 15 Marks
• Implementation of Primitive Recursion (wherever it is necessary) : 5 Marks
• Quality of Source code : 5 Marks
Prolog: 20 Marks
• Idea / Logic : 5 Marks
• Facts ( Minimum 20 Facts) : 5 Marks
• Rules ( Minimum 10 rules): 5 Marks
• Queries( Minimum 10 queries): 5 Marks
Report (Documentation) (20 marks)
This report must provide the complete contents based on the requirements to receive marks of 20%.
The document should be concise but should include all the contents which are recommended in section 4.0
Demonstration/presentation of your work to the lecturer (10 marks)
The presentation should provide a comprehensive discussion of the system. During presentation, each student should be able to explain/demonstrate in detail his/her work as well as answer the questions posed.
The following criteria will be considered to assess your presentation/demonstration:
• Clarity of explanations
• Ability to answer queries
• Skills and knowledge
NOTE:
IF YOU ARE FAIL TO ATTEND/DEMONSTRATE YOUR SYSTEM, ONLY DOCUMENTATION MARKS (20%) WILL BE AWARDED.
6.0 PERFORMANCE CRITERIA
A: 70% +
This grade will be assigned to work which is considered to be of very high standard and which meets 100% of the basic requirements listed and more. The final system should be functional and satisfy all the requirements of the assignment. Work at this level must provide clear evidence of a variety of advanced concepts / knowledge in implementing primitive recursion and higher-order functions in Haskell. Express queries, facts and rules in a logic programming language. Evidence of technical knowledge and practical skills essential for programming in a functional/logical paradigm should be made available. All work should be documented and referenced well. During presentation, the student should be able to explain in detail the work that has been done.
B: 60-69%
This grade will be assigned to work which is considered to be of high standard and which meets at least 80% of the basic requirements listed above and if possible, more. Work at this level must provide evidence of implementing primitive recursion and higher-order functions in Haskell. Express queries, facts and rules in a logic programming language. Evidence of technical knowledge and practical skills essential for programming in a functional paradigm should be made available. All work should be adequately documented and referenced. During presentation, the student should be able to explain well most of the work that has been done.
C: 50-59%
This grade will be assigned to work which is considered to be of good standard and which meets at least 60% of the basic requirements listed above and if possible, more. The final system should have functionality and at least compile with no errors and run smoothly when executed. Work at this level must provide evidence of implementing primitive recursion and higher-order functions in Haskell. Express queries, facts and rules in a logic programming language. Evidence of technical knowledge and practical skills essential for programming in a functional paradigm should be made available. All work should be adequately documented and referenced. During presentation, the student should be able to explain well most of the work that has been done.
D: 40-49%
This grade will be assigned to work which is considered to be of average standard and which meets at least 50% of the basic requirements listed above. The final system should at least compile with minimal errors or run when executed. Work at this level must provide evidence of implementing primitive recursion and higher-order functions in Haskell. Express queries, facts and rules in a logic programming language. All work should be adequately documented and referenced. During presentation, the student should be able to explain briefly the work that has been done.
E: 30-39%
Work at this level will generally be of low standard where it may even fail to meet at least 50% of the basic requirements listed above. Such a program may display a list of compilation errors and may not even run when executed. Work that is not documented adequately, lacks referencing and does not display proper program structure would fall in this category. During presentation, the student is not able to explain briefly the work that has been done.
F: 0-29%
Work at this level will generally be of very low standard where it may even fail to meet at least 40% of the basic requirements listed above. Such a program may display a list of compilation errors and may not even run when executed. Work that is not documented adequately, lacks referencing and does not display proper program structure would fall in this category. During presentation, the student is not able to explain briefly the work that has been done.
A simple application development using functional and logical programming languages.
2.0 LEARNING OUTCOMES
At the end of this coursework, you should be able to:
• Express queries, facts and rules in a logic programming language.
• Implement primitive recursion and higher-order functions in a functional language.
3.0 THE COURSEWORK OVERVIEW
You are required to develop a simple application using Haskell for Functional Programming Concepts and Prolog for Logic Programming Concepts. You can use any application scenario of your choice but your applications should have the following parts:
Haskell Application:
i) Suitable user interface (Text based Menu).
ii) Business logic (certain transactions/ data manipulations) – at least 5 modules/functions need to be used; each module should have specific functionality.
iii) Higher Order functions – all the above modules should have higher order functions. Library functions also can be considered. Wherever it is not possible can be exempted but to score higher marks use higher order functions.
iv) Primitive recursion – Wherever is possible/necessary need to be used.
Prolog Application:
i) Facts (minimum 20) – at least some facts should have structures.
ii) Rules (minimum 10) – at least some rules should have AND/OR logics.
iii) Queries (minimum 10) – test all queries without any duplicates.
Possible sample scenarios are given below but these are just for guidance. You do not need to stick rigidly to this idea:
Haskell application:
Simple banking application with the following functionalities:
• Check account details
• Money deposit
• Money transfer
• Money withdraw
• Check balance
Hints: All the above functionalities should have to implement higher order functions. Create a text based menu to handle these functionalities; recursion technique can be used in the text based menu.
Prolog application:
Create a set of Prolog rules which, given a set of basic facts about a family tree, define family relationships through bloodlines.
Hints: i) Facts should have structures.
eg: daughter (Z,married_couple(X,Y)).
ii)Rules should have AND/OR logics.
eg: mother_in_law(Z,X):- married_couple(X,Y),mother(Z,Y) AND logic.
Instructions:
• Create the file family.pl with given facts.
• Create rules in the given order and put them in family.pl.
• Test your rules. Make sure they give a complete result set and there are no duplicates.
4.0 DELIVERABLES:
Submission should be in printed form (documentation) and softcopy of the application.
Printed form (Documentation)
Standard format
Font Size: 12
Font: Times New Roman
Line Spacing: Single
Justify: Align text to both left and right margins.
Paper: White A4 Size Only
Soft bound binding: Comb binding
The document should have the following:
A) Cover Page:
All reports must be prepared with a front cover. For printed copy, a protective transparent plastic sheet can be placed in front of the report to protect the front cover. The front cover should be presented with the following details:
Module
Coursework Title
Intake
Students’ names and id’s
Date Assigned (the date the report was handed out).
Date Completed (the date the report is due to be handed in).
B) Contents:
Abstract/Overview of the system.
All the screen shots with explanation.
System limitation and enhancement.
Test Plan with expected results.
Full source codes with proper comments
Conclusion
Reference
C) References
You may source algorithms and information from the Internet or books. Proper referencing of the resources should be evident in the document.
All references must be made using the Harvard Naming Convention as shown below:
The theory was first propounded in 1970 (Larsen, A.E. 1971), but since then has been refuted; M.K. Larsen (1983) is among those most energetic in their opposition……….
/**
* Following source code obtained from (Danang, S.N. 2002)
*/
int noshape=2;
noshape=GetShape();
List of references at the end of your document or source code must be specified in the following format:
Larsen, A.E. 1971, A Guide to the Aquatic Science Literature, McGraw-Hill, London.
Larsen, M.K. 1983, British Medical Journal [Online], Available from http://libinfor.ume.maine.edu/acquatic.htm (Accessed 19 November 1995)
Danang, S.N., 2002, Finding Similar Images [Online], The Code Project, *Available from http://www.codeproject.com/bitmap/cbir.asp, [Accessed 14th *September 2006]
Further information on other types of citation is available in Petrie, A., 2003, UWE Library Services Study Skills: How to reference [online], England, University of Western England, Available from http://www.uweac.uk/library/resources/general/info_study_skills/harvard2.htm, [Accessed 4th September 2003].
SOFTCOPY:
Your CD should contain the following files:
i) Documentation file (i.e. .doc file if using Ms-word)
ii) Program file (Haskell source code and Prolog file with tested query results)
SUBMISSION:
All documentation and CD must be submitted on the due date at 7.00 p.m. or earlier to the administration department.
5.0 ASSIGNMENT ASSESSMENT CRITERIA
The marks allocation of the assignment is divided into four parts. 50% marks are allocated to the Haskell application development, 20% marks are allocated to the Prolog application development, 20% marks for the report (documentation) to accompany the application and 10% marks for presentation.
Assessment of applications (70 marks)
This will be assessed by your lecturer during presentation/demonstration. To award 70% of marks the following criteria will be considered:
Haskell: 50 Marks
• Idea / Logic : 5 Marks
• User Interface(Such as Text Based Menu): 5 Marks
• Minimum 5 Modules / functions: 15 Marks
• Implementation of Higher Order Functions in all modules: 15 Marks
• Implementation of Primitive Recursion (wherever it is necessary) : 5 Marks
• Quality of Source code : 5 Marks
Prolog: 20 Marks
• Idea / Logic : 5 Marks
• Facts ( Minimum 20 Facts) : 5 Marks
• Rules ( Minimum 10 rules): 5 Marks
• Queries( Minimum 10 queries): 5 Marks
Report (Documentation) (20 marks)
This report must provide the complete contents based on the requirements to receive marks of 20%.
The document should be concise but should include all the contents which are recommended in section 4.0
Demonstration/presentation of your work to the lecturer (10 marks)
The presentation should provide a comprehensive discussion of the system. During presentation, each student should be able to explain/demonstrate in detail his/her work as well as answer the questions posed.
The following criteria will be considered to assess your presentation/demonstration:
• Clarity of explanations
• Ability to answer queries
• Skills and knowledge
NOTE:
IF YOU ARE FAIL TO ATTEND/DEMONSTRATE YOUR SYSTEM, ONLY DOCUMENTATION MARKS (20%) WILL BE AWARDED.
6.0 PERFORMANCE CRITERIA
A: 70% +
This grade will be assigned to work which is considered to be of very high standard and which meets 100% of the basic requirements listed and more. The final system should be functional and satisfy all the requirements of the assignment. Work at this level must provide clear evidence of a variety of advanced concepts / knowledge in implementing primitive recursion and higher-order functions in Haskell. Express queries, facts and rules in a logic programming language. Evidence of technical knowledge and practical skills essential for programming in a functional/logical paradigm should be made available. All work should be documented and referenced well. During presentation, the student should be able to explain in detail the work that has been done.
B: 60-69%
This grade will be assigned to work which is considered to be of high standard and which meets at least 80% of the basic requirements listed above and if possible, more. Work at this level must provide evidence of implementing primitive recursion and higher-order functions in Haskell. Express queries, facts and rules in a logic programming language. Evidence of technical knowledge and practical skills essential for programming in a functional paradigm should be made available. All work should be adequately documented and referenced. During presentation, the student should be able to explain well most of the work that has been done.
C: 50-59%
This grade will be assigned to work which is considered to be of good standard and which meets at least 60% of the basic requirements listed above and if possible, more. The final system should have functionality and at least compile with no errors and run smoothly when executed. Work at this level must provide evidence of implementing primitive recursion and higher-order functions in Haskell. Express queries, facts and rules in a logic programming language. Evidence of technical knowledge and practical skills essential for programming in a functional paradigm should be made available. All work should be adequately documented and referenced. During presentation, the student should be able to explain well most of the work that has been done.
D: 40-49%
This grade will be assigned to work which is considered to be of average standard and which meets at least 50% of the basic requirements listed above. The final system should at least compile with minimal errors or run when executed. Work at this level must provide evidence of implementing primitive recursion and higher-order functions in Haskell. Express queries, facts and rules in a logic programming language. All work should be adequately documented and referenced. During presentation, the student should be able to explain briefly the work that has been done.
E: 30-39%
Work at this level will generally be of low standard where it may even fail to meet at least 50% of the basic requirements listed above. Such a program may display a list of compilation errors and may not even run when executed. Work that is not documented adequately, lacks referencing and does not display proper program structure would fall in this category. During presentation, the student is not able to explain briefly the work that has been done.
F: 0-29%
Work at this level will generally be of very low standard where it may even fail to meet at least 40% of the basic requirements listed above. Such a program may display a list of compilation errors and may not even run when executed. Work that is not documented adequately, lacks referencing and does not display proper program structure would fall in this category. During presentation, the student is not able to explain briefly the work that has been done.
Wednesday, January 20, 2010
Excel Sheet at Zoho
http://sheet.zoho.com/GuestView.do?ByZijz9szdQZMfcPeaMljjLIcZLXJdB3X2p9Uo45TzkXVik0kLXQ2Q%3D%3D
Scholary Academic Search Engine
http://www.diva-portal.se/index.xsql?lang=en
http://academicearth.org
http://www.academicindex.net/
http://www.AcademicInfo.net
http://agecon.lib.umn.edu/
http://www.all-academic.com
http://www.AmericanSouth.org
http://www.MetaArchive.org/
http://arc.cs.odu.edu/
http://www.tulane.edu/lmiller/search.htm
http://archives.chadwyck.com/marketing/index.jsp
http://www.archiveshub.ac.uk
http://dsej.arl.org/dsej/
http://search.arrow.edu.au
http://www.articlecity.com
http://www4.infotrieve.com/search/databases/newsearch.asp
http://services.inist.fr/public/eng/conslt.htm
http://arxiv.org/multi?group=cs&%2Ffind=Search
http://www.athenus.com
http://www.google.com/coop/cse?cx=012189697858739272261:yyyqychcumo
http://adt.caul.edu.au
http://www.nla.gov.au/ajol/
http://research.nla.gov.au/
http://base.ub.uni-bielefeld.de/index_english.html
http://www.bbsonline.org
http://www.bioline.org.br/
http://www.blogscholar.com/
http://www.bloomsburymagazine.com/ARC/Arc_home.asp
http://www.booksandperiodicals.com/
http://www.bpubs.com
http://bubl.ac.uk/link/
http://carl-abrc-oai.lib.sfu.ca/
http://catalog.gpo.gov
http://celestial.eprints.org
http://cdsweb.cern.ch
http://www.chemrefer.com
http://chemxseer.ist.psu.edu/
http://www.foia.cia.gov/search_options.asp
http://citebase.eprints.org/cgi-bin/search
http://citeseer.ist.psu.edu
http://citeseerx.ist.psu.edu
http://www.citidel.org/
http://www.cete.org/acve/
http://clinmed.netprints.org/home.dtl
http://cogprints.ecs.soton.ac.uk/perl/search/simple
http://www.CompletePlanet.com
http://oai.dlib.vt.edu/hussein/cgi-bin/compute/UI/search.pl
http://arxiv.org/corr/home
http://cs-structure.inr.ac.ru/
http://www.davidrumsey.com/view.html
http://www.DeepWebResearch.info/
http://www.DeepWeb.us/
http://www.dtic.mil/dtic/search/
http://www.DescribeThis.com
http://www.dlese.org
http://dlc.dlib.indiana.edu
http://www.doaj.org/
http://www.webometrics.info/directory_rep.asp
http://discovered.creativecommons.org/search/
http://www.openp2p.com/pub/t/74
http://www4.infotrieve.com/search/docsource.asp
http://dois.mimas.ac.uk
http://libraries.mit.edu/dspace-mit
http://gunther.smeal.psu.edu
http://www.eevl.ac.uk/eese/eese-eevl.htm
http://www.eevlxtra.ac.uk/
http://www.eFinancialBot.com/
http://www.eGreenBot.com
http://www.eHealthcareBot.com/
http://www.eigenfactor.org/
http://www.eerl.org
http://ejournal.coalliance.org/
http://www.eMarketingBot.com
http://www.osti.gov/energyfiles
http://www.engineeringvillage2.org
http://eprints.osti.gov/index.shtml
http://eprints.rclis.org/perl/search/simple
http://www.eric.ed.gov
http://www.escholarship.org
http://repositories.cdlib.org/escholarship
http://www.ethnologue.com
http://www.fieldsofknowledge.com/index.html
http://www.findarticles.com/PI/index.jhtml
http://www.firstmonday.org/issues/issue10_12/aharoni/index.html
http://www.FindingExperts.info/
http://www.FindLaw.com/
http://www.crl.edu/content.asp?l1=5&l2=23&l3=44&l4=25
http://www.bdaweb.net/freescience_learnmore_it.php
http://search.ft.com/search/index.html
http://www.fso-online.com
http://www.gemcatcher.com/
http://www.globalspec.com
http://www.goarticles.com
http://www.gogeo.ac.uk/
http://goldrush.coalliance.org/
http://base.google.com
http://scholar.google.com
http://www.access.gpo.gov/su_docs/gils/index.html
http://www.gpoaccess.gov/multidb.html
http://www.gpo.gov/fdsys/search/home.action
http://g118.grainger.uiuc.edu/engroai
http://lcweb2.loc.gov/hlas/
http://www.highbeam.com/
http://isihighlycited.com
http://highwire.stanford.edu/cgi/search/
http://highwire.stanford.edu/lists/freeart.dtl
http://sunzi1.lib.hku.hk/hkuto/index.jsp
http://www.hon.ch/MeSH/
http://ideas.repec.org/
http://www.tasi.ac.uk/resources/searchengines.html
http://www.theses.com
http://wiki.dspace.org/DspaceInstances
http://databases.unesco.org/xtrans/xtra-form.html
http://infomine.ucr.edu
http://www.osti.gov/bridge
http://www.infosci-on-demand.com
http://www3.infotrieve.com/search/articlefinder.asp
http://www.ingentaconnect.com/
http://www.intellisearchnow.com
http://www.archive.org/
http://www.bodley.ox.ac.uk/ilej/
http://www.IPSearchEngine.com/
http://www.intute.ac.uk/
http://www.intute.ac.uk/irs
http://www.intute.ac.uk/sciences
http://www.invisible-web.net
http://wiki.issuecrawler.net/bin/view/Issuecrawler/WebHome
http://jairo.nii.ac.jp/en
http://jake-db.org
http://www.journaltocs.hw.ac.uk
http://www.jstor.org
http://www.jurn.org
http://www.Kartoo.com/
http://www.KeepMedia.com
http://kuscholarworks.ku.edu/dspace
http://alacarte.lexisnexis.com
http://www.libdex.com/
http://www.loc.gov/z3950
http://www.loc.gov/rr/ElectronicResources/subjects.php?subjectID=13&
http://www.libworm.com
http://www.pubmedcentral.gov
http://www.magportal.com
http://liber.library.uu.nl/publish/articles/000039/index.html
http://www.MedWorm.com
http://metalis.cilea.it
http://www.metapress.com
http://www.mooter.com/
http://www.muradora.org
http://www.mylitsearch.org
http://www.myoai.com
http://www.archives.gov/aad/
http://www.narcis.info
http://nectar.northampton.ac.uk/
http://lsr.nellco.org
http://www.ndltd.org
http://www.lib.utk.edu/newfoundpress
http://gort.ucsd.edu/newjour/search.html
http://www.nzetc.org
http://www.ntis.gov/
http://ntrs.nasa.gov
http://nzresearch.org.nz
http://www.Oaister.org
http://www2.oclc.org/oclc/fs/fstitle/index.asp
http://documents.un.org/welcome.asp?language=E
http://www.language-archives.org/
http://open.ekduniya.net
http://www.ltu.se/depts/lib/databaser/Preprints.shtml
http://oad.simmons.edu/oadwiki/Main_Page
http://www.openarchives.org/service/listproviders.html
http://opencontent.org/ocwfinder
http://www.opendoar.org/
http://www.opendoar.org/search.php
http://www.openj-gate.com/
http://orgprints.org
http://www.oxfordscholarship.com/oso/public/index.html
http://rspas.anu.edu.au/pambu/
http://www.parse-insight.eu/
http://www.parse-insight.eu
http://www.perseus.tufts.edu/cgi-bin/vor
http://prospector.coalliance.org
http://www.cogsci.ecs.soton.ac.uk/psycoloquy
http://www.pkp.ubc.ca/
http://www.publiclibraryofscience.org
http://www.publist.com
http://pubmedcentral.com
http://www.pubsub.com
http://www.qsensei.com
http://eprints-uk.rdn.ac.uk
http://www.gpoaccess.gov/legacy/registry
http://www.regulations.gov/search/index.jsp
http://www.renarcus.org
http://www.uidaho.edu/special-collections/Other.Repositories.html
http://www.rlo-cetl.ac.uk/harvester2
http://tigger.uic.edu/rjensen
http://eprints.bo.cnr.it
http://www.ucalgary.ca/lib-old/ssportsite/
https://scholarsbank.uoregon.edu/dspace/
http://www.scielo.cl/scielo.php?script=sci_home&lng=en&nrm=iso
http://www.science.gov
http://www.scienceaccelerator.gov
http://science.creativecommons.org/
http://www.ScienceResearch.com
http://www.scirus.com
http://topics.scirus.com
http://www.sciseek.com
http://scitation.aip.org
http://www.scitopia.org/scitopia/
http://www.scopus.com/
http://www.searchability.com/academic.htm
http://searchpdf.adobe.com/
http://www.searchedu.com
http://www.searchenginecolossus.com/Academic.html
http://www.gpo.gov/nara/pubpaps/srchpaps.html
http://info.lib.uh.edu/sepb/search.htm
http://unesdoc.unesco.org/ulis/unesbib.html
http://www.uvm.edu/bmaclenn/
http://smealsearch.psu.edu/
http://sunsite3.berkeley.edu/wikis/datalab/index.php?n=Main.GoogleSearch
http://papers.ssrn.com/sol3/DisplayAbstractSearch.cfm
http://stnweb.fiz-karlsruhe.de/html/english/
http://www.StormingMedia.us/
https://dspace.stir.ac.uk/dspace/index.jsp
http://swoogle.umbc.edu/
http://etds.ncl.edu.tw/theabs/english_site/search_simple_eng.jsp
http://www.techxtra.ac.uk/
http://cma.zdnet.com/texis/techinfobase/techinfobase
http://www.inderscience.com/catalogue/
http://dast.nlanr.net/Clearinghouse/Query.htm
http://www.open-video.org/
http://articlesciences.inist.fr/
http://www.virtuallrc.com/
http://thoughtmesh.net/
http://www.babelfish.altavista.com/tr
http://www.google.com/language_tools
http://www.faganfinder.com/translate/
http://eprints.ucl.ac.uk/
http://nergal.grainger.uiuc.edu/cgi/b/bib/bib-idx
http://www.data-archive.ac.uk/
http://census.ac.uk/
http://snipurl.com/r2wn
http://www.virtuallrc.com/TechReports.html
http://vos.ucsb.edu/
http://whelf.ac.uk/wrn/index.shtml
http://www.wolframalpha.com/
http://www.worldwidescience.org/
http://xstructure.inr.ac.ru/
http://www.VirtualPrivateLibrary.com/
http://www.AgricultureResources.info/
http://www.AIResources.info/
http://www.AstronomyResources.info/
http://www.AuctionResources.info/
http://www.BiologicalInformatics.info/
http://www.BiotechnologyResources.info/
http://www.BotResearch.info/
http://www.BIResources.info/
http://www.ChatterBots.info/
http://www.DataMiningResources.info/
http://www.DeepWebResearch.info/
http://www.DirectoryResources.info/
http://eCommerceResources.info/
http://www.ElderResources.info/
http://www.EmploymentResources.info/
http://www.EntrepreneurialResources.info/
http://www.FinancialSources.info/
http://www.FindingPeople.info/
http://www.GamesResources.info/
http://www.GenealogyResources.info/
http://www.GrantResources.info/
http://www.GreenFiles.info/
http://www.GridResources.info/
http://www.HealthcareResources.info/
http://www.InformationFutureMarkets.com/
http://www.InformationQualityResources.info/
http://www.InternationalTradeResources.info/
http://www.InternetAlerts.info/
http://www.InternetDemographics.info/
http://www.InternetExperts.info/
http://www.InternetHoaxes.info/
http://www.IntrapreneurialResources.info/
http://www.JournalismResources.info/
http://www.KnowledgeDiscovery.info/
http://www.MilitaryResources.info/
http://www.NewEconomyAnalytics.com/
http://www.OutsourcingOffshore.us/
http://www.PrivacyResources.info/
http://www.ReferenceResources.info/
http://www.ResearchResources.info/
http://www.RestStress.com/
http://www.WcriptResources.info/
http://www.ShoppingBots.info/
http://www.SocialInformatics.info/
http://www.StatisticsResources.info/
http://www.StudentResearch.info/
http://www.TheologyResources.info/
http://www.TutorialResources.info/
http://www.WWWReference.info/
http://www.WhitePapers.us/
http://www.InternetMiniguide.com/
http://www.AwarenessWatch.com/
http://www.LinkSeries.com/
http://www.InternetSources.info/
http://www.SourceSeries.com/
http://www.ScholarSearchEngines.com/
http://www.BotsBlogs.com/
http://www.BIOnlineResources.info/
http://www.eReferenceLibrary.com/
http://www.KDResources.info/
http://www.SearchingTheInternet.info/
http://www.WedDataExtractors.com/
http://www.InternetSpeaker.net
http://www.ecurrentAwareness.com/
http://www.MarketIntelligenceResources.com/
http://www.EntrepreneurialLinks.com/
http://www.NewEconomyManual.com/
http://academicearth.org
http://www.academicindex.net/
http://www.AcademicInfo.net
http://agecon.lib.umn.edu/
http://www.all-academic.com
http://www.AmericanSouth.org
http://www.MetaArchive.org/
http://arc.cs.odu.edu/
http://www.tulane.edu/lmiller/search.htm
http://archives.chadwyck.com/marketing/index.jsp
http://www.archiveshub.ac.uk
http://dsej.arl.org/dsej/
http://search.arrow.edu.au
http://www.articlecity.com
http://www4.infotrieve.com/search/databases/newsearch.asp
http://services.inist.fr/public/eng/conslt.htm
http://arxiv.org/multi?group=cs&%2Ffind=Search
http://www.athenus.com
http://www.google.com/coop/cse?cx=012189697858739272261:yyyqychcumo
http://adt.caul.edu.au
http://www.nla.gov.au/ajol/
http://research.nla.gov.au/
http://base.ub.uni-bielefeld.de/index_english.html
http://www.bbsonline.org
http://www.bioline.org.br/
http://www.blogscholar.com/
http://www.bloomsburymagazine.com/ARC/Arc_home.asp
http://www.booksandperiodicals.com/
http://www.bpubs.com
http://bubl.ac.uk/link/
http://carl-abrc-oai.lib.sfu.ca/
http://catalog.gpo.gov
http://celestial.eprints.org
http://cdsweb.cern.ch
http://www.chemrefer.com
http://chemxseer.ist.psu.edu/
http://www.foia.cia.gov/search_options.asp
http://citebase.eprints.org/cgi-bin/search
http://citeseer.ist.psu.edu
http://citeseerx.ist.psu.edu
http://www.citidel.org/
http://www.cete.org/acve/
http://clinmed.netprints.org/home.dtl
http://cogprints.ecs.soton.ac.uk/perl/search/simple
http://www.CompletePlanet.com
http://oai.dlib.vt.edu/hussein/cgi-bin/compute/UI/search.pl
http://arxiv.org/corr/home
http://cs-structure.inr.ac.ru/
http://www.davidrumsey.com/view.html
http://www.DeepWebResearch.info/
http://www.DeepWeb.us/
http://www.dtic.mil/dtic/search/
http://www.DescribeThis.com
http://www.dlese.org
http://dlc.dlib.indiana.edu
http://www.doaj.org/
http://www.webometrics.info/directory_rep.asp
http://discovered.creativecommons.org/search/
http://www.openp2p.com/pub/t/74
http://www4.infotrieve.com/search/docsource.asp
http://dois.mimas.ac.uk
http://libraries.mit.edu/dspace-mit
http://gunther.smeal.psu.edu
http://www.eevl.ac.uk/eese/eese-eevl.htm
http://www.eevlxtra.ac.uk/
http://www.eFinancialBot.com/
http://www.eGreenBot.com
http://www.eHealthcareBot.com/
http://www.eigenfactor.org/
http://www.eerl.org
http://ejournal.coalliance.org/
http://www.eMarketingBot.com
http://www.osti.gov/energyfiles
http://www.engineeringvillage2.org
http://eprints.osti.gov/index.shtml
http://eprints.rclis.org/perl/search/simple
http://www.eric.ed.gov
http://www.escholarship.org
http://repositories.cdlib.org/escholarship
http://www.ethnologue.com
http://www.fieldsofknowledge.com/index.html
http://www.findarticles.com/PI/index.jhtml
http://www.firstmonday.org/issues/issue10_12/aharoni/index.html
http://www.FindingExperts.info/
http://www.FindLaw.com/
http://www.crl.edu/content.asp?l1=5&l2=23&l3=44&l4=25
http://www.bdaweb.net/freescience_learnmore_it.php
http://search.ft.com/search/index.html
http://www.fso-online.com
http://www.gemcatcher.com/
http://www.globalspec.com
http://www.goarticles.com
http://www.gogeo.ac.uk/
http://goldrush.coalliance.org/
http://base.google.com
http://scholar.google.com
http://www.access.gpo.gov/su_docs/gils/index.html
http://www.gpoaccess.gov/multidb.html
http://www.gpo.gov/fdsys/search/home.action
http://g118.grainger.uiuc.edu/engroai
http://lcweb2.loc.gov/hlas/
http://www.highbeam.com/
http://isihighlycited.com
http://highwire.stanford.edu/cgi/search/
http://highwire.stanford.edu/lists/freeart.dtl
http://sunzi1.lib.hku.hk/hkuto/index.jsp
http://www.hon.ch/MeSH/
http://ideas.repec.org/
http://www.tasi.ac.uk/resources/searchengines.html
http://www.theses.com
http://wiki.dspace.org/DspaceInstances
http://databases.unesco.org/xtrans/xtra-form.html
http://infomine.ucr.edu
http://www.osti.gov/bridge
http://www.infosci-on-demand.com
http://www3.infotrieve.com/search/articlefinder.asp
http://www.ingentaconnect.com/
http://www.intellisearchnow.com
http://www.archive.org/
http://www.bodley.ox.ac.uk/ilej/
http://www.IPSearchEngine.com/
http://www.intute.ac.uk/
http://www.intute.ac.uk/irs
http://www.intute.ac.uk/sciences
http://www.invisible-web.net
http://wiki.issuecrawler.net/bin/view/Issuecrawler/WebHome
http://jairo.nii.ac.jp/en
http://jake-db.org
http://www.journaltocs.hw.ac.uk
http://www.jstor.org
http://www.jurn.org
http://www.Kartoo.com/
http://www.KeepMedia.com
http://kuscholarworks.ku.edu/dspace
http://alacarte.lexisnexis.com
http://www.libdex.com/
http://www.loc.gov/z3950
http://www.loc.gov/rr/ElectronicResources/subjects.php?subjectID=13&
http://www.libworm.com
http://www.pubmedcentral.gov
http://www.magportal.com
http://liber.library.uu.nl/publish/articles/000039/index.html
http://www.MedWorm.com
http://metalis.cilea.it
http://www.metapress.com
http://www.mooter.com/
http://www.muradora.org
http://www.mylitsearch.org
http://www.myoai.com
http://www.archives.gov/aad/
http://www.narcis.info
http://nectar.northampton.ac.uk/
http://lsr.nellco.org
http://www.ndltd.org
http://www.lib.utk.edu/newfoundpress
http://gort.ucsd.edu/newjour/search.html
http://www.nzetc.org
http://www.ntis.gov/
http://ntrs.nasa.gov
http://nzresearch.org.nz
http://www.Oaister.org
http://www2.oclc.org/oclc/fs/fstitle/index.asp
http://documents.un.org/welcome.asp?language=E
http://www.language-archives.org/
http://open.ekduniya.net
http://www.ltu.se/depts/lib/databaser/Preprints.shtml
http://oad.simmons.edu/oadwiki/Main_Page
http://www.openarchives.org/service/listproviders.html
http://opencontent.org/ocwfinder
http://www.opendoar.org/
http://www.opendoar.org/search.php
http://www.openj-gate.com/
http://orgprints.org
http://www.oxfordscholarship.com/oso/public/index.html
http://rspas.anu.edu.au/pambu/
http://www.parse-insight.eu/
http://www.parse-insight.eu
http://www.perseus.tufts.edu/cgi-bin/vor
http://prospector.coalliance.org
http://www.cogsci.ecs.soton.ac.uk/psycoloquy
http://www.pkp.ubc.ca/
http://www.publiclibraryofscience.org
http://www.publist.com
http://pubmedcentral.com
http://www.pubsub.com
http://www.qsensei.com
http://eprints-uk.rdn.ac.uk
http://www.gpoaccess.gov/legacy/registry
http://www.regulations.gov/search/index.jsp
http://www.renarcus.org
http://www.uidaho.edu/special-collections/Other.Repositories.html
http://www.rlo-cetl.ac.uk/harvester2
http://tigger.uic.edu/rjensen
http://eprints.bo.cnr.it
http://www.ucalgary.ca/lib-old/ssportsite/
https://scholarsbank.uoregon.edu/dspace/
http://www.scielo.cl/scielo.php?script=sci_home&lng=en&nrm=iso
http://www.science.gov
http://www.scienceaccelerator.gov
http://science.creativecommons.org/
http://www.ScienceResearch.com
http://www.scirus.com
http://topics.scirus.com
http://www.sciseek.com
http://scitation.aip.org
http://www.scitopia.org/scitopia/
http://www.scopus.com/
http://www.searchability.com/academic.htm
http://searchpdf.adobe.com/
http://www.searchedu.com
http://www.searchenginecolossus.com/Academic.html
http://www.gpo.gov/nara/pubpaps/srchpaps.html
http://info.lib.uh.edu/sepb/search.htm
http://unesdoc.unesco.org/ulis/unesbib.html
http://www.uvm.edu/bmaclenn/
http://smealsearch.psu.edu/
http://sunsite3.berkeley.edu/wikis/datalab/index.php?n=Main.GoogleSearch
http://papers.ssrn.com/sol3/DisplayAbstractSearch.cfm
http://stnweb.fiz-karlsruhe.de/html/english/
http://www.StormingMedia.us/
https://dspace.stir.ac.uk/dspace/index.jsp
http://swoogle.umbc.edu/
http://etds.ncl.edu.tw/theabs/english_site/search_simple_eng.jsp
http://www.techxtra.ac.uk/
http://cma.zdnet.com/texis/techinfobase/techinfobase
http://www.inderscience.com/catalogue/
http://dast.nlanr.net/Clearinghouse/Query.htm
http://www.open-video.org/
http://articlesciences.inist.fr/
http://www.virtuallrc.com/
http://thoughtmesh.net/
http://www.babelfish.altavista.com/tr
http://www.google.com/language_tools
http://www.faganfinder.com/translate/
http://eprints.ucl.ac.uk/
http://nergal.grainger.uiuc.edu/cgi/b/bib/bib-idx
http://www.data-archive.ac.uk/
http://census.ac.uk/
http://snipurl.com/r2wn
http://www.virtuallrc.com/TechReports.html
http://vos.ucsb.edu/
http://whelf.ac.uk/wrn/index.shtml
http://www.wolframalpha.com/
http://www.worldwidescience.org/
http://xstructure.inr.ac.ru/
http://www.VirtualPrivateLibrary.com/
http://www.AgricultureResources.info/
http://www.AIResources.info/
http://www.AstronomyResources.info/
http://www.AuctionResources.info/
http://www.BiologicalInformatics.info/
http://www.BiotechnologyResources.info/
http://www.BotResearch.info/
http://www.BIResources.info/
http://www.ChatterBots.info/
http://www.DataMiningResources.info/
http://www.DeepWebResearch.info/
http://www.DirectoryResources.info/
http://eCommerceResources.info/
http://www.ElderResources.info/
http://www.EmploymentResources.info/
http://www.EntrepreneurialResources.info/
http://www.FinancialSources.info/
http://www.FindingPeople.info/
http://www.GamesResources.info/
http://www.GenealogyResources.info/
http://www.GrantResources.info/
http://www.GreenFiles.info/
http://www.GridResources.info/
http://www.HealthcareResources.info/
http://www.InformationFutureMarkets.com/
http://www.InformationQualityResources.info/
http://www.InternationalTradeResources.info/
http://www.InternetAlerts.info/
http://www.InternetDemographics.info/
http://www.InternetExperts.info/
http://www.InternetHoaxes.info/
http://www.IntrapreneurialResources.info/
http://www.JournalismResources.info/
http://www.KnowledgeDiscovery.info/
http://www.MilitaryResources.info/
http://www.NewEconomyAnalytics.com/
http://www.OutsourcingOffshore.us/
http://www.PrivacyResources.info/
http://www.ReferenceResources.info/
http://www.ResearchResources.info/
http://www.RestStress.com/
http://www.WcriptResources.info/
http://www.ShoppingBots.info/
http://www.SocialInformatics.info/
http://www.StatisticsResources.info/
http://www.StudentResearch.info/
http://www.TheologyResources.info/
http://www.TutorialResources.info/
http://www.WWWReference.info/
http://www.WhitePapers.us/
http://www.InternetMiniguide.com/
http://www.AwarenessWatch.com/
http://www.LinkSeries.com/
http://www.InternetSources.info/
http://www.SourceSeries.com/
http://www.ScholarSearchEngines.com/
http://www.BotsBlogs.com/
http://www.BIOnlineResources.info/
http://www.eReferenceLibrary.com/
http://www.KDResources.info/
http://www.SearchingTheInternet.info/
http://www.WedDataExtractors.com/
http://www.InternetSpeaker.net
http://www.ecurrentAwareness.com/
http://www.MarketIntelligenceResources.com/
http://www.EntrepreneurialLinks.com/
http://www.NewEconomyManual.com/
Tuesday, January 19, 2010
Academic Search Engine and Portals
www.diva-portal.se/index.xsql?lang=en
academicearth.org
academicinfo.net
agecon.lib.umn.edu
all-academic.com
americansouth.org
arc.cs.odu.edu
tulane.edu/~Imiller/search.htm
archives.chadwyk.com/marketing/index.jsp
... and many more
academicearth.org
academicinfo.net
agecon.lib.umn.edu
all-academic.com
americansouth.org
arc.cs.odu.edu
tulane.edu/~Imiller/search.htm
archives.chadwyk.com/marketing/index.jsp
... and many more
Good websites
askkids.com
ivyjoy.com
kidsclick.org
kids.net.au
kidsites.org
kigose.com
aga-kids.com
bollify.org
quinturakids.com
studysearch.com.au
kidrex.org
dibdabdoo.com
academicindex.net
allsearchengines.com
academic.live.com
allacademic.com
collegenet.com
searchedu.com
ivyjoy.com
kidsclick.org
kids.net.au
kidsites.org
kigose.com
aga-kids.com
bollify.org
quinturakids.com
studysearch.com.au
kidrex.org
dibdabdoo.com
academicindex.net
allsearchengines.com
academic.live.com
allacademic.com
collegenet.com
searchedu.com
♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥
♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥
Boot .ini Boot BCD configuration os menu
[boot loader]
timeout = 13
default = multi(0)disk(0)rdisk(0)partition(1)\WINDOWS
[operating systems]
multi(0)disk(0)rdisk(0)partition(0)\WINDOWS="dunno 0" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(1)\WINDOWS="dunno 1" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(2)\WINDOWS="dunno 2" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(3)\WINDOWS="dunno 3" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(4)\WINDOWS="dunno 4" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(5)\WINDOWS="dunno 5" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(6)\WINDOWS="dunno 6" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(7)\WINDOWS="dunno 7" /NOEXECUTE=OPTIN /FASTDETECT
timeout = 13
default = multi(0)disk(0)rdisk(0)partition(1)\WINDOWS
[operating systems]
multi(0)disk(0)rdisk(0)partition(0)\WINDOWS="dunno 0" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(1)\WINDOWS="dunno 1" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(2)\WINDOWS="dunno 2" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(3)\WINDOWS="dunno 3" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(4)\WINDOWS="dunno 4" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(5)\WINDOWS="dunno 5" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(6)\WINDOWS="dunno 6" /NOEXECUTE=OPTIN /FASTDETECT
multi(0)disk(0)rdisk(0)partition(7)\WINDOWS="dunno 7" /NOEXECUTE=OPTIN /FASTDETECT
Subscribe to:
Comments (Atom)
