Skip to search.

Breaking News Visit Yahoo! News for the latest.

×Close this window

aima-talk · AI: A Modern Approach: Help for the text

The Yahoo! Groups Product Blog

Check it out!

Group Information

? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Real people. Real stories. See how Yahoo! Groups impacts members worldwide.

Messages

Advanced
Messages Help
Messages 152 - 198 of 946   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Show Message Summaries Sort by Date ^  
#152 From: "Franz Calvo" <franzcalvo@...>
Date: Tue Apr 29, 2003 12:24 am
Subject: Looking for a Datalog language (that works)
franzcalvo
Send Email Send Email
 
I would greatly appreciate if someone could help me find a Datalog
language (deductive databases) I could download and use. A 1-month
evaluation version would be just fine.

I did try http://www.dbai.tuwien.ac.at/proj/dlv but it didn't run on
Windows XP nor on Windows 2000.

Thank you

Franz

Biomedical and Health Informatics
The University of Washington
http://www.bhi.washington.edu

#153 From: "george3770549" <george@...>
Date: Mon May 19, 2003 9:08 pm
Subject: Cryptarithmetic puzzles
george3770549
Send Email Send Email
 
I'd be interested in an extension to csp Module (csp.py) which would
hand dle Higher-order Constraints as suggested on page 140, or
equivalently discussion of exercise 5.11.

#154 From: Peter Norvig <peter@...>
Date: Mon May 19, 2003 9:44 pm
Subject: Re: Cryptarithmetic puzzles
norvig
Send Email Send Email
 
Are you asking me to implement them, or are you offering to?

-Peter

On Monday, May 19, 2003, at 02:08  PM, george3770549 wrote:

> I'd be interested in an extension to csp Module (csp.py) which would
> hand dle Higher-order Constraints as suggested on page 140, or
> equivalently discussion of exercise 5.11.
>
>
>
> ------------------------ Yahoo! Groups Sponsor
> ---------------------~-->
> Get A Free Psychic Reading! Your Online Answer To Life's Important
> Questions.
> http://us.click.yahoo.com/Lj3uPC/Me7FAA/uetFAA/7brrlB/TM
> ---------------------------------------------------------------------
> ~->
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to
> http://docs.yahoo.com/info/terms/
>

#155 From: "george3770549" <george@...>
Date: Tue May 20, 2003 1:10 am
Subject: Re: Cryptarithmetic puzzles
george3770549
Send Email Send Email
 
I'd be glad to try to implement such a beast.  I think the method
would be to define 'neighbors' groups for example neigbors = [[O R
X1],[X1 W  U X2],[X2 T O X3],[X3 F]]
A parse neighbors would split these into dictionary elements O:[O R X1]
R:[O R X1] X1:[O R X1] etc.

Then each reference to elements of neighbors list must be examined and
in most cases modified to properly handle lists of variables

The definition of the constraints function needs to be modified
it could be constraints(A,a,B,b...) with alternating vars and values
or constrains(Varlist,Vallist) with lists of variables and values.


Does this seem like a good way to go, or is it heading up or down a
blind alley?

george


--- In aima-talk@yahoogroups.com, Peter Norvig <peter@n...> wrote:
> Are you asking me to implement them, or are you offering to?
>
> -Peter
>
> On Monday, May 19, 2003, at 02:08  PM, george3770549 wrote:
>
> > I'd be interested in an extension to csp Module (csp.py) which would
> > hand dle Higher-order Constraints as suggested on page 140, or
> > equivalently discussion of exercise 5.11.
> >
> >
> >
> > ------------------------ Yahoo! Groups Sponsor
> > ---------------------~-->
> > Get A Free Psychic Reading! Your Online Answer To Life's Important
> > Questions.
> > http://us.click.yahoo.com/Lj3uPC/Me7FAA/uetFAA/7brrlB/TM
> > ---------------------------------------------------------------------
> > ~->
> >
> > To unsubscribe from this group, send an email to:
> > aima-talk-unsubscribe@yahoogroups.com
> >
> >
> >
> > Your use of Yahoo! Groups is subject to
> > http://docs.yahoo.com/info/terms/
> >

