<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments for eng.kulanov.org.ua</title>
	<atom:link href="http://eng.kulanov.org.ua/comments/feed" rel="self" type="application/rss+xml" />
	<link>http://eng.kulanov.org.ua</link>
	<description>GRID Compiting, Grid in Ukraine, Workload performance, modelling and prediction</description>
	<lastBuildDate>Fri, 29 Jul 2011 12:32:45 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>Comment on Speeding up with repmat function (MEX version) by forward-backward algorithm in C (Mex format) &#124; eng.kulanov.org.ua</title>
		<link>http://eng.kulanov.org.ua/archives/285/comment-page-1#comment-63</link>
		<dc:creator>forward-backward algorithm in C (Mex format) &#124; eng.kulanov.org.ua</dc:creator>
		<pubDate>Fri, 29 Jul 2011 12:32:45 +0000</pubDate>
		<guid isPermaLink="false">http://eng.kulanov.org.ua/?p=285#comment-63</guid>
		<description>[...] the previous post we were talking about repmat function in MEX format. We can reach further improvements if replace [...]</description>
		<content:encoded><![CDATA[<p>[...] the previous post we were talking about repmat function in MEX format. We can reach further improvements if replace [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Markov Chain (Model) Builder&#8230; by Sergey Kulanov</title>
		<link>http://eng.kulanov.org.ua/archives/73/comment-page-1#comment-11</link>
		<dc:creator>Sergey Kulanov</dc:creator>
		<pubDate>Thu, 21 Apr 2011 11:44:41 +0000</pubDate>
		<guid isPermaLink="false">http://eng.kulanov.org.ua/?p=73#comment-11</guid>
		<description>How to get P(observation&#124;MakrovModel)
this is what we have 
&lt;code&gt;result=prod(reshape(A.^o,1,[]))&lt;/code&gt;
where 
A - transition matrix;
o - is the transition matrix of the &lt;strong&gt;observation &lt;/strong&gt; sequence (which can be produced by
&lt;code&gt;o=full(sparse(observation(1:end-1),observation(2:end),1));)&lt;/code&gt;
Of course we have to add initial State o(1) probability:
&lt;code&gt;result*InitProb(o(1))&lt;/code&gt;

But the best way is to use logarithm scale
A more elegant way to count Probability P(Observation&#124;model)was found in PMTK by Kevin Murphy:
see 
&lt;code&gt;log=markovLogprob(model,data)&lt;/code&gt;</description>
		<content:encoded><![CDATA[<p>How to get P(observation|MakrovModel)<br />
this is what we have<br />
<code>result=prod(reshape(A.^o,1,[]))</code><br />
where<br />
A &#8211; transition matrix;<br />
o &#8211; is the transition matrix of the <strong>observation </strong> sequence (which can be produced by<br />
<code>o=full(sparse(observation(1:end-1),observation(2:end),1));)</code><br />
Of course we have to add initial State o(1) probability:<br />
<code>result*InitProb(o(1))</code></p>
<p>But the best way is to use logarithm scale<br />
A more elegant way to count Probability P(Observation|model)was found in PMTK by Kevin Murphy:<br />
see<br />
<code>log=markovLogprob(model,data)</code></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Linux rtl8192se driver (Fedora) by Sergey Kulanov</title>
		<link>http://eng.kulanov.org.ua/archives/179/comment-page-1#comment-10</link>
		<dc:creator>Sergey Kulanov</dc:creator>
		<pubDate>Thu, 24 Mar 2011 05:13:30 +0000</pubDate>
		<guid isPermaLink="false">http://eng.kulanov.org.ua/?p=179#comment-10</guid>
		<description>This bug was reported as https://bugzilla.redhat.com/show_bug.cgi?id=682972

For now it was solved with the update from 23.03.2011 (kde-plasma-networkmanagement-0.9-0.39.20110314.fc14)</description>
		<content:encoded><![CDATA[<p>This bug was reported as <a href="https://bugzilla.redhat.com/show_bug.cgi?id=682972" rel="nofollow">https://bugzilla.redhat.com/show_bug.cgi?id=682972</a></p>
<p>For now it was solved with the update from 23.03.2011 (kde-plasma-networkmanagement-0.9-0.39.20110314.fc14)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Bayes’ Rule by Sergey Kulanov</title>
		<link>http://eng.kulanov.org.ua/archives/85/comment-page-1#comment-9</link>
		<dc:creator>Sergey Kulanov</dc:creator>
		<pubDate>Mon, 20 Sep 2010 05:45:06 +0000</pubDate>
		<guid isPermaLink="false">http://eng.kulanov.org.ua/?p=85#comment-9</guid>
		<description>P(Cause&#124;Effect)=P(Effect&#124;Cause)*P(Cause)/P(Effect)
That is what we have in the influenza case:
What is the probability to catch influenza, if for example, we have a cough:

P(flu&#124;cough)=P(cough&#124;flu)*P(flu)/P(cough)

If we have some epidemic situation so P(flu) dramatically increase and P(flu&#124;cough) also increases.</description>
		<content:encoded><![CDATA[<p>P(Cause|Effect)=P(Effect|Cause)*P(Cause)/P(Effect)<br />
That is what we have in the influenza case:<br />
What is the probability to catch influenza, if for example, we have a cough:</p>
<p>P(flu|cough)=P(cough|flu)*P(flu)/P(cough)</p>
<p>If we have some epidemic situation so P(flu) dramatically increase and P(flu|cough) also increases.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

