anyone can give me some clues about the up-to-date info about expert
system? Seems this topic has been being faded?

Thanks in advance.

"oldatum" <oldatum@...> writes:

> anyone can give me some clues about the up-to-date info about expert
> system? Seems this topic has been being faded?

I wondered this myself, and posted some notes to my blog:

   Expert systems: what happened in the past decade?
   http://www.paoloamoroso.it/log/050309.html


Paolo
--
Lisp Propulsion Laboratory log - http://www.paoloamoroso.it/log

Hello ML,
I'm the guy who's doing an alternative implementation of the algorithms in the
book in Java. I've done a long break but now I've decided to continue with the
project, even with no help :-(

I've just finished the package related to chapter 7.

You can see the documentation in:
http://www.artificialidea.com/my_programs/docs/index.html

If you would like to download all I have done until now:
http://www.artificialidea.com/index.php?page=my_programs

I'd more than appreciate any comment.

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

Dear everyone:

Could anyone please tell me if I would like to do research on Automatic Music Composition Generator, who is the professor in this area and what is the website to focus on?

Thank you for all answers.

Best regards,

Jaidee, Mr.

Yahoo! Music Unlimited - Access over 1 million songs. Try it free.

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.

Rob,

 

Thanks so much! This helps me with a homework problem that I was completely stumped on. I'll cite your letter, as our teacher asked us to do if we get help with an answer.

 

Your admissible but inconsistent trip example went right past where I live, near Philadelphia. : )

 

regards,

Susan

---

From: aima-talk@yahoogroups.com [mailto:aima-talk@yahoogroups.com] On Behalf Of The Geek
Sent: Tuesday, September 27, 2005 1:46 PM
To: aima-talk@yahoogroups.com
Subject: RE: [aima-talk] about A* search

Consistency of heuristics is a little more tricky to
explain, since every consistent one is also
admissible.

If you're not from the U.S., I'll apologize in advance
for the following example....

Lets say you're trying to get from New York to L.A. by
car - forget the fact that it would now cost you a
small fortune to do so.  A consistent heuristic is one
where the estimate to get from New York to L.A. must
be equal to or smaller than the actual cost to get
from New York to any other city **plus** the estimate
to get from that city to L.A.  In other words, if you
drive from New York to Chicago, then estimate the
distance from Chicago to L.A. you're not supposed to
get a smaller answer than your original estimate.  If
you use straight-line distance, it's easy to see this
is consistent.

Admissible heurstics must guarantee the estimate is no
larger than the actual cost turns out to be.
Consistent heuristics must also guarantee the "revised
estimate" (the sum of the actual distance traveled so
far plus the estimate of what you've got remaining)
never goes down as you explore the path.

You have to get kind of goofy to find things that are
admissible but not consistent - taking the
straight-line distance divided by the number of
letters in the city name for example.  The estimate is
guaranteed to be low (since it's always less than the
straight-line distance), and thus is admissible.  When
you start at New York your estimate would be 2400/7 =
342.86.  If you drove 95 miles to Philadelphia, you're
estimate from Philadelphia to L.A. would be 2320 / 12
= 193.33.  Adding that back to the 95 miles you drove
from New York we see that we now think we can get from
New York to L.A. by way of Philadelphia for an
estimated cost of 193.33 + 95 = 288.33, less than our
original estimate of 342.86, thus demonstrating that
the heuristic is not consistent.

Rob G.

--- savastinuk <minnie@...> wrote:

