At what level should I import the source code? should I just import
the aima level? or the src sublevel? Thank you for your time.


--- In aima-talk@yahoogroups.com, "Ravi Mohan" <magesmail@...> wrote:
>
>
> If you are having trouble with .project file, delete it. Use the
> "Import project from source" option in eclipse and it will generate a
> new .project file for you.
>
> Cheers,
> Ravi
>
> --- In aima-talk@yahoogroups.com, "inyourmind6684" <dtamayo@> wrote:
> >
> > I'm having trouble opening up the aima-java. I am using eclipse to
> > open the .project file. However, everytime I try to do this, I just
> > open up a blank workspace. There is no project defined and I have no
> > idea why. The very first time I did this, I saw the project and
> > everything. Then after that I seem to have lost the ability to view
> > it. I have tried unpacking the zip several times and even reinstalling
> > the eclipse program several times to make sure the settings were still
> > the same and have yet to be able to view the project again. Can anyone
> > help with this problem? Thank you for your time.
> >
>

If you are having trouble with .project file, delete it. Use the
"Import project from source" option in eclipse and it will generate a
new .project file for you.

Cheers,
Ravi

--- In aima-talk@yahoogroups.com, "inyourmind6684" <dtamayo@...> wrote:
>
> I'm having trouble opening up the aima-java. I am using eclipse to
> open the .project file. However, everytime I try to do this, I just
> open up a blank workspace. There is no project defined and I have no
> idea why. The very first time I did this, I saw the project and
> everything. Then after that I seem to have lost the ability to view
> it. I have tried unpacking the zip several times and even reinstalling
> the eclipse program several times to make sure the settings were still
> the same and have yet to be able to view the project again. Can anyone
> help with this problem? Thank you for your time.
>

I'm having trouble opening up the aima-java. I am using eclipse to
open the .project file. However, everytime I try to do this, I just
open up a blank workspace. There is no project defined and I have no
idea why. The very first time I did this, I saw the project and
everything. Then after that I seem to have lost the ability to view
it. I have tried unpacking the zip several times and even reinstalling
the eclipse program several times to make sure the settings were still
the same and have yet to be able to view the project again. Can anyone
help with this problem? Thank you for your time.

Sir,
      In your book AIMA, in the chapter of dynamic bayesian
