<?xml version="1.0" encoding="UTF-8"?><rss version="0.92">
<channel>
	<title>Dan&#039;s Thoughts</title>
	<link>http://danboykis.com</link>
	<description>Thinking somewhat carefully</description>
	<lastBuildDate>Thu, 12 Aug 2010 21:28:22 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	<!-- generator="WordPress/3.1-alpha" -->

	<item>
		<title>Converting a regular BIND ZONE to DNSSEC</title>
		<description><![CDATA[Recently I wanted to sign a regular zone in BIND9.7. Google wasn't very helpful so I thought I'd write up a little bit about it here. My /etc/named.conf looks like this: zone &#34;myzone.com&#34; IN &#123; type master; file &#34;/var/named/zones/myzone.com/myzone.com&#34;; notify no; &#125;; I want to keep my dnssec zones in a separate directory. # mkdir [...]]]></description>
		<link>http://danboykis.com/2010/06/converting-a-regular-bind-zone-to-dnssec/</link>
			</item>
	<item>
		<title>Using SVN with Git</title>
		<description><![CDATA[Once I learned Git I never wanted to go back to the days of svn. The only problem is that SVN is used almost in every linux shop I worked for. Luckily there is git-svn. With git-svn I can just import an svn repositories and use git to browse, branch, merge etc. My typical workflow: [...]]]></description>
		<link>http://danboykis.com/2010/05/using-svn-with-git/</link>
			</item>
	<item>
		<title>sin(n) = -1 where n is an integer in radians</title>
		<description><![CDATA[I saw a fun math problem on reddit the other day. find a number n, so that sin(n)=-1, where n is an integer in radians; so sin(270 degrees) doesn't count. Obviously it will never be exactly -1 but close enough for the difference to be lost in rounding. I need the argument of sin function [...]]]></description>
		<link>http://danboykis.com/2010/05/sinn-1-where-n-is-an-integer-in-radians/</link>
			</item>
	<item>
		<title>QMISMF Chap 3</title>
		<description><![CDATA[3-1 3-2 3-3 3-4 3-5 Assume: 3-6 Assume: and 3-7]]></description>
		<link>http://danboykis.com/2009/10/qmismf-chap-3/</link>
			</item>
	<item>
		<title>QMISMF: Chapter 2</title>
		<description><![CDATA[2-1: > (+ 3-i 2+4i) 5+3i > (+ 1+3i 2) 3+3i > (- -5+2i 2+2i) -7 > (+ -2+i 2+2i) +3i > (* 3-i 2+4i) 10+10i > (* 1+3i 2) 2+6i > (* 0+i 1+3i) -3+i > (* -5+2i 2+3i) -16-11i > (* 2+3i -2+3i) -13 > (* 2+3i 3+2i) +13i 2-2: 2-3: 2-4: 2-5: [...]]]></description>
		<link>http://danboykis.com/2009/10/qmismf-chapter-2/</link>
			</item>
	<item>
		<title>Exercise 2.42 of SICP</title>
		<description><![CDATA[Exercise 2.42: The "eight-queens puzzle'' asks how to place eight queens on a chessboard so that no queen is in check from any other (i.e., no two queens are in the same row, column, or diagonal). One possible solution is shown in figure 2.8. One way to solve the puzzle is to work across the [...]]]></description>
		<link>http://danboykis.com/2009/08/exercise-2-42-of-sicp/</link>
			</item>
	<item>
		<title>Exercise 2.41 of SICP</title>
		<description><![CDATA[Exercise 2.41: Write a procedure to find all ordered triples of distinct positive integers i, j, and k less than or equal to a given integer n that sum to a given integer s. &#40;define &#40;filter pred seq&#41; &#40;cond &#40;&#40;null? seq&#41; '&#40;&#41;&#41; &#40;&#40;pred &#40;car seq&#41;&#41; &#40;cons &#40;car seq&#41; &#40;filter pred &#40;cdr seq&#41;&#41;&#41;&#41; &#40;else &#40;filter pred [...]]]></description>
		<link>http://danboykis.com/2009/08/exercise-2-41-of-sicp/</link>
			</item>
	<item>
		<title>Exercise 2.40 of SICP</title>
		<description><![CDATA[Exercise 2.40: Define a procedure unique-pairs that, given an integer n, generates the sequence of pairs with . Use unique-pairs to simplify the definition of prime-sum-pairs given above. Using Miller-Rabin primality test as well as taking advantage of some lexical scoping here is the solution: &#40;define &#40;prime? n times&#41; &#40;define &#40;miller-rabin-test n&#41; &#40;define &#40;random n&#41; [...]]]></description>
		<link>http://danboykis.com/2009/08/exercise-2-40-of-sicp/</link>
			</item>
	<item>
		<title>Exercise 2.39 of SICP</title>
		<description><![CDATA[Exercise 2.39: Complete the following definitions of reverse (exercise 2.18) in terms of fold-right and fold-left from exercise 2.38: &#40;define &#40;reverse sequence&#41; &#40;fold-right &#40;lambda &#40;x y&#41; &#60;??&#62;&#41; nil sequence&#41;&#41; &#40;define &#40;reverse sequence&#41; &#40;fold-left &#40;lambda &#40;x y&#41; &#60;??&#62;&#41; nil sequence&#41;&#41; &#40;define &#40;fold-right fn init-value items&#41; &#40;if &#40;null? items&#41; init-value &#40;fn &#40;car items&#41; &#40;fold-right fn init-value &#40;cdr [...]]]></description>
		<link>http://danboykis.com/2009/08/exercise-2-39-of-sicp/</link>
			</item>
	<item>
		<title>Exercise 2.38 of SICP</title>
		<description><![CDATA[Exercise 2.38: The accumulate procedure is also known as fold-right, because it combines the first element of the sequence with the result of combining all the elements to the right. There is also a fold-left, which is similar to fold-right, except that it combines elements working in the opposite direction: &#40;define &#40;fold-left op initial sequence&#41; [...]]]></description>
		<link>http://danboykis.com/2009/08/exercise-2-38-of-sicp/</link>
			</item>
</channel>
</rss>
