While surfing the internet you often find one of those buttons

or other links to the w3c-validator sites - but have you ever tried to click them???

They should be an evidence for good web-design and valid code

The World Wide Web Consortium (W3C) develops interoperable technologies (specifications, guidelines, software, and tools) to lead the Web to its full potential.

W3C is a forum for information, commerce, communication, and collective understanding. On this page, you'll find W3C news, links to W3C technologies and ways to get involved. New visitors can find help in Finding Your Way at W3C.

We encourage organizations to learn more about W3C and about W3C Membership.

• http://www.siggraph.org/
• http://es.tldp.org/
• http://www.sciencematerialscenter.org/siteinfo.htm
• http://www.mdsign.co.uk/w3c.html
• http://www.mediateur-republique.fr/fr-citoyen-05-63
• http://www.itmanagersjournal.com/feature/21847
• http://www.dailyflashid.org/archives/flex/
• http://www.geocities.com/frakilk/index.html

This is a pack for use with IEview.Includes all 72 emoticons from version 3.5.0.239 of skype.Also includes 15 hidden emoticons.They all are exactly the same emoticons like in skype.This is very helpful for these who work with skype plugin to chat from miranda.Now they seen the same thing like the skype users.

; Pack of smileys for use with IEView plugin.
;
SelectionSize = 25, 25
;------------------------------------------
;              Skype CODE START
Smiley = "01.gif"  , 0, ":) :-) :=)"
Smiley = "02.gif"  , 0, ":( :-( :=("
Smiley = "03.gif"  , 0, ":D :-D :=D :d :-d :=d"
Smiley = "04.gif"  , 0, "8) 8-) 8=) B) B-) B=)"
Smiley = "05.gif"  , 0, ":o :-o :=o :O :-O :=O"
Smiley = "06.gif"  , 0, ";) ;-) ;=)"
Smiley = "07.gif"  , 0, ";( ;-( ;=("
Smiley = "08.gif"  , 0, "(sweat) (:|"
Smiley = "09.gif"  , 0, ":| :-| :=|"
Smiley = "10.gif" , 0, ":* :-* :=*"
Smiley = "11.gif" , 0, ":p :-p :=p :P :-P :=P"
Smiley = "12.gif" , 0, "(blush) :$ :-$ :=$ :">"
...

Smiley = "12.gif" , 0, "(blush) :$ :-$ :=$ :>"

while i was doing some research form my master thesis i found this article ... check it

a nice article about COBOL ... it's past, current and future usage & some interesting statistical figures

read more | digg story

I was curious what addresses are displayed in the "To:" Field in gmail and started to guess ...

are those the e-mail addresses from

• the contact-list
• the sender field of received mails (read/unread mails)
  
• the receiver field of sent mails
• a combination of sender/receiver field (all of inbox/outbox, history, recent ...)
• ...
  

• set up a new gmail account
• wrote an e-mail from the new account to myself
• checked when the e-mail address gets into my contact-list
  

• received email from email-address not in contact list
• e-mail address didn't appear in the "To:" field neither in the contact-list
• opened email from email-address not in contact list
• e-mail address didn't appear in the "To:" field neither in the contact-list
• replyed to email from email-address not in contact list
  
• e-mail address is saved in contact-list & appears in the "To:" field

I searched for a simple script which validates a html-form and if everything is alright submit the form to a php script ... i didn't really find something so here is a simple one of mine

1st - create your form with the js-validation

 onsubmit="return k_checkForm(this);" 
 method="post">
Name: 
Number: 

echo $_POST["name"]; 
echo $_POST["phone"];

after some debugging i found the reason for the js-error ie reported all the time ...

here is a simple solution ... ignore the Statement 'Don't change anything past this point ----------------- ' in the script-part and replace

function s(a,b,i,x){
  if(a>b){
      var m=(a-b)/Math.log(x),v=a-Math.floor(Math.log(i)*m)
         }
  else{
      var m=(b-a)/Math.log(x),v=Math.floor(Math.log(i)*m+a)
      }
  return v
}

function s(a,b,i,x){
 var m = 1;
 var v = 1;

 if(a>b){
    if (Math.log(x) > 0)  {
       m = (a-b)/Math.log(x);
    } else {
       m = 1;
    }
    var v=a-Math.floor(Math.log(i)*m)
 } else {
    if (Math.log(x) > 0)  {
       m = (b-a)/Math.log(x);
    } else {
       m = 1;
    }
    v=Math.floor(Math.log(i)*m+a)
 }
  
 return v;
}