Secret codes for Nokia

All these codes are collected from different sources in the internet. I have tested only some of them. Some of these may not work on all models. So, please try at your own risk.

IMEI no: : *#06#

Reset to factory settings : *#7780#

Clear the LCD display (operator logo) : *#67705646#

Bluetooth device address : *#2820#

Sim clock status : *#746025625#

Default Security Code : 12345

On Enhanced Full Rate Codec : *3370#

Off Enhanced Full Rate Codec : *#3370#

On Half Rate Codec. : *4720#

Off Half Rate Codec : *#4720#

Software Version : *#0000# or *#9999#

Display the MAC address of the WLAN adapter : *#62209526#
(Available only in newer models that support WLAN like N80)

Lock Status of ur Phone : #pw+1234567890+1#

Lock Status of ur SIM : #pw+1234567890+4#

Security Code of ur Phone : *#2640#

Game Score & Timer: *#73#




Delete the contents and code of wallet : *#3925538#

Master Code generated from IMEI : 1234567890

Lifetimer : *#92702689#

Provider lock status: #pw+1234567890+1

Network lock status: #pw+1234567890+2

Provider lock status: #pw+1234567890+3

SimCard lock status: #pw+1234567890+4

Reset security code : *#7328748263373738#

Enjoy dudes..

Secret codes for MOTOROLA phones

All these codes are collected from different sources in the internet. I have tested only some of them. Some of these may not work on all models. So, please try at your own risk.

IMEI number : *#06#

Lock keys : *7 (Press together)

Note : [] (pause) means the * key held in until box appears.

Select phone line : [] [] [] 0 0 8 [] 1 []
(use this 2 write things below the service provider name)

Add phonebook 2 main menu: [] [] [] 1 0 5 [] 1 []

Add messages 2 main menu : [] [] [] 1 0 7 [] 1 []

Copy SIM memory (phonebook menu) : [] [] [] 1 0 8 [] 1 []

Eng Field options : [] [] [] 1 1 3 [] 1 []

Frequency of search menu - Slow : [] [] [] 1 0 1 [] 1 []

Frequency of search menu - Medium : [] [] [] 1 0 2 [] 1 []

Frequency of search menu - Fast : [] [] [] 1 0 3 [] 1 []

Enable EFR (Enhanced Full Rate Codec) : [] [] [] 1 1 9 [] 1 []

Function : [] [] [] # # # [] 1 []


Change pin : [] [] [] 0 0 4 [] 1 []

Unblocking using the PUK code : [] [] [] 0 0 5 [] 1 []


To deactivate any code, change the last no: to '0' (zero).
eg:- To deactivate the code [] [] [] 1 1 9 [] 1 [], type [] [] [] 1 1 9 [] 0 []



Enginnering mode : Enter menu & press 048263* quickly.

To change GSM frequencies to 900/1800 in this menu :
Under "Opcode", enter the foll:

10*0*3 for GSM 900

10*0*4 for GSM 1800

10*0*5 for GSM 1900

10*0*6 for dual band GSM 900/1800

10*0*7 for dual band GSM 850/1900

BSNL FREE DELIVERY REPORT

For some BSNL connections delivery report is chargeable(10ps).
Here is a simple trick for free delivery report.
While typing the msg, give an exclamation mark '!' in the beginning & then type the msg.
eg: !hi
Then the recipient will get it as 'hi' without '!'
Just try it. Its working well in 944- series.
Try on other series also.
May not work while forwarding msgs.
Type from the beginning itself, i mean a fresh msg.

Beyond Web-2.0

Posted by T.V Raman, Research Scientist

A little over a year ago, I gave a lightning talk at the W3C Technical Plenary in Boston where I looked forward to what came after Web-2.0. The key insight underlying that talk was that the Web was now mature enough for us to build Web technologies purely out of Web parts. Web-2.0 is a result of applying the Web to itself and is therefore better thought of as Web(Web()) or more concisely, Web².

Today, we can build new web artifacts out of existing ones by aggregation (web mashups) and by projection (filtered views), and publish the resulting artifacts on the web by assigning them a URL. This leads to the insight that this web that is to come potentially consists of the power-set of all web content. These ideas, and their logical consequences are detailed in article entitled Toward 2^W --- Beyond Web 2.0 in the February edition of the Communications Of The ACM. You can also find a slightly more extensive blog I posted here.

Web settings for BSNL gprs and internet.

Hi friends, for bsnl users- you can download web settings from the following link-
http://www.cellone.in/cellone_msp.htm
Select your state and get the settings directly on your phone.

If your phone does not support automatic configuration, Go to this link for manual settings-
http://www.cellone.in/ds.htm

Airtel gprs settings for china mobiles and others which require manual configuration.

AIRTEL LIVE

Access point- airtelfun.com
proxy- 100.1.200.99
port- 8080
Home page- live.airtelworld.com

keep user name and password as blank
No need to change other settings.

MOBILE OFFICE

Access point- airtelgprs.com
proxy- Disabled
Home page- wap.google.com (or any site you like)

