Pavan,
This question is irrelevant in  *this* forum, which is about the AIMA
book, written by Dr Norvig and Dr. Russell. You may want to try the
extreme programming group on yahoo, where you'll get  answers to your
questions.
Thanks,
Ravi


--- In aima-talk@yahoogroups.com, "Pavan" <pkkayathi@y...> wrote:
>
> Hello friends,
>     I have been going through the chapter of Rapid Software
> Development. When I came across Extreme Programming what puzzled me
> was what can be the disadvantages of using story cards in XP. I
> searched for the same in google but hardly found anything. So can
> someone tell me if they are any disadvantages of using a story card.
> Thanx in advance
> Pavan.
>

Hi all!

What do you belive will be the most usefull area for AI. Perhaps in the
mediclal area, to cure and take care of the sick and elderly, or in
crime prevention?

i just started to read the book and i hope that my time will be well
spent.


/MK

Hi all!

What do you belive will be the most usefull area for AI. Perhaps in the
mediclal area, to cure and take care of the sick and elderly, or in
crime prevention?

i just started to read the book and i hope that my time will be well
spent.


/MK

http://mind.sourceforge.net/mind4th.html mow invites Netizens
to install a JavaScript Seed AI as "Mind" on their computers.

http://mind.sourceforge.net/Mind.html now includes a recursive
link back to itself so that users may update their local copy.

http://mind.sourceforge.net/userman.html ordains AI diaspora.
> First you start the JavaScript AI Mind by clicking on it.
> You may also host the AI Mind on your own hard disk
> or your own Web page and then bring the Mind to life by
> running MSIE, then using "File/ Open" with the AI filename,
> or by clicking on the Seed AI link that you have transplanted.
> Notice at the end of this User Manual that there is a link to
> C:\Windows\Desktop\Mind.html that will work only when you
> have made your own local copy of the JavaScript Seed AI. You
> have the opportunity to spread your artificial intelligence
> by planting the Seed AI on as many computers as possible.
> If the computer that you use is shared by a group of users,
> other people may stumble upon the ghost in the machine and
> may accept the challenge of programming a more powerful AI.
> If you are a manufacturer or distributor of computers, you
> are free to install the JavaScript Seed AI on every desktop.

A. T. Murray
--
http://doi.acm.org/10.1145/307824.307853
http://doi.acm.org/10.1145/1052883.1052885
http://www.scn.org/~mentifex/agiradar.html
http://www.sl4.org/archive/0205/3836.html

> What do you belive will be the most usefull area for AI.

I'm afraid it would be in the armament industry if we continue doing nothing to
stop countries invading others and to stop the growing gap between rich and
poor.

Iván Villanueva

http://mind.sourceforge.net/mind4th.html mow invites Netizens
to install a JavaScript Seed AI as "Mind" on their computers.

http://mind.sourceforge.net/Mind.html now includes a recursive
link back to itself so that users may update their local copy.

http://mind.sourceforge.net/userman.html ordains AI diaspora.

> First you start the JavaScript AI Mind by clicking on it.
> You may also host the AI Mind on your own hard disk
> or your own Web page and then bring the Mind to life by
> running MSIE, then using "File/ Open" with the AI filename,
> or by clicking on the Seed AI link that you have transplanted.
> Notice at the end of this User Manual that there is a link to
> C:\Windows\Desktop\Mind.html that will work only when you
> have made your own local copy of the JavaScript Seed AI. You
> have the opportunity to spread your artificial intelligence
> by planting the Seed AI on as many computers as possible.
> If the computer that you use is shared by a group of users,
> other people may stumble upon the ghost in the machine and
> may accept the challenge of programming a more powerful AI.
> If you are a manufacturer or distributor of computers, you
> are free to install the JavaScript Seed AI on every desktop.

A. T. Murray
--
http://doi.acm.org/10.1145/307824.307853
http://doi.acm.org/10.1145/1052883.1052885
http://www.scn.org/~mentifex/agiradar.html
http://www.sl4.org/archive/0205/3836.html