#156 From: "george3770549" <george@...>
Date: Tue May 20, 2003 3:29 pm
Subject: Re: Cryptarithmetic puzzles
george3770549
Send Email Send Email
 
A significant revision to my earler thoughts on this issue:

After rereading problem 5.11 the tuple '[X Y Z]' should parse to
{'X':['Y','Z'],'Y':['X','Z'],'Z'['X','Y']}

-george

--- In aima-talk@yahoogroups.com, Peter Norvig <peter@n...> wrote:
> Are you asking me to implement them, or are you offering to?
>
> -Peter
>
> On Monday, May 19, 2003, at 02:08  PM, george3770549 wrote:
>
> > I'd be interested in an extension to csp Module (csp.py) which would
> > hand dle Higher-order Constraints as suggested on page 140, or
> > equivalently discussion of exercise 5.11.
> >
> >
> >
> > ------------------------ Yahoo! Groups Sponsor
> > ---------------------~-->
> > Get A Free Psychic Reading! Your Online Answer To Life's Important
> > Questions.
> > http://us.click.yahoo.com/Lj3uPC/Me7FAA/uetFAA/7brrlB/TM
> > ---------------------------------------------------------------------
> > ~->
> >
> > To unsubscribe from this group, send an email to:
> > aima-talk-unsubscribe@yahoogroups.com
> >
> >
> >
> > Your use of Yahoo! Groups is subject to
> > http://docs.yahoo.com/info/terms/
> >

#157 From: "Brandon Corfman" <bcorfman@...>
Date: Wed May 21, 2003 1:23 pm
Subject: csp.py
bcorfman
Send Email Send Email
 
Since this file has been mentioned recently, I'd like to ask how
finished it is. I tried running solve_zebra, and it bombs out with an
error. Also, it doesn't look like some of the other problems (like
N-Queens) have a direct way to execute.

Brandon

#158 From: Peter Norvig <peter@...>
Date: Thu May 22, 2003 1:02 am
Subject: Re: csp.py
norvig
Send Email Send Email
 
The zebra problem is difficult; you may have run out of memory.  What
error msg did you get?  You should get an answer eventually, but it
should take several minutes.

I added some example calls for N-Queens and the map problems.

I also moved the code to http://aima.cs.berkeley.edu/python

-Peter

On Wednesday, May 21, 2003, at 06:23  AM, Brandon Corfman wrote:

> Since this file has been mentioned recently, I'd like to ask how
> finished it is. I tried running solve_zebra, and it bombs out with an
> error. Also, it doesn't look like some of the other problems (like
> N-Queens) have a direct way to execute.
>
> Brandon
>
>
> ------------------------ Yahoo! Groups Sponsor
> ---------------------~-->
> Get A Free Psychic Reading!
> Your Online Answer To Life's Important Questions.
> http://us.click.yahoo.com/aM1XQD/od7FAA/uetFAA/7brrlB/TM
> ---------------------------------------------------------------------
> ~->
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to
> http://docs.yahoo.com/info/terms/
>

#159 From: "BRANDON C CORFMAN" <bcorfman@...>
Date: Thu May 22, 2003 1:09 pm
Subject: Re: csp.py
bcorfman
Send Email Send Email
 
>>> csp.solve_zebra()
House 1
Traceback (most recent call last):
   File "<pyshell#0>", line 1, in ?
     csp.solve_zebra()
   File "C:\Documents and Settings\Brandon
Corfman\Desktop\PyCode\csp.py", line 431, in solve_zebra
     for (var, val) in ans.items():
AttributeError: 'NoneType' object has no attribute 'items'

It definitely takes several minutes to get this error message -- I think
about 20-30 minutes on my P4. It looks like it's ending without finding
a solution?

Thanks for the new code; I'll give it a try.

Brandon

Peter Norvig wrote:

>The zebra problem is difficult; you may have run out of memory.  What
>error msg did you get?  You should get an answer eventually, but it
>should take several minutes.
>
>I added some example calls for N-Queens and the map problems.
>
>I also moved the code to http://aima.cs.berkeley.edu/python
>
>-Peter
>
>
>
>
>

#160 From: "Brandon Corfman" <bcorfman@...>
Date: Thu May 22, 2003 6:45 pm
Subject: Re: csp.py
bcorfman
Send Email Send Email
 