keep user name and password as blank
No need to change other settings.

WORKS ALL OVER INDIA.

Airtel free gprs, free downloads,chats,FREE SMS through 160by2.com, orkut,live cricket score, etc even on connections with no validity.

Trick for airtel unlimited free internet.


Hi friends, this is a trick for free acces to any website for free in airtel on your mobile. Your connection need not have validity even.
This trick is very simple eventhough i have written it so long in detail.

First of all you should make your balance below 30ps. But in some places (including kerala), Airtel live can be accessed only when balance is above 15rs. Inorder to use it with low balance, do this trick-

1) Dial *567*1#,select option '1'. It will activate 'Mobile Office' on your mobile.(Activation is free).

Now wait for the confirmation message and web settings.
If you dont get settings see here for manual settings.
After receiving the settings you may deactivate the mobile office by dialling *567*2#.

2) Now Go to the MENU>>WEB>>SETTINGS>>CONFIGURATION SETTINGS>>CONFIGURATION. Change the configuration to AIRTEL or AIRTEL LIVE.(leave it if it is already the same).

Now you can access AIRTEL LIVE even at zero balance.

Now the real deal comes....





Go to https://fire-proxy.com
Or
https://flyproxy.com
and enter the site address and click go. Now you can access whole internet and download anything.
Note: In fire-proxy, you can download files with size upto 3mb only. But there is no limit for flyproxy.

You can enter my site for free downloads and services
http://skyzone.wapka.mobi
(updated daily)

New Update: You can also access these sites directly by entering the addresses below(No need to enter through the above proxy sites).

https://mobitamilan.net/live
https://isaitamil.in

You can get a lot of free downloads here..

And ofcourse, you can use AIRTEL LIVE and other services like TADKA LIVE as usual.
NOTE: If your balance is above 30ps it may charge. So always keep your balance below 30ps.

WORKS EXCELLENTLY IN KERALA. TRY IN YOUR STATE.


GO ENJOY DUDES.................

Market Algorithms and Optimization Meeting

Posted by Vahab S. Mirrokni and Muthu Muthukrishnan

Google auctions ads, and enables a market with millions of advertisers and users.  This market presents a unique opportunity to test and refine economic principles as applied to a very large number of interacting, self-interested parties with a myriad of objectives. Researchers in economics, computer science, operations research, marketing and business are increasingly involved in defining, understanding and influencing this market. 

On January 7th, a group of computer science researchers from Google and various universities formed a workshop to discuss key research directions in this area, specifically "Market Algorithms and Optimization." Corinna Cortes (Head, Google Research, NY)  and Alfred Spector (VP of Research, Google) gave short talks about research groups in Google, academic collaborations, and research awards. The morning session comprised talks by Google researchers including Noam Nisan, Jon Feldman, Vahab Mirrokni, Yishay Mansour, and Muthu Muthukrishnan. These talks explored the following topics and key issues: 

• Role of budgets. Identify suitable properties of mechanisms for repeated auctions in the presence of budgets. Truthfulness is impossible, and may not be the suitable property.  
  
• Advertisers' bidding strategies. While bidding equally on all keywords has certain desirable properties,  identify other bidding strategies if advertisers want to maximize different utility functions and  use rich bidding features.
  
• Dynamics of ad games. Understand dynamics of sophisticated advertiser bidder strategies under various ad allocation rules. For proportional allocation rules, the dynamics of simple bidder strategies are described here.
• Online Reservations. Design suitable mechanisms for selling ad inventory in the future rather than on the spot. Models and methods for what happens when reservations can not be honored are explored in WWW08, WINE08, and SODA09 papers.

The research presented in these talks can be found at the Google publications site. Some general research directions and open problems in ad auctions are here.

The post-lunch (sushi included of course) session comprised talks by researchers from academia.  Bobby Kleinberg (Cornell) went first and took the audience far into projective geometry in an attempt to understand equilibria resulting from a sequence of selfish behavior of players using specific learning algorithms. Silvio Micali (MIT) described how difficult it was to model or propose mechanisms in presence of collusions, and then went on to show how to correctly design such mechanisms for combinatorial auctions. Kamesh Munagala (Duke Univ.) and Anna Karlin ( U. Wash) discussed algorithmic problems related to ad auctions, including how to run auctions in presence of advertisers with mixed utilities and tight remnant budgets. Other participants -- Richard Cole (NYU), Amos Fiat (Tel Aviv), Uri Feige (Weizmann), Michel Goemans (MIT), Anupam Gupta (CMU),   Nicole Immorlica (Northwestern), Michael Rabin (Harvard), and Eva Tardos (Cornell) -- kept it lively with questions and discussions.

Part of what makes Google ad systems exciting is the challenges they pose and overcome, and yet others in the horizon. It is remarkable how some of the fundamental problems Google ad systems grapple with are also some of the hardest research problems in the community of Market Algorithms.  Joint Google and Academia meetings like this help researchers begin to attack these problems, and may be a model for  research collaborations in the future.

Google University Research Awards