networks(sample umbrella network),say; if I wish to
calculate the probability of rain on day 5, given evidence of rain
from day 1 to 5 i.e. p(X5|E1:5), using DECAYED-MCMC,
how do I implement the formula( inverse polynomial decay-
{g(t)=(alpha)(T-t+1)e-(1+delta)} given in
Mr. Stuart Russell's UAI-02 paper on decayed MCMC) for the above
problem ?

	 Please do help me,
Waiting for your reply,
Regards,
Abhijit.

I notice there is no AIMA Python or Lisp code for any of the planning
algorithms in chapter 11. I'd really like to find out if anyone has
developed any planning code based on the book pseudocode before I
strike out on my own.

Please post a quick reply if you've developed any  planning code that
I could look at or use. Thanks.

Best regards,
Brandon

Hi all!
There is an exercise, 5.5(b) which I'm stuck with. I just can't get a
correct approach for it...
Consider we have 3 Groups (GroupA, GroupB, GroupC), 3 Rooms (RoomA,
RoomB, RoomC), 3 Teachers(TeacherA, TeacherB, TeacherC), 3 subjects
(SubjA, SubjB, SubjC) and 3 possible timeframes(Lesson1, Lesson2,
Lesson3).
Then I put constrains, that link teachers to subjects:
teach(TeacherA, SubjA)
teach(TeacherA, SubjC)
teach(TeacherB, SubjB)
teach(TeacherC, SubjC)
These are binary relations, that's excellent.
And now, how to write a constraint, that says: "Only one group can be
in the classroom" or "Only one teacher can teach one subject on the
same lesson" or "Group can have only one subject in the same lesson".

I just can't get an idea how to express that. What should be
variables? For example, we can put variable TimetableRecord, that is a
record and has the following fields: Group, Classroom, Teacher,
Lesson, Subject. But that is nit correct, I know... What approach is
correct?

I know, answers to exercises can';t be post here, but I don't need it.
I just need a hint on how to express restrictions I mentioned above...

You're argument is that dumping is not in the action list - but that's not the
point that's
being made here.

The key that is being conveyed here is this...

"As a general rule, it is better to design a performance measure according to
what one
actually wants the in the environment, rather than according to how one thinks
the agent
should behave"

----

In the earlier example I gave, the flaw was a good example, as rather than
looking at "How
much has the agent travelled?", they were looking at "How much has the ball
rolled"... and
the robot discovered an honest solution to make the ball roll faster, which was
not what
the designers were looking for.

Analogously here, we're saying that the agent could find a similar `flaw' (from
the
designer's perspective) in the reward system, and continually dump and suck -
this is just
an observation... We are hypothesizing... as in "Imagine if..."
...imagine *if* the robot could *dump*, then you'd see that this suck-dump-loop
could be
a possibility, and to not allow that to happen, so we need to be careful about
how the
reward system is set up.

I hope that clarifies it.

Nima

--- In aima-talk@yahoogroups.com, ozgur aydogan <aydogan_ozgur@...> wrote:
>
> Hi thanks for the answer, but , frankly, I know what Mr. Norvig wants to point
by that
exceptional action of the cleaner. And, I see your example as well. But there is
a little
difference between yours and the one I am mentioning about; your robot carried
out the
actions you stated at the beginning of your experiment. It went through a
direction[must
be only action you defined for it?] looking for the maximum goal you had
described. Thus,
it only carried out the action you wanted it to do[and that scratching dog like
position was
a result of your goal and action definitions.]
>
> if you excuse me, I want to exemplify my question:
>
> Firstly, let's forget about the agent and just focus on the actions of it to
abstract the
example. Here are the actions:
>
> A, B, C, D and those are mutually exclusive and none of them has side
effects[like
DUMPing].  how would you get an extra action [say it E] out of this four ones?
you can't
unless you implied it[Unlike your robotic example, It only carried out the
actions you
described initially]. Although this looks trivial issue, it lacks information
and bad example
for an introductory example. Lastly, If I added an additional action of a Truth
Table during
the exam, my teacher would definitely have me failed :S
>
> Thanks again.
>
>
>
>
>
> --- 22/06/08 Pzr tarihinde Nima Talebi <nima.talebi@...> şöyle yazıyor:
> Kimden: Nima Talebi <nima.talebi@...>
> Konu: Re: [aima-talk] A serious logical error in chapter 2.
> Kime: aima-talk@yahoogroups.com
> Tarihi: 22 Haziran 2008 Pazar, 5:42
>
>
>
>
>
>
>
>
>
>
>
>             I think the mention of `dump', not being in the action list of the
agent, as you
correctly stated, in this environment at least serves no purpose.
> I think (please correct me if I'm wrong), Dr. Norvig mentions the action of a
`dump' only
as a means of driving a point home - If allowed to be the designer of it's own
performance
measure, it could easily make life easy for itself and, as an *example*, enter a
loop of
clean-->dump-->clean-->dump... and satisfy itself that it is performing
extremely well,
while in reality, it's doing nothing.
>
> Here is another example I've come across which may help...
> There was a robotics experiment (reinforcement learning) where a robot had a
ball-
mouse attached to it behind, and it was `rewarded' for how much the ball rolled
*forward*, then allowed to experiment in a room... hopefully to learn to move as
fast as
possible by itself.
>
> It was left to explore overnight, and in the morning, it was found sitting at
an area in
the room where there was a lump on the ground... and what the agent was found
doing
was this...
>
> Best way to draw a picture is this - imagine a dog rubbing it's behind on the
carpet as to
scratch it.
> In effect - that is what it had learned to do. It was (incorrectly) being
rewarded because
the series of motions it had learned and was carrying was
indeed honoring (cheating)
the reward system...
>  * the ball was rolling forward faster than ever before.
> This is analogous to the vacuum cleaner taking a dump and sucking it backup.
 I
hope I've answered your question? =)
>
> Nima
>
> On Sun, Jun 22, 2008 at 10:58 AM, aydogan_ozgur <aydogan_ozgur@ yahoo.com>
wrote:
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>             In Performance Measures of Chapter 2, Mr. Norvig refutes the goal
of
>
> counting the number of cleaning a square by claiming that the
>
> cleaner,in  which case, can successionly clean and DUMP the dirt of
>
> the same square, which is clearly worthless.
>
>
>
> However, there is a nontrivial glitch in this proposition. The Actions
>
> of the cleaner are
>
>
>
> to move right,
>
> to move left,
>
> to clean or
>
> to do nothing.
>
>
>
> In other words, there is no DUMP action, which Mr. Norvig uses to
>
> refute the proposition. So, I think, he can't just make up another
>
> action to refute the proposition. I hope, I am not exagerrating the case?
>
>
>
> Thanks for reading.
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
> ___________________________________________________________________
> Yahoo! kullaniyor musunuz?  http://tr.mail.yahoo.com
> Istenmeyen postadan biktiniz mi? Istenmeyen postadan en iyi korunma
> Yahoo! Posta'da
>

In Performance Measures of Chapter 2, Mr. Norvig refutes the goal of
counting the number of cleaning a square by claiming that the
cleaner,in  which case, can successionly clean and DUMP the dirt of
the same square, which is clearly worthless.

However, there is a nontrivial glitch in this proposition. The Actions
of the cleaner are

to move right,
to move left,
to clean or
to do nothing.

In other words, there is no DUMP action, which Mr. Norvig uses to
refute the proposition. So, I think, he can't just make up another
action to refute the proposition. I hope, I am not exagerrating the case?

Thanks for reading.

Hi Again,

Has anyone tried to solve this problem? I have failed to prove what the question
is asking in
the following PDF...

http://ai.autonomy.net.au/chrome/site/neurons/linear-transfer-fns.pdf

...I don't think I've made any mistakes in what I *have* done, however I think
I've missed
something along the way - could someone point it out to me?

Thank you!

Nima

Hi Everybody.

I've created a tutorial as part of my own learning while reading AIMA, and would
like to share
it with anyone who would be interested.

http://ai.autonomy.net.au/wiki/Tutorial/Mathematics/NeuralNetByHand

Any corrections and constructive criticism would be welcomed, and I hope you
find it useful.

Nima

On Wed, Jun 04, 2008 10:43:55AM -0000, daashmashty wrote:

> I've been reading AIMA religiously, and making my notes on a wiki.  In
> trying to get a clear understanding of MiniMax and Alpha-Beta pruning, I've
> tried to illustrate it via an example...
>
>  * http://ai.autonomy.net.au/wiki/Algorithms/AlphaBetaPruning
>  * http://ai.autonomy.net.au/wiki/Algorithms/MiniMax

You might consider using the Wikipedia, either to understand it, or to
improve its pages.

     http://en.wikipedia.org/wiki/Minimax
     http://en.wikipedia.org/wiki/Alpha-beta_pruning

--
Iván F. Villanueva B.

Hi all,

I've been reading AIMA religiously, and making my notes on a wiki.  In trying to
get a clear
understanding of MiniMax and Alpha-Beta pruning, I've tried to illustrate it via
an example...

  * http://ai.autonomy.net.au/wiki/Algorithms/AlphaBetaPruning
  * http://ai.autonomy.net.au/wiki/Algorithms/MiniMax

...however I do not have complete confidence in this yet, could anyone here have
a look and
tell me if it is indeed correct, or if it is incorrect, where the error is.

A big thanks in advance =)

Nima

Hello,

in a Bayesian setting, how can I express known estimation errors? I am
working on a problem where I want to model estimation volatility, but
also biases on the estimation and estimation volatility.

So say I one want to guess who will win the NBA basketball game Boston
Celtics vs Detroit Pistons this evening. If I am an expert, not only
will my belief match the objective probability (if it exists at all),
but I will have a good understanding of how good my guess will be.

Furthermore say I am trading a contract in a prediction market and am
estimating how good guesses of other people is. Currently the contract
trades at .32$ which means the implied probability of the event BC,
'Boston Celtics wins', is 32%. What is a good algorithm to derive
other agents' estimation error? I might form the belief that the
estimation error of the implied probability of BC is ±10%.

Hello,

First I would like to say I read AIMA 2nd edition for fun and it was fantastic.

I have been studying the hybrid Bayesian network for an application and am
wearing out
pages 501 and 502 which talk about combining a discrete true/false parent
(Subsidy) and
a continuous parent (Harvest) into a linear Gaussian distribution.

I am simply not seeing where the variables required as parameters for the
Gaussian are
coming from.  It seems that the h variable is the Harvest, and Subsidy would be
some
probability.

The extra variables are:
a-true, b-true, stddev-true
a-false, b-false, stddev-false

Would someone take pity on me? :)

Thanks,
Scott

Hi,
In the book p.482 it is mentioned that the full joint distribution
table has seven independent members (2*2*2 - 1 because the number must
sum to 1). I didn't understand why it is 7. the provided explanation is
not clear for me.

Thanks for you cooperation

zayan

Are multilayer feed-forward neural networks __not__ classed as perceptrons,
while single
layer ones are?  On sites unrelated to AIMA (such as wikipedia), I see many
references to
multilayer perceptrons, in the book I haven't - what is the correct distinction?

Hello,

Patch for

http://www.cs.berkeley.edu/~russell/code/search/algorithms/simple.lisp

so that iterative-deepening-search works.

--- search/algorithms/simple.lisp.orig  2008-02-26 11:43:18.000000000 +0200
+++ search/algorithms/simple.lisp       2008-02-26 11:31:38.000000000 +0200
@@ -36,9 +36,13 @@
    "Search depth-first, but only up to LIMIT branches deep in the tree."
    (cond ((goal-test problem node) node)
          ((>= (node-depth node) limit) :cut-off)
-        (t (for each n in (expand node problem) do
+        (t (let (cut-off)
+             (for each n in (expand node problem) do
                 (let ((solution (depth-limited-search problem limit n)))
-                 (when solution (RETURN solution)))))))
+                    (cond
+                      ((eq solution :cut-off) (setf cut-off :cut-off))
+                      (solution (RETURN solution)))))
+             cut-off))))

  ;;;; Search Algorithms That Use Heuristic Information

David Tolpin
http://davidashen.net/

Quran's Invariance & Artificial Intelligence (Modern Unified Perspective)

The challenge of finding the invariant synchronous words of the Quran

http://intelligentquran.net/

Hi,
I've read section 13.3 of the book on de Finetti's theorem and cannot
figure out how to solve exercise 13.3. Why would you have a "range of
values" for A ^ B ?( where ^ represents intersection. )

Any help will be appreciated.

Regards,
Aashish

Version 0.1 just released. It's very simple at this time, but it will grow up.

Please visit http://www.symbolware.com/aima

BLOG: http://blogs.symbolware.com/?cat=9

I am very happy to receive any suggestion or feedback. Please feel free to write to me at symbolware@....

On Sun, Dec 30, 2007 10:47:32PM -0000, Ravi Mohan wrote:
> [...]
> You do need to download the aima-java v 0.92 archive from
> http://code.google.com/p/aima-java/downloads/list.
> [...]
>   Ivan Villaneuva has a parallel implementation of most of the
> algorithms at
     http://www.artificialidea.com/index.php?page=algorithms

Many thanks for the reference !

--
Ivan Villanueva
FFII (open standards, no software patents)  --  http://www.ffii.org
FFII.org Deutschland                        --  https://www.ffii.de
Jabber: ogai@...