--- In aima-talk@yahoogroups.com, Peter Norvig <peter@n...> wrote:
>
> I added some example calls for N-Queens and the map problems.
>

I must be missing something; I didn't see any difference in the files.
Am I looking in the wrong place?

Thanks,
Brandon

#161 From: Peter Norvig <peter@...>
Date: Thu May 22, 2003 8:42 pm
Subject: Re: Re: csp.py
norvig
Send Email Send Email
 
The latest version is now at aima.cs.berkeley.edu

You can see the output of the examples at
http://aima.cs.berkeley.edu/python/docex-log.html#csp.py

The file itself is at
http://aima.cs.berkeley.edu/python/csp.py

-Peter

On Thursday, May 22, 2003, at 11:45  AM, Brandon Corfman wrote:

> --- In aima-talk@yahoogroups.com, Peter Norvig <peter@n...> wrote:
>>
>> I added some example calls for N-Queens and the map problems.
>>
>
> I must be missing something; I didn't see any difference in the files.
> Am I looking in the wrong place?
>
> Thanks,
> Brandon
>

#162 From: bhargav prajapati <bhargav_study@...>
Date: Fri May 23, 2003 9:31 am
Subject: Question
bhargav_study
Send Email Send Email
 
Respected,
 
my name is bhargav. I have completed my study in Bachelor Of Computer Applicartion.
 
my question is:
 
What the intelligence can create Fellings?


Do you Yahoo!?
The New Yahoo! Search - Faster. Easier. Bingo.

#163 From: Michael Schuerig <schuerig@...>
Date: Fri May 23, 2003 11:19 am
Subject: Re: Question regarding intelligence and feelings
mschuerig
Send Email Send Email
 
On Friday 23 May 2003 11:31, bhargav prajapati wrote:

> What the intelligence can create Fellings?

It all depends on what you mean by "feelings".

If you extend the question somewhat to "Can purely algorithmic processes
in a system result in the system having feelings", then you get one of
the hot topics of recent philosophy of mind. Important players are Ned
Block, David Chalmers, Thomas Nagel, John Searle, Sidney Shoemaker and,
of course, Daniel Dennett.

Basically, the debate boils down to an unmitigated opposition between
those who believe in (philosophical) Zombies and those who don't.
Zombies in this sense are creatures who behave absolutely
indistinguishable from ordinary people -- but who don't feel anything,
they don't have "qualia" (philo jargon for raw feelings).

So, if you would insist that feelings are something above and beyond
behavior, utterances, predispositions -- that is, things that can be
discernd from a scientific, third-person perspective. And if you
instead claimed that you have privileged, exclusive, first-person
access to "what it's like". Well, then there's no way from algorithmic
process to feelings.

People who favor this big-R Realist view of qualia conceive of the
feelings themselves as something in need of explanation. In my opinion,
this is a futile endeavor. Instead, I side with those (Dennett), who
more or less see our *verbal reports of feelings* as the thing to
explain. Feelings in this sense are (small-r) real, too, as they
obviously have an explanatory role in our mental economy.

HTH,
Michael

--
Michael Schuerig                 Not only does lightning not strike
mailto:schuerig@...          twice, it usually doesn't strike once.
http://www.schuerig.de/michael/  --Salman Rushdie, "Fury"

#164 From: "Brandon Corfman" <bcorfman@...>
Date: Tue May 27, 2003 12:19 pm
Subject: CSP chapter
bcorfman
Send Email Send Email
 
I finished reading the CSP chapter (the PDF file posted on the web
site)  over the weekend. I have a comment about one of the sentences
in section 5.2 talking about arc consistency.

On p. 146, it says that "although this [arc consistency] is
substantially more expensive than forward checking, the extra cost is
usually worthwhile." This doesn't seem to agree with the CSP survey
paper by Kumar (1992), which mentions that for loosely constrained
problems like N-queens that arc consistency is too expensive. (This is
also borne out by my own experience writing loosely-constrained CSPs
that have used AC-3.)

In this regard, I think that it would be good for section 5.2 to
actually have a brief mention of tightly constrained problems vs.
loosely constrained problems that would lead into a discussion of why
you would only apply FC vs. MAC/AC-3.