> This makes sense. : )
> 
> Can you also explain consistent? Or, better yet,
> INconsistent?
> Still talking A*.
> 
> thanks....
> Susan
>
>
>   _____ 
>
> From: aima-talk@yahoogroups.com
> [mailto:aima-talk@yahoogroups.com] On Behalf
> Of The Geek
> Sent: Monday, September 26, 2005 6:03 PM
> To: aima-talk@yahoogroups.com
> Subject: Re: [aima-talk] about A* search
>
>
> I think my version is different from yours, but I
> assume you're talking about the A* search algorithm.
>
> The proof is in the book a page or so later, but
> look
> at it the other way for a second - if the path
> estimate were sometimes too high, then based on the
> inflated estimate you might ignore a path that would
> have turned out to have a "short cut" in it.  But by
> guaranteeing that the actual cost will always be
> more
> than your estimate, you're guaranteed never to
> ignore
> a short cut. 
>
> To put it another way, with an admissible heuristic
> any unexplored path is guaranteed to be worse than
> or
> equal to it's estimate - never better.  Thus when
> you
> actually explore a path, you're guaranteed that it's
> cost will only get worse.  So if you've found an
> actual path solution that's equal to or better than
> the best unexplored path estimates, the actual path
> you've found is guaranteed to be the best because
> the
> unexplored paths can only get more costly when
> they're
> explored.
>
> I hope that made sense.
>
> Rob G.
>
> --- lwudong <wudongs@...> wrote:
>
> > In page97, line 7:
> > The restriction is to choose an h function that
> > never overestimates
> > the cost to reach the goal. Such an h is called an
> > admissible
> > heuristic. Admissible heuristics are by nature
> > optimistic, because
> > they think the cost of solving the problem is less
> > than it actually is.
> >
> > Can anyone give me more explanation why it always
> > gets the optimial
> > result when it never overestimates the total cost.
> >
> >
> >
> >
> >
>
>
>
>            
> __________________________________
> Yahoo! Mail - PC Magazine Editors' Choice 2005
> http://mail.yahoo.com
>
>
>
>
>
> SPONSORED LINKS
> Artificial
>
<http://groups.yahoo.com/gads?t=ms&k=Artificial+intelligence+software&w1=Art
>
ificial+intelligence+software&w2=Artificial+intelligence+in+business&w3=Arti
>
ficial+intelligence&w4=Artificial+intelligence+introduction&c=4&s=150&.sig=Z
> -KgstNm21fXWEV4ASPvHQ> intelligence software
> Artificial
>
<http://groups.yahoo.com/gads?t=ms&k=Artificial+intelligence+in+business&w1=
>
Artificial+intelligence+software&w2=Artificial+intelligence+in+business&w3=A
>
rtificial+intelligence&w4=Artificial+intelligence+introduction&c=4&s=150&.si
> g=477uHvbluHUGZv4M3Wsnag> intelligence in business
> Artificial
>
<http://groups.yahoo.com/gads?t=ms&k=Artificial+intelligence&w1=Artificial+i
>
ntelligence+software&w2=Artificial+intelligence+in+business&w3=Artificial+in
>
telligence&w4=Artificial+intelligence+introduction&c=4&s=150&.sig=LONI6S4JBL
> JohI0gb7t-Ug> intelligence      
> Artificial
>
<http://groups.yahoo.com/gads?t=ms&k=Artificial+intelligence+introduction&w1
>
=Artificial+intelligence+software&w2=Artificial+intelligence+in+business&w3=
>
Artificial+intelligence&w4=Artificial+intelligence+introduction&c=4&s=150&.s
> ig=n5dsIRz6BWbukAv5Ru4LcA> intelligence introduction
>      
>
>   _____ 
>
> YAHOO! GROUPS LINKS
>
>
>      
> *      Visit your group "aima-talk
> <http://groups.yahoo.com/group/aima-talk> " on the
> web.
>  
>
> *      To unsubscribe from this group, send an email to:
>  aima-talk-unsubscribe@yahoogroups.com
>
<mailto:aima-talk-unsubscribe@yahoogroups.com?subject=Unsubscribe>
>
>  
>
> *      Your use of Yahoo! Groups is subject to the
> Yahoo! Terms of Service
> <http://docs.yahoo.com/info/terms/> .
>
>
>   _____ 
>
>
>



           
__________________________________
Yahoo! Mail - PC Magazine Editors' Choice 2005
http://mail.yahoo.com

How can we know that our solutions are correct or not ?

hi there!
  is there any solution to the excercises of aima? like
  chapter by chapter? If there is any on the net, plz let
  it be known, and if anyone has solved any hirself, plz
  let us share.