Posted by Juan Vargas, University Relations

For most people, the word "Google" evokes associations of Internet search, free apps, and advertising--a far cry from our roots in research and academia. Google, however, has not lost sight of that fundamental relationship. Many of our offices (or "campuses") are located near local universities, and we maintain a working environment many consider to be collegiate: informal, collaborative, and home to expert lectures not only about science and technology, but also about literature, the economy, world peace, green energy, fitness, etc.

But these aspects are only one component of our enduring partnership with academia. Given the unique technical challenges we face, from the beginning we've often recognized the need for a strong relationship with the research community. One of the key ways we interact with this community is through the Google Research Awards Program. 

Started in 2005, the program seeks to identify and support leading-edge research in strategic areas of engineering and computer science. Professors from universities worldwide submit proposals three times per year that are evaluated by a team of Google engineers and scientists. 

Like Google itself, the program is global in scope: in the most recent round of submissions, nearly a third came from outside of the United States. During that round, we received 149 proposals and we ultimately decided to fund about a third of the projects.

A challenging aspect of running an awards program is making the funding decisions. We want to ensure that every proposal is reviewed by the best experts in the field. Luckily, we're fortunate to have many people at Google with the right expertise who help us make those decisions. 

As Alfred Spector, VP for Research, explains, "The winning proposals not only get financial support from Google, but also receive the extra benefit of being assigned a Google liaison who maintains a special relation with the professor during the life of the award, contributes to the research, and ensures that the outcomes are valuable to Google and academia." One example of this is the recent paper featured on the Google Research home page, by Phil Long and Rocco Servedio from Columbia University titled "Random Classification Noise Defeats All Convex Potential Boosters." 

The following are some highlights from other recently-funded projects: 

Social Networks Research Through CourseRank

Hector Garcia-Molina, Stanford University

Hector Garcia-Molina and his team at Stanford are pursuing research on social networks and web usability by using and expanding CourseRank, a course evaluation and recommendation system for the Stanford community. As of June 2008, CourseRank has over 6,700 users and over 134,000 course evaluations. In addition to providing a service for Stanford students, it provides useful data to learn about social networks. Dr. Garcia-Molina plans to use CourseRank to investigate problems such as spam, trust, recommendations with complex objects, and the nature of social interactions. You can see a video with student testimonials and a demo here.

Energy-Efficient Storage Architectures for Data Centers

Sudhanva Gurumurthi, Mircea Stan, University of Virginia

Drs. Gurumurthi and Stan from the University of Virgina have developed a new disk drive architecture called "Intra-Disk Parallelism" that they hope will reduce the energy consumption of data center storage systems by over 60% while providing high performance to applications. This architecture extends conventional disk drives by allowing it to handle multiple I/O requests in parallel and by provisioning additional hardware resources to enhance the parallel capabilities even further. Details of their research were published at the 2008 International Symposium on Computer Architecture (ISCA). The conference paper has also been selected to appear in the IEEE Micro special issue on Top Picks from Computer Architecture Conferences.

Finding Better Spoken Dialog System Metrics

Maxine Eskenazi, Carnegie Mellon University

When the number of calls to spoken dialog systems mounts into the thousands, or millions, it is impossible to listen to every call. Prof. Eskenazi and her team at CMU are studying new metrics that could improve the performance of those systems. Dr. Eskenazi hopes this research will help illuminate how best to cope with advances in tuned speech recognition and new synthetic voices.

Interested in learning more about the Google University Relations and our Research Awards Program? Please visit our web site where scholars can learn more and submit proposals.

Smart Thumbnails on YouTube

Posted by Tomáš Ižo (Software Engineer) and Jay Yagnik (Head of Computer Vision Research)

One of our favorite aspects of Google web search are the informative snippets that appear with each search result.  The more relevant they are, the quicker we can find what we're looking for.  As members of the computer vision team, we're pleased to say that we now apply a similar philosophy to choosing thumbnails for videos on YouTube.  After all, the thumbnail is the first visual piece of information our users get when searching or browsing YouTube videos.  As we recently announced in a post on the YouTube Blog, our previous system of choosing thumbnails from the 25, 50 and 75% marks in the video, which often led to arbitrary, uninformative or sometimes even misleading images, is now a thing of the past.  When a new video comes to YouTube, we now analyze it with an algorithm whose aim is to pick a set of images that are visually representative of the content of the video.  As with the ground-breaking video identification tools that we launched on YouTube last year, this system is another example of how looking inside the video can lead to a safer, more relevant experience for our users.  

Launching a computer vision algorithm on YouTube comes with a unique set of challenges, many of which have to do with the incredible diversity of the content and the awe-inspiring rate at which it pours into our servers: each minute YouTube receives as much as 13 hours of video content in a wide variety of genres, styles, formats and resolutions.  Of course, even with some of the technical challenges aside, our work is far from finished.  We'll keep on studying how our users interact with thumbnails and, more generally, with video content on the web, and we'll continue thinking of innovative ways to use computer vision and machine learning to improve the experience.