My 2 cents.

Best regards,
Brandon

#172 From: Alberto Vera <artificialintelligenceperu@...>
Date: Tue Jun 3, 2003 7:32 pm
Subject: Neural Network - layers in a net
artificialin...
Send Email Send Email
 
Hello:
 
Could you tell me about any method to answer this questions?
 
a) How many hidden layers do I set in a neural network?
b) How many neurons do I set for each hidden layer ?
c) how many layers is it better to set in a neural network?
 
Regards


Yahoo! Messenger
Nueva versión: Super Webcam, voz, caritas animadas, y más ¡Gratis!

#173 From: Alberto Vera <artificialintelligenceperu@...>
Date: Tue Jun 3, 2003 7:33 pm
Subject: Neural Network - layers in a net
artificialin...
Send Email Send Email
 
Hello:
 
Could you tell me about any method to answer this questions?
a) How many hidden layers do I set in a neural network?
b) How many neurons do I set for each hidden layer ?
c) how many layers is it better to set in a neural network?
 
Regards


Yahoo! Messenger
Nueva versión: Super Webcam, voz, caritas animadas, y más ¡Gratis!

#174 From: "Serguei A. Mokhov" <mokhov@...>
Date: Tue Jun 3, 2003 8:21 pm
Subject: Re: Neural Network - layers in a net
stgunya
Send Email Send Email
 
On Tue, 3 Jun 2003, [iso-8859-1] Alberto Vera wrote:

> Hello:
>
> Could you tell me about any method to answer this questions?
> a) How many hidden layers do I set in a neural network?
> b) How many neurons do I set for each hidden layer ?
> c) how many layers is it better to set in a neural network?

These are /research/ questions. For c) minimum you have to have two, input
and output layers. a) and c) and number of links (it may not necessarily
be a fully-connected network) are a research component. Try :) To be
computationally-feasible on a "commodity" class machines don't try too
many hidden layers with many neurons in a fully-connected network.

To give a few numbers: in one of our projects a net of 512 input neurons,
32 output neurons, a hidden layer of 1024, then 512, then 256 (a total of
5 layers) on my PIII, 550Mhz, 512Mb of RAM has never completed because it
ran out of memory.

--
Serguei A. Mokhov
Computer Science Department
Concordia University

#175 From: Peter Norvig <peter@...>
Date: Tue Jun 3, 2003 9:39 pm
Subject: Re: Neural Network - layers in a net
norvig
Send Email Send Email
 
You will find many rules of thumb to say exactly how many layers or
units to put into a network.  Don't believe them. The best answer is to
search the parameter space and use cross-validation.  A helpful
discussion is at
http://www-aig.jpl.nasa.gov/public/home/decoste/HTMLS/NN/FAQ/
FAQ2.html#A_hu


On Tuesday, June 3, 2003, at 12:33  PM, Alberto Vera wrote:

> Hello:
>  
> Could you tell me about any method to answer this questions?
> a) How many hidden layers do I set in a neural network?
> b) How many neurons do I set for each hidden layer ?
> c) how many layers is it better to set in a neural network?
>  
> Regards
>
>

#176 From: "dhteuri" <dhteuri@...>
Date: Wed Jun 4, 2003 7:12 pm
Subject: 8.5 THE GROCERY SHOPPING WORLD
dhteuri
Send Email Send Email
 
I need help , if you have source code of this Ai-KB please send it
to  me .

#177 From: "Tommy French" <Tommy_French@...>
Date: Thu Jun 5, 2003 5:02 pm
Subject: Point of clarification...
tfrench66
Send Email Send Email
 
Hi.
 
I am currently using AIMA printed in 1995 (2nd printing - I think!) and I think I spotted a mistake or just a point that needs to be clarified in the CURRENT-BEST-LEARNING algorithm on page 547, Chapter 18, section 18.5.
 
The line reads
for each remaining example in examples do
 
should it not read -
 
for each remaining example e in examples do
 
As we use the variable e in the rest of the algorithm, but it is never initialised.
 
 
Yours thankfully,
T. French