On Tue, Oct 11, 2005 at 01:44:06AM -0700, [3!|_/|_ wrote:
> Does anyone have the implementation of A* search
> Of Romania Map or some other
> in prolog or any other

If by "any other" you mean any other language, yes there are A* implementations
in Lisp, Python and Java on the Aima webpage, and on my homepage in java at:
www.artificialidea.com/index.php?page=my_programs

Regards,
Iván.
--
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

Page 126 of AIMA, 2nd ed, notes that:

"It is easy to prove that a random walk will eventually find a goal or
complete its exploration, provided that the space is finite."

Here, a footnote continues:

"The infinite case is much more tricky. Random walks are complete on
infinite one-dimensional and two dimensional grids, but not on three
dimensional grids! In the latter case, the probability that the walk
ever returns to the starting point is only about 0.3405."

I was surprised by the claim above (random walks are complete for 1 and
2 dimensions but not for 3). Can anyone explain why this is true?

-Neil

It all began with Polya's 1921 proof:

http://mathworld.wolfram.com/PolyasRandomWalkConstants.html

Then follow the link from there "[Pages Linking Here]"

which has links to discussions of 1-, 2-, and 3-dimensional walks.

   - Bob

_______________________________________________________________
Robert P. Futrelle      | Biological Knowledge Laboratory
     Associate Professor  | College of Computer  and Information
                          |     Science MS WVH202
Office: (617)-373-4239  | Northeastern University
Fax:    (617)-373-5121  | 360 Huntington Ave.
futrelle@...    | Boston, MA 02115
           http://www.ccs.neu.edu/home/futrelle
    http://www.bionlp.org   http://www.diagrams.org

            http://biologicalknowledge.com
         mailto:biologicalknowledge@...
_______________________________________________________________


>Page 126 of AIMA, 2nd ed, notes that:
>
>"It is easy to prove that a random walk will eventually find a goal or
>complete its exploration, provided that the space is finite."
>
>Here, a footnote continues:
>
>"The infinite case is much more tricky. Random walks are complete on
>infinite one-dimensional and two dimensional grids, but not on three
>dimensional grids! In the latter case, the probability that the walk
>ever returns to the starting point is only about 0.3405."
>
>I was surprised by the claim above (random walks are complete for 1 and
>2 dimensions but not for 3). Can anyone explain why this is true?
>
>-Neil
>
>
>
>
>
>YAHOO! GROUPS LINKS
>
>  Visit your group
>"<http://groups.yahoo.com/group/aima-talk>aima-talk" on the web.
>
>  To unsubscribe from this group, send an email to:
>
><mailto:aima-talk-unsubscribe@yahoogroups.com?subject=Unsubscribe>aima-talk-uns\
ubscribe@yahoogroups.com
>
>  Your use of Yahoo! Groups is subject to the
><http://docs.yahoo.com/info/terms/>Yahoo! Terms of Service.


--
_______________________________________________________________
Robert P. Futrelle      | Biological Knowledge Laboratory
     Associate Professor  | College of Computer  and Information
                          |     Science MS WVH202
Office: (617)-373-4239  | Northeastern University
Fax:    (617)-373-5121  | 360 Huntington Ave.
futrelle@...    | Boston, MA 02115
           http://www.ccs.neu.edu/home/futrelle
    http://www.bionlp.org   http://www.diagrams.org

            http://biologicalknowledge.com
         mailto:biologicalknowledge@...
_______________________________________________________________

Googling on

automated "music composition" ai

produced about 12,500 page hits.

I think you'll find what you need there,

though I realize there may be someone on this

list who is familiar with the area (I'm not).

("automated" gets more hits than "automatic")

 - Bob Futrelle

Dear everyone:

 

Could anyone please tell me if I would like to do research on Automatic Music Composition Generator, who is the professor in this area and what is the website to focus on?

Thank you for all answers.

 

Best regards,

Jaidee, Mr.

               

---

Yahoo! Music Unlimited - Access over 1 million songs. Try it free.

---

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.

Hello all,

I met this when I was doing my homework.

Prove that, if the heuristic function h never overestimates by more
than cost c, A* search using h returns a solution whose cost exceeds
that of the optimal solution by no more than c.

This is Question 4.6 from AIMA book. Any hints will be very much
appreciated.

Regards,
odm

hi,
     is it true that CRFs require less training data
than other discriminative models.If yes what is the
reason?

Pranjal Awasthi





__________________________________
Yahoo! Mail - PC Magazine Editors' Choice 2005
http://mail.yahoo.com

Hi everyone,

the book explains pattern databases on page 107 (2nd ed.). It says that it
is currently unknown how how the pattern database approach can be applied
to Rubik's cube. However there is now the work by Korf

@InProceedings{Kor97,
   author = 	 {Richard E. Korf},
   title = 	 {Finding Optimal Solutions to {R}ubik's {C}ube Using
Pattern Databases},
   booktitle = 	 {Proceedings of the 14th National Conference on
Artificial
                   Intelligence and 9th Innovative Applications of
                   Artificial Intelligence Conference},
   pages =  {700-705},
   year =  1997,
   publisher =  {MIT Press}
}

which addresses this question. It would be nice if the authors could
mention this work.

Cheers,
Jan Smaus, Freiburg

Hello,
in 13.4 of the book, there is the formula:

P(Y) = Sum over z of: P(Y,z)

I have problems to understand this formula and probably I'm not the only one
because the meaning of the P(a,b) notation is IMHO not well explained in the
book.

Here my question: does P(Y,z) means P(y1 & z) when P(Y) is P(y1) ?
If yes, why not to write: P(Y & z) ?
--
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

Some quz about search:

1> A* algorithm
    When I make a program to slove a graph problem, I use graph search
so that I must do the thing to cheak if a node has been visited. To
this thing, I could use hash table to check, but whether a better
approach to do it?

2> IDS algorithm
    The book said that IDS will be bether than the BFS because that IDS
will bounds less nodes than BFS. But in fact the IDS run slower than
BFS when I use the algorithms to slove a same search problem, why?

btw, I want to know that if Peking University in China use this book to
teach the class of AI?

Hi all,
  A couple of people wrote to me saying their Anti Virus software
reported that the "learning" directory of the java code is infected
with a worm,  W32.Sircam.Worm@mm to be precise.
Symantec's description of the worm is here
http://www.symantec.com/avcenter/venc/data/w32.sircam.worm@mm.html.

As far as I know this is not true and the code on the site is clean
(but see below) . This is what I did to track down any infestation

1.I have Norton Anti Virus on my Windows system (I do most of my
development on Linux) and a full system scan did not reveal this worm.

2.I downloaded the zip file from the AIMA site and ran a scan on it.
Still "No Infection found".


3.I then visually inspected the code. Since the zip file contains
only, txt, xml, java and class files (and no executable files) I am
not able to make out how the code could be infected. (the SYmantec
description seems to indicate that the worm travels via email with an
executable attachment being the carrier.)

4.I uploaded the  zip file from the aima site as an attachment to an
email using a yahoo account(Yahoo scans all attachments for
viruses/worms ) and yahoo reported an "all clear " as well.

5.I ran the symantec  worm removing
tool(http://securityresponse.symantec.com/avcenter/venc/data/w32.sircam.worm@mm.\
removal.tool.html)
which specifically checks for this worm and found nothing , on the
code on my development machine and the code on the AIMA site

At this point I think one of the following is happening (a) an
antivirus product is delivering a false positive (b)The Symantec
Norton Anti Virus product is broken and does not detect an infection
or (c) the zip file is being infected after being downloaded onto an
infected PC.The fact that aima.zip is often the first zip file
encountered in a search may have something to do with this? (d)
Smething really weird is happening and I have no clue what.



As far as I can make out, the code on my machine and that on the aima
site are not (repeat NOT) infected. However I am not an expert on
security and I could be wrong. I request anyone encountering this
phenomenon to kindly mail me with details of

(a)what antivirus software they are using
(b) the exact message the AV tool pops up
(c) the infected file's name if the tool points to a particular file
as being infected.

A generic report of " your code is infected. Please help" is next to
useless.

You may want to try run the worm removal tool and re download the zip
file from the website. If your AV tool reports the zip file as
infected  *as you download*, please write to *me* ( and NOT to this
forum) at magesmail@.... Any help much appreciated.


Regards,
Ravi

Hi all,

<update>
I have completed checking the aima java archive with norton, mcAffee
and PC Cillin.All 3 products report that the archive is clean. It
seems that the archive is getting infected AFTER download onto an
infected network.(both reports came from the same university)

The worm's description at
http://www.symantec.com/avcenter/venc/data/w32.sircam.worm@mm.html
seems to indicate that the worm spreads through email (executable)
attachments.

Since the archive does not contain any kind of binary file(except
.class files) worm infection is very unlikely. In the next upload, I
will  include an MD5 hash so people can check if the archive has been
tampered with.

Conclusion : The aima.zip file  on the AIMA site is clean.
If I get any data to indicate the contrary, I'll post it here.

</update>

Regards,
Ravi

Hi every one i am new to the group, my name is Ahmad i'm a CS student
and cruntly taking "Introduction to AI " and using the "Artificial
intelligence : Amodren approach by Stuart Russell & Peter Norving 2
edition and my problem is that i was given an assinment to implement
the vacume-world problem using the breadth-first & depth-first search
stratigies and i do not know where to start so if some one could
please give me an idea on how to start and i would be gratley thankfull.

Hi every one i am new to the group, my name is Ahmad i'm a CS student
and cruntly taking "Introduction to AI " and using the "Artificial
intelligence : Amodren approach by Stuart Russell & Peter Norving 2
edition and my problem is that i was given an assinment to implement
the vacume-world problem using the breadth-first & depth-first search
stratigies and i do not know where to start so if some one could
please give me an idea on how to start and i would be gratley thankfull.

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.

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.
>

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