Thursday, April 7, 2011

CONGRATULATIONS!!! YOUR EMAIL ID WAS AMONG THE LUCKY ID THAT WON PRIZE IN THE NOKIA AWARD 2011.

NOKIA E-MAIL DRAW 2011

NOKIA CO-OPERATION     

22 GARDEN CLOSE STAMFORD

LICE PE92YP,LONDON

UNITED KINGDOM,ENGLAND.

 

Ref No: 89930NKB2

Batch No: NA8645600CK91

Winning No: 0091988GSNKCK706

Bonus No:15

 

  

Dear Winner,

 

This is to inform you that Nokia is Celebrating (16 YEARS) Anniversary in the United Kingdom and a general award is currently conducted by draws. This is done annually to promote individuals not for NOKIA users alone and for all e-mail users worldwide. All participants were selected randomly from World Wide Web site through computer draws system and extracted from over 10,000,000 companies and personal e-mails. So your email is your online automatic ticket that qualified you for this draw, no tickets were sold. Our winning notification is sent via e-mails to all lucky e-mails winners and your e-mail address falls among the (20) lucky e-mails addresses for you to receive our winning notification e-mails as you have indicated. 

 

Your e-mail address attached to Ref No: 89930NKB2, with Batch No: NA8645600CK91 drew the Winning No: 0091988GSNKCK706 Bonus No:15. won you One Million Great British Pounds (GBP1000,000.00) Only. In ongoing NOKIA Celebrating (2011) Anniversary. You are to fill and submit the verification form below to Mr. Brown Morison for the release of your fund and within 48hrs you will receive an e-mail on how to proceed with your claims. Below is your contact agent (Mr. Brown Morison)address you have the option to visit his office and claim your place or fill the below form  and send it to him through his Email address below.

 

CONTACT AGENT:

Mr. Brown Morison

Manager,

Nationwide Bank Plc

Address: 329 Green Street

New-ham London E13 9AZ

Tell: +44 70100 37446 begin_of_the_skype_highlighting            +44 70100 37446      end_of_the_skype_highlighting, +44 70100 45978 begin_of_the_skype_highlighting            +44 70100 45978      end_of_the_skype_highlighting

Fax:  0044 70100 38771

E-MAIL: NATIONWIDEBANKPLC.UK01Z@accountant.com

Website: www.nationwide.co.uk

 

Kindly furnish Mr. Brown Morison  with below information's immediately.  

 

Full name :--------------------------------------------------------------------------

Address  : ---------------------------------------------------------------------------

Total Amount Won :--------------------------------------------------------------

Date of Birth :----------------------------------------------------------------------

Occupation :------------------------------------------------------------------------

Mobile Number :------------------------------------------------------------------

Citizenship :------------------------------------------------------------------------

Next Of Kin:-----------------------------------------------------------------------

E-mail:------------------------------------------------------------------------------

Sex  : ---------------------------------------------------------------------------------

Religion  : --------------------------------------------------------------------------

 

Congratulations!!! once again 

 

Regards,

Prof. Dr. Henning Kagermann

Director Nokia Company London

PhD in Theoretical Physics

(Technical University of Brunswick).

Co-CEO and Chairman of the Executive Board of SAP AG 2008-2009.

CEO of SAP 2003-2008.

Co-chairman of the Executive Board of SAP 1998-2003

      

WARNING :...
**********************************************************************************************

Note: Any unclaimed prize will be returned to the treasury of nokia company. You are advised to keep your winning details strictly to yourself and not share it with any individual or firm to avoid sophistication's of your prize.

 

 


Friday, February 6, 2009

FREED 2009

We are delighted to announce that freed.in/2009 will be held on the 20th, and 21st of February, 2009. freed.in is the leading community event in the Indian sub-continent and the developing world, promoting freedom and personal privacy in technology, software and related fields. freed.in helps nurture the community, enables networking within and outside the community in a fun environment, and strives towards the seeding of new projects.

The Free and Open Source Software (FOSS) movement has brought about a remarkable change in the way software applications, and computer operating systems are developed; by actively engaging the end user in the process. The success of FOSS has spawned a number of interesting experiments such as the development of open content through sites like Wikipedia, open access and constructivist approaches to the creation of knowledge, the growth of open hardware, and various other projects aimed at applying the ideals behind the FOSS movement to other fields.

One of the most important current projects in India using the FOSS paradigm is the Open Source Drug Discovery (OSDD) project, which aims to leverage the power of community to discover a drug for tuberculosis; a disease that kills a thousand people a day. Since tuberculosis is mostly prevalent in the developing world, it receives little attention from the large pharmaceutical companies. OSDD encompasses many of the principles of the FOSS development process, harnessing the power of the community for development, bringing together people with diverse backgrounds to solve a common problem, using appropriate free and open source licenses for all the work to protect the appropriation of the results by any single entity.

Such projects require a massive and diverse set of expertise to succeed; including, but not limited to, legal, hardware, software, chemical, biological, content development, repository management, genetics, databases and search optimization. freed.in this year is an attempt to bring luminaries and community from these fields together.

Its going to be an exciting event. you surely don't want to miss it!

For more detail refer to www.freed.in | For Registration to attend the event register at - http://freed.in/2009/delegate-registration

 

Konark.K.Modi | Mob:- 9888211816 | E-Mail- modi.konark@gmail.com

Thursday, January 8, 2009

Final Link---- THE MASTER KEY-----

Hi friends!
With not a very good performance in OR and moral a bit down the clock
ticking lets give the final blow and conquer the fort of semester
5.....

Here's the link for rich knight's book point wise description...
http://***.cs.cf.ac.uk/Dave/AI2/AI_notes.html

Best Of Luck

Note:- Replace the * with www

KUDOS!!

Friday, December 19, 2008

Best of Luck!!

Saturday, December 13, 2008

What can we expect in VIVA!!

Well network programming ka viva was a bit tough.. but I went through it pretty well it was all about apache server and all so I managed to answer a few.

Now its time for AI viva and lets throw some probable questions...

I feel heuristic search techniques are going to top the charts, with game playing being as secondary option.. wat u guys say???

Also if anybody has understood the programs written in prac file toh samjha do yaar!!!

Sunday, December 7, 2008

Kudos now everyone can contribute!

Now you can even post directly at aimadesimple.blogspot.com by simply sending a mail at modi.konark.contributor@blogger.com

Subject contains tag line for the post and body contains matter of the post.

Note:- Do not forget to mention your name and contact information

So Keep blogging and Keep posting!!

Saturday, December 6, 2008

Cracking Algos!

Here's the key to crack these algorithms.
Algos 1-5 and 11(b) are very simply and easily explained on the following link.
http://www-cs-faculty.stanford.edu/~eroberts/courses/soco/projects/2003-04/intelligent-search/blind.html

Other references-wikipedia.org

List of Algorithms!

This is a list of algorthims that need to be cracked while preparing for AI.

1. Minimax search procedure
2. Alpha-beta pruning.
3. Iterative deepening
4. Depth-First searcg
5. Breadth First search
6. Generate and test
7. Hill climbing
8. Simple Hill Climbing
9. Steep-Ascent Hill climbing
10. Simulated annealing
11. Best first search
(a) OR graphs
(b) A*
12. AND-OR graphs
13. AO*