#178 From: "tfrench66" <Tommy_French@...>
Date: Thu Jun 5, 2003 4:23 pm
Subject: Point of clarification...
tfrench66
Send Email Send Email
 
Hi.

I am currently using AIMA printed in 1995 (2nd printing - I think!) and I think
I spotted a mistake or just a point that needs to be clarified in the
CURRENT-BEST-LEARNING algorithm on page 547, Chapter 18, section 18.5.

The line reads
for each remaining example in examples do

should it not read -

for each remaining example e in examples do

As we use the variable e in the rest of the algorithm, but it is never
initialised.


Yours thankfully,
T. French

Computer Science and Artificial Intelligence Undergraduate
University of Edinburgh, UK

#179 From: "kuziz" <kuziz@...>
Date: Fri Jun 6, 2003 11:21 am
Subject: Grocery shopping world
kuziz
Send Email Send Email
 
hi

I am learning the grocery shopping world at A.I course.
i need some explainations about this subject

regards

Jacob

#183 From: "serge_stinckwich" <sergio36@...>
Date: Tue Jul 15, 2003 4:56 pm
Subject: French translation of AIMA ?
serge_stinck...
Send Email Send Email
 
Hi all,

i already post this question last year before the second edition was
released. Do you have any plans to have a french translation of AIMA
available ? I dunno how to proceed to make one : talk to a french editor ?

Best regards,

PS : please reply to my real address : Serge DOT Stinckwich AT info
DOT unicaen DOT fr

--
Serge Stinckwich                                         -< )
Université de Caen>CNRS UMR 6072>GREYC>MAD                /~\
http://www.iutc3.unicaen.fr/serge/                       (/  |
Smalltalkers do: [:it | All with: Class, (And love: it)] _|_/

#188 From: "bondxmax" <bondxmax@...>
Date: Fri Jul 25, 2003 1:26 pm
Subject: problem in natural language processing......
bondxmax
Send Email Send Email
 
hello,
        i am a student of MS in computer science. i am doing my final
year project in natural language processing. my problems are
1. is there any online book available on the web, or  online tutorial.
    please inform me.
2. are textstorm and clouds available on the web for downdoad.

     regards.
      girish

#191 From: Peter Norvig <peter@...>
Date: Fri Jul 25, 2003 5:46 pm
Subject: Re: problem in natural language processing......
norvig
Send Email Send Email
 
The two best books are "Speech and Language Processing" and
"Foundations of Statistical NLP". Neither is online.
http://aima.cs.berkeley.edu/ai.html#nlp has some online resources, but
not books.

-Peter

On Friday, July 25, 2003, at 06:26  AM, bondxmax wrote:

> hello,
>        i am a student of MS in computer science. i am doing my final
> year project in natural language processing. my problems are
> 1. is there any online book available on the web, or  online tutorial.
>    please inform me.
> 2. are textstorm and clouds available on the web for downdoad.
>
>     regards.
>      girish
>
>
> ------------------------ Yahoo! Groups Sponsor
> ---------------------~-->
> Buy Ink Cartridges & Refill Kits for Your Epson at Myinks.com
> Free shipping on orders $50 or more to the US and Canada.
> http://www.c1tracking.com/l.asp?cid=5705&lp=home/epson.asp
> http://us.click.yahoo.com/brYXfA/_xWGAA/ySSFAA/7brrlB/TM
> ---------------------------------------------------------------------
> ~->
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to
> http://docs.yahoo.com/info/terms/
>

#192 From: Luis <luizsoarez@...>
Date: Fri Jul 25, 2003 9:26 pm
Subject: Re: problem in natural language processing......
luizsoarez
Send Email Send Email
 
bondxmax wrote:

> hello,
>        i am a student of MS in computer science. i am doing my final
> year project in natural language processing. my problems are
> 1. is there any online book available on the web, or  online tutorial.
>    please inform me.

Hello there.


I'm not experienced at all in this field by you can find "Prolog and
Natural-Language Analysis" in this link:
http://www.mtome.com/pnla-physical.html.
In http://www.comsem.org/ there are also 2 books on computational
semantics, also using prolog.


Hope it helps,
Luis

#194 From: "kaylasrevenge222" <kaylasrevenge222@...>
Date: Wed Jul 30, 2003 4:48 pm
Subject: New Way to Date!
kaylasreveng...
Send Email Send Email
 
