<?xml version='1.0' encoding='utf-8' ?>

<rss version='2.0' xmlns:lj='http://www.livejournal.org/rss/lj/1.0/' xmlns:atom10='http://www.w3.org/2005/Atom'>
<channel>
  <title>Blimix</title>
  <link>https://blimix.dreamwidth.org/</link>
  <description>Blimix - Dreamwidth Studios</description>
  <lastBuildDate>Sun, 05 Jun 2022 11:36:06 GMT</lastBuildDate>
  <generator>LiveJournal / Dreamwidth Studios</generator>
  <lj:journal>blimix</lj:journal>
  <lj:journaltype>personal</lj:journaltype>
  <image>
    <url>https://v2.dreamwidth.org/160370/261946</url>
    <title>Blimix</title>
    <link>https://blimix.dreamwidth.org/</link>
    <width>100</width>
    <height>100</height>
  </image>

<item>
  <guid isPermaLink='true'>https://blimix.dreamwidth.org/171055.html</guid>
  <pubDate>Sun, 05 Jun 2022 11:36:06 GMT</pubDate>
  <title>Today&apos;s silliness</title>
  <link>https://blimix.dreamwidth.org/171055.html</link>
  <description>Interviewer:  We need someone with experience at intercepting and decrypting communications.&lt;br /&gt;&lt;br /&gt;Me:  [Smiles.]  I&apos;m kind of a big name in the field.&lt;br /&gt;&lt;br /&gt;Interviewer:  Oh?&lt;br /&gt;&lt;br /&gt;Me:  My name is Eve.&lt;br /&gt;&lt;br /&gt;Interviewer:  ...&lt;br /&gt;&lt;br /&gt;Interviewer:  You&apos;re hired.&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=blimix&amp;ditemid=171055&quot; width=&quot;30&quot; height=&quot;12&quot; alt=&quot;comment count unavailable&quot; style=&quot;vertical-align: middle;&quot;/&gt; comments</description>
  <comments>https://blimix.dreamwidth.org/171055.html</comments>
  <category>humor</category>
  <category>computers</category>
  <lj:mood>silly</lj:mood>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://blimix.dreamwidth.org/151352.html</guid>
  <pubDate>Sat, 15 Dec 2018 00:34:58 GMT</pubDate>
  <title>Adventures and accomplishments at work</title>
  <link>https://blimix.dreamwidth.org/151352.html</link>
  <description>&lt;span class=&quot;cut-wrapper&quot;&gt;&lt;span style=&quot;display: none;&quot; id=&quot;span-cuttag___1&quot; class=&quot;cuttag&quot;&gt;&lt;/span&gt;&lt;b class=&quot;cut-open&quot;&gt;(&amp;nbsp;&lt;/b&gt;&lt;b class=&quot;cut-text&quot;&gt;&lt;a href=&quot;https://blimix.dreamwidth.org/151352.html#cutid1&quot;&gt;Lots of cool stuff I&apos;ve done at work.  Cut for length.&lt;/a&gt;&lt;/b&gt;&lt;b class=&quot;cut-close&quot;&gt;&amp;nbsp;)&lt;/b&gt;&lt;/span&gt;&lt;div style=&quot;display: none;&quot; id=&quot;div-cuttag___1&quot; aria-live=&quot;assertive&quot;&gt;&lt;/div&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=blimix&amp;ditemid=151352&quot; width=&quot;30&quot; height=&quot;12&quot; alt=&quot;comment count unavailable&quot; style=&quot;vertical-align: middle;&quot;/&gt; comments</description>
  <comments>https://blimix.dreamwidth.org/151352.html</comments>
  <category>respect</category>
  <category>math</category>
  <category>human services</category>
  <category>cats</category>
  <category>computers</category>
  <category>poetry</category>
  <lj:mood>accomplished</lj:mood>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://blimix.dreamwidth.org/149634.html</guid>
  <pubDate>Sat, 11 Aug 2018 15:00:08 GMT</pubDate>
  <title>Seeking a program or algorithm.</title>
  <link>https://blimix.dreamwidth.org/149634.html</link>
  <description>A question for computer people:  I have need of a program to optimize something, and its general form seems like a program that must have been written a thousand times already, so I&apos;d like to save some time by not doing it all from scratch.  Any leads (on existing programs or well regarded algorithms) would be appreciated.  (Note that while I can program, I am not experienced in any modern environments.  I wouldn&apos;t even know if what I&apos;m looking for is a standard library function.)&lt;br /&gt;&lt;br /&gt;The program needs to organize a set of roughly sixty elements into five groups.  Each pair of elements has a numerical rating of the desirability of their being in the same group.  Find the grouping that maximizes total desirability.  Complicating matters is that there are three types of elements:  Each group is to have one element of the first type, three of the second type, and eight of the third type.&lt;br /&gt;&lt;br /&gt;Since there&apos;s no practical difference between group 1 and group 5, I could do an end-run around that requirement by running a smaller version of the program, um, 16!/6^5 = 168,168,000 times, once for each possible grouping of the first and second types of elements.  Okay, maybe not.&lt;br /&gt;&lt;br /&gt;I don&apos;t even know whether this is np-hard.  My first visualization of a non-brute-force solution strikes me as way too complicated to bother coding.  Total permutations = 40!/8!^5 * 16!/6^5 = about 1.3 * 10^33, so a brute force program finishing in a day would judge about 1.5 * 10^28 permutations per second.  My computer isn&apos;t quite that fast. &lt;img width=&quot;1&quot; height=&quot;1&quot; src=&quot;http://www.blimix.com/images/line8.gif&quot;&gt;&lt;/img&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=blimix&amp;ditemid=149634&quot; width=&quot;30&quot; height=&quot;12&quot; alt=&quot;comment count unavailable&quot; style=&quot;vertical-align: middle;&quot;/&gt; comments</description>
  <comments>https://blimix.dreamwidth.org/149634.html</comments>
  <category>computers</category>
  <lj:mood>busy</lj:mood>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
</channel>
</rss>