YAHOO! GROUPS LINKS

•  Visit your group "aima-talk" on the web.
   
•  To unsubscribe from this group, send an email to:
   aima-talk-unsubscribe@yahoogroups.com
   
•  Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

> What do you belive will be the most usefull area for AI.

I'm afraid it would be in the armament industry if we continue doing nothing to
stop countries invading others and to stop the growing gap between rich and
poor.

Iván Villanueva

__________________________________________________
Do You Yahoo!?
Tired of spam? Yahoo! Mail has the best spam protection around
http://mail.yahoo.com

--- In aima-talk@yahoogroups.com, "mattias_kristoffersen"
<mattias@k...> wrote:
>
> Hi all!
>
> What do you belive will be the most usefull area for AI. Perhaps in the
> mediclal area, to cure and take care of the sick and elderly, or in
> crime prevention?
>
> i just started to read the book and i hope that my time will be well
> spent.
>
>
> /MK
>
Research!
AI is going to drive research in biology in the future. Infact, i may
even go to the extent of saying immediate future.

-- AI

On Tue, Dec 20, 2005 07:25:06AM -0000, j1mmy_n3u7120n wrote:
> --- In aima-talk@yahoogroups.com, "mattias_kristoffersen"
> > What do you belive will be the most usefull area for AI.

> Research!
> AI is going to drive research in biology in the future.

Could you explain it a little more. Which biology research is related with AI.
I'm very interested in. Some links ?

--
Ivan F. Villanueva B.
The dream of intelligent machines: www.artificialidea.com
Encrypted mail preferred.
GPG Key Id: 3FDBF85F 2004-10-18 Ivan-Fernando Villanueva Barrio

--- In aima-talk@yahoogroups.com, Ivan Villanueva <ivan@a...> wrote:
>
> On Tue, Dec 20, 2005 07:25:06AM -0000, j1mmy_n3u7120n wrote:
> > --- In aima-talk@yahoogroups.com, "mattias_kristoffersen"
> > > What do you belive will be the most usefull area for AI.
>
> > Research!
> > AI is going to drive research in biology in the future.
>
> Could you explain it a little more. Which biology research is
related with AI.
> I'm very interested in. Some links ?
>
> --
> Ivan F. Villanueva B.
> The dream of intelligent machines: www.artificialidea.com
> Encrypted mail preferred.
> GPG Key Id: 3FDBF85F 2004-10-18 Ivan-Fernando Villanueva Barrio
>
Most computational problems in biology are being solved using AI
techniques. I give a few links below,
1. Evaluation of Gene Protein Prediction Programs
http://www.cs.jhu.edu/~salzberg/guigo.ps

2. Locating Protein Coding Regions in Human DNA using a Decision Tree
Algorithm
http://www.cs.jhu.edu/~salzberg/exons.ps.gz

3. Genetic operators for the DNA fragment-assembly problem
ftp://mammoth.cs.unm.edu/pub/forrest/dna-fragment-94.ps.gz

4. Machine Learning in Molecular Biology Sequence Analysis
http://citeseer.ist.psu.edu/chan91machine.html

There are several such things going on, the field is basically called
computational biology or bioinformatics. One link that is of quite an
interest would be,
Blue Brain Project
http://bluebrainproject.epfl.ch/

-- AI

Hi Mattias,

i wonder if AI can be used to translate all language in this world, still it's a
lot works to do,
but for example like English -> French, but in an everyday language...

just an idea, because in my country we have 580 dialect,
so by translate one language into another,
it will surely help people to understand others better :)

it can be used in an neural networks system too...

--- mattias_kristoffersen <mattias@...> wrote:

> Hi all!
>
> What do you belive will be the most usefull area for AI. Perhaps in the
> mediclal area, to cure and take care of the sick and elderly, or in
> crime prevention?
>
> i just started to read the book and i hope that my time will be well
> spent.
>
>
> /MK
>
>
>
>
>
>