This site needs no introduction its all for us it's soooo kickass for the
singles scene!
You guys have to check it oufor yourself!!

http://www.internetsexads.com/landing.asp?afl=EYHO

#195 From: tayss s <tayss_temp@...>
Date: Sun Aug 3, 2003 4:05 pm
Subject: Difference between int'l & normal edition?
tayss_temp
Send Email Send Email
 
Hi, I'm ordering a copy of AIMA, and I have the
possibility of getting the "International Edition."
It seems a little more recent and wallet-friendly.
Does anyone know the difference between it and the
normal?

http://www.amazon.de/exec/obidos/ASIN/0130803022/qid=1059874381/sr=2-1/ref=sr_2_\
11_1/302-8537986-5434454
http://www.amazon.de/exec/obidos/ASIN/0137903952/qid=1059874381/sr=2-2/ref=sr_2_\
11_2/302-8537986-5434454

Thanks,
Tayss

__________________________________
Do you Yahoo!?
Yahoo! SiteBuilder - Free, easy-to-use web site design software
http://sitebuilder.yahoo.com

#196 From: "Brandon Corfman" <bcorfman@...>
Date: Wed Aug 13, 2003 1:07 pm
Subject: Mozilla 1.4 and AIMA web site
bcorfman
Send Email Send Email
 
When I try to access aima.cs.berkeley.edu with Mozilla 1.4, I get a
dialog popping up asking me for a name and password for Kerberos
authentication. IE doesn't have this issue. I would suggest this issue
  be raised to a network admin at Berkeley, so they can fix it. I don't
remember it happening before; I use Mozilla all the time.

Thanks,
Brandon

#197 From: "Peter Norvig" <peter@...>
Date: Wed Aug 13, 2003 4:10 pm
Subject: Re: Mozilla 1.4 and AIMA web site
norvig
Send Email Send Email
 
I believe this was a temporary configuration problem, now fixed.  Let us know if
there
are further problems.

-Peter

--- In aima-talk@yahoogroups.com, "Brandon Corfman" <bcorfman@a...> wrote:
> When I try to access aima.cs.berkeley.edu with Mozilla 1.4, I get a
> dialog popping up asking me for a name and password for Kerberos
> authentication. IE doesn't have this issue. I would suggest this issue
>  be raised to a network admin at Berkeley, so they can fix it. I don't
> remember it happening before; I use Mozilla all the time.
>
> Thanks,
> Brandon

#198 From: tayss s <tayss_temp@...>
Date: Mon Aug 4, 2003 8:00 pm
Subject: Re: Difference between int'l & normal edition?
tayss_temp
Send Email Send Email
 
I'm guessing it's of flimsier build quality to compete
in cost-conscious markets, based on what O'Reilly says
about its int'l editions.  Thanks, I don't think this
is important enough anymore to respond to.

Tayss


--- tayss s <tayss_temp@...> wrote:
> Hi, I'm ordering a copy of AIMA, and I have the
> possibility of getting the "International Edition."
> It seems a little more recent and wallet-friendly.
> Does anyone know the difference between it and the
> normal?
>
>
http://www.amazon.de/exec/obidos/ASIN/0130803022/qid=1059874381/sr=2-1/ref=sr_2_\
11_1/302-8537986-5434454
>
http://www.amazon.de/exec/obidos/ASIN/0137903952/qid=1059874381/sr=2-2/ref=sr_2_\
11_2/302-8537986-5434454
>
> Thanks,
> Tayss
>
> __________________________________
> Do you Yahoo!?
> Yahoo! SiteBuilder - Free, easy-to-use web site
> design software
> http://sitebuilder.yahoo.com
>
> ------------------------ Yahoo! Groups Sponsor
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to
> http://docs.yahoo.com/info/terms/
>
>


__________________________________
Do you Yahoo!?
Yahoo! SiteBuilder - Free, easy-to-use web site design software
http://sitebuilder.yahoo.com

Messages 152 - 198 of 946   Oldest  |  < Older  |  Newer >  |  Newest
Add to My Yahoo!      XML What's This?

Copyright © 2010 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines NEW - Help