<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Futurist  Transhuman  News  Blog &#187; Artificial Intelligence</title>
	<atom:link href="http://euvolution.com/futurist-transhuman-news-blog/category/artificial-intelligence/feed/" rel="self" type="application/rss+xml" />
	<link>http://euvolution.com/futurist-transhuman-news-blog</link>
	<description></description>
	<lastBuildDate>Thu, 19 Aug 2010 08:20:52 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Artificial Intelligence Resources</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/artificial-intelligence-resources/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/artificial-intelligence-resources/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:53 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=425</guid>
		<description><![CDATA[[Download Artificial Intelligence Resources White Paper Link Compilation] 
Artificial Intelligence Resources (AIResources.info)is a Subject Tracer™ Information Blog developed and created by the Virtual Private Library™. It is designed to bring together the latest resources and sources on an ongoing basis from the Internet for artificial intelligence resources which are listed below. We always welcome suggestions [...]]]></description>
			<content:encoded><![CDATA[<p>[<a href="http://zillman.blogspot.com/2009/08/artificial-intelligence-resources-white.html" />Download Artificial Intelligence Resources White Paper Link Compilation</a>]<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/8cfbd_updated.gif" /> </p>
<p>Artificial Intelligence Resources (AIResources.info)is a Subject Tracer™ Information Blog developed and created by the <a href="http://www.virtualprivatelibrary.com/">Virtual Private Library™</a>. It is designed to bring together the latest resources and sources on an ongoing basis from the Internet for artificial intelligence resources which are listed below. We always welcome suggestions of additional sites and resources to be added to this comprehensive listing and please submit by clicking <a href="mailto:suggestions@airesources.info?Subject=Sites">here</a>. This site has been developed and maintained by Marcus P. Zillman, M.S., A.M.H.A.; Internet <a href="http://marcuszillman.blogspot.com/">expert</a>, <a href="http://www.internetminiguides.com/">author</a>, <a href="http://www.internetspeaker.net/">keynote speaker</a>, and <a href="http://internetconsultant.blogspot.com/">consultant</a>. His latest white papers include <a href="http://zillman.blogspot.com/2004/09/searching-internet-white-paper.html"><em>Searching the Internet</em></a>, <a href="http://zillman.blogspot.com/2004/12/academic-and-scholar-search-engines.html"><em>Academic and Scholar Search Engines and Sources</em></a>, and <a href="http://kdresources.info/"><em>Knowledge Discovery Resources 2009</em></a>. All of his Subject Tracer™ Information Blogs and his white papers are available from <a href="http://www.whitepapers.us/">WhitePapers.us</a>.</p>
<p>His latest monthly column is available by clicking <a href="http://zillmancolumns.com/">here</a>. Subscribe to his free monthly <strong>Awareness Watch™</strong> Newsletter. Learn more by clicking <a href="http://www.awarenesswatch.com/">here</a>. Free online streaming tutorial videos on searching the Internet by Marcus P. Zillman, M.S., A.M.H.A.; available by clicking <a href="http://www.informationdetective.com/">here</a>.  </p>
<p><strong>ARTIFICIAL INTELLIGENCE RESOURCES</strong> </p>
<p><strong>20Q.net &#8211; An Experiment in Artificial Intelligence</strong> <br /><a href="http://www.20q.net/">http://www.20q.net/</a> </p>
<p><strong>AboutAI.net</strong> <br /><a href="http://www.aboutai.net/">http://www.aboutai.net/</a> </p>
<p><strong>About Intelligence</strong><br /><a href="http://www.aboutintelligence.co.uk/">http://www.aboutintelligence.co.uk/</a></p>
<p><strong>Adaptive Artificial Intelligence</strong> <br /><a href="http://adaptiveai.com/">http://adaptiveai.com/</a> </p>
<p><strong>ADATE System &#8211; Automatic Design of Algorithms Through Evolution</strong> <br /><a href="http://www-ia.hiof.no/~rolando/index.html">http://www-ia.hiof.no/~rolando/index.html</a> </p>
<p><strong>AI Dreams &#8211; Forum for the Discussion of Artificial Intelligence and Linked Materials Such as Robotics, Character Design, Movies and New Technology</strong><br /><a href="http://www.aidreams.co.uk/">http://www.aidreams.co.uk/</a></p>
<p><strong>AI Education Repository</strong> <br /><a href="http://www.cs.cofc.edu/~manaris/ai-education-repository/">http://www.cs.cofc.edu/~manaris/ai-education-repository/</a> </p>
<p><strong>AI FAQ Index</strong> <br /><a href="http://www.faqs.org/faqs/ai-faq/">http://www.faqs.org/faqs/ai-faq/</a> </p>
<p><strong>Ai Forums</strong> <br /><a href="http://www.ai-forum.org/">http://www.ai-forum.org/</a> </p>
<p><strong>AI Genealogy Project</strong><br /><a href="http://aigp.csres.utexas.edu/~aigp/">http://aigp.csres.utexas.edu/~aigp/</a></p>
<p><strong>AI Hub</strong><br /><a href="http://www.aihub.org/">http://www.aihub.org/</a></p>
<p><strong>AI Lab University of Zurich</strong> <br /><a href="http://www.ifi.unizh.ch">http://www.ifi.unizh.ch</a> </p>
<p><strong>AI on the Web</strong> <br /><a href="http://www.cs.berkeley.edu/~russell/ai.html">http://www.cs.berkeley.edu/~russell/ai.html</a> </p>
<p><strong>AI Repositories and Resource Lists</strong> <br /><a href="http://snipurl.com/7gk2">http://snipurl.com/7gk2</a> </p>
<p><strong>Ai Research</strong><br /><a href="http://www.a-i.com/">http://www.a-i.com/</a></p>
<p><strong>AISB &#8211; The Society for the Study of Artificial Intelligence and the Simulation of Behaviour</strong> <br /><a href="http://www.aisb.org.uk/">http://www.aisb.org.uk/</a></p>
<p><strong>AI: The Movie</strong> <br /><a href="http://www.aaai.org/AITopics/html/aimovie.html">http://www.aaai.org/AITopics/html/aimovie.html</a> </p>
<p><strong>AITIA Informatikai &#8211; Artificial Intelligence, Information Technology, Intelligent Agents</strong><br /><a href="http://www.aitia.ai/">http://www.aitia.ai/</a></p>
<p><strong>AI Toolkits and SDKs</strong><br /><a href="http://www.gameai.com/toolkits.html">http://www.gameai.com/toolkits.html</a></p>
<p><strong>AI Topics</strong> <br /><a href="http://www.aaai.org/AITopics/aitopics.html">http://www.aaai.org/AITopics/aitopics.html</a> </p>
<p><strong>American Association for Artificial Intelligence (AAAI)</strong> <br /><a href="http://www.aaai.org/">http://www.aaai.org/</a> </p>
<p><strong>Amzi!</strong> <br /><a href="http://www.amzi.com/">http://www.amzi.com/</a> </p>
<p><strong>Applied Soft Computing</strong><br /><a href="http://www.sciencedirect.com/science/journal/15684946">http://www.sciencedirect.com/science/journal/15684946</a></p>
<p><strong>Appreciative Inquiry Commons</strong> <br /><a href="http://appreciativeinquiry.cwru.edu/">http://appreciativeinquiry.cwru.edu/</a> </p>
<p><strong>Artificial Intelligence &#8211; a CompInfo Directory</strong> <br /><a href="http://www.compinfo-center.com/tpai-t.htm">http://www.compinfo-center.com/tpai-t.htm</a> </p>
<p><strong>Artificial Intelligence: A Modern Approach</strong> <br /><a href="http://aima.cs.berkeley.edu/ ">http://aima.cs.berkeley.edu/ </a></p>
<p><strong>Artificial Intelligence Areas</strong> <br /><a href="http://www.isis.vt.edu/~fanjun/text/ai1.html">http://www.isis.vt.edu/~fanjun/text/ai1.html</a> </p>
<p><strong>Artificial Intelligence By Jonathan Crowhurst</strong><br /><a href="http://www.freepint.com/issues/290704.htm#tips">http://www.freepint.com/issues/290704.htm#tips</a></p>
<p><strong>Artificial Intelligence Depot</strong> <br /><a href="http://ai-depot.com/Main.html">http://ai-depot.com/Main.html</a> </p>
<p><strong>Artificial Intelligence from the Bible</strong><br /><a href="http://users.adelphia.net/~lilavois/Seven/bible.html">http://users.adelphia.net/~lilavois/Seven/bible.html</a></p>
<p><strong>Artificial Intelligence Research</strong> <br /><a href="http://www.a-i.com/">http://www.a-i.com/</a> </p>
<p><strong>Association for Uncertainty in Artificial Intelligence (AUAI)</strong> <br /><a href="http://www.auai.org/">http://www.auai.org/</a> </p>
<p><strong>AutoStitch &#8211; A New Dimension In Automatic Image Stitching</strong><br /><a href="http://www.cs.ubc.ca/~mbrown/autostitch/autostitch.html">http://www.cs.ubc.ca/~mbrown/autostitch/autostitch.html</a></p>
<p><strong>Babel &#8211; A Language for Talking To Computers</strong><br /><a href="http://babelproject.com/">http://babelproject.com/</a></p>
<p><strong>Bibliographies on Artificial Intelligence</strong> <br /><a href="http://liinwww.ira.uka.de/bibliography/Ai/">http://liinwww.ira.uka.de/bibliography/Ai/</a> </p>
<p><strong>BLIASoft Knowledge Discovery</strong><br /><a href="http://www.bliasoft.com/Eindex.html">http://www.bliasoft.com/Eindex.html</a></p>
<p><strong>Bot Research</strong><br /><a href="http://www.botresearch.info/">http://www.BotResearch.info/</a></p>
<p><strong>BrainMaker (California Scientific) Neural Network Software</strong> <br /><a href="http://www.calsci.com/index.html">http://www.calsci.com/index.html</a> </p>
<p><strong>BUBL LINK / Artificial Intelligence </strong> <br /><a href="http://bubl.ac.uk/link/a/artificialintelligence.htm">http://bubl.ac.uk/link/a/artificialintelligence.htm</a> </p>
<p><strong>CGAL &#8211; Computational Geometry Algorithms Library</strong><br /><a href="http://www.cgal.org/">http://www.cgal.org/</a></p>
<p><strong>ChatterBots</strong><br /><a href="http://www.chatterbots.info/">http://www.ChatterBots.info/</a></p>
<p><strong>Cybernetics and Systems Analysis</strong><br /><a href="http://www.springerlink.com/link.asp?id=106467">http://www.springerlink.com/link.asp?id=106467</a></p>
<p><strong>Dali</strong> <br /><a href="http://www.dalilab.com/index.html">http://www.dalilab.com/index.html</a> </p>
<p><strong>Data Mining Resources</strong><br /><a href="http://www.dataminingresources.info/">http://www.DataMiningResources.info/</a></p>
<p><strong>digitalAGORA</strong> <br /><a href="http://aut.edu/agora/main.htm">http://aut.edu/agora/main.htm</a> </p>
<p><strong>Dr. Dobb&#8217;s Journal &#8211; AI</strong> <br /><a href="http://www.ddj.com/topics/ai/">http://www.ddj.com/topics/ai/</a> </p>
<p><strong>Edinburgh University, Artificial Intelligence</strong> <br /><a href="http://www.dai.ed.ac.uk/">http://www.dai.ed.ac.uk/</a> </p>
<p><strong>Electronic Transactions on Artificial Intelligence</strong> <br /><a href="http://www.etai.info/">http://www.etai.info/</a> </p>
<p><strong>Elzware &#8211; Information Virtually and Conversational Interfaces</strong><br /><a href="http://www.elzware.com/">http://www.elzware.com/</a></p>
<p><strong>Encog &#8211; A Neural Network Framework for C# and Java</strong><br /><a href="http://www.heatonresearch.com/encog">http://www.heatonresearch.com/encog</a></p>
<p><strong>Evolutionary Intelligence</strong><br /><a href="http://www.springer.com/engineering/journal/12065">http://www.springer.com/engineering/journal/12065</a></p>
<p><strong>Feng-GUI &#8211; Feng Shui For Graphic User Interfaces™ </strong><br /><a href="http://www.feng-gui.com/">http://www.feng-gui.com/</a></p>
<p><strong>Framsticks &#8211; Artificial Life &#8211; 3D Evolution and Simulation</strong> <br /><a href="http://www.frams.alife.pl/">http://www.frams.alife.pl/</a> </p>
<p><strong>Franz, Inc.</strong> <br /><a href="http://www.franz.com/">http://www.franz.com/</a> </p>
<p><strong>Free Online Directory of Computing (FOLDOC)</strong> <br /><a href="http://www.foldoc.org/">http://www.foldoc.org/</a> </p>
<p><strong>Generation5</strong><br /><a href="http://www.generation5.org/">http://www.generation5.org/</a></p>
<p><strong>Genetic Algorithms and Artificial Life Resources</strong> <br /><a href="http://www.doc.ic.ac.uk/~nd/surprise_96/journal/vol2/tcw2/article2.html">http://www.doc.ic.ac.uk/~nd/surprise_96/journal/vol2/tcw2/article2.html</a> </p>
<p><strong>Genetic Algorithms Archive</strong> <br /><a href="http://www.aic.nrl.navy.mil/galist/">http://www.aic.nrl.navy.mil/galist/</a> </p>
<p><strong>Gnod &#8211; Experimental AI Self Adapting System</strong><br /><a href="http://www.gnod.net/">http://www.gnod.net/</a></p>
<p><strong>Google™ Directory &#8211; Computers &#8211; Artificial Intelligence</strong> <br /><a href="http://directory.google.com/Top/Computers/Artificial_Intelligence/">http://directory.google.com/Top/Computers/Artificial_Intelligence/</a> </p>
<p><strong>GreatMindsWorking.com</strong> <br /><a href="http://greatmindsworking.com/">http://greatmindsworking.com/</a> </p>
<p><strong>gwap.com &#8211; Training Computers by Playing Games</strong><br /><a href="http://www.gwap.com/gwap/">http://www.gwap.com/gwap/</a></p>
<p><strong>Heuristics and Artificial Intelligence in Finance and Investment</strong> <br /><a href="http://www.geocities.com/francorbusetti/">http://www.geocities.com/francorbusetti/</a> </p>
<p><strong>Imagination-Engines</strong> <br /><a href="http://www.imagination-engines.com/">http://www.Imagination-Engines.com/</a> </p>
<p><strong>Institute for Human and Machine Cognition (IHMC)</strong><br /><a href="http://www.ihmc.us/">http://www.ihmc.us/</a></p>
<p><strong>Institute for Information Technology &#8211; Artificial Intelligence Technologies</strong> <br /><a href="http://iit-iti.nrc-cnrc.gc.ca/r-d/ai-ia_e.html">http://iit-iti.nrc-cnrc.gc.ca/r-d/ai-ia_e.html</a> </p>
<p><strong>Interactive Artificial Intelligence Resources</strong> <br /><a href="http://www.mainline.brynmawr.edu/EIAIR/">http://www.mainline.brynmawr.edu/EIAIR/</a> </p>
<p><strong>Interesting AI Demos and Projects</strong> <br /><a href="http://www.cs.wisc.edu/~dyer/cs540/demos.html">http://www.cs.wisc.edu/~dyer/cs540/demos.html</a> </p>
<p><strong>International Association of Artificial Intelligence and Law (IAAIL)</strong><br /><a href="http://www.iaail.org/">http://www.iaail.org/</a></p>
<p><strong>International Journal of Computational Intelligence (IJCI)</strong><br /><a href="http://www.enformatika.org/journals/1304-2386/">http://www.enformatika.org/journals/1304-2386/</a></p>
<p><strong>International Journal of Computational Intelligence Research (IJCIR)</strong><br /><a href="http://www.ijcir.info">http://www.ijcir.info</a></p>
<p><strong>International Journal of Interactive Multimedia and Artificial Intelligence</strong> <br /><a href="http://www.imai-software.com/openlab/index.php?q=journal">http://www.imai-software.com/openlab/index.php?q=journal</a></p>
<p><strong>International Journal on Artificial Intelligence Tools (IJAIT)</strong> <br /><a href="http://ejournals.wspc.com.sg/ijait/ijait.shtml">http://ejournals.wspc.com.sg/ijait/ijait.shtml</a> </p>
<p><strong>Introduction to Neural Networks for C#</strong><br /><em>Online Book:</em>  <a href="http://www.heatonresearch.com/online/introduction-neural-networks-cs-edition-2">http://www.heatonresearch.com/online/introduction-neural-networks-cs-edition-2</a><br /><em>Online Course(YouTube):</em> <a href="http://www.heatonresearch.com/course/intro-neural-nets-cs">http://www.heatonresearch.com/course/intro-neural-nets-cs</a></p>
<p><strong>Introduction to Neural Networks for Java</strong><br /><em>Online Book:</em> <a href="http://www.heatonresearch.com/online/introduction-neural-networks-java-edition-2">http://www.heatonresearch.com/online/introduction-neural-networks-java-edition-2</a><br /><em>Online Course(YouTube):</em>  <a href="http://www.heatonresearch.com/course/intro-neural-nets-java">http://www.heatonresearch.com/course/intro-neural-nets-java</a></p>
<p><strong>Java Applets for Neural Network and Artificial Life</strong> <br /><a href="http://staff.aist.go.jp/utsugi-a/Lab/Links.html">http://staff.aist.go.jp/utsugi-a/Lab/Links.html</a> </p>
<p><strong>Joone &#8211; Java Object Oriented Neural Engine</strong><br /><a href="http://www.jooneworld.com/">http://www.jooneworld.com/</a></p>
<p><strong>Journal of Artificial General Intelligence (JAGI)</strong><br /><a href="http://journal.agi-network.org/Home/tabid/72/Default.aspx">http://journal.agi-network.org/Home/tabid/72/Default.aspx</a></p>
<p><strong>Journal of Artificial Intelligence Research</strong> <br /><a href="http://www.cs.washington.edu/research/jair/home.html">http://www.cs.washington.edu/research/jair/home.html</a> </p>
<p><strong>Journal of Artificial Societies and Social Simulation</strong> <br /><a href="http://jasss.soc.surrey.ac.uk/JASSS.html">http://jasss.soc.surrey.ac.uk/JASSS.html</a> </p>
<p><strong>Journal of Interesting Negative Results in Natural Language Processing and Machine Learning (JINR)</strong><br /><a href="http://jinr.site.uottawa.ca/">http://jinr.site.uottawa.ca/</a></p>
<p><strong>Journal of Machine Learning Research</strong> <br /><a href="http://www.jmlr.org/">http://www.jmlr.org/</a> </p>
<p><strong>KurzweilAI.net</strong> <br /><a href="http://www.kurzweilai.net/">http://www.kurzweilai.net/</a> </p>
<p><strong>Logic Programming Associates &#8211; LPA</strong><br /><a href="http://www.lpa.co.uk">http://www.lpa.co.uk</a></p>
<p><strong>Machine Translation</strong><br /><a href="http://www.springerlink.com/link.asp?id=100310">http://www.springerlink.com/link.asp?id=100310</a></p>
<p><strong>MindPixel: Digital Mind Modeling Project</strong><br /><a href="http://www.mindpixel.com/">http://www.mindpixel.com/</a></p>
<p><strong>Minds and Machines</strong><br /><a href="http://www.springerlink.com/link.asp?id=100314">http://www.springerlink.com/link.asp?id=100314</a></p>
<p><strong>MIT AI Lab Research Projects</strong> <br /><a href="http://www.csail.mit.edu/research/activities/activities.html">http://www.csail.mit.edu/research/activities/activities.html</a> </p>
<p><strong>NASA Tech Briefs Software Center &#8211; Artificial Intelligence and Expert Systems</strong><br /><a href="http://www.techbriefs.com/software/ai.html">http://www.techbriefs.com/software/ai.html</a></p>
<p><strong>Natural Computing: An International Journal</strong><br /><a href="http://www.springerlink.com/link.asp?id=108905">http://www.springerlink.com/link.asp?id=108905</a></p>
<p><strong>Neuron AI Directory: Artificial Intelligence Resources</strong> <br /><a href="http://www.neuron.co.uk/">http://www.neuron.co.uk/</a> </p>
<p><strong>Neuroph &#8211; Java Neural Network Frramework</strong><br /><a href="http://neuroph.sourceforge.net/">http://neuroph.sourceforge.net/</a></p>
<p><strong>OpenAI</strong> <br /><a href="http://sourceforge.net/projects/openai/">http://sourceforge.net/projects/openai/</a> </p>
<p><strong>OpenCyc &#8211; Open Source General KnowledgeBase and Commonsense Reasoning Engine</strong><br /><a href="http://www.cyc.com/cyc/opencyc">http://www.cyc.com/cyc/opencyc</a> </p>
<p><strong>Open Directory &#8211; Computers: Artificial Intelligence</strong> <br /><a href="http://dmoz.org/Computers/Artificial_Intelligence/">http://dmoz.org/Computers/Artificial_Intelligence/</a> </p>
<p><strong>Pascal Costanza&#8217;s Highly Opinionated Guide to Lisp</strong><br /><a href="http://p-cos.net/lisp/guide.html">http://p-cos.net/lisp/guide.html</a></p>
<p><strong>PCAI Artificial Intelligence Magazine</strong> <br /><a href="http://www.pcai.com/">http://www.pcai.com/</a> </p>
<p><strong>PCAI Artificial Intelligence Yahoo Groups Mailing List</strong> <br /><a href="http://groups.yahoo.com/group/pcai/">http://groups.yahoo.com/group/pcai/</a> </p>
<p><strong>Prediction Markets</strong><br /><a href="http://www.predictionmarkets.com/">http://www.PredictionMarkets.com/</a></p>
<p><strong>Pyro &#8211; Python Robotics</strong><br /><a href="http://pyrorobotics.org/">http://pyrorobotics.org/</a></p>
<p><strong>SIGART AI Web Resources Directory</strong> <br /><a href="http://www.acm.org/sigart/ai/">http://www.acm.org/sigart/ai/</a> </p>
<p><strong>Sigma Knowledge Engineering Environment</strong><br /><a href="http://sigmakee.sourceforge.net/">http://sigmakee.sourceforge.net/</a></p>
<p><strong>Singularity Institute for Artificial Intelligence</strong> <br /><a href="http://www.singinst.org/">http://www.singinst.org/</a> </p>
<p><strong>SRI&#8217;s Artificial Intelligence Center</strong> <br /><a href="http://www.ai.sri.com/">http://www.ai.sri.com/</a> </p>
<p><strong>Structure and Interpretation of Computer Programs &#8211; Video Lectures by Hal Abelson and Gerald Jay Sussman</strong><br /><a href="http://www.swiss.ai.mit.edu/classes/6.001/abelson-sussman-lectures/">http://www.swiss.ai.mit.edu/classes/6.001/abelson-sussman-lectures/</a></p>
<p><strong>Suggested Upper Merged Ontology (SUMO)</strong><br /><a href="http://www.ontologyportal.org/">http://www.ontologyportal.org/</a> </p>
<p><strong>Summarizer Ranks Sentences</strong><br /><a href="http://www.trnmag.com/Stories/2005/042005/Summarizer_ranks_sentences_042005.html">http://www.trnmag.com/Stories/2005/042005/Summarizer_ranks_sentences_042005.html</a></p>
<p><strong>Swarm Intelligence Resources</strong><br /><a href="http://glmrc.ie.ncit.edu.tw/simon/SIHompage.htm">http://glmrc.ie.ncit.edu.tw/simon/SIHompage.htm</a></p>
<p><strong>Tangent Research Intelligent Systems and Robotics R&amp;D</strong> <br /><a href="http://tangentresearch.com/research/ai/">http://tangentresearch.com/research/ai/</a> </p>
<p><strong>The A.I. Honor Society, National Chapter at GWU</strong> <br /><a href="http://www.gwu.edu/~aisoc/">http://www.gwu.edu/~aisoc/</a> </p>
<p><strong>The Artificial Intelligence Directory</strong><br /><a href="http://www.ai-directory.com/">http://www.ai-directory.com/</a></p>
<p><strong>The Game AI Page: Building Artificial Intelligence into Games</strong> <br /><a href="http://www.gameai.com/">http://www.gameai.com/</a> </p>
<p><strong>The Haley Enterprise</strong> <br /><a href="http://www.haley.com/">http://www.Haley.com/</a> </p>
<p><strong>The IDC Story: The First Successful AI Based Multi-Expert System In Arizona</strong> <br /><a href="http://snipurl.com/7ucv">http://snipurl.com/7ucv</a> </p>
<p><strong>Things That Think</strong><br /><a href="http://ttt.media.mit.edu/index.html">http://ttt.media.mit.edu/index.html</a></p>
<p><strong>Thinking Machine 4</strong><br /><a href="http://turbulence.org/spotlight/thinking/index.html">http://turbulence.org/spotlight/thinking/index.html</a></p>
<p><strong>Transactions of the Japanese Society for Artificial Intelligence (TJSAI)</strong><br /><a href="http://www.jstage.jst.go.jp/browse/tjsai">http://www.jstage.jst.go.jp/browse/tjsai</a></p>
<p><strong>University of Arizona Artificial Intelligence Lab</strong> <br /><a href="http://ai.bpa.arizona.edu/index.html">http://ai.bpa.arizona.edu/index.html</a> </p>
<p><strong>What Is Artificial Intelligence?</strong> <br /><a href="http://www-formal.stanford.edu/jmc/whatisai/whatisai.html">http://www-formal.stanford.edu/jmc/whatisai/whatisai.html</a> </p>
<p><strong>WPI AIRG &#8212; AI Webliography</strong> <br /><a href="http://www.cs.wpi.edu/Research/airg/AI-hotlist.html">http://www.cs.wpi.edu/Research/airg/AI-hotlist.html</a> </p>
<p><strong>WWW Virtual Library &#8211; Artificial Intelligence</strong> <br /><a href="http://vl.fmnet.info/ai/">http://vl.fmnet.info/ai/</a> </p>
<p><strong>Yahoo Directory &#8211; Artificial Intelligence</strong> <br /><a href="http://snipurl.com/7glb">http://snipurl.com/7glb</a> </p>
<p><strong>Current Subject Tracer™ Information Blogs:</strong> </p>
<p><strong>Accessibility Resources</strong><br /><a href="http://www.accessibilityresources.info/">http://www.AccessibilityResources.info/</a></p>
<p><strong>Agriculture Resources</strong> <br /><a href="http://www.agricultureresources.info/">http://www.AgricultureResources.info/</a> </p>
<p><strong>Artificial Intelligence Resources</strong> <br /><a href="http://www.airesources.info/">http://www.AIResources.info/</a> </p>
<p><strong>Astronomy Resources</strong> <br /><a href="http://www.astronomyresources.info/">http://www.AstronomyResources.info/</a> </p>
<p><strong>Auction Resources</strong> <br /><a href="http://www.auctionresources.info/">http://www.AuctionResources.info/</a> </p>
<p><strong>Biological Informatics</strong> <br /><a href="http://www.biologicalinformatics.info/">http://www.biologicalinformatics.info/</a> </p>
<p><strong>Biotechnology Resources</strong><br /><a href="http://www.biotechnologyresources.info/">http://www.BiotechnologyResources.info/</a></p>
<p><strong>Bot Research</strong> <br /><a href="http://www.botresearch.info/">http://www.botresearch.info/</a> </p>
<p><strong>Business Intelligence Resources</strong> <br /><a href="http://www.biresources.info/">http://www.biresources.info/</a> </p>
<p><strong>ChatterBots</strong> <br /><a href="http://www.chatterbots.info/">http://www.ChatterBots.info/</a> </p>
<p><strong>Data Mining Resources</strong> <br /><a href="http://www.dataminingresources.info/">http://www.DataMiningResources.info/</a> </p>
<p><strong>Deep Web Research</strong> <br /><a href="http://www.deepwebresearch.info/">http://www.deepwebresearch.info/</a> </p>
<p><strong>Directory Resources</strong> <br /><a href="http://www.directoryresources.info/">http://www.DirectoryResources.info/</a> </p>
<p><strong>eCommerce Resources</strong> <br /><a href="http://www.ecommerceresources.info/">http://www.eCommerceResources.info/</a> </p>
<p><strong>Elder Resources</strong><br /><a href="http://www.elderresources.info/">http://www.ElderResources.info/</a></p>
<p><strong>Employment Resources</strong> <br /><a href="http://www.employmentresources.info/">http://www.EmploymentResources.info/</a> </p>
<p><strong>Entrepreneurial Resources</strong><br /><a href="http://www.entrepreneurialresources.info/">http://www.EntrepreneurialResources.info/</a></p>
<p><strong>Financial Sources</strong> <br /><a href="http://www.financialsources.info/">http://www.FinancialSources.info/</a> </p>
<p><strong>Finding People</strong> <br /><a href="http://www.findingpeople.info/">http://www.FindingPeople.info/</a> </p>
<p><strong>Games Resources</strong> <br /><a href="http://www.gamesresources.info/">http://www.GamesResources.info/</a> </p>
<p><strong>Genealogy Resources</strong> <br /><a href="http://www.genealogyresources.info/">http://www.GenealogyResources.info/</a> </p>
<p><strong>Grant Resources</strong><br /><a href="http://www.grantresources.info/">http://www.GrantResources.info/</a></p>
<p><strong>Green Files</strong><br /><a href="http://www.greenfiles.info/">http://www.GreenFiles.info/</a></p>
<p><strong>Grid, Distributed and Cloud Computing Resources</strong><br /><a href="http://www.gridresources.info/">http://www.GridResources.info/</a></p>
<p><strong>Healthcare Resources</strong> <br /><a href="http://www.healthcareresources.info/">http://www.healthcareresources.info/</a> </p>
<p><strong>Information Futures Markets</strong> <br /><a href="http://www.informationfuturesmarkets.com/">http://www.InformationFuturesMarkets.com/</a> </p>
<p><strong>Information Quality Resources</strong> <br /><a href="http://www.informationqualityresources.info/">http://www.InformationQualityResources.info/</a> </p>
<p><strong>International Trade Resources</strong><br /><a href="http://www.internationaltraderesources.info/">http://www.InternationalTradeResources.info/</a></p>
<p><strong>Internet Alerts</strong> <br /><a href="http://www.internetalerts.info/">http://www.InternetAlerts.info/</a> </p>
<p><strong>Internet Demographics</strong> <br /><a href="http://www.internetdemographics.info/">http://www.internetdemographics.info/</a> </p>
<p><strong>Internet Experts</strong> <br /><a href="http://www.internetexperts.info/">http://www.internetexperts.info/</a> </p>
<p><strong>Internet Hoaxes</strong> <br /><a href="http://www.internethoaxes.info/">http://www.internethoaxes.info/</a> </p>
<p><strong>Journalism Resources</strong><br /><a href="http://www.journalismresources.info/">http://www.JournalismResources.info/</a></p>
<p><strong>Knowledge Discovery</strong> <br /><a href="http://www.knowledgediscovery.info/">http://www.knowledgediscovery.info/</a> </p>
<p><strong>Military Resources</strong><br /><a href="http://www.militaryresources.info/">http://www.MilitaryResources.info/</a></p>
<p><strong>New Economy Analytics, Resources and Alerts</strong><br /><a href="http://www.neweconomyanalytics.com/">http://www.NewEconomyAnalytics.com/</a></p>
<p><strong>Outsourcing/Offshoring Information and Resources</strong> <br /><a href="http://www.outsourcingoffshore.us/">http://www.OutsourcingOffshore.us/</a> </p>
<p><strong>Privacy Resources</strong> <br /><a href="http://www.privacyresources.info/">http://www.PrivacyResources.info/</a> </p>
<p><strong>Reference Resources</strong> <br /><a href="http://www.referenceresources.info/">http://www.ReferenceResources.info/</a> </p>
<p><strong>Research Resources</strong> <br /><a href="http://www.researchresources.info/">http://www.researchresources.info/</a> </p>
<p><strong>RestStress™</strong> <br /><a href="http://www.reststress.com/">http://www.RestStress.com/</a> </p>
<p><strong>Script Resources</strong><br /><a href="http://www.scriptresources.info/">http://www.ScriptResources.info/</a></p>
<p><strong>ShoppingBots</strong> <br /><a href="http://www.shoppingbots.info/">http://www.ShoppingBots.info/</a> </p>
<p><strong>Social Informatics</strong><br /><a href="http://www.socialinformatics.net/">http://www.SocialInformatics.net/</a></p>
<p><strong>Statistics Resources</strong> <br /><a href="http://www.statisticsresources.info/">http://www.statisticsresources.info/</a> </p>
<p><strong>Student Research</strong> <br /><a href="http://www.studentresearch.info/">http://www.studentresearch.info/</a> </p>
<p><strong>Theology Resources</strong> <br /><a href="http://www.theologyresources.info/">http://www.TheologyResources.info/</a></p>
<p><strong>Tutorial Resources</strong><br /><a href="http://www.tutorialresources.info/">http://www.TutorialResources.info/</a></p>
<p><strong>World Wide Web Reference</strong><br /><a href="http://www.wwwreference.info/">http://www.WWWReference.info/</a></p>
<p><span>© 2009 Marcus P. Zillman, M.S., A.M.H.A.</span>
<div><img width="1" height="1" src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/8cfbd_7488365-108859863834023428?l=airesources.blogspot.com" /></div>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/artificial-intelligence-resources/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Decision Making for Medical Support [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/decision-making-for-medical-support-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/decision-making-for-medical-support-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:52 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=417</guid>
		<description><![CDATA[In April, the two-year-old RHIO began offering a clinical decision-support service through ActiveHealth Management, a New York-based company. ActiveHealth&#8217;s CareEngine technology compares patients&#8217; medical, pharmacy and laboratory claims against established standards of care. It then notifies a physician if it finds an opportunity to improve a patient&#8217;s treatment.
For example, CareEngine can alert physicians to potential [...]]]></description>
			<content:encoded><![CDATA[<p>In April, the two-year-old RHIO began offering a clinical decision-support service through ActiveHealth Management, a New York-based company. ActiveHealth&#8217;s CareEngine technology compares patients&#8217; medical, pharmacy and laboratory claims against established standards of care. It then notifies a physician if it finds an opportunity to improve a patient&#8217;s treatment.</p>
<p>For example, CareEngine can alert physicians to potential adverse drug interactions, overlooked lab tests or the availability of beneficial drugs, according to ActiveHealth.<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/f55f5_dT5_aKKPksg" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/decision-making-for-medical-support-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Neural Network Creates Music CD [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/neural-network-creates-music-cd-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/neural-network-creates-music-cd-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:52 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=418</guid>
		<description><![CDATA[Computers have composed music before, but those efforts were little more than high-tech mixed tapes. Most computer composers have been taught rules of music through extensive programming or by breaking down works of human musicians and creating new pieces from the parts.
Instead, these Creativity Machine are untrained artificial intelligence computer known as a neural network. [...]]]></description>
			<content:encoded><![CDATA[<p>Computers have composed music before, but those efforts were little more than high-tech mixed tapes. Most computer composers have been taught rules of music through extensive programming or by breaking down works of human musicians and creating new pieces from the parts.</p>
<p>Instead, these Creativity Machine are untrained artificial intelligence computer known as a neural network. The neurons in the computer brain are mathematical entities instead of brain cells. The creative process starts by tweaking the mathematical connections between the neurons. That set off a cascade of calculations that were translated as sounds.<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/f55f5_FZSqWWeE5JQ" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/neural-network-creates-music-cd-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>jKilavuz &#8211; a guide in the polygon soup [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/jkilavuz-a-guide-in-the-polygon-soup-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/jkilavuz-a-guide-in-the-polygon-soup-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:52 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=419</guid>
		<description><![CDATA[First public version of jKilavuz is released.
jKilavuz is a path engine for Java. It consists of an extensible set of tools for collecting pathfind data and finding and executing paths. Despite the complexness of subject it is designed for ease of use.
]]></description>
			<content:encoded><![CDATA[<p>First public version of jKilavuz is released.</p>
<p>jKilavuz is a path engine for Java. It consists of an extensible set of tools for collecting pathfind data and finding and executing paths. Despite the complexness of subject it is designed for ease of use.<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/f55f5_bHuMYUvDiBI" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/jkilavuz-a-guide-in-the-polygon-soup-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial General Intelligence: Now Is the Time [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/artificial-general-intelligence-now-is-the-time-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/artificial-general-intelligence-now-is-the-time-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:52 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=420</guid>
		<description><![CDATA[Dr. Ben Goertzel&#8217;s talk at Google, discussing his own work on the Novamente Cognition Engine, an AGI project based on combining a number of knowledge representations and reasoning and learning techniques into an integrative architecture motivated by complex systems theory, and initially oriented at the control of virtual agents in 3D simulation worlds such as [...]]]></description>
			<content:encoded><![CDATA[<p>Dr. Ben Goertzel&#8217;s talk at Google, discussing his own work on the Novamente Cognition Engine, an AGI project based on combining a number of knowledge representations and reasoning and learning techniques into an integrative architecture motivated by complex systems theory, and initially oriented at the control of virtual agents in 3D simulation worlds such as Second Life.<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/f55f5_CuNOiPpmXbc" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/artificial-general-intelligence-now-is-the-time-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Apply AI 2007 Roundtable Report [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/apply-ai-2007-roundtable-report-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/apply-ai-2007-roundtable-report-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:52 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=421</guid>
		<description><![CDATA[The Apply AI Innovations 2007 conference drew together programmers from the games industry, students and professors from academia. The AI in games roundtable covered topics such as intelligent replanning, learning AI, debugging strategies, and opinions on current tools.
]]></description>
			<content:encoded><![CDATA[<p>The Apply AI Innovations 2007 conference drew together programmers from the games industry, students and professors from academia. The AI in games roundtable covered topics such as intelligent replanning, learning AI, debugging strategies, and opinions on current tools.<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/f55f5_n6YSq0LjzWw" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/apply-ai-2007-roundtable-report-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>What Would You do With 80 Cores? [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/what-would-you-do-with-80-cores-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/what-would-you-do-with-80-cores-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:52 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=422</guid>
		<description><![CDATA[An Intel developer discussed model-based computing, and how this relates to multi-core architectures.
&#34;Like the human brain itself, these intelligent applications lend themselves to parallel processing. 80-cores would change the game in a broader sense than just hardware &#8211; it will enable new application possibilities.&#34;
]]></description>
			<content:encoded><![CDATA[<p>An Intel developer discussed model-based computing, and how this relates to multi-core architectures.</p>
<p>&quot;Like the human brain itself, these intelligent applications lend themselves to parallel processing. 80-cores would change the game in a broader sense than just hardware &#8211; it will enable new application possibilities.&quot;<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/f55f5_4GJs9RguQSY" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/what-would-you-do-with-80-cores-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Software Finds Learning Language Child&#8217;s Play [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/software-finds-learning-language-childs-play-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/software-finds-learning-language-childs-play-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:52 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=423</guid>
		<description><![CDATA[A computer program that learns to decode language sounds in a similar way to a baby could shed new light on how humans acquire the ability to talk. It casts doubt on the idea that babies are born with an innate understanding of all possible language sounds.
The debate in language acquisition is around how much [...]]]></description>
			<content:encoded><![CDATA[<p>A computer program that learns to decode language sounds in a similar way to a baby could shed new light on how humans acquire the ability to talk. It casts doubt on the idea that babies are born with an innate understanding of all possible language sounds.</p>
<p>The debate in language acquisition is around how much specific information about language is hard-wired into the brain of the infant, and how much is something that can be explained by relatively general purpose learning systems.<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/f55f5_8TTTCHDEh1o" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/software-finds-learning-language-childs-play-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial Intelligence in Games [Article]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/artificial-intelligence-in-games-article/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/artificial-intelligence-in-games-article/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:52 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=424</guid>
		<description><![CDATA[There&#8217;s a new site on Game AI called AiGameDev.com (feed).  It features daily articles in a blog-like format, including reviews, editorials, and tutorials, not forgetting regular community discussions on game AI.
Here are some interesting posts made recently.
Machine Learning in Games
Game developers are increasingly keen to try ML techniques, but it does take some know-how [...]]]></description>
			<content:encoded><![CDATA[<p>There&#8217;s a new site on <a href="http://aigamedev.com/">Game AI</a> called <tt>AiGameDev.com</tt> (<a href="http://aigamedev.com/feed/">feed</a>).  It features daily articles in a blog-like format, including reviews, editorials, and tutorials, not forgetting regular community discussions on game AI.</p>
<p>Here are some interesting posts made recently.</p>
<h3>Machine Learning in Games</h3>
<p>Game developers are increasingly keen to try ML techniques, but it does take some know-how and experience.</p>
<ul>
<li><a href="http://aigamedev.com/architecture/learn-realistic">The Secret to Building Game AI that Learns Realistically</a></li>
<li><a href="http://aigamedev.com/design/alternatives-online-learning">Alternatives to Online Learning for Actor Behaviors</a></li>
<li><a href="http://aigamedev.com/editorial/beauty-beast">Game AI: Beauty and the Beast</a></li>
</ul>
<h3>Hierarchical Planning &amp; Behavior Trees</h3>
<p>Planners have proven themselves very effective in recent games, and hierarchical planners are the next logical step.</p>
<ul>
<li><a href="http://aigamedev.com/hierarchical-logic/bt-overview">Understanding Behavior Trees</a></li>
<li><a href="http://aigamedev.com/alive/game-ai-technical">A Technical Overview of Game::AI++</a></li>
<li><a href="http://aigamedev.com/alive/game-ai-motivation">The Motivation Behind Game::AI++</a></li>
</ul>
<h3>Conference Coverage</h3>
<p><tt>AiGameDev.com</tt> also has summaries of recent events, very useful for catching up with what went on&#8230;</p>
<ul>
<li><a href="http://aigamedev.com/coverage/aiide-2007-posters">AIIDE &#8216;07 Conference Coverage</a></li>
<li><a href="http://aigamedev.com/coverage/aiide-2007-papers">Pushing the Limits of Game AI Technology</a></li>
<li><a href="http://aigamedev.com/coverage/applyai-roundtable">Apply AI 2007 Roundtable Report</a></li>
</ul>
<p>Be sure to check out the site/blog if you&#8217;re interested in <a href="http://aigamedev.com/">game AI</a>!</p>
<p><img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/f55f5_IjmNYfyqmtU" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/artificial-intelligence-in-games-article/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Decision Tree [Knowledge]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/decision-tree-knowledge/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/decision-tree-knowledge/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:51 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=410</guid>
		<description><![CDATA[A decision tree is a technique for predicting target values from observations.
Motivation
Assume your program has data samples and needs to draw certain conclusions about each of them.  This is the case when mining for information in large databases, or trying to find an appropriate behaviour for a particular situation.  You can apply decision [...]]]></description>
			<content:encoded><![CDATA[<p>A decision tree is a technique for predicting target values from observations.</p>
<h3>Motivation</h3>
<p>Assume your program has data samples and needs to draw certain conclusions about each of them.  This is the case when mining for information in large databases, or trying to find an appropriate behaviour for a particular situation.  You can apply decision trees to this problem as long as:</p>
<ul>
<li><strong>The data samples each have attributes, either discrete or continuous values.</strong> For example, a symbol indicating if it was overcast or not, and the humidity level.</li>
<li><strong>The predictions must also be discrete or continuous values.</strong>  For example, the estimated temperature or a prediction of whether it will rain or not.</li>
</ul>
<p>Decision trees assume that it&#8217;s possible to check the attributes of the data samples multiple times, and use this information to refine the predicted value.</p>
<h3>Description</h3>
<p>A decision tree is based on a hierarchical data-structure, where each branch in the tree represents a condition.  This condition typically evaluates to a boolean, with true/false each corresponding to a child node.  However, it&#8217;s also possible to have more than two child nodes &#8212; for example if ranges are used as conditions.  The leaves in the tree store the predictions for the target value(s).</p>
<div><img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/77477_decisiontree.png" alt="Decision Tree" /></div>
<p>A simple traversal algorithm is also necessary to traverse the tree, evaluating each decision and then selecting the appropriate sub-tree to enter.  The algorithm is then applied recursively until a leaf node is reached.  This process is rather efficient as very little memory is required to store a tree, and only simple conditional checks need to be evaluated while predicting.</p>
<h3>Application</h3>
<p>A decision tree can be used in almost any classification problem (to predict discrete symbols) or regression problem (to predict continuous values).  They are particularly useful in data-mining because of their efficiency.  However, such decision trees cannot solve all types of problems because of assumptions of the hierarchical model.</p>
<p>In practice, to apply the traversal algorithm successfully, a good decision tree is needed.  This can be obtained in multiple ways:</p>
<ol>
<li>The decision tree may be edited by an expert.</li>
<li>The decision tree can be induced from data samples.</li>
</ol>
<p>Since expert solutions may take time to develop and tune, supervised learning is often used.</p>
<h3>Resources</h3>
<ul>
<li>See papers about the <a href="http://ai-depot.com/resources/decision_tree">decision tree</a> in the resources section on AI Depot.</li>
</ul>
<p><img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/dbbcd_bxarbA0meao" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/decision-tree-knowledge/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>More AI Content &amp; Format Preference Poll [Article]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/more-ai-content-format-preference-poll-article/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/more-ai-content-format-preference-poll-article/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:51 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=411</guid>
		<description><![CDATA[Most of my time these days is spent updating the artificial intelligence knowledge part of the website.  Two brand-new overviews of AI techniques have been published recently, complete with pseudo-code and graphics:

Minimax Search
Decision Tree

You can subscribe to articles like these by signing up for the combined artificial intelligence feed.  Be sure to let [...]]]></description>
			<content:encoded><![CDATA[<p>Most of my time these days is spent updating the <a href="http://ai-depot.com/knowledge/">artificial intelligence knowledge</a> part of the website.  Two brand-new overviews of AI techniques have been published recently, complete with pseudo-code and graphics:</p>
<ul>
<li><a href="http://ai-depot.com/knowledge/minimax_search">Minimax Search</a></li>
<li><a href="http://ai-depot.com/knowledge/decision_tree">Decision Tree</a></li>
</ul>
<p>You can <a href="http://ai-depot.com/site/subscribe">subscribe</a> to articles like these by signing up for the combined artificial intelligence feed.  Be sure to let me know (using the form below) if you have a particular topic at heart so we can bump it up the list of things to write about.</p>
<p>On a related note, I&#8217;m exploring ways to liven up this kind of content and drag it kicking and screaming into the world of Web 2.0.  I would appreciate your feedback on the subject:</p>
<div>
<h3>What format do you prefer to complement text articles?</h3>
<div>
<ul>
<li>
 <label for="poll-answer-6">Animation (slides)</label></li>
<li>
 <label for="poll-answer-7">Audio (podcast)</label></li>
<li>
 <label for="poll-answer-8">Interaction (demo)</label></li>
<li>
 <label for="poll-answer-9">Video (webcast)</label></li>
</ul>
<p><a href="http://ai-depot.com/#ViewPollResults" title="View Results Of This Poll">View Results</a></p>
</div>
</div>
<div><img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/dbbcd_loading.gif" width="16" height="16" alt="Loading ..." title="Loading ..." class="wp-polls-image" />&nbsp;Loading &#8230;</div>
<p>Any comments are also welcome on the subject.</p>
<p><img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/dbbcd_D5xeHqGOV7A" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/more-ai-content-format-preference-poll-article/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>New Planners Solve Rescue Missions [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/new-planners-solve-rescue-missions-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/new-planners-solve-rescue-missions-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:51 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=412</guid>
		<description><![CDATA[New technology has been used to plan search and rescue operations for the American air force.  The research can be seen as providing a way to combine route planning principles with principles for automatic fault finding. &#34;My research has combined two different but complementary principles for handling complex planning problems, developed within the computer [...]]]></description>
			<content:encoded><![CDATA[<p>New technology has been used to plan search and rescue operations for the American air force.  The research can be seen as providing a way to combine route planning principles with principles for automatic fault finding. &quot;My research has combined two different but complementary principles for handling complex planning problems, developed within the computer science disciplines of artificial intelligence and formal verification&quot;, explains Rune Moeller Jensen.</p>
<p>Several research groups have tried to combine the two principles. However, this has been shown to be difficult. Rune Moeller Jensen has, in co-operation with American colleagues from Carnegie Mellon University, developed a method called state-set-branching, in which the two principles can be combined. &quot;We could show that these search algorithms were more efficient than previous algorithms&quot;, he says.<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/dbbcd_tFIE6SUmL4E" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/new-planners-solve-rescue-missions-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Neural Network Learns to Bluff at Poker [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/neural-network-learns-to-bluff-at-poker-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/neural-network-learns-to-bluff-at-poker-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:51 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=413</guid>
		<description><![CDATA[These days, the bots playing poker can&#8217;t bluff convincingly. &#34;Computers are programmed to perform the best strategy, but bluffing is based on unexpected, illogical actions,&#34; says Evan Hurwitz, a computer scientist at the University of the Witwatersrand in South Africa.
Now Hurwitz and Tshilidzi Marwala, also at Witwatersrand, have developed a virtual player that has taught [...]]]></description>
			<content:encoded><![CDATA[<p>These days, the bots playing poker can&#8217;t bluff convincingly. &quot;Computers are programmed to perform the best strategy, but bluffing is based on unexpected, illogical actions,&quot; says Evan Hurwitz, a computer scientist at the University of the Witwatersrand in South Africa.</p>
<p>Now Hurwitz and Tshilidzi Marwala, also at Witwatersrand, have developed a virtual player that has taught itself to bluff at a card game called lerpa. Their artificial intelligence bot, named Aiden, is based on a neural network algorithm that usually forecasts stock market fluctuations.</p>
<p>Then the researchers decided to play Aiden against three other similarly trained bots to see what would happen. &quot;They began to develop their own personalities &#8211; either aggressive or conservative &#8211; depending on their past successes,&quot;<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/dbbcd_7Dj0BVLZVEY" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/neural-network-learns-to-bluff-at-poker-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Pushing the Limits of Game AI Technology [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/pushing-the-limits-of-game-ai-technology-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/pushing-the-limits-of-game-ai-technology-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:51 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=414</guid>
		<description><![CDATA[AIIDE ‘07 starts tomorrow (Artificial Intelligence and Interactive Digital Entertainment), featuring the most cutting edge research in game AI. The proceedings read like a &#34;who&#8217;s who&#34; in the field, and there&#8217;s lot to learn from! Here&#8217;s a collection of highlights from the conference, and references that can be found online.
]]></description>
			<content:encoded><![CDATA[<p>AIIDE ‘07 starts tomorrow (Artificial Intelligence and Interactive Digital Entertainment), featuring the most cutting edge research in game AI. The proceedings read like a &quot;who&#8217;s who&quot; in the field, and there&#8217;s lot to learn from! Here&#8217;s a collection of highlights from the conference, and references that can be found online.<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/dbbcd_FRYVAcHYjRA" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/pushing-the-limits-of-game-ai-technology-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Mining Data for the Netflix Prize [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/mining-data-for-the-netflix-prize-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/mining-data-for-the-netflix-prize-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:51 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=415</guid>
		<description><![CDATA[Last October, Netflix, the online movie rental service, announced that it would award $1 million to the first person or team who can devise a system that is 10 percent more accurate than the company&#8217;s current system for recommending movies that customers would like.
The contest has also generated several academic papers, Mr. Bennett said. It [...]]]></description>
			<content:encoded><![CDATA[<p>Last October, Netflix, the online movie rental service, announced that it would award $1 million to the first person or team who can devise a system that is 10 percent more accurate than the company&#8217;s current system for recommending movies that customers would like.</p>
<p>The contest has also generated several academic papers, Mr. Bennett said. It has turned out to be more exciting than officials expected.<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/dbbcd_EpDHLGLLQpI" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/mining-data-for-the-netflix-prize-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Interview with Peter Denning on the Principles of Computing [News]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/interview-with-peter-denning-on-the-principles-of-computing-news/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/interview-with-peter-denning-on-the-principles-of-computing-news/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:51 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=416</guid>
		<description><![CDATA[A computing visionary and leader of the movement to define and elucidate the &#34;great principles of computing,&#34; Peter J. Denning is a professor at the Naval Postgraduate School in Monterey, California. He is a former president of the ACM.
&#34;&#34;Artificial intelligence (AI) researchers claimed that the mind is a computational process. When they discovered the rules [...]]]></description>
			<content:encoded><![CDATA[<p>A computing visionary and leader of the movement to define and elucidate the &quot;great principles of computing,&quot; Peter J. Denning is a professor at the Naval Postgraduate School in Monterey, California. He is a former president of the ACM.</p>
<p>&quot;&quot;Artificial intelligence (AI) researchers claimed that the mind is a computational process. When they discovered the rules of the process, a computer that followed the same rules would be conscious and intelligent. This claim, often called &quot;strong AI&quot;, is not falsifiable. In the past two decades, mainstream AI has focused on falsifiable claims, such as &quot;a neural net can be trained to read handwritten addresses from postal envelopes.&quot; In the older terminology, this was called &#8216;weak AI&#8217;, but it has transformed AI into a strong scientific enterprise.&quot;&quot;<img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/dbbcd_Kxl-KDeHvto" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/interview-with-peter-denning-on-the-principles-of-computing-news/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Minimax Search [Knowledge]</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/minimax-search-knowledge/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/minimax-search-knowledge/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:50 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=409</guid>
		<description><![CDATA[Let&#8217;s say your program is in a competitive situation against others, and must predict possible consequences of actions to select the one with the best outcome.  This is the case in many logic games like Tic-Tac-Toe, Othello, Chess or Go.  The minimax algorithm can be applied here as long as:

The current state is [...]]]></description>
			<content:encoded><![CDATA[<p>Let&#8217;s say your program is in a competitive situation against others, and must predict possible consequences of actions to select the one with the best outcome.  This is the case in many logic games like Tic-Tac-Toe, Othello, Chess or Go.  The minimax algorithm can be applied here as long as:</p>
<ul>
<li><strong>The current state is (at least partly) available to the program.</strong>  For example, the program knows the position of the pieces on the game board.</li>
<li><strong>It&#8217;s possible to search through successor states in the future.</strong>  The program knows how the pieces end up when a move is made.</li>
<li><strong>There&#8217;s a way to evaluate the utility of certain states.</strong>  For instance, knowing when about the winning/loosing conditions.</li>
</ul>
<p>Since this is a competitive setting, you can assume that the others pick actions resulting in a worse outcome for your program.  Then, minimax works by taking the predictions of future states, and working back to determine the utility of predecessor states.  When your program has estimated the utility of the next states, it can easily select the best.</p>
<h3>Description</h3>
<p>Minimax is a policy to select optimal utility actions assuming the worst from other programs.  Typically, minmax is combined with a depth-first search algorithm that traverses the game tree, predicting what the opponents are likely to do and what your program should do.  As such, there are two different levels in the search tree: 1) for the opponents and 2) for team-members.</p>
<ol>
<li>The level in the game tree dealing with opponents is known as <tt>MIN</tt>, since they will typically <strong>minimize</strong> the utility of the outcome state.</li>
<li>Conversely, the search tree&#8217;s level dealing with team-members is known as <tt>MAX</tt>, since they will typically <strong>maximize</strong> the utility of the outcome state.</li>
</ol>
<p>The minimax search, in effect, minimizes the maximum possible loss, or looking at it the other way, maximizes the minimum gain.</p>
<p><img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/47380_minimax.png" alt="Min/Max Search in Game Tree" /></p>
<h3>Application</h3>
<p>Minimax is applied to many games with great success, especially when the branching factor is small (i.e. there are few options each turn), when the situation is deterministic, and the state is fully observable.</p>
<p>However, in practice, there are significant challenges to applying Minimax to a logic game.  Notably, the game tree is usually too large to search until the end, so good estimator functions are required for any state (and not just terminal states).  This is not a trivial problem, and significantly affects the outcome of the algorithm.  Most state estimation functions are hand written for each problem by experts.</p>
<p>The pseudo-code for a minimax search looks like this:</p>
<div>
<div>
<pre><span>def</span> minimax<span>&#40;</span>node, depth<span>&#41;</span>
    <span>if</span> node.<span>is_terminal</span><span>&#40;</span><span>&#41;</span> <span>or</span> depth == <span>0</span>:
         <span>return</span> node.<span>calculate_heuristic</span><span>&#40;</span><span>&#41;</span>
    <span>if</span> node.<span>is_opponent</span><span>&#40;</span><span>&#41;</span>:
         a = +inf
         <span>for</span> child <span>in</span> node.<span>get_children</span><span>&#40;</span><span>&#41;</span>:
             a = <span>min</span><span>&#40;</span>a, minimax<span>&#40;</span>child, depth<span>-1</span><span>&#41;</span><span>&#41;</span>
    <span>else</span>:
        a = -inf
        <span>for</span> child <span>in</span> node.<span>get_children</span><span>&#40;</span><span>&#41;</span>:
             a = <span>max</span><span>&#40;</span>a, minimax<span>&#40;</span>child, depth<span>-1</span><span>&#41;</span><span>&#41;</span>
    <span>return</span> a</pre>
</div>
</div>
<p>On the bright side, alpha-beta pruning can be implemented easily to improve the efficiency of the search.</p>
<h3>Theory</h3>
<p>In classical statistical decision theory, an estimator <img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/47380_77a3b715842b45e440a5bee15357ad29_1.0pt.gif" title="\delta" alt="\delta" /> is used to estimate a parameter <img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/47380_c4da9a79ba148a2e9a7bcd92255680be_1.39098pt.gif" title="\theta \in \Theta" alt="\theta \in \Theta" />.  Also assume a risk function <img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/77477_6a17165cc8bd2870b628562e395773c2_3.5pt.gif" title="R(\theta,\delta)" alt="R(\theta,\delta)" />, usually specified as the integral of a loss function. Given this framework, <img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/77477_d99d347424268567155c1e3e57e466e0_1.0pt.gif" title="\tilde{\delta}" alt="\tilde{\delta}" /> is called &#8220;<em>minimax</em>&#8221; if it satisfies:</p>
<p><img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/77477_67b428b3c397981a5a7f4481a50c69d8_3.5pt.gif" title="\sup_\theta R(\theta,\tilde{\delta}) = \inf_\delta \sup_\theta R(\theta,\delta)" alt="\sup_\theta R(\theta,\tilde{\delta}) = \inf_\delta \sup_\theta R(\theta,\delta)" /></p>
<h3>Resources</h3>
<ul>
<li>See papers on <a href="http://ai-depot.com/resources/minimax_search">minimax search</a> in the resources section on <b>AI Depot</b>.</li>
</ul>
<p><img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/77477_ggU8IJ70bVQ" height="1" width="1" /></p>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/minimax-search-knowledge/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>New version of Numenta software is available</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/new-version-of-numenta-software-is-available/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/new-version-of-numenta-software-is-available/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:48 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=405</guid>
		<description><![CDATA[I prefer open source software &#8211; the license applied to an open source software project lets me know up front what my usage rights and obligations are.
The Numenta Platform for Intelligent Computing (NuPIC) is free for academic and non-commercial research use, but there is so far no definitive information on commercial licensing costs. As a [...]]]></description>
			<content:encoded><![CDATA[<p>I prefer open source software &#8211; the license applied to an open source software project lets me know up front what my usage rights and obligations are.</p>
<p>The <a href="http://www.numenta.com/for-developers/software.php" target="new">Numenta Platform for Intelligent Computing (NuPIC)</a> is free for academic and non-commercial research use, but there is so far no definitive information on commercial licensing costs. As a result of this, even though I like the ideas behind NuPIC, I spend relatively little time playing with the examples. I very much enjoyed Jeff Hawkin&#8217;s book <a href="http://www.amazon.com/gp/product/0805078533?ie=UTF8&amp;tag=markwatsonassoci&amp;linkCode=as2&amp;camp=1789&amp;creative=9325&amp;creativeASIN=0805078533">On Intelligence</a><img src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/74278_ir?t=markwatsonassoci&amp;l=as2&amp;o=1&amp;a=0805078533" width="1" height="1" border="0" alt="" style="border:none !important; margin:0px !important;" /> (Amazon purchase link) and I will probably devote a lot more time to experimenting with NuPIC when all of the licensing issues are nailed down.
<div><img width="1" height="1" src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/c75c7_9025880770474050744-8722339949778678933?l=artificial-intelligence-theory.blogspot.com" /></div>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/new-version-of-numenta-software-is-available/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Very nice: Elsevier IJCAI AI Journal articles now available for free as PDFs</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/very-nice-elsevier-ijcai-ai-journal-articles-now-available-for-free-as-pdfs/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/very-nice-elsevier-ijcai-ai-journal-articles-now-available-for-free-as-pdfs/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:48 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=406</guid>
		<description><![CDATA[This requires a free sign up process. I just registered and I found a dozen articles on topics of interest to me that are now in my reading queue.

]]></description>
			<content:encoded><![CDATA[<p>This requires a <a href="http://www.aiinternational.org/AIJ/register.php" target="new">free sign up process</a>. I just registered and I found a dozen articles on topics of interest to me that are now in my reading queue.
<div><img width="1" height="1" src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/c75c7_9025880770474050744-8675435887395914792?l=artificial-intelligence-theory.blogspot.com" /></div>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/very-nice-elsevier-ijcai-ai-journal-articles-now-available-for-free-as-pdfs/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Verison 2.0 of OpenCyc is available</title>
		<link>http://euvolution.com/futurist-transhuman-news-blog/verison-2-0-of-opencyc-is-available/</link>
		<comments>http://euvolution.com/futurist-transhuman-news-blog/verison-2-0-of-opencyc-is-available/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 05:11:48 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://euvolution.com/futurist-transhuman-news-blog/?p=407</guid>
		<description><![CDATA[I installed OpenCyc 2.0 on one of my test servers last night. It is now Java based, so is (in principle) portable: I&#8217;ll try modifying the start up scripts for OS X when I have time. There is also now a Semantic Web sub project for OpenCyc.
There are now references to other lined data sources [...]]]></description>
			<content:encoded><![CDATA[<p>I installed <a href="http://www.opencyc.org/" target="new">OpenCyc 2.0</a> on one of my test servers last night. It is now Java based, so is (in principle) portable: I&#8217;ll try modifying the start up scripts for OS X when I have time. There is also now a Semantic Web sub project for OpenCyc.</p>
<p>There are now references to other lined data sources &#8211; you will notice this as soon as you start experimenting with the browser based interface.</p>
<p>If you have not tried OpenCyc before, it is a free version of the Cyc product. OpenCyc provides an ontology of the &#8220;real world&#8221; and many facts and relations dealing with what might be called <i>&#8220;common sense&#8221;</i> knowledge.
<div><img width="1" height="1" src="http://euvolution.com/futurist-transhuman-news-blog/wp-content/plugins/wp-o-matic/cache/c75c7_9025880770474050744-7958174467456372047?l=artificial-intelligence-theory.blogspot.com" /></div>
]]></content:encoded>
			<wfw:commentRss>http://euvolution.com/futurist-transhuman-news-blog/verison-2-0-of-opencyc-is-available/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