- Adhi N. Wirawan -
  adnetz@...
.eVolutioN EveryTime.



__________________________________
Meet your soulmate!
Yahoo! Asia presents Meetic - where millions of singles gather
http://asia.yahoo.com/meetic

I have a problem related to planning. Can anyone take a look and
give any suggestion?

The chapter 11 and 12 in the AIMA boook talks about the planning,
but it doesn't talk much about STRPS-like schemas. I am reading a
paper by Daniel S. Weld, "An Introduction to Least Commitment
Planning", which talks more about the extensions such as universal
quantification, conditional effects, etc.

The Universally quantified conditional effects allow the
specification of objects such as briefcases, where moving the
briefcase causes all objects inside to move as well.

If we write out the action, it will look like.
Action(Move(b,from, to),
PRECOND: at(b, from) and (from NOTEQUAL to)
effect: (at(b, to) and NOT at(b, from) and
    for all x, when in(x,b): NOT at(x, from) and at(x, to).

Assuming I have a initial state that my driverlicense is in the
wallet, which is in the briefcase. And the briefcase is in New York.
That is:

at(briefcase, NY) and at(wallet, NY) and at(DriverLicense, NY) and in
(wallet, briefcase) and in(DriverLicense, wallet).

If we apply the action move(briefcase, NY, FL), we can get :
at(briefcase, FL) and at(wallet, FL) and at(DriverLicense, NY) and in
(wallet, briefcase) and in(DriverLicense, wallet).

The DriverLicense is still in NY. How can I write the action so
DriverLicense will move to FL too? My thought is that we should
recursively change the state in the EFFECT clause for all sub-
clause. Is there any syntax support for this kind of problem?

Thanks,
JT

I could presumably slug through getting it to work, but wondering if
anyone else has tried openmcl.  It seems to be pretty solid, but not
behaving too well in trying to get started.

   - Bob Futrelle

This seems wrong to me, but I just wanted to make sure. Fourth
paragraph on page 633 of the second edition it says

"It is irrational to play a strongly dominated strategy, and
irrational not to play a dominant strategy if one exists."

should probably say something like

"It is rational to play a strongly dominated strategy, and irrational
not to play a dominant strategy if one exists."

JimDavies
http://www.jimdavies.org/

You just misread it - dominated vs. dominant

Strongly dominated strategy = a strategy that is
strongly dominated by another, a.k.a one that sucks.
Therefore it is irrational to play a strongly
dominated strategy.

Rob Guiher

--- Jim Davies <jim.davies@...> wrote:

> This seems wrong to me, but I just wanted to make
> sure. Fourth
> paragraph on page 633 of the second edition it says
>
> "It is irrational to play a strongly dominated
> strategy, and
> irrational not to play a dominant strategy if one
> exists."
>
> should probably say something like
>
> "It is rational to play a strongly dominated
> strategy, and irrational
> not to play a dominant strategy if one exists."
>
> JimDavies
> http://www.jimdavies.org/
>
>
>
>
>
>




__________________________________________
Yahoo! DSL – Something to write home about.
Just $16.99/mo. or less.
dsl.yahoo.com

dear all ,
I need some help

I'd like to ask if there is any possible way to get the book
Exercises' solutions

is there any link or resource , I can make use of ??

thanks

Hi,
  I believe Dr Norvig has stated on this list that the manual is
available only for Instructors. If you are one, you should be able to
make use of the information at
http://aima.cs.berkeley.edu/instructors.html to order a copy.

Just stating what I know. If someone knows differently, do correct me.
I personally have not felt the lack of an Instructors Manual. Most of
the fun is (imho) in trying to solve the problems on one's own.
Ravi

--- In aima-talk@yahoogroups.com, "Ghada" <ghkm1984@y...> wrote:
>
> dear all ,
> I need some help
>
> I'd like to ask if there is any possible way to get the book
> Exercises' solutions
>
> is there any link or resource , I can make use of ??
>
> thanks
>

There seem to be about three files that were updated today.  A number
of directories in the updated Lisp code are empty, e.g., search/ and
learning/.  A comment on the site reads: "The updates will be
incorporated soon into the standard AIMA Lisp code."

So at the moment, anyone who downloads the code.tar.gz file will get
an incomplete collection of code.  The previous, full version, is not
available.

So the new file should NOT be used to replace your old AIMA Lisp code
collection.  It would have to be merged manually.  I'll wait, thanks,
since I'm using an older version of Allegro.

   -- Bob Futrelle

I'm teaching decision making now, and the students have this question
about information value that I'm having trouble answering.

RN2 p602 says that information has value to the extent that it is
likely to cause a chagne of plan and to the extent that the new plan
will be significantly better than the old plan. Are these independent?

I'm trying to come up with a intuitive example of this, and I'm having
trouble coming up with a situation in which the information is
unlikely to affect your decision, but the information might result in
a significantly better decision.

I came up with the idea of buying a DVD player, choosing between going
to get it at best buy (A) and circuit city (B). The information in
question is the exact prices at these stores. The agent knows the
price ranges.

Situation 1:
A: $10-80
B: $15-98

In this case, it's likely to affect your decision and you could save a
lot of money because of it. The information is worth most in this case.

Situation 2:
A: $48-51
B: $49-53

It's likely to affect your decision, but the difference is not big, so
the decision doesn't really matter, so the information is not worth as
much.

Situation 3:
A: $30-50
B: $48-60

Unlikely to affect decision, because A is so much more likely to be
cheaper, AND the price ranges are so close that you don't save much
money. Information worth the least in this case.

Situation 4:
A: ??
B: ??

I want an example in which it's unlilkely to affect your decision but
the decision could be significantly better given the information. I
was thinking
A: $10-51
B: $68-98
but it seems with such a little overlap it's hard to say that the
change in decision will be important. How can it not affect your
decision and also result in a significantly better outcome?

Or am I thinking about this in the wrong way?

This is more a straight Lisp question, but it relates to material in
the early chapters of PAIP.  (Someone can direct me to a better list
for this, I'm sure.)

This function splits an even-length list into its even and odd
(sequence) elements:

(defun split-list (lst)
    (cond ((null lst) '(() ()))
           (t (let ((lst2 (split-list (rest (rest lst)))))
              (list (cons (first lst) (first lst2))
                 (cons (second lst) (second lst2)))
			 )
		 )
	 )
)

Point being, there's more to recursion than consing up a single list.

Execution:

1 > (split-list '(b d i o g g))
((B I G) (D O G))

I assume it's not tail-recursive.
Can it be made so using multiple-value return?

(this is not a quiz, just a question  ;-)

   - Bob Futrelle

PS: I think there's no separate PAIP list.

PPS:  ';-)' is a closing bracket in the SMILEY programming language.

How about this:

(defun split-list (lst)
     (let ((odds nil)
	   (evens nil))
       (loop for x in lst for i from 1 do
	     (if (oddp i) (push x odds) (push x evens)))
       (list (nreverse odds) (nreverse evens))))

No problem with running out of stack space there.

Or if you're an even bigger fan of LOOP, you can do:

(defun split-list2 (lst)
   (loop for x in lst for i from 1
	 when (oddp i)
	 collect x into odds
	 else
	 collect x into evens
	 finally (return (list odds evens))))

-Peter

On 1/29/06, Robert Futrelle <futrelle@...> wrote:
> This is more a straight Lisp question, but it relates to material in
> the early chapters of PAIP.  (Someone can direct me to a better list
> for this, I'm sure.)
>
> This function splits an even-length list into its even and odd
> (sequence) elements:
>
> (defun split-list (lst)
>    (cond ((null lst) '(() ()))
>           (t (let ((lst2 (split-list (rest (rest lst)))))
>              (list (cons (first lst) (first lst2))
>                 (cons (second lst) (second lst2)))
>                         )
>                 )
>         )
> )
>
> Point being, there's more to recursion than consing up a single list.
>
> Execution:
>
> 1 > (split-list '(b d i o g g))
> ((B I G) (D O G))
>
> I assume it's not tail-recursive.
> Can it be made so using multiple-value return?
>
> (this is not a quiz, just a question  ;-)
>
>   - Bob Futrelle
>
> PS: I think there's no separate PAIP list.
>
> PPS:  ';-)' is a closing bracket in the SMILEY programming language.
>
>
>
>
>
> Yahoo! Groups Links
>
>
>
>
>
>
>

On 29/01/06, Robert Futrelle <futrelle@...> wrote:
> This is more a straight Lisp question, but it relates to material in
> the early chapters of PAIP.  (Someone can direct me to a better list
> for this, I'm sure.)
>
> This function splits an even-length list into its even and odd
> (sequence) elements:
>
> (defun split-list (lst)
>    (cond ((null lst) '(() ()))
>           (t (let ((lst2 (split-list (rest (rest lst)))))
>              (list (cons (first lst) (first lst2))
>                 (cons (second lst) (second lst2)))
>                         )
>                 )
>         )
> )
>
> Point being, there's more to recursion than consing up a single list.
>
> Execution:
>
> 1 > (split-list '(b d i o g g))
> ((B I G) (D O G))
>
> I assume it's not tail-recursive.

I can say that it's not tail recursive. I couldn't spot it at first
because the simple form to look for is a recursive call embedded in an
argument position (I don't know the correct terminology), like "(cons
lst (split-list ...". However, the problem is that the result of the
recursive call is bound to lst2 and then there is more to do. It's
just that the lst2 is used twice so it's an optimisation.

> Can it be made so using multiple-value return?

Not sure but I think not. Multiple return value is like an
optimisation for returning a tuple (a pair in this case). Using
mutiple return values might prevent consing of the pair and use of
registers for both return values. It doesn't mean change the fact that
this technique needs to do something (cons) with the results of a call
to split-list. What do you think?

> (this is not a quiz, just a question  ;-)

Seems like a quiz :)

Steve.
--
Steven Shaw http://abstractsimplicity.co.uk/

Here's version that's tail recursive though I don't think very
efficient because of my use of append and list perhaps were not
necessary.

(defun split-list2 (list)
   (let ((a (list)) (b (list)))
     (split-list2-helper list a b)))

(defun split-list2-helper (list firsts seconds)
   (cond ((null list) (list firsts seconds))
     (t (split-list2-helper
          (rest (rest list))
          (append firsts (list (first list)))
          (append seconds (list (second list)))))))

Also, I forget the syntax for defining inner auxilary functions...
flet, labels, defun??...

Steve.

On 29/01/06, Peter Norvig <peter@...> wrote:
> How about this:

Looks good. I could have done with nvreverse myself!

Hello,
after having read the algorithm Enumeration-Ask (chapter 14) it seems to me that
it will only work if the function VARS[BayesNet] returns the variables in order.
For instance it works if the first variable returned is Earthquake. But it
wouldn't work if it was Alarm.

I wonder if I have missed the explanation in the book, I have made a
mistake in the thought above, or is something obvious. In the last case I think,
for readers like me, that an explicit explanation could help.

I have take a look at the Java code and it seems that the function VARS orders
the variables appropriately.

Regards,
--
Ivan F. Villanueva B.
The dream of intelligent machines: www.artificialidea.com
Encrypted mail preferred.
GPG Key Id: 3FDBF85F 2004-10-18 Ivan-Fernando Villanueva Barrio

It's not really about whether or not the information
would change your decision, it's that the answer is
**unlikely** to change your decision.  It's tough to
illustrate when you have a pretty flat probability
distribution as implied by your DVD example.

Instead try this:

Harry's Bargain Electronics sells the DVD players for
$99, but they're running a special promotion where
every 1000th customer who buys one gets it for free.
Crazy Ron's sells the same DVD player for $50, but
everyone has to pay.  In this example the
"information" is whether or not you would be one of
the lucky customers at Harry's to get it for free.

Madame Trelawney the psychic is able to tell you with
100% certainty whether or not you will be one of the
lucky ones to get a freebie if you buy from Harry's.
How much would you pay her for that knowledge?

While the information could cause a significant
difference in the relative expected values of the two
choices ($99-$50 vs. $0-$50), it's **unlikely** that
you're going to get a freebie, so the information
itself isn't terribly valuable.  It's **very**
valuable **if** you're going to be the winner.  But,
999 times out of 1000 you'll find out you're not going
to be a winner.  In that case you'd just go to Crazy
Ron's, which is the same decision you'd make without
the information.

Rob G.


--- Jim Davies <jim.davies@...> wrote:

> I'm teaching decision making now, and the students
> have this question
> about information value that I'm having trouble
> answering.
>
> RN2 p602 says that information has value to the
> extent that it is
> likely to cause a chagne of plan and to the extent
> that the new plan
> will be significantly better than the old plan. Are
> these independent?
>
> I'm trying to come up with a intuitive example of
> this, and I'm having
> trouble coming up with a situation in which the
> information is
> unlikely to affect your decision, but the
> information might result in
> a significantly better decision.
>
> I came up with the idea of buying a DVD player,
> choosing between going
> to get it at best buy (A) and circuit city (B). The
> information in
> question is the exact prices at these stores. The
> agent knows the
> price ranges.
>
> Situation 1:
> A: $10-80
> B: $15-98
>
> In this case, it's likely to affect your decision
> and you could save a
> lot of money because of it. The information is worth
> most in this case.
>
> Situation 2:
> A: $48-51
> B: $49-53
>
> It's likely to affect your decision, but the
> difference is not big, so
> the decision doesn't really matter, so the
> information is not worth as
> much.
>
> Situation 3:
> A: $30-50
> B: $48-60
>
> Unlikely to affect decision, because A is so much
> more likely to be
> cheaper, AND the price ranges are so close that you
> don't save much
> money. Information worth the least in this case.
>
> Situation 4:
> A: ??
> B: ??
>
> I want an example in which it's unlilkely to affect
> your decision but
> the decision could be significantly better given the
> information. I
> was thinking
> A: $10-51
> B: $68-98
> but it seems with such a little overlap it's hard to
> say that the
> change in decision will be important. How can it not
> affect your
> decision and also result in a significantly better
> outcome?
>
> Or am I thinking about this in the wrong way?
>
>
>
>
>
>
>


__________________________________________________
Do You Yahoo!?
Tired of spam?  Yahoo! Mail has the best spam protection around
http://mail.yahoo.com

--- In aima-talk@yahoogroups.com, Tommy Gun <thompsoncdrum@...>
wrote:
>
> More than likely, military applications will have more AI than any
other field.  After all, the better that AI gets, the less likely
that people will have to go into harm's way, which is what is
preferrable.   Just think about a cruise missile and all of the
computations and decisions it has to make to get to a precise target
1000 miles away flying along the ground.  Would it be better to have
something like that flown by a pilot?  UAVs and aircraft are an up
and becoming field for AI.
>
>   Just my $.02     I could be wrong...
>
>
> ---------------------------------
> Yahoo! Shopping
>  Find Great Deals on Holiday Gifts at Yahoo! Shopping
>
oh yes you are absoloutely right ... i saw a movie yesterday may be
you people would also have seen that and if not and you are crazy
abt. AI do see the movie "stealth" it's really nice movie and it's
completely related to the AI field and ANN(artificial neural
networks) ... basically you will see what can be the future of
AI ... ok have fun with it on a cool weekend. bbye

I want the slides of the book  "Artificial Intelligence A Modern
Approach  second  Edition "
important
please