<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for What can scientific models tell us about the world?</title>
	<atom:link href="http://playingwithmodels.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://playingwithmodels.wordpress.com</link>
	<description>What can mathematical models tell us about the world?</description>
	<lastBuildDate>Wed, 05 Dec 2012 16:01:01 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>Comment on Are Android unlock patterns as secure as numeric PINs? by Milen</title>
		<link>http://playingwithmodels.wordpress.com/2010/04/14/andorid_unlock_patterns/#comment-392</link>
		<dc:creator><![CDATA[Milen]]></dc:creator>
		<pubDate>Wed, 05 Dec 2012 16:01:01 +0000</pubDate>
		<guid isPermaLink="false">http://playingwithmodels.wordpress.com/?p=189#comment-392</guid>
		<description><![CDATA[If you mean no general solution at all versus no general solution has been found yet, that would be a real shame.  There are some pretty cool symmetries there.]]></description>
		<content:encoded><![CDATA[<p>If you mean no general solution at all versus no general solution has been found yet, that would be a real shame.  There are some pretty cool symmetries there.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Are Android unlock patterns as secure as numeric PINs? by Alexander Lobkovsky Meitiv</title>
		<link>http://playingwithmodels.wordpress.com/2010/04/14/andorid_unlock_patterns/#comment-391</link>
		<dc:creator><![CDATA[Alexander Lobkovsky Meitiv]]></dc:creator>
		<pubDate>Wed, 05 Dec 2012 14:53:21 +0000</pubDate>
		<guid isPermaLink="false">http://playingwithmodels.wordpress.com/?p=189#comment-391</guid>
		<description><![CDATA[Unfortunately, there is no general solution.  The search algorithm would have to be modified for each new geometry.  Also, there is no analytical solution even for the simplest geometries.]]></description>
		<content:encoded><![CDATA[<p>Unfortunately, there is no general solution.  The search algorithm would have to be modified for each new geometry.  Also, there is no analytical solution even for the simplest geometries.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Are Android unlock patterns as secure as numeric PINs? by Milen</title>
		<link>http://playingwithmodels.wordpress.com/2010/04/14/andorid_unlock_patterns/#comment-390</link>
		<dc:creator><![CDATA[Milen]]></dc:creator>
		<pubDate>Wed, 05 Dec 2012 08:09:05 +0000</pubDate>
		<guid isPermaLink="false">http://playingwithmodels.wordpress.com/?p=189#comment-390</guid>
		<description><![CDATA[Hey guys - I&#039;m just interested in the combinatorial solution to this problem, so Alex if you (or anyone else that may have the solution) can post it I&#039;d be grateful.  I was also wondering if we extrapolate the rules, but instead apply them to NxN squares of nodes, what would be the general solution? Finally, what would happen if you tweaked the geometry so it&#039;s not arranged in a square, but a rectangle or a straightedge, or some other weird shape - would that affect the general solution?]]></description>
		<content:encoded><![CDATA[<p>Hey guys &#8211; I&#8217;m just interested in the combinatorial solution to this problem, so Alex if you (or anyone else that may have the solution) can post it I&#8217;d be grateful.  I was also wondering if we extrapolate the rules, but instead apply them to NxN squares of nodes, what would be the general solution? Finally, what would happen if you tweaked the geometry so it&#8217;s not arranged in a square, but a rectangle or a straightedge, or some other weird shape &#8211; would that affect the general solution?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Are Android unlock patterns as secure as numeric PINs? by Vincenzo Alcamo</title>
		<link>http://playingwithmodels.wordpress.com/2010/04/14/andorid_unlock_patterns/#comment-315</link>
		<dc:creator><![CDATA[Vincenzo Alcamo]]></dc:creator>
		<pubDate>Thu, 07 Jun 2012 15:41:39 +0000</pubDate>
		<guid isPermaLink="false">http://playingwithmodels.wordpress.com/?p=189#comment-315</guid>
		<description><![CDATA[The number of valid patters of at least 4 dots is 389112.
The result can be &quot;easily&quot; achieved using SQL with ORACLE DB:

create table android(id varchar2(9), primary key (id));
insert into android
with nums as (select rownum d from dual connect by rownum &lt;= 9)
select seq from (
select n1.d &#124;&#124; n2.d &#124;&#124; n3.d &#124;&#124; n4.d &#124;&#124; n5.d &#124;&#124; n6.d &#124;&#124; n7.d &#124;&#124; n8.d &#124;&#124; n9.d seq from nums n1
inner join nums n2 on n2.d not in (n1.d)
inner join nums n3 on n3.d not in (n1.d, n2.d)
inner join nums n4 on n4.d not in (n1.d, n2.d, n3.d)
inner join nums n5 on n5.d not in (n1.d, n2.d, n3.d, n4.d)
inner join nums n6 on n6.d not in (n1.d, n2.d, n3.d, n4.d, n5.d)
inner join nums n7 on n7.d not in (n1.d, n2.d, n3.d, n4.d, n5.d, n6.d)
inner join nums n8 on n8.d not in (n1.d, n2.d, n3.d, n4.d, n5.d, n6.d, n7.d)
inner join nums n9 on n9.d not in (n1.d, n2.d, n3.d, n4.d, n5.d, n6.d, n7.d, n8.d)
) a where not regexp_like(seq, &#039;13.*2&#124;17.*4&#124;19.*5&#124;28.*5&#124;31.*2&#124;37.*5&#124;39.*6&#124;64.*5&#124;93.*6&#124;97.*8&#124;91.*5&#124;82.*5&#124;73.*5&#124;71.*4&#124;79.*8&#124;46.*5&#039;);
select (select count(distinct substr(id,1,9)) from android) +(select count(distinct substr(id,1,8)) from android)
+(select count(distinct substr(id,1,7)) from android) +(select count(distinct substr(id,1,6)) from android)
+(select count(distinct substr(id,1,5)) from android) +(select count(distinct substr(id,1,4)) from android)
as num from dual;]]></description>
		<content:encoded><![CDATA[<p>The number of valid patters of at least 4 dots is 389112.<br />
The result can be &#8220;easily&#8221; achieved using SQL with ORACLE DB:</p>
<p>create table android(id varchar2(9), primary key (id));<br />
insert into android<br />
with nums as (select rownum d from dual connect by rownum &lt;= 9)<br />
select seq from (<br />
select n1.d || n2.d || n3.d || n4.d || n5.d || n6.d || n7.d || n8.d || n9.d seq from nums n1<br />
inner join nums n2 on n2.d not in (n1.d)<br />
inner join nums n3 on n3.d not in (n1.d, n2.d)<br />
inner join nums n4 on n4.d not in (n1.d, n2.d, n3.d)<br />
inner join nums n5 on n5.d not in (n1.d, n2.d, n3.d, n4.d)<br />
inner join nums n6 on n6.d not in (n1.d, n2.d, n3.d, n4.d, n5.d)<br />
inner join nums n7 on n7.d not in (n1.d, n2.d, n3.d, n4.d, n5.d, n6.d)<br />
inner join nums n8 on n8.d not in (n1.d, n2.d, n3.d, n4.d, n5.d, n6.d, n7.d)<br />
inner join nums n9 on n9.d not in (n1.d, n2.d, n3.d, n4.d, n5.d, n6.d, n7.d, n8.d)<br />
) a where not regexp_like(seq, &#039;13.*2|17.*4|19.*5|28.*5|31.*2|37.*5|39.*6|64.*5|93.*6|97.*8|91.*5|82.*5|73.*5|71.*4|79.*8|46.*5&#039;);<br />
select (select count(distinct substr(id,1,9)) from android) +(select count(distinct substr(id,1,8)) from android)<br />
+(select count(distinct substr(id,1,7)) from android) +(select count(distinct substr(id,1,6)) from android)<br />
+(select count(distinct substr(id,1,5)) from android) +(select count(distinct substr(id,1,4)) from android)<br />
as num from dual;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Are Android unlock patterns as secure as numeric PINs? by jsz</title>
		<link>http://playingwithmodels.wordpress.com/2010/04/14/andorid_unlock_patterns/#comment-292</link>
		<dc:creator><![CDATA[jsz]]></dc:creator>
		<pubDate>Sun, 13 May 2012 11:08:01 +0000</pubDate>
		<guid isPermaLink="false">http://playingwithmodels.wordpress.com/?p=189#comment-292</guid>
		<description><![CDATA[Forgot the link... https://gist.github.com/2687787]]></description>
		<content:encoded><![CDATA[<p>Forgot the link&#8230; <a href="https://gist.github.com/2687787" rel="nofollow">https://gist.github.com/2687787</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Are Android unlock patterns as secure as numeric PINs? by jsz</title>
		<link>http://playingwithmodels.wordpress.com/2010/04/14/andorid_unlock_patterns/#comment-291</link>
		<dc:creator><![CDATA[jsz]]></dc:creator>
		<pubDate>Sun, 13 May 2012 11:07:19 +0000</pubDate>
		<guid isPermaLink="false">http://playingwithmodels.wordpress.com/?p=189#comment-291</guid>
		<description><![CDATA[The nodes that can connect are a little more dynamic. For example, you can go from 1 to 4 to 0 to 2, i.e. 0 to 2 is possible, which is not allowed by the &quot;edges&quot; array in your code.

Here is my try. It&#039;s almost a direct translate of your code from python to c. You simply have to take the current &quot;visited&quot; table into account.

The result is 389112.]]></description>
		<content:encoded><![CDATA[<p>The nodes that can connect are a little more dynamic. For example, you can go from 1 to 4 to 0 to 2, i.e. 0 to 2 is possible, which is not allowed by the &#8220;edges&#8221; array in your code.</p>
<p>Here is my try. It&#8217;s almost a direct translate of your code from python to c. You simply have to take the current &#8220;visited&#8221; table into account.</p>
<p>The result is 389112.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Are Android unlock patterns as secure as numeric PINs? by Alexander Lobkovsky Meitiv</title>
		<link>http://playingwithmodels.wordpress.com/2010/04/14/andorid_unlock_patterns/#comment-273</link>
		<dc:creator><![CDATA[Alexander Lobkovsky Meitiv]]></dc:creator>
		<pubDate>Wed, 28 Mar 2012 18:53:11 +0000</pubDate>
		<guid isPermaLink="false">http://playingwithmodels.wordpress.com/?p=189#comment-273</guid>
		<description><![CDATA[You can install a recovery on Samsung phones by putting the phone into download mode and flashing the recovery using heimdall or odin.]]></description>
		<content:encoded><![CDATA[<p>You can install a recovery on Samsung phones by putting the phone into download mode and flashing the recovery using heimdall or odin.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Are Android unlock patterns as secure as numeric PINs? by David Barr</title>
		<link>http://playingwithmodels.wordpress.com/2010/04/14/andorid_unlock_patterns/#comment-272</link>
		<dc:creator><![CDATA[David Barr]]></dc:creator>
		<pubDate>Wed, 28 Mar 2012 18:51:05 +0000</pubDate>
		<guid isPermaLink="false">http://playingwithmodels.wordpress.com/?p=189#comment-272</guid>
		<description><![CDATA[But how do you install Clockworkmod without getting past the lock screen or wiping the data from the phone?

There was another article on Slashdot yesterday about a company that can break phone security, but the article doesn&#039;t say whether or not they can get past pattern protected phones:

http://www.forbes.com/sites/andygreenberg/2012/03/27/heres-how-law-enforcement-cracks-your-iphones-security-code-video/]]></description>
		<content:encoded><![CDATA[<p>But how do you install Clockworkmod without getting past the lock screen or wiping the data from the phone?</p>
<p>There was another article on Slashdot yesterday about a company that can break phone security, but the article doesn&#8217;t say whether or not they can get past pattern protected phones:</p>
<p><a href="http://www.forbes.com/sites/andygreenberg/2012/03/27/heres-how-law-enforcement-cracks-your-iphones-security-code-video/" rel="nofollow">http://www.forbes.com/sites/andygreenberg/2012/03/27/heres-how-law-enforcement-cracks-your-iphones-security-code-video/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Are Android unlock patterns as secure as numeric PINs? by Alexander Lobkovsky Meitiv</title>
		<link>http://playingwithmodels.wordpress.com/2010/04/14/andorid_unlock_patterns/#comment-271</link>
		<dc:creator><![CDATA[Alexander Lobkovsky Meitiv]]></dc:creator>
		<pubDate>Wed, 28 Mar 2012 14:08:42 +0000</pubDate>
		<guid isPermaLink="false">http://playingwithmodels.wordpress.com/?p=189#comment-271</guid>
		<description><![CDATA[Clearly these so called &quot;experts&quot; don&#039;t know what they are doing.  All you have to do is install Clockworkmod recovery and then mount &quot;data&quot; from it to have complete access to the partition.  To my knowledge the databases on the /data partition are not encrypted by default.]]></description>
		<content:encoded><![CDATA[<p>Clearly these so called &#8220;experts&#8221; don&#8217;t know what they are doing.  All you have to do is install Clockworkmod recovery and then mount &#8220;data&#8221; from it to have complete access to the partition.  To my knowledge the databases on the /data partition are not encrypted by default.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Are Android unlock patterns as secure as numeric PINs? by Ben</title>
		<link>http://playingwithmodels.wordpress.com/2010/04/14/andorid_unlock_patterns/#comment-270</link>
		<dc:creator><![CDATA[Ben]]></dc:creator>
		<pubDate>Tue, 27 Mar 2012 22:12:57 +0000</pubDate>
		<guid isPermaLink="false">http://playingwithmodels.wordpress.com/?p=189#comment-270</guid>
		<description><![CDATA[Though there may be fewer available combinations of patterns than PINs, the system is substantially harder to crack than a numerical PIN. Here&#039;s a piece of news from a couple of weeks ago showing that this years-old technology has stumped the FBI. http://m.wired.com/threatlevel/2012/03/fbi-android-phone-lock/]]></description>
		<content:encoded><![CDATA[<p>Though there may be fewer available combinations of patterns than PINs, the system is substantially harder to crack than a numerical PIN. Here&#8217;s a piece of news from a couple of weeks ago showing that this years-old technology has stumped the FBI. <a href="http://m.wired.com/threatlevel/2012/03/fbi-android-phone-lock/" rel="nofollow">http://m.wired.com/threatlevel/2012/03/fbi-android-phone-lock/</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
