<?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>Northeast Ohio Freelance Web Developer</title>
	<atom:link href="http://www.mikestratton.net/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.mikestratton.net</link>
	<description>Ohio Freelance Web Developer</description>
	<lastBuildDate>Thu, 09 Feb 2012 21:17:43 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
<xhtml:meta xmlns:xhtml="http://www.w3.org/1999/xhtml" name="robots" content="noindex" />
		<item>
		<title>C++ Mortgage Payment Calculator</title>
		<link>http://www.mikestratton.net/2012/02/c-mortgage-payment-calculator/</link>
		<comments>http://www.mikestratton.net/2012/02/c-mortgage-payment-calculator/#comments</comments>
		<pubDate>Thu, 09 Feb 2012 20:53:04 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[learn to program]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=5156</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2012/02/c-mortgage-payment-calculator/">C++ Mortgage Payment Calculator</a></p><p>C++ College Lab Assignment<br />
C++ college lab assignment for CIS 130 C++ course.<br />
C++ Mortgage Payment Calculator {Code}<br />
//*****************************************************************<br />
 // Mortgage Payment Calculator program<br />
 // This program determines the monthly payments on a mortgage given<br />
 // the loan amount, the yearly interest, and the number of years.<br />
 //*****************************************************************<br />
#include &#60;iostream&#62;      // Access cout<br />
#include &#60;cmath&#62;           // Access power function<br />
#include &#60;iomanip&#62;       // Access manipulators<br />
using namespace std;<br />
const float LOAN_AMOUNT = 500000.00;   // Amount of the ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2012/02/c-mortgage-payment-calculator/">C++ Mortgage Payment Calculator</a></p><h3>C++ College Lab Assignment</h3>
<p>C++ college lab assignment for CIS 130 C++ course.</p>
<h3>C++ Mortgage Payment Calculator {Code}</h3>
<p><span style="color: #ff6600;">//*****************************************************************</span><br />
<span style="color: #ff6600;"> // Mortgage Payment Calculator program</span><br />
<span style="color: #ff6600;"> // This program determines the monthly payments on a mortgage given</span><br />
<span style="color: #ff6600;"> // the loan amount, the yearly interest, and the number of years.</span><br />
<span style="color: #ff6600;"> //*****************************************************************</span></p>
<p><span style="color: #993300;">#include &lt;iostream&gt;</span>      <span style="color: #ff6600;">// Access cout</span><br />
<span style="color: #993300;">#include &lt;cmath&gt;</span>           <span style="color: #ff6600;">// Access power function</span><br />
<span style="color: #993300;">#include &lt;iomanip&gt;      </span> <span style="color: #ff6600;">// Access manipulators</span><br />
<span style="color: #800080;">using namespace</span> std;</p>
<p><span style="color: #800080;">const float</span> LOAN_AMOUNT = 500000.00;   <span style="color: #ff6600;">// Amount of the loan</span><br />
<span style="color: #800080;">const float</span> YEARLY_INTEREST = 5.5;                                                  <span style="color: #ff6600;">// Yearly interest rate</span><br />
<span style="color: #800080;">const int</span> NUMBER_OF_YEARS = 30;                                                  <span style="color: #ff6600;">// Number of years</span></p>
<p><span style="color: #800080;">int</span> main()<br />
{<br />
<span style="color: #ff6600;">// local variables</span><br />
<span style="color: #800080;">float</span> monthlyInterest; <span style="color: #ff6600;">// Monthly interest rate</span><br />
<span style="color: #800080;">int</span> numberOfPayments; <span style="color: #ff6600;">// Total number of payments</span><br />
<span style="color: #800080;">float</span> payment; <span style="color: #ff6600;">// Monthly payment</span></p>
<p><span style="color: #ff6600;">// Calculate values</span><br />
monthlyInterest = (YEARLY_INTEREST / 100) / 12; <span style="color: #ff6600;">// change applied to meet exercise 3 requirements.</span><br />
numberOfPayments = NUMBER_OF_YEARS * 12;<br />
payment = (LOAN_AMOUNT *<br />
pow(monthlyInterest + 1, numberOfPayments)<br />
* monthlyInterest)/( pow(monthlyInterest + 1,<br />
numberOfPayments) &#8211; 1 );</p>
<p><span style="color: #ff6600;">// Output results</span><br />
cout &lt;&lt; fixed &lt;&lt; setprecision(2) &lt;&lt; <span style="color: #339966;">&#8220;For a loan amount of  &#8221;</span><br />
&lt;&lt; LOAN_AMOUNT &lt;&lt; <span style="color: #339966;">&#8221; with an interest rate of &#8220;</span><br />
&lt;&lt; YEARLY_INTEREST &lt;&lt; <span style="color: #339966;">&#8221; and a &#8220;</span> &lt;&lt; NUMBER_OF_YEARS<br />
&lt;&lt; <span style="color: #339966;">&#8221; year mortgage, &#8220;</span> &lt;&lt; endl;<br />
cout &lt;&lt; <span style="color: #339966;">&#8221; your monthly payments are $&#8221;</span> &lt;&lt; payment<br />
&lt;&lt;<span style="color: #339966;"> &#8220;.&#8221;</span> &lt;&lt; endl;<br />
<span style="color: #800080;">return</span> 0;<br />
}</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2012/02/c-mortgage-payment-calculator/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Six Trigonometric Functions in Terms of Others</title>
		<link>http://www.mikestratton.net/2012/01/six-trigonometric-functions-in-terms-of-others/</link>
		<comments>http://www.mikestratton.net/2012/01/six-trigonometric-functions-in-terms-of-others/#comments</comments>
		<pubDate>Tue, 17 Jan 2012 10:18:53 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Advanced Mathematics]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[advanced mathematics]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=5067</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2012/01/six-trigonometric-functions-in-terms-of-others/">Six Trigonometric Functions in Terms of Others</a></p><p> Trigonometric Identities<br />
<br />
&#160;<br />
Image courtesy of Wikipedia<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2012/01/six-trigonometric-functions-in-terms-of-others/">Six Trigonometric Functions in Terms of Others</a></p><h2> Trigonometric Identities</h2>
<p><a href="http://www.mikestratton.net/assets/trigonometric_identities-six_trigonometric_functions_in_terms_of_any_others.png" target="_blank"><img class="alignnone  wp-image-5068" title="trigonometric_identities-six_trigonometric_functions_in_terms_of_any_others" src="http://www.mikestratton.net/assets/trigonometric_identities-six_trigonometric_functions_in_terms_of_any_others-1024x554.png" alt="" width="614" height="332" /></a></p>
<p>&nbsp;</p>
<p>Image courtesy of <a href="http://en.wikipedia.org/wiki/List_of_trigonometric_identities" target="_blank">Wikipedia</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2012/01/six-trigonometric-functions-in-terms-of-others/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Program Development Cycle</title>
		<link>http://www.mikestratton.net/2012/01/program-development-cycle/</link>
		<comments>http://www.mikestratton.net/2012/01/program-development-cycle/#comments</comments>
		<pubDate>Mon, 09 Jan 2012 07:24:27 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[Visual Basic]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[mountain state university]]></category>
		<category><![CDATA[visual basic]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4905</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2012/01/program-development-cycle/">Program Development Cycle</a></p><p>Performing a Task on the Computer<br />
Step 1:<br />
What is the ouput? Exactly what will the task produce?<br />
Step 2:<br />
Identify the data. What input is necessary to produce the output?<br />
Step 3:<br />
Determine how to process the input to obtain the desired output. What formulas or ways of doing things can be used to obtain the output?<br />
Program Development Cycle &#38; Software Development Life Cycle<br />
The programming development cycle is a process of steps, used by programmers to more efficiently ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2012/01/program-development-cycle/">Program Development Cycle</a></p><h3>Performing a Task on the Computer</h3>
<p><strong>Step 1:<br />
</strong>What is the ouput? Exactly what will the task produce?</p>
<p><strong>Step 2:<br />
</strong>Identify the data. What input is necessary to produce the output?</p>
<p><strong>Step 3:<br />
</strong>Determine how to process the input to obtain the desired output. What formulas or ways of doing things can be used to obtain the output?</p>
<div class="hr_shadow" /></div><h3>Program Development Cycle &amp; Software Development Life Cycle</h3>
<p>The programming development cycle is a process of steps, used by programmers to more efficiently manage their time in designing error-free programs that produce the desired output.</p>
<p>The program development cycle correlates to the Software Development Life Cycle, as the Program Development Cycle defines each stage, and different Software Development Life Cycle models have specific methods of using each stage.</p>
<p>Each step in the Program Development Cycle is utilized dependent on the programmers chosen Software Development Life Cycle method. In the Agile Software Development Life Cycle, less time is spent in the design phase, and more time is spent in the coding phase, and the process is not a step by step process; but rather, the process is iterative in which specific components are designed to meet output requirements.  The Waterfall Software Development Life Cycle more closely aligns itself with the step by step process defined in the program development cycle, as each phase is completed before sequentially moving on to the next stage.</p>
<p>Exmaples of Software Development Life Cycle Models:</p>
<ul>
<li>Waterfall, V-Model, Component Assembly, and Chaos Models</li>
<li>Software Prototyping and the Spiral Model</li>
<li>Rapid Application Development (RAD) Model</li>
<li>Agile Model &amp; Extreme Programming</li>
<li>Rational Unified Process</li>
</ul>
<div class="hr_shadow" /></div><h3>Program Development Cycle</h3>
<ol>
<li><strong>Analyze &#8211; Define the problem.<br />
</strong>You must have a clear idea of what data (or input) is given and the relationship between the input and the desired output.</li>
<li><strong>Design &#8211; Plan the solution to the problem.<br />
</strong>Find a logical sequence of precises steps that solve the problem (aka the algorithm). The logical plan may include flowcharts, psuedocode, and top-down charts.</li>
<li><strong>Design the interface &#8211; Select objects (text boxes, buttons, etc.).<br />
</strong>Determine how to obtain input and how the output will be displayed. Objects are created to recieve input and display output. Appropriate menus, buttons, etc. are created to allow user to control the program.</li>
<li><strong>Code &#8211; Translate algorithm into a programming language.<br />
</strong>During this stage that program is written.</li>
<li><strong>Test and debug &#8211; Locate and remove errors in program.<br />
</strong>Testing is the process for finding errors. Debugging is  the process for correcting errors.</li>
<li><strong>Complete the documentation &#8211; Organize all materials that describes the program.<br />
</strong>Documentation is necessarry to allow another programmer or non-programmer to understand the program. Internal documentation, known as comments, are created to assist a programmer. An instruction manual is created for the non-programmer. Documentation should be done during the coding stage.</li>
</ol>
<p>&nbsp;</p>
<p>References:</p>
<p>Schneider, D. (2011). An Introduction to Programming Using Visual Basic 2010(8th ed.). Upper Saddle River, NJ: Pearson Higher Education.</p>
<p>Association for Computing Machinery, ElementK Training (2010). Introduction to Software Life Cycle Models.  Retrieved from <a href="https://knowledge.elementk.com/" target="_blank">https://knowledge.elementk.com/</a> on January 9, 2012</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2012/01/program-development-cycle/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Six Trigonometric Functions</title>
		<link>http://www.mikestratton.net/2012/01/six-trigonometric-functions/</link>
		<comments>http://www.mikestratton.net/2012/01/six-trigonometric-functions/#comments</comments>
		<pubDate>Sun, 08 Jan 2012 10:52:04 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Advanced Mathematics]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[advanced mathematics]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4891</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2012/01/six-trigonometric-functions/">Six Trigonometric Functions</a></p><p>Trigonometry Mnemonic<br />
&#8220;Sohcahtoa, the Indian princess of Trigonometry&#8220;<br />
SOH<br />
sin θ = opposite/hypotenuse<br />
CAH<br />
cos θ = adjacent/hypotenuse<br />
TOA<br />
tan θ = opposite/adjacent<br />
Basic Trigonometry Videos:<br />
Basic Trigonometry : Introduction to trigonometry<br />
http://www.khanacademy.org/video/basic-trigonometry<br />
Basic Trigonometry II: A few more examples using SOH CAH TOA<br />
http://www.khanacademy.org/video/basic-trigonometry-ii<br />
Radians and degrees : What a radian is. Converting radians to degrees and vice versa.<br />
http://www.khanacademy.org/video/radians-and-degrees<br />
Using Trig Functions : Using Trigonometric functions to solve the sides of a right triangle<br />
http://www.khanacademy.org/video/using-trig-functions<br />
Using Trig Functions ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2012/01/six-trigonometric-functions/">Six Trigonometric Functions</a></p><h3><strong>Trigonometry Mnemonic</strong></h3>
<p>&#8220;<em>Sohcahtoa, the Indian princess of Trigonometry</em>&#8220;</p>
<p>SOH<br />
sin θ = opposite/hypotenuse</p>
<p>CAH<br />
cos θ = adjacent/hypotenuse</p>
<p>TOA<br />
tan θ = opposite/adjacent</p>
<h3><strong>Basic Trigonometry Videos:</strong></h3>
<p>Basic Trigonometry : Introduction to trigonometry<br />
<a href="http://www.khanacademy.org/video/basic-trigonometry" target="_blank">http://www.khanacademy.org/video/basic-trigonometry</a></p>
<p>Basic Trigonometry II: A few more examples using SOH CAH TOA<br />
<a href="http://www.khanacademy.org/video/basic-trigonometry-ii" target="_blank">http://www.khanacademy.org/video/basic-trigonometry-ii</a></p>
<p>Radians and degrees : What a radian is. Converting radians to degrees and vice versa.<br />
<a href="http://www.khanacademy.org/video/radians-and-degrees" target="_blank">http://www.khanacademy.org/video/radians-and-degrees</a></p>
<p>Using Trig Functions : Using Trigonometric functions to solve the sides of a right triangle<br />
<a href="http://www.khanacademy.org/video/using-trig-functions" target="_blank">http://www.khanacademy.org/video/using-trig-functions</a></p>
<p>Using Trig Functions Part II<br />
<a href="http://www.khanacademy.org/video/using-trig-functions-part-ii" target="_blank">http://www.khanacademy.org/video/using-trig-functions-part-ii</a></p>
<p>The unit circle definition of trigonometric function<br />
<a href="http://www.khanacademy.org/video/the-unit-circle-definition-of-trigonometric-function">http://www.khanacademy.org/video/the-unit-circle-definition-of-trigonometric-function</a></p>
<p>Unit Circle Definition of Trig Functions<br />
<a href="http://www.khanacademy.org/video/unit-circle-definition-of-trig-functions" target="_blank">http://www.khanacademy.org/video/unit-circle-definition-of-trig-functions</a></p>
<p>&nbsp;</p>
<p><strong>Definition I</strong><br />
If <em>θ</em> is an angle in standard position, and the point (x,y) is any point on the terminal side of <em>θ</em> other than the origin, then the six trigonometric functions of angle <em>θ</em> are defined as follows:</p>
<table style="width: auto;" border="0">
<tbody>
<tr>
<td><strong>Function</strong></td>
<td></td>
<td style="text-align: center;"><strong>           Abbreviation           </strong></td>
<td></td>
<td style="text-align: center;"><strong><em>       Definition       </em></strong></td>
</tr>
<tr>
<td>The sine of <em>θ      </em></td>
<td>   =</td>
<td style="text-align: center;">sin <em>θ</em></td>
<td>     =</td>
<td style="text-align: center;">y/r</td>
</tr>
<tr>
<td>The cosine of <em>θ</em></td>
<td>   =</td>
<td style="text-align: center;">cos <em>θ</em></td>
<td>     =</td>
<td style="text-align: center;">x/r</td>
</tr>
<tr>
<td>The tangent of <em>θ</em></td>
<td>   =</td>
<td style="text-align: center;">tan <em>θ</em></td>
<td>     =</td>
<td style="text-align: center;">y/x (x ≠ 0)</td>
</tr>
<tr>
<td>The cotangent of <em>θ         </em></td>
<td>   =</td>
<td style="text-align: center;"><em>cot <em>θ</em></em></td>
<td>     =</td>
<td style="text-align: center;">x/y (y ≠ 0)</td>
</tr>
<tr>
<td>The secant of <em>θ</em></td>
<td>   =</td>
<td style="text-align: center;">sec <em>θ</em></td>
<td>     =</td>
<td style="text-align: center;">r/x (x ≠ 0)</td>
</tr>
<tr>
<td>The cosecant of <em>θ</em></td>
<td>   =</td>
<td style="text-align: center;">csc <em>θ</em></td>
<td>     =</td>
<td style="text-align: center;">r/y (y ≠ 0)</td>
</tr>
</tbody>
</table>
<p>where x<sup>2</sup> + y<sup>2</sup> = r<sup>2</sup>, or r = √x<sup>2</sup> + y<sup>2</sup>.&gt;<br />
That is, <em>r</em> is the distance from the origin to (x,y)</p>
<div class="hr_shadow" /></div><p>The symbol <strong><em>θ</em></strong> is called &#8220;theta&#8221; (pronouced &#8216;thayta&#8217;).<br />
Theta (<strong> <em>θ</em></strong> )  is the eighth letter in the greek alphabet and is used in trigonometry as a representation of an angle measurement.</p>
<div class="hr_shadow" /></div><p>Reference:<br />
McKeague, C. and Turner, M. (2008). Trigonometry (6th ed.). Belmont, CA: Brooks/Cole, Cengage Learning</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2012/01/six-trigonometric-functions/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Android Activity Lifecycle</title>
		<link>http://www.mikestratton.net/2011/12/android-activity-lifecycle/</link>
		<comments>http://www.mikestratton.net/2011/12/android-activity-lifecycle/#comments</comments>
		<pubDate>Thu, 22 Dec 2011 12:37:47 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[android]]></category>
		<category><![CDATA[java]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4879</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/12/android-activity-lifecycle/">Android Activity Lifecycle</a></p><p>Android Visualization Lab &#8211; University of California, Berkeley<br />
&#8220;Like HTML webpages, Android provides functionality for setting up and tearing down. HTML provides the ability to respond to events through triggers like onLoad and onUnload. Android provides eight such methods, each to respond to a very specific situation.&#8221;<br />
(Berkeley, University of California retrieved from:<br />
 http://vis.berkeley.edu/courses/cs160-sp08/wiki/index.php/Getting_Started_with_Android 12/22/2011)<br />
Android API Reference<br />
http://code.google.com/android/reference/android/app/Activity.html<br />
Android Package Index<br />
http://developer.android.com/reference/packages.html<br />
Android Class Index<br />
http://developer.android.com/reference/classes.html<br />
Android Download<br />
http://developer.android.com/sdk/index.html<br />
Android Videos<br />
http://developer.android.com/videos/<br />
Android Developers Guide<br />
http://developer.android.com/guide<br />
Android Market<br ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/12/android-activity-lifecycle/">Android Activity Lifecycle</a></p><h3>Android Visualization Lab &#8211; University of California, Berkeley</h3>
<p>&#8220;Like HTML webpages, Android provides functionality for setting up and tearing down. HTML provides the ability to respond to events through triggers like onLoad and onUnload. Android provides eight such methods, each to respond to a very specific situation.&#8221;<br />
<em>(Berkeley, University of California retrieved from:</em><br />
<em> <a href="http://vis.berkeley.edu/courses/cs160-sp08/wiki/index.php/Getting_Started_with_Android" target="_blank">http://vis.berkeley.edu/courses/cs160-sp08/wiki/index.php/Getting_Started_with_Android</a> 12/22/2011)</em></p>
<h3>Android API Reference</h3>
<p><a href="http://code.google.com/android/reference/android/app/Activity.html" target="_blank">http://code.google.com/android/reference/android/app/Activity.html</a></p>
<h3>Android Package Index</h3>
<p><a href="http://developer.android.com/reference/packages.html">http://developer.android.com/reference/packages.html</a></p>
<h3>Android Class Index</h3>
<p><a href="http://developer.android.com/reference/classes.html" target="_blank">http://developer.android.com/reference/classes.html</a></p>
<h3>Android Download</h3>
<p><a href="http://developer.android.com/sdk/index.html" target="_blank">http://developer.android.com/sdk/index.html</a></p>
<h3>Android Videos</h3>
<p><a href="http://developer.android.com/videos/" target="_blank">http://developer.android.com/videos/</a></p>
<h3>Android Developers Guide</h3>
<p><a href="http://developer.android.com/guide" target="_blank">http://developer.android.com/guide</a></p>
<h3>Android Market</h3>
<p><a href="https://market.android.com/" target="_blank">https://market.android.com/</a></p>
<p>&nbsp;</p>
<p><em>Image courtesy of Google</em><br />
<img class="alignnone size-full wp-image-4881" title="Android Activity Lifecycle" src="http://www.mikestratton.net/assets/android_activity_lifecycle.png" alt="Android Activity Lifecycle" width="480" height="658" /></p>
<h3>Android System Architecture Diagram<br />
<a href="http://code.google.com/p/androidteam/wiki/AndroidSystemArch" target="_blank"><img class="alignnone  wp-image-4885" title="Android System Architecture Diagram" src="http://www.mikestratton.net/assets/android_stack.jpg" alt="Android System Architecture Diagram" width="499" height="358" /></a></h3>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/12/android-activity-lifecycle/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Learning Styles &#8211; Accelerate Your Capacity to Learn</title>
		<link>http://www.mikestratton.net/2011/12/learning-styles-accelerate-your-capacity-to-learn/</link>
		<comments>http://www.mikestratton.net/2011/12/learning-styles-accelerate-your-capacity-to-learn/#comments</comments>
		<pubDate>Tue, 20 Dec 2011 02:17:17 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4831</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/12/learning-styles-accelerate-your-capacity-to-learn/">Learning Styles &#8211; Accelerate Your Capacity to Learn</a></p><p>This post was created to share an essay assignment that I completed during my sophmore year at Mountain State University. This post includes the assignment details, as well as my assignment submission. I have entitled this post “Learning Styles &#8211; Accelerate Your Capacity to Learn&#8221; as this is the title of my essay. Learning Styles – Accelerate Your Capacity to Learn<br />
 English Composition II &#8211; Final Essay Assignment<br />
&#8220;This is the broadest and least narrowly defined area you are being asked to ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/12/learning-styles-accelerate-your-capacity-to-learn/">Learning Styles &#8211; Accelerate Your Capacity to Learn</a></p><p>This post was created to share an essay assignment that I completed during my sophmore year at Mountain State University. This post includes the assignment details, as well as my assignment submission. I have entitled this post “Learning Styles &#8211; Accelerate Your Capacity to Learn&#8221; as this is the title of my essay. <a href="http://www.mikestratton.net/assets/learning_styles_accelerate_your_capacity_to_learn.pdf">Learning Styles – Accelerate Your Capacity to Learn</a></p>
<h3> English Composition II &#8211; Final Essay Assignment</h3>
<p>&#8220;This is the broadest and least narrowly defined area you are being asked to investigate. This is for a reason. I want you to be able to make choices on your own about what area you wish to research instead of having me determine something for you. This is much the same as will occur in a typical course, wherein an instructor leaves everything up to you other than a broad topic. Here, “education” might reasonably relate to almost anything relevant to learning of some sort. Some potential areas of investigation are listed below, but you should not feel that you have to work with one of these suggestions. These are presented as suggestions only.</p>
<p>What might be understood as the pros and/or cons of the US education system as compared to the education systems of other countries?  Private vs. Public education.  Advantages or disadvantages of various kinds of learning environments.  Theories about how we learn.  Alternative” education.  Pros/cons of home schooling.  Distance learning vs. the traditional classroom.  Causes and effects of school consolidation.  Validity or lack of validity in the No Child Left Behind program.  Animal education/training/learning.  Learning disabilities and/or obstacles to learning  Critical Thinking” is the buzzword among educators these days. What is it and why is it thought to be important?</p>
<p>The failure of the education system to adequately prepare high school graduates for the workplace and college. And so on. Requirements: 3-5 pages, typed and double-spaced. Make use of a minimum of three research sources. Proper APA textual documentation and References. &#8221; (Mountain State University,  2011)</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/12/learning-styles-accelerate-your-capacity-to-learn/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Image Processing &#8211; Linear Filter</title>
		<link>http://www.mikestratton.net/2011/12/image-processing-linear-filter/</link>
		<comments>http://www.mikestratton.net/2011/12/image-processing-linear-filter/#comments</comments>
		<pubDate>Sat, 17 Dec 2011 11:17:46 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[NASA/USPTO]]></category>
		<category><![CDATA[Stanford Engineering Everywhere]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[nasa]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4820</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/12/image-processing-linear-filter/">Image Processing &#8211; Linear Filter</a></p><p>Youtube video and relevant image offering a method by which to extract information from a greyscale image with an example of a linear filter (equation).<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/12/image-processing-linear-filter/">Image Processing &#8211; Linear Filter</a></p><p>Youtube video and relevant image offering a method by which to extract information from a greyscale image with an example of a linear filter (equation).<br />
<img wp-image-4821" title="linear filter" src="http://www.mikestratton.net/assets/linear_filter.png" alt="linear filter" width="452" height="554" /><br />
&nbsp;</p>
<h3>Extracting Features from a Greyscale image </h3>
<p><code><object width="560" height="315"><param name="movie" value="http://www.youtube-nocookie.com/v/BhCcmTsm5ck?version=3&amp;hl=en_US"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/BhCcmTsm5ck?version=3&amp;hl=en_US" type="application/x-shockwave-flash" width="560" height="315" allowscriptaccess="always" allowfullscreen="true"></embed></object></code></p>
<h3>Linear Filter</h3>
<p><code><object width="560" height="315"><param name="movie" value="http://www.youtube-nocookie.com/v/7KVPsx_oP7A?version=3&amp;hl=en_US"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/7KVPsx_oP7A?version=3&amp;hl=en_US" type="application/x-shockwave-flash" width="560" height="315" allowscriptaccess="always" allowfullscreen="true"></embed></object></code></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/12/image-processing-linear-filter/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The U.S. Department of Defense&#8217;s View on Open Source</title>
		<link>http://www.mikestratton.net/2011/12/the-u-s-department-of-defenses-view-on-open-source/</link>
		<comments>http://www.mikestratton.net/2011/12/the-u-s-department-of-defenses-view-on-open-source/#comments</comments>
		<pubDate>Thu, 15 Dec 2011 07:35:47 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[NASA/USPTO]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[nasa]]></category>
		<category><![CDATA[open source]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4769</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/12/the-u-s-department-of-defenses-view-on-open-source/">The U.S. Department of Defense&#8217;s View on Open Source</a></p><p>In December of 2011, I entered a coding competition sponsored by NASA, the USPTO and Harvard University. The competition allowed for use of Open Source software to meet the software requirements. The competition also required that all open source software should be compatible with Apache License, Version 2.0. After a bit of research, I found the following information:<br />
&#8220;In practice, an open source software license must also meet the GNU Free Software Definition; the GNU project publishes a list of ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/12/the-u-s-department-of-defenses-view-on-open-source/">The U.S. Department of Defense&#8217;s View on Open Source</a></p><p>In December of 2011, I entered a coding competition sponsored by NASA, the USPTO and Harvard University. The competition allowed for use of Open Source software to meet the software requirements. The competition also required that all open source software should be compatible with Apache License, Version 2.0. After a bit of research, I found the following information:</p>
<p>&#8220;In practice, an open source software license must also meet the GNU Free Software Definition; the GNU project publishes a list of licenses that meet the Free Software Definition.&#8221; (Source: <a href="http://dodcio.defense.gov/sites/oss/Open_Source_Software_(OSS)_FAQ.htm" target="_blank">http://dodcio.defense.gov/sites/oss/Open_Source_Software_(OSS)_FAQ.htm</a>)</p>
<p>Considering that the competition gives an individual the ability to validate there worth by coding for the U.S. Government, I felt it was best to accelerate the competition with appropriate information; therefore, I posted this information for all competitors to view.</p>
<p>It seems that that you can view all Open Source licenses as having a &#8220;tree&#8221; structure, with the &#8220;GPL-Compatible Free Software Licenses&#8221; being the top of the tree structure.</p>
<p>List of licenses that meet the Free Software Definition:<br />
<a href="http://www.gnu.org/licenses/license-list.html#SoftwareLicenses" target="_blank">http://www.gnu.org/licenses/license-list.html#SoftwareLicenses</a></p>
<p>I would also like to note, that the only incompatibility I found with Apache 2.0 was with the GPL 2.0. GPL 2.0 is also incompatible with GPL 3.0.</p>
<p>Apache Verstion 2.0 Compatibility:<br />
&#8220;The GPL v3.0 is compatible with the Apache License 2.0, but not with previous versions of the GPL.&#8221;</p>
<p>Is the MIT License Compatible with Apache 2.0?<br />
Both licenses fall under the GPL list of Compatible Free Software Licenses; therefore, the MIT License is Compatible with Apache 2.0.</p>
<p>Is the BSD License Compatible with Apache 2.0?<br />
The BSD License falls under the GPL list of Comptatible Free Software Licenses; therefore, the BSD License is compatible with Apache 2.0.</p>
<p>Is the BSD License Compatible with the MIT License?<br />
The BSD License is equivelant to the MIT License and they both fall under the GPL List of Compatible Free Software Licenses; therefore, the BSD License is compatible to the MIT License.</p>
<p>The BSD license is compatible with Apache 2.0 as of Jan 9, 2008. “On January 9th, 2008 the OSI Board approved BSD-2-Clause, which is used by FreeBSD and others. It omits the final “no-endorsement” clause and is thus roughly equivalent to the MIT License.” (Source: <a href="http://www.opensource.org/licenses/BSD-3-Clause" target="_blank">http://www.opensource.org/licenses/BSD-3-Clause</a>)</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/12/the-u-s-department-of-defenses-view-on-open-source/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>NASA, TopCoder &amp; USPTO &#8211; Innovation Challenge</title>
		<link>http://www.mikestratton.net/2011/12/nasa-topcoder-uspto-innovation-challenge/</link>
		<comments>http://www.mikestratton.net/2011/12/nasa-topcoder-uspto-innovation-challenge/#comments</comments>
		<pubDate>Mon, 12 Dec 2011 06:11:26 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[NASA/USPTO]]></category>
		<category><![CDATA[artificial inteligence]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[nasa]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4753</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/12/nasa-topcoder-uspto-innovation-challenge/">NASA, TopCoder &#038; USPTO &#8211; Innovation Challenge</a></p><p>This thread was created to document resources needed for the USPTO Tournament Challenge.<br />
Source: http://community.topcoder.com/ntl/<br />
The Challenge<br />
The contest will requires advanced knowledge of:<br />
&#160;&#160;<br />
The Contest<br />
&#160;&#160;<br />
Open Source<br />
Open source software is allowable as submission for each algorithm, as long as the open source software is compatible with the Apache License, Version 2.0. http://www.apache.org/licenses/LICENSE-2.0.html<br />
Potential Open Source Software:<br />
&#160;&#160;<br />
Definitions<br />
Text Reconition<br />
Image Analysis<br />
Construction of Bounding Boxes<br />
http://www.cs.ucsb.edu/~suri/cs235/Rlist/boxHeuristicAnalysis.pdf<br />
&#160;&#160;<br />
Software Development Life Cycle<br />
http://www.ibm.com/developerworks/websphere/library/techarticles/0306_perks/perks2.html<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/12/nasa-topcoder-uspto-innovation-challenge/">NASA, TopCoder &#038; USPTO &#8211; Innovation Challenge</a></p><p>This thread was created to document resources needed for the USPTO Tournament Challenge.<br />
Source: <a href="http://community.topcoder.com/ntl/" target="_blank">http://community.topcoder.com/ntl/</a></p>
<h3>The Challenge</h3>
<p>The contest will requires advanced knowledge of:</p>
<ul class="list list3">
<li>text recognition</li>
<li>image analysis</li>
<li>the construction of bounding boxes</li>
</ul>
<p>&nbsp;&nbsp;</p>
<h3>The Contest</h3>
<ul class="list list3">
<li>teams of two</li>
<li>course of one month</li>
<li>develop an algorithm that identifies and locate specific elements within patent documents.</li>
<li>partnership with TopCoder, Harvard, NASA, U.S. Federal Government</li>
<li>developed to understand how contests can be used to solve complex computational problems for the U.S. Federal Goverment</li>
</ul>
<p>&nbsp;&nbsp;</p>
<h3>Open Source</h3>
<p>Open source software is allowable as submission for each algorithm, as long as the open source software is compatible with the Apache License, Version 2.0. <a href="http://www.apache.org/licenses/LICENSE-2.0.html" target="_blank">http://www.apache.org/licenses/LICENSE-2.0.html</a></p>
<p>Potential Open Source Software:</p>
<ul class="list list3">
<li>text recognition<br />
Java: <a href="http://sourceforge.net/apps/trac/javaocr/" target="_blank">http://sourceforge.net/apps/trac/javaocr/</a><br />
C++ <a href="http://code.google.com/p/ocropus/" target="_blank">http://code.google.com/p/ocropus/</a></li>
<li>image analysis<br />
Java: <a href="http://www.tina-vision.net/" target="_blank">http://www.tina-vision.net/</a><br />
This program is licensed under the GNU General Public License (Version 3), which is compatible with Apache Version 2.0<br />
<a href="http://www.gnu.org/licenses/lgpl.html" target="_blank">http://www.gnu.org/licenses/lgpl.html</a></p>
<p>C++: <a href="http://opensource.adobe.com/wiki/display/gil/Generic+Image+Library" target="_blank">http://opensource.adobe.com/wiki/display/gil/Generic+Image+Library</a></li>
<li>the construction of bounding boxes</li>
</ul>
<p>&nbsp;&nbsp;</p>
<h3>Definitions</h3>
<p>Text Reconition</p>
<p>Image Analysis</p>
<p>Construction of Bounding Boxes<br />
<a href="http://www.cs.ucsb.edu/~suri/cs235/Rlist/boxHeuristicAnalysis.pdf" target="_blank">http://www.cs.ucsb.edu/~suri/cs235/Rlist/boxHeuristicAnalysis.pdf</a><br />
&nbsp;&nbsp;</p>
<h3>Software Development Life Cycle</h3>
<p><a href="http://www.ibm.com/developerworks/websphere/library/techarticles/0306_perks/perks2.html" target="_blank">http://www.ibm.com/developerworks/websphere/library/techarticles/0306_perks/perks2.html</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/12/nasa-topcoder-uspto-innovation-challenge/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Is BSD License compatible with Apache 2.0 License?</title>
		<link>http://www.mikestratton.net/2011/12/is-bsd-license-compatible-with-apache-2-0-license/</link>
		<comments>http://www.mikestratton.net/2011/12/is-bsd-license-compatible-with-apache-2-0-license/#comments</comments>
		<pubDate>Mon, 12 Dec 2011 05:59:05 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[open source]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4749</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/12/is-bsd-license-compatible-with-apache-2-0-license/">Is BSD License compatible with Apache 2.0 License?</a></p><p>After a bit of research I found that BSD license is compatible with Apache 2.0 as of Jan 9, 2008.  &#8220;On January 9th, 2008 the OSI Board approved BSD-2-Clause, which is used by FreeBSD and others. It omits the final &#8220;no-endorsement&#8221; clause and is thus roughly equivalent to the MIT License.&#8221; (Source: http://www.opensource.org/licenses/BSD-3-Clause)<br />
One thing to consider is that for each individual open source software, you must follow the terms and conditions, as they apply. I would strongly suggest commenting ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/12/is-bsd-license-compatible-with-apache-2-0-license/">Is BSD License compatible with Apache 2.0 License?</a></p><p>After a bit of research I found that BSD license is compatible with Apache 2.0 as of Jan 9, 2008.  &#8220;On January 9th, 2008 the OSI Board approved BSD-2-Clause, which is used by FreeBSD and others. It omits the final &#8220;no-endorsement&#8221; clause and is thus roughly equivalent to the MIT License.&#8221; (Source: <a href="http://www.opensource.org/licenses/BSD-3-Clause" target="_blank">http://www.opensource.org/licenses/BSD-3-Clause</a>)</p>
<p>One thing to consider is that for each individual open source software, you must follow the terms and conditions, as they apply. I would strongly suggest commenting blocks before and after each specific open source as it applies to each license, as well as commenting at the top of the file as defined as stated in each particular license. .</p>
<p>It seems to me that the license applies as far as each particular open source library relevant to that license is utilized. Once you step away from the use of a particular library, the license is no longer relevant.</p>
<p>Please don&#8217;t take my word for it, as I am not an attorney.</p>
<h3>MIT Licence:</h3>
<p>&#8220;Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the &#8220;Software&#8221;), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.&#8221; (Source: <a href="http://www.opensource.org/licenses/mit-license.php" target="_blank">http://www.opensource.org/licenses/mit-license.php</a>)</p>
<h3>Apache 2.0 License:</h3>
<p>&#8220;Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted.&#8221; (Source: <a href="http://www.apache.org/licenses/LICENSE-2.0.html" target="_blank">http://www.apache.org/licenses/LICENSE-2.0.html</a>)</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/12/is-bsd-license-compatible-with-apache-2-0-license/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The Influence of Emotionally Charged WWII Propaganda</title>
		<link>http://www.mikestratton.net/2011/12/the-influence-of-emotionally-charged-wwii-propaganda/</link>
		<comments>http://www.mikestratton.net/2011/12/the-influence-of-emotionally-charged-wwii-propaganda/#comments</comments>
		<pubDate>Thu, 08 Dec 2011 10:04:45 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4708</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/12/the-influence-of-emotionally-charged-wwii-propaganda/">The Influence of Emotionally Charged WWII Propaganda</a></p><p>This post was created to share an essay assignment that I completed during my sophmore year at Mountain State University. This post includes the assignment details, as well as my assignment submission. I have entitled this post &#8220;The Influence of Emotionally Charged WWII Propaganda&#8221; as this is the title of my essay.<br />
I am a computer science major who takes takes pride in the fact that my GPA is exceptional, with little effort, in the required general course studies.<br />
The ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/12/the-influence-of-emotionally-charged-wwii-propaganda/">The Influence of Emotionally Charged WWII Propaganda</a></p><p>This post was created to share an essay assignment that I completed during my sophmore year at Mountain State University. This post includes the assignment details, as well as my assignment submission. I have entitled this post &#8220;The Influence of Emotionally Charged WWII Propaganda&#8221; as this is the title of my essay.</p>
<p>I am a computer science major who takes takes pride in the fact that my GPA is exceptional, with little effort, in the required general course studies.</p>
<p>The Influence of Emotionally Charged WWII Propaganda<br />
<a href="http://www.mikestratton.net/assets/influcence_of_emotionally_charged_world_war_ii_propaganda.pdf" target="_blank">http://www.mikestratton.net/assets/influcence_of_emotionally_charged_world_war_ii_propaganda.pdf</a></p>
<h3>English Composition II &#8211; Essay 2 Assignment</h3>
<p>Essay 2<br />
Our second essay will create an argument about the nature and purpose of World War II propaganda posters used in the US prior to and during US involvement in the war. The essay we write will actually include the posters as evidence for the argument. This assignment is intended as our “easy” essay assignment. I say this for a few different reasons.</p>
<p>First, the argument that I want you to formulate here should only do two things: identify what each selected poster was trying to motivate Americans to think or do, and then analyze the emotional appeals (propaganda) being exerted in each selected poster. As to the first thing, this is really easy, because the posters typically say right on them what they want you to do or believe: enlist in the armed services, work harder at your job for the war effort, conserve materials, get a job, buy war bonds, and so on. As to the second thing, identifying the emotional persuasion in each poster (that’s what ‘propaganda” is), this is also pretty easy to do because only a few basic emotions are typically played on in these posters: fear, guilt, anger, pride, patriotism, and so on. Once you start looking at the posters you’ll easily recognize both of these things.</p>
<p>Second, there are really only two basic ways to organize an essay of this sort, given the two things mentioned above as our objectives. You can choose either of these organizational strategies, and either one works out just fine. Because the objectives are two-fold, then you can organize an essay around either what sorts of purposes the posters had, or what sorts of emotional appeals they made. Paragraphs will begin then with claims about one or the other, even though both goals will be addressed in each paragraph. So, consider the two paragraphs shown below: Thesis: During World War II, the US government employed numerous propaganda posters to motivate Americans about a variety of war-related issues. These posters played on basic human emotions as the primary means of motivating US citizens.</p>
<p>Paragraph focusing on what the posters tried to motivate Americans to think or do:<br />
Many posters encouraged Americans to buy war bonds as a means of directly and economically supporting the war effort. This was necessary because there was no strong tax base at that time, and America was not financially ready to fight a war. A great many of these posters used fear as an emotional motivator. For example, Figure 1 shows a scene with three small children in it, anxiously looking away from their play as a Nazi Swastika overlays the ground. The poster reads “Don’t Let That Shadow Touch Them! Buy War Bonds!” Clearly the use of children in the poster and their looks of anxiety are meant to play on the audience’s fear for their children’s safety and well-being. Still other posters (see Figure 2) used fear for the same purpose by showing a threatening image of Hitler creeping toward America, warning us that “Our Homes Are In Danger Now!”, and thus the only way to prevent such a threat was to buy war bonds. Not all posters that attempted to persuade Americans to buy war bonds used fear as a motivator. Some, like Figure 3, used patriotic images to inspire citizens to go out and do their duty buy buying war bonds. In this poster, we see a happy, satisfied man returning from the bank after having purchased a war bond. The poster says “Even Though He’s Not on the Front Lines, He’s Fighting This War!”, telling people that they could still be an active part of the war effort even if they weren’t in the armed forces. Here, the image of the satisfied man further suggests that he is able to maintain his manly pride through buying a war bond, even though he’s not fighting directly.</p>
<p>Paragraph focusing on the emotional appeals the posters used:<br />
Many posters used during the war tried to motivate Americans to participate in the war effort in one way or another by making them feel guilty. Guilt was a common feature of many of these posters, regardless of what they were trying to get people to think or do. In one famous poster (see Figure 1) we’re shown an image of a man driving his car, and seated in the passenger seat is a ghostly image of Hitler. The poster reads “When you ride alone, you ride with Hitler,” clearly playing on feelings of guilt for wasting precious fuel that might have been used for the war effort. In yet another poster (see Figure 2), we’re shown a young woman who is holding a letter that is obviously from a loved one who is fighting overseas. She is looking anxiously into the distance, obviously very much missing her man. The poster reads “Longing won’t bring him back sooner. Get a war job!” While the purpose of this poster was to motivate women to become involved in the war time labor force, clearly the emotional appeal here is one of guilt, informing women that if they’re just sitting around at home, they’re not helping to bring their loved ones safely home again.</p>
<p>So, as you see, one paragraph focuses on what the purpose of these posters were about, while the other paragraph focuses on a particular emotional appeal and provides various examples of it. Either strategy works, and each paragraph accomplishes the two stated goals: identifying the purposes of the posters, and analyzing the emotional appeals (propaganda) in them. When it comes time to put together an outline, maybe come back and review the examples here for a bit of direction. Good luck with this second essay everyone.</p>
<p>Requirements: Use three research sources OTHER THAN the poster sites. 3-5 pages, typed double-spaced. Correct APA textual citations and References.</p>
<p>&nbsp;</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/12/the-influence-of-emotionally-charged-wwii-propaganda/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Intro to Logarithm Properties</title>
		<link>http://www.mikestratton.net/2011/12/intro-to-logarithm-properties/</link>
		<comments>http://www.mikestratton.net/2011/12/intro-to-logarithm-properties/#comments</comments>
		<pubDate>Tue, 06 Dec 2011 11:27:47 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Advanced Mathematics]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[advanced mathematics]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4679</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/12/intro-to-logarithm-properties/">Intro to Logarithm Properties</a></p><p>Advanced Algebra: Intro to Logarithm Properties<br />
Logarithm Addition Property<br />
 ab = c &#124; loga c = b<br />
 logB A  + logB C = logB (A*C)     (B = Base)<br />
log2 8 + log2 32 = log2 (256) <br />
3           5                 8<br />
Logarithm Subtraction Property<br />
ab = c &#124; loga c = b <br />
logB A - logB C = logB (A/C) (B = Base)<br />
log3 1/9 + log3 89 = log3 (1/9 * 1/81) <br />
-2           -4              -6<br />
Logarithm Multipication Property<br />
A ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/12/intro-to-logarithm-properties/">Intro to Logarithm Properties</a></p><h2>Advanced Algebra: Intro to Logarithm Properties</h2>
<div class="hr_shadow" /></div><p>Logarithm Addition Property</p>
<p> a<strong><sup>b</sup></strong> = c | log<strong><sub>a</sub> <sup>c = b</sup></strong></p>
<p><strong> </strong>log<strong><sub>B</sub> <sup>A  </sup></strong>+ log<strong><sub>B</sub> <sup>C </sup></strong>= log<strong><sub>B</sub></strong><sup> (<strong>A</strong>*<strong>C)</strong></sup>     (B = Base)</p>
<p>log<strong><sub>2</sub><sup> 8</sup></strong> + log<strong><sub>2</sub><sup> 32</sup></strong> = log<strong><sub>2</sub><sup> (256) </sup></strong></p>
<p>3           5                 8</p>
<div class="hr_shadow" /></div><p>Logarithm Subtraction Property</p>
<p>a<strong><sup>b</sup></strong> = c | log<strong><sub>a</sub> <sup>c = b</sup> </strong></p>
<p>log<strong><sub>B </sub><sup>A</sup></strong> - log<strong><sub>B</sub> <sup>C</sup></strong> = log<strong><sub>B</sub></strong><sup> (<strong>A/C)</strong></sup> (B = Base)</p>
<p>log<strong><sub>3</sub><sup> 1/9</sup></strong> + log<strong><sub>3</sub><sup> 89</sup></strong> = log<strong><sub>3</sub><sup> (1/9 * 1/81) </sup></strong></p>
<p>-2           -4              -6</p>
<div class="hr_shadow" /></div><p>Logarithm Multipication Property</p>
<p>A * log<strong><sub>B</sub> <sup>C</sup></strong> = log<strong><sub>B</sub></strong><sup> (C<sup>A</sup>)</sup> (B = Base)</p>
<p>3 * log<strong><sub>2</sub> <sup>8</sup></strong> = log<strong><sub>2</sub></strong><sup> (8<sup>3</sup>)</sup>       ( <strong><sub>8</sub><sup>3      </sup></strong><strong>OR <sub>     2</sub> <sup>9 </sup> </strong></p>
<p>3            *       3            =       9</p>
<div class="hr_shadow" /></div><p><code><object width="480" height="360" classid="clsid:d27cdb6e-ae6d-11cf-96b8-444553540000" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=6,0,40,0"><param name="allowFullScreen" value="true" /><param name="allowscriptaccess" value="always" /><param name="src" value="http://www.youtube-nocookie.com/v/PupNgv49_WY?version=3&amp;hl=en_US&amp;rel=0" /><param name="allowfullscreen" value="true" /><embed width="480" height="360" type="application/x-shockwave-flash" src="http://www.youtube-nocookie.com/v/PupNgv49_WY?version=3&amp;hl=en_US&amp;rel=0" allowFullScreen="true" allowscriptaccess="always" allowfullscreen="true" /></object></code><br />
<span style="font-size: 18px;"></p>
<div class="hr_shadow" /></div><p></span><br />
<code><object width="480" height="360" classid="clsid:d27cdb6e-ae6d-11cf-96b8-444553540000" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=6,0,40,0"><param name="allowFullScreen" value="true" /><param name="allowscriptaccess" value="always" /><param name="src" value="http://www.youtube-nocookie.com/v/TMmxKZaCqe0?version=3&amp;hl=en_US&amp;rel=0" /><param name="allowfullscreen" value="true" /><embed width="480" height="360" type="application/x-shockwave-flash" src="http://www.youtube-nocookie.com/v/TMmxKZaCqe0?version=3&amp;hl=en_US&amp;rel=0" allowFullScreen="true" allowscriptaccess="always" allowfullscreen="true" /></object></code></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/12/intro-to-logarithm-properties/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial Life Simulation</title>
		<link>http://www.mikestratton.net/2011/11/artificial-life-simulation-2/</link>
		<comments>http://www.mikestratton.net/2011/11/artificial-life-simulation-2/#comments</comments>
		<pubDate>Tue, 29 Nov 2011 09:34:03 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[C#]]></category>
		<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[artificial life]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[microsoft]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4665</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/11/artificial-life-simulation-2/">Artificial Life Simulation</a></p><p>The purpose of this post is to document my research in the comprehension of artificial intelligence and the simulation/creation of an artificial life form.<br />
Artificial Intelligence &#8211; Research Question and Hypothesis<br />
Topic: Artificial Intelligence<br />
Narrowed Topic: Artificially intelligent algorithms and artificial life.<br />
Issue: Advancing and improving artificial intelligence for the purpose of creating artificial life forms, and/or artificial life simulations.<br />
Research Questions: Of the existing types of artificially intelligent algorithms, which has the greatest potential to improve and/or expand our ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/11/artificial-life-simulation-2/">Artificial Life Simulation</a></p><p>The purpose of this post is to document my research in the comprehension of artificial intelligence and the simulation/creation of an artificial life form.</p>
<h2>Artificial Intelligence &#8211; Research Question and Hypothesis</h2>
<p><strong>Topic: </strong>Artificial Intelligence</p>
<p><strong>Narrowed Topic: </strong>Artificially intelligent algorithms and artificial life.</p>
<p><strong>Issue: </strong>Advancing and improving artificial intelligence for the purpose of creating artificial life forms, and/or artificial life simulations.</p>
<p><strong>Research Questions: </strong>Of the existing types of artificially intelligent algorithms, which has the greatest potential to improve and/or expand our current capabilities in the use of artificial life forms and/or artificial life simulations.</p>
<p><strong>Hypothesis: </strong>It is possible to create an artificial life form; for, the advancement in the design, development and enhancement of existing artificially intelligent algorithms.</p>
<h2>Artificial Life Form Design</h2>
<p>It can be interpreted that life forms live off of a few basic functions, some of which are: the ability to transform an energy source into food, the ability to evolve, and the ability to reproduce. The design of the artificial life form will follow the same functions and life-cycle. The image in Figure 1 demonstrates this in a side by side comparison.</p>
<h3>Figure 1: Life Form/Algorithm Comparison</h3>
<p><img class="alignnone size-full wp-image-4666" title="Life Cycle" src="http://www.mikestratton.net/assets/lifecycle.png" alt="Life Cycle" width="626" height="317" /></p>
<h2>Artificial Life Form Simulation</h2>
<p>The video in Figure 2 shows a simplistic example of how an algorithm such as this would work, with the use of 4 separate objects each with separate fuctions. The objects are a carnivore, herbivore, plant, and bacteria. At the time of making this video, the carnivore, representsented as a wolf head, stalks and follows the herbivore (represented as the chicken). The animated vegetable reacts to the herbivore by moving away when it comes in contact with the it. The herbivore also reacts to the carnivore by moving away when it comes in contact with it.</p>
<p>Future development (currently in progress) of this algorithm will include &#8220;intelligence&#8221; for each object as well as random environmental variables. All of the objects, functions, and random variables will emulate two things a) life form evolution b) artificial intelligence that evolves, reproduces, and solves a specific problem set.</p>
<h3>Figure 2: Artificial Life Form Algorithm Video Simulation</h3>
<p><code><object width="480" height="360" classid="clsid:d27cdb6e-ae6d-11cf-96b8-444553540000" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=6,0,40,0"><param name="allowFullScreen" value="true" /><param name="allowscriptaccess" value="always" /><param name="src" value="http://www.youtube-nocookie.com/v/X2JRNqbRcA8?version=3&amp;hl=en_US&amp;rel=0" /><param name="allowfullscreen" value="true" /><embed width="480" height="360" type="application/x-shockwave-flash" src="http://www.youtube-nocookie.com/v/X2JRNqbRcA8?version=3&amp;hl=en_US&amp;rel=0" allowFullScreen="true" allowscriptaccess="always" allowfullscreen="true" /></object></code></p>
<h3>Algorithm Specifications</h3>
<p>The algorithm in this video was developed in C# code with Visual Studio 2010 and the XNA Software Development Kit. Source code for this algorithm is avaible upon request.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/11/artificial-life-simulation-2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Resume &#8211; VB.net Proficiency</title>
		<link>http://www.mikestratton.net/2011/11/resume-vb-net-proficiency/</link>
		<comments>http://www.mikestratton.net/2011/11/resume-vb-net-proficiency/#comments</comments>
		<pubDate>Tue, 15 Nov 2011 19:23:13 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[.net]]></category>
		<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[Resume]]></category>
		<category><![CDATA[Visual Basic]]></category>
		<category><![CDATA[asp.net]]></category>
		<category><![CDATA[microsoft]]></category>
		<category><![CDATA[resume]]></category>
		<category><![CDATA[visual basic]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4649</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/11/resume-vb-net-proficiency/">Resume &#8211; VB.net Proficiency</a></p><p>The purpose of this post is to share my proficiency with vb.net, so that a potential employer may have a better understanding of my level of experience.<br />
View my VB.net proficiency test here: http://www.mikestratton.net/assets/visual_basic_net_proficiency1.pdf<br />
Test provided by: http://www.ikmnet.com/<br />
I recently applied for a job where the initial stages of the interview process included a remote test that validates my knowledge within the VB.net platform. The position that I applied for was an entry level opportunity, and I expected to do ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/11/resume-vb-net-proficiency/">Resume &#8211; VB.net Proficiency</a></p><p>The purpose of this post is to share my proficiency with vb.net, so that a potential employer may have a better understanding of my level of experience.</p>
<p>View my VB.net proficiency test here: <a href="http://www.mikestratton.net/assets/visual_basic_net_proficiency1.pdf" target="_blank">http://www.mikestratton.net/assets/visual_basic_net_proficiency1.pdf</a><br />
Test provided by: <a href="http://www.ikmnet.com/" target="_blank">http://www.ikmnet.com/</a></p>
<p>I recently applied for a job where the initial stages of the interview process included a remote test that validates my knowledge within the VB.net platform. The position that I applied for was an entry level opportunity, and I expected to do well with the test considering my base understanding of the VB.net platform. To my surprise, the test was extremely difficult and I felt I had failed horribly. Later I found that the opposite of this was true.</p>
<p>The test is set up so that each individual recieves questions relevant to their knowledge. For example, a mathematics test might start with a random question about Algebra. If the correct answer is given, the test will ask a more advanced question, like one relevant to triganometry. If an incorrect answer is given to a question about Algebra, the test will give an easier question, like one relevant to fractions.</p>
<p>I struggled with this test as each question was extremely challenging as a result of my knowledge in VB.net. I also found that from an industry standard, my level of knowledge is much greater than that of an entry level opportunity. The test ranges from questions directed at individuals with no experience to individuals with 10 years or greater of experience. My test results showed that my knowledge is average in comparison to this range.</p>
<p>Immediately after I took the exam, the company requested an initial interview with the HR department. I was extremely anxious, and although my test results were great, I did not pass the &#8220;personality&#8221; portion of the job interview as a result of my anxiety.</p>
<p>Interested in hiring me for a vb.net entry level opportunity? Call me at 330-802-0285.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/11/resume-vb-net-proficiency/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>TCP &#8211; UDP Port Lookup Reference</title>
		<link>http://www.mikestratton.net/2011/11/tcpudp-port-lookup-reference/</link>
		<comments>http://www.mikestratton.net/2011/11/tcpudp-port-lookup-reference/#comments</comments>
		<pubDate>Mon, 14 Nov 2011 20:54:41 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[computer science]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4633</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/11/tcpudp-port-lookup-reference/">TCP &#8211; UDP Port Lookup Reference</a></p><p>TCP &#8211; UDP Port Lookup<br />
Source accessed: 11/14/2011<br />
Provided by SANS Technology Institute: http://www.sans.edu<br />
TCP/UDP Port Lookup - Adobe PDF Version<br />
TCP/UDP Port Lookup - TXT version<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/11/tcpudp-port-lookup-reference/">TCP &#8211; UDP Port Lookup Reference</a></p><p>TCP &#8211; UDP Port Lookup</p>
<p>Source accessed: 11/14/2011<br />
Provided by SANS Technology Institute: http://www.sans.edu</p>
<h3><a href="http://www.mikestratton.net/assets/tcp-udp-port-lookup-reference.pdf" target="_blank">TCP/UDP Port Lookup - Adobe PDF Version</a><br />
<a href="http://www.mikestratton.net/assets/tcp-udp_port_lookup-reference.txt" target="_blank">TCP/UDP Port Lookup - TXT version</a></h3>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/11/tcpudp-port-lookup-reference/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Mountain State &#8211; English Composition II</title>
		<link>http://www.mikestratton.net/2011/11/mountain-state-english-composition/</link>
		<comments>http://www.mikestratton.net/2011/11/mountain-state-english-composition/#comments</comments>
		<pubDate>Mon, 14 Nov 2011 03:36:22 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4625</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/11/mountain-state-english-composition/">Mountain State &#8211; English Composition II</a></p><p>Week 3 Written Assignment<br />
Michael A. Stratton<br />
ENG 102 English Composition II<br />
Instructor: Dr. Stanton<br />
Mountain State University<br />
Assignment:<br />
&#8220;Our first essay asks us to formulate an argument that focuses on potential causes of rising global oil prices during approximately the past 36 months. The first big spikes in oil prices began around mid-2005, and rose steadily until late 2008 when we saw them drop again. The focus of the essay should be on identifying potential reasons for this, and ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/11/mountain-state-english-composition/">Mountain State &#8211; English Composition II</a></p><p>Week 3 Written Assignment<br />
Michael A. Stratton<br />
ENG 102 English Composition II<br />
Instructor: Dr. Stanton<br />
Mountain State University</p>
<p>Assignment:<br />
&#8220;Our first essay asks us to formulate an argument that focuses on potential causes of rising global oil prices during approximately the past 36 months. The first big spikes in oil prices began around mid-2005, and rose steadily until late 2008 when we saw them drop again. The focus of the essay should be on identifying potential reasons for this, and not on the effects of rising oil prices or about solutions to the problem. The essay should be 3-5 double-spaced pages in length, and make use of a minimum of two research sources.&#8221;</p>
<p>My submission:<br />
<a href="http://www.mikestratton.net/assets/sources_of_rising_oil_prices_2005_2008.pdf" target="_blank">http://www.mikestratton.net/assets/sources_of_rising_oil_prices_2005_2008.pdf</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/11/mountain-state-english-composition/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>WolframAlpha &#8211; API</title>
		<link>http://www.mikestratton.net/2011/11/wolframalpha-api/</link>
		<comments>http://www.mikestratton.net/2011/11/wolframalpha-api/#comments</comments>
		<pubDate>Fri, 04 Nov 2011 22:25:44 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[artificial intelligence]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4617</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/11/wolframalpha-api/">WolframAlpha &#8211; API</a></p><p><br />
Bring computational knowledge to your web, mobile, desktop, and enterprise applications<br />
http://products.wolframalpha.com/api/<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/11/wolframalpha-api/">WolframAlpha &#8211; API</a></p><p><code><script id="WolframAlphaScript" src="http://www.wolframalpha.com/input/embed/?type=largeannot" type="text/javascript"></script></code></p>
<h2>Bring computational knowledge to your web, mobile, desktop, and enterprise applications</h2>
<p><a href="http://products.wolframalpha.com/api/" target="_blank">http://products.wolframalpha.com/api/</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/11/wolframalpha-api/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>A Career in Web Design</title>
		<link>http://www.mikestratton.net/2011/10/a-career-in-web-design/</link>
		<comments>http://www.mikestratton.net/2011/10/a-career-in-web-design/#comments</comments>
		<pubDate>Wed, 26 Oct 2011 09:09:42 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Volunteer Web Designer]]></category>
		<category><![CDATA[computer science]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4605</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/10/a-career-in-web-design/">A Career in Web Design</a></p><p>For those of us interested in a career in web design, it is essential that we understand the phrase &#8220;web design&#8221; from a dynamic standpoint as opposed to the widely accepted HTML definition. This article evaluates the term &#8220;web design&#8221; as it directly relates to different career paths in the field of &#8220;web design&#8221;. It will also include relevant links to help you better evaluate the different careers available to be considered a professional &#8220;web designer&#8221;.<br />
We have all heard ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/10/a-career-in-web-design/">A Career in Web Design</a></p><p>For those of us interested in a <a href="http://www.onlinewebdesigndegree.com" target="_blank">career in web design</a>, it is essential that we understand the phrase &#8220;web design&#8221; from a dynamic standpoint as opposed to the <a href="http://www.onlinewebdesigndegree.com" target="_blank"><img class="alignleft size-full wp-image-4606" title="I Love HTML" src="http://www.mikestratton.net/assets/i_love_html.png" alt="I Love HTML" width="182" height="132" /></a>widely accepted HTML definition. This article evaluates the term &#8220;web design&#8221; as it directly relates to different career paths in the field of &#8220;web design&#8221;. It will also include relevant links to help you better evaluate the different careers available to be considered a <a href="http://www.onlinewebdesigndegree.com" target="_blank">professional &#8220;web designer&#8221;.</a></p>
<p>We have all heard of the term &#8220;web design&#8221;, but very few of us have given careful consideration to what the term &#8220;web design&#8221; really means. From a simplistic standpoint, most believe that web design could be summed up in a sentence or two. Ask someone with minimal experience what web design means and they will respond with something to the effect: &#8220;web design is the creation of a website with <a href="http://www.onlinewebdesigndegree.com" target="_blank">HTML</a> and graphics&#8221;. This view is acceptable, but the phrase &#8220;web design&#8221; is actually dynamic and not static. It is dynamic as it is defined from the standpoint of who you are and what you do; that is, our definition of the term &#8220;web design&#8221; is directly related to our experience in the field of computer science.</p>
<p>From the standpoint of someone with a degree in computer science, the phrase “web design” is used as a method to market websites to small businesses and individuals and is not relevant to actual experience in the field. Software developers never label themselves as “web designers”. The “labels” are directly related to our experience, for example, a software engineer may have relevant experience as a Visual Basic programmer, and therefore is qualified to apply for a job where the requirements are related to Microsoft’s .net platform.</p>
<p>Are you interested in the field of computer science? MIT (Massachusetts Institute of Technology) offers FREE classes! Click here: <a href="http://ocw.mit.edu/" target="_blank">http://ocw.mit.edu/</a> I will caution you that if math is not your strong suit, this may not be the field for you.</p>
<p>If math is not your strong suit, no worries as you can still become a “professional web designer”. Basically, there are two other career paths to choose from a) graphic design, and b) marketing.</p>
<p>The following list defines the career paths available in the field of “web design”.<br />
1. Marketing<br />
2. Arts/Graphic Design<br />
3. Computer Science</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/10/a-career-in-web-design/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial Intelligence &#8211; Problem Solving</title>
		<link>http://www.mikestratton.net/2011/10/artificial-intelligence-problem-solving/</link>
		<comments>http://www.mikestratton.net/2011/10/artificial-intelligence-problem-solving/#comments</comments>
		<pubDate>Thu, 13 Oct 2011 22:59:49 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Stanford Engineering Everywhere]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[stanford engineering everywhere]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4588</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/10/artificial-intelligence-problem-solving/">Artificial Intelligence &#8211; Problem Solving</a></p><p>Provided by Know Labs in Partnership with Stanford University&#8217;s Engineering Department<br />
URL: http://www.ai-class.com/<br />
“Online Introduction to Artificial Intelligence is based on Stanford CS221, Introduction to Artificial Intelligence. This class introduces students to the basics of Artificial Intelligence, which includes machine learning, probabilistic reasoning, robotics, and natural language processing.&#8221;<br />
Source &#8211; ai-class.com<br />
Problem Solving<br />
Definition of a problem: <br />
<br />
Initial State<br />
Action (state) &#8211;&#62; { action1, action2, action3 &#8230; }<br />
Takes a state as input, and returns a set of ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/10/artificial-intelligence-problem-solving/">Artificial Intelligence &#8211; Problem Solving</a></p><h5>Provided by Know Labs in Partnership with Stanford University&#8217;s Engineering Department<br />
URL: <a href="http://www.ai-class.com/" target="_blank">http://www.ai-class.com/</a></h5>
<p>“Online Introduction to Artificial Intelligence is based on Stanford CS221, Introduction to Artificial Intelligence. This class introduces students to the basics of Artificial Intelligence, which includes machine learning, probabilistic reasoning, robotics, and natural language processing.&#8221;<br />
<em>Source &#8211; ai-class.com</em></p>
<h3>Problem Solving</h3>
<p>Definition of a problem: </p>
<ul>
<li>Initial State</li>
<li>Action (state) &#8211;&gt; { action1, action2, action3 &#8230; }<br />
Takes a state as input, and returns a set of possible actions.</li>
<li>Result (state, action) &#8211;&gt; state1<br />
Takes as input state &amp; action and delivers results as new state.</li>
<li>Goal Test (state) &#8211;&gt; True | False<br />
Takes a state and returns a boolean value verifying if the state is a goal or not.</li>
<li>Path Cost (state:action &#8211;&gt; state:action &#8211;&gt; state:action) &#8211;&gt; number.<br />
Takes a sequence of state to action transitions and returns a cost (number).</li>
</ul>
<p></p>
<h3>Tree Search Video <br /></h3>
<p><code><iframe width="560" height="315" src="http://www.youtube.com/embed/c0PfWsqtfdo?rel=0" frameborder="0" allowfullscreen></iframe></code> </p>
<p>function treeSearch(problem) :<br />
frontier = { [ initial.state ] }<br />
loop:<br />
if frontier is empty : (failure)<br />
else (path = remove.frontierChoice (newFrontier))<br />
state = path.end<br />
if ( state == goal) : return path<br />
else (path.extend)<br />
for a in actions :<br />
add [ path  + action = result (state, action) ] to frontier</p>
<p>function graphSearch(problem) :<br />
frontier = { [ initial.state ] } <strong>; explored = { }</strong><br />
loop:<br />
if frontier is empty : (failure)<br />
else (path = remove.frontierChoice (newFrontier))<br />
state = path.end ; <strong>add s to explored </strong><br />
if ( state == goal) : return path<br />
else (path.extend)<br />
for a in actions :<br />
add [ path  + action = result (state, action) ] to frontier<br />
unless result (state, action) in frontier.explored</p>
<h3>Tree Search Types</h3>
<ul>
<li>Breadth First (Counts nodes in the tree, using shortest node length first)</li>
<li>Cheapest First (Counts the total costs of each path, using shortest total cost first)</li>
<li>Depth First (Counts the total cost of each node, using the longest node first. Cannot find a finite value goal)</li>
<li>Greedy Best &#8211; First (Estimates the fastet way to reach a the goal, and continues on that path until the goal is reached. Does not always find the fastest path to a goal as it will not consider moving away from a goal as a possibile method of reach the goal.)<br />
<img src="http://www.mikestratton.net/assets/greedy-best-first.png" alt="Greedy Best Search" title="Greedy Best First" width="480" height="360" class="alignnone size-full wp-image-4591" />
</li>
<li>A* Search <br />
function = g + h<br />
g(path) = path cost<br />
h(path) = h(state) = estimated distance to goal</li>
</ul>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/10/artificial-intelligence-problem-solving/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Probability</title>
		<link>http://www.mikestratton.net/2011/10/intro-to-probability/</link>
		<comments>http://www.mikestratton.net/2011/10/intro-to-probability/#comments</comments>
		<pubDate>Mon, 10 Oct 2011 07:10:46 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Advanced Mathematics]]></category>
		<category><![CDATA[Stanford Engineering Everywhere]]></category>
		<category><![CDATA[advanced mathematics]]></category>
		<category><![CDATA[stanford engineering everywhere]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4572</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/10/intro-to-probability/">Probability</a></p><p>Intro to Probability<br />
As referenced by ai-class.com, a pre-requisite of the Intro to AI class.<br />
https://www.ai-class.com/resources<br />
URL: http://www.khanacademy.org/video/basic-probability?playlist=Probability<br />
<br />
&#160;<br />
Probability #6 &#8211; Introduction to Conditional Probability<br />
<br />
Dependent Probability Example #1<br />
<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/10/intro-to-probability/">Probability</a></p><h3>Intro to Probability</h3>
<p>As referenced by ai-class.com, a pre-requisite of the Intro to AI class.<br />
<a href="https://www.ai-class.com/resources" target="_blank">https://www.ai-class.com/resources</a></p>
<p>URL: <a href="http://www.khanacademy.org/video/basic-probability?playlist=Probability" target="_blank">http://www.khanacademy.org/video/basic-probability?playlist=Probability</a></p>
<p><code><iframe width="560" height="315" src="http://www.youtube.com/embed/uzkc-qNVoOk?rel=0" frameborder="0" allowfullscreen></iframe></code><br />
<br />&nbsp;</p>
<h3>Probability #6 &#8211; Introduction to Conditional Probability</h3>
<p><code><iframe width="420" height="315" src="http://www.youtube.com/embed/xf3vfczoCho?rel=0" frameborder="0" allowfullscreen></iframe></code></p>
<h3>Dependent Probability Example #1</h3>
<p><code><iframe width="560" height="315" src="http://www.youtube.com/embed/xPUm5SUVzTE?rel=0" frameborder="0" allowfullscreen></iframe></code></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/10/intro-to-probability/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Intro to Artificial Intelligence</title>
		<link>http://www.mikestratton.net/2011/10/intro-to-artificial-intelligence/</link>
		<comments>http://www.mikestratton.net/2011/10/intro-to-artificial-intelligence/#comments</comments>
		<pubDate>Mon, 10 Oct 2011 05:49:37 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Stanford Engineering Everywhere]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[stanford engineering everywhere]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4563</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/10/intro-to-artificial-intelligence/">Intro to Artificial Intelligence</a></p><p>Provided by Know Labs in Partnership with Stanford University&#8217;s Engineering Department<br />
URL: http://www.ai-class.com/<br />
&#8220;Online Introduction to Artificial Intelligence is based on Stanford CS221, Introduction to Artificial Intelligence. This class introduces students to the basics of Artificial Intelligence, which includes machine learning, probabilistic reasoning, robotics, and natural language processing.<br />
The objective of this class is to teach you modern AI. You learn about the basic techniques and tricks of the trade, at the same level we teach our Stanford students. We also ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/10/intro-to-artificial-intelligence/">Intro to Artificial Intelligence</a></p><h5>Provided by Know Labs in Partnership with Stanford University&#8217;s Engineering Department<br />
URL: <a href="http://www.ai-class.com/" target="_blank">http://www.ai-class.com/</a></h5>
<p>&#8220;Online Introduction to Artificial Intelligence is based on Stanford CS221, Introduction to Artificial Intelligence. This class introduces students to the basics of Artificial Intelligence, which includes machine learning, probabilistic reasoning, robotics, and natural language processing.</p>
<p>The objective of this class is to teach you modern AI. You learn about the basic techniques and tricks of the trade, at the same level we teach our Stanford students. We also aspire to excite you about the field of AI. Whether you are a seasoned professional, a college student, or a curious high school student &#8211; everyone can participate.</p>
<p>This online class will make this material available to a worldwide audience. But rather than just watching lectures online, you will participate. You will do homework assignments, take exams, participate in discussions with other students, ask questions of the instructors, and also get a final score.&#8221;<br />
<em>Source </em>- <em>ai-class.com </em></p>
<h3>Intelligent Agent</h3>
<ul>
<li>An intelligent agent interacts with an environment.</li>
<li>It detects the state of its environment through its sensors.</li>
<li>It can effect the state of the environment through its actuators.</li>
<li>The function that recieves its input (sensors) and responds with an output (actuators) is known as the <strong>control policy</strong> for the agent.</li>
<li>The control policy creates a loop in which:<br />
Input data is recieved (sensors)<br />
Input data is processed, a decision is made how to respond to this data. (Control Policy)<br />
Actuators send data to environment in an effort to change the environment.</li>
<li>The previous loop is known as the <strong>Perception Action Cycle</strong></li>
</ul>
<p><img class="alignnone size-full wp-image-4564" title="Perception Action Cycle" src="http://www.mikestratton.net/assets/ai-cycle.png" alt="" width="345" height="327" /></p>
<h4>My Thoughts</h4>
<p>From the earliest stages of childhood development, we are fascinated with both ourselves and our environment. It would seem that we learn as a result of discovering who we are rather than our environments response to what we do.</p>
<p>Considering this, I propose the following concept:<br />
An intelligent agent may have greater success not through the awareness of it&#8217;s environment; but rather, an intelligent agent should see all factors as individual pieces of its environment, including itself. Each factor in its environment has a corresponding equation, with all equations culminating together into a much greater equation.</p>
<p><img class="alignnone size-full wp-image-4565" title="Intelligent Agent" src="http://www.mikestratton.net/assets/agent.png" alt="" width="320" height="400" /></p>
<h3>Artificial Intelligence Terminology</h3>
<ul>
<li><strong>Fully</strong> versus <strong>Partially</strong> (observable)<br />
An environment is considered fully observable if the intelligent agent can always see (input data) the full state of the environment. An environment is partially observable if the agent can only see a portion of the environment, yet it is able to calculate past environments to better understand its current state. (i.e. Playing Blackjack 21 using 52 cards. The agent can &#8220;count cards&#8221; and knows which cards have not yet been played)</li>
<li><strong>Determinist</strong> versus <strong>Stochastic</strong><br />
A deterministic environment is one where an agent&#8217;s actions uniquely determine the outcome. (For example, in the game of chess, the agent move piece to  a set place.) A Stochastic environment is one where the agents actions to not directly determine the outcome. (For example, in a game of dice, the roll is random and the agent cannot determine the outcome.)</li>
<li><strong>Discrete </strong>versus <strong>Continuous</strong><br />
A discrete environment in one in which there are a finite number of actions to be performed. (Chess for example). A continuous environment is one in which the number of actions that can be performed maybe infinite. (For example, to play a game of darts, there are an infinte number of angles and infinite number of accelerations.)</li>
<li><strong>Benign </strong>versus <strong>Adversarial<br />
</strong>Benign environments are ones that may be random or stochastic, yet the environment has not objective that may contradict the agents objective. (Weather is random and it may affect your reaction, but it&#8217;s purpose is not to negatively affect someone.) An adversial environment is one where the environment is &#8220;out to get&#8221; the agent. (Chess is an example).</li>
</ul>
<h3>Artificial Intelligence and Uncertainty Management</h3>
<p>What to do when you do not know what to do?</p>
<p>Reasons for Uncertainty:</p>
<ul>
<li>Sensor Limits</li>
<li>Adversaries</li>
<li> Stochastic Environments</li>
<li>Laziness</li>
<li>Ignorance</li>
</ul>
<h3>Intro to Artificial Intelligence &#8211; Summary</h3>
<p><code><iframe width="448" height="252" src="http://www.youtube.com/embed/mXM38kjzK-M?rel=0" frameborder="0" allowfullscreen></iframe></code></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/10/intro-to-artificial-intelligence/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Divide &amp; Conquer</title>
		<link>http://www.mikestratton.net/2011/09/divide-conquer/</link>
		<comments>http://www.mikestratton.net/2011/09/divide-conquer/#comments</comments>
		<pubDate>Sat, 24 Sep 2011 04:27:54 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Mountain State University]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4533</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/09/divide-conquer/">Divide &#038; Conquer</a></p><p>This post is being created to display the Divide and Conquer problem solving strategy.<br />
While taking a C++ programming class, I was suddenly hit with a great deal work than I had expected. The work seemed completely overwhelming, and I felt a bit overwhelmed. To reduce the work load I have decided to break down the work to be performed into much smaller, byte size pieces. To do this, I must take the full scope of each assignment and break ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/09/divide-conquer/">Divide &#038; Conquer</a></p><p>This post is being created to display the Divide and Conquer problem solving strategy.</p>
<p>While taking a C++ programming class, I was suddenly hit with a great deal work than I had expected. The work seemed completely overwhelming, and I felt a bit overwhelmed. To reduce the work load I have decided to break down the work to be performed into much smaller, byte size pieces. To do this, I must take the full scope of each assignment and break it down into much smaller, &#8220;byte&#8221; size pieces.</p>
<p>There are 3 different problem sets. The first entails the use of the CodeBlocks IDE, the second and third are both lab assignments.</p>
<p><em>References: </em><br />
<em>Dale, N. &amp; Weems, C. (2010). Programming and Problem Solving with C++, 5th edition, Jones and Bartlett Publishers, Sudbury, MA.</em><br />
<em>Dale, N (2010). A Labratory Course in C++, 5th edition, Jones and Bartlett Publishers, Sudbury, MA.</em></p>
<div class="hr_shadow" /></div><h2>Problem Set 1: CodeBlocks IDE</h2>
<p>Requirements:<br />
All lab assignments must be saved as a project file, and each file must work independently of each other yet work together as a complete software package.</p>
<p>The resolution to this was actually quite simple. Each independent file was created by formatting the file as a function other than main. The main file (function) then included references to the other functions. The main file (function) also included internal functions so that a user could enter the program number of there choice or enter zero to exit the program. The program loops indefinitely, requesting a program to run until the user enters the number zero.</p>
<p>Here is the code:<br />
// Example of software package to be run from codeblocks  or other IDE project file.<br />
// This program asks the user to enter the number of a program<br />
// or the number 0 to exit the program.<br />
// Author: Michael A. Stratton, 2011 <a href="http://www.mikestratton.net/" target="_blank">http://www.mikestratton.net/</a><br />
// Licensed under the MIT license: <a href="http://www.opensource.org/licenses/mit-license.php" target="_blank">http://www.opensource.org/licenses/mit-license.php</a><br />
//<br />
#include &lt;iostream&gt;</p>
<p>using namespace std;</p>
<p>//**************************************************************<br />
//**************************************************************<br />
// Import external programs<br />
void richUncle();<br />
void richUncle_unresolved();<br />
// End of Imported Programs<br />
//**************************************************************<br />
//**************************************************************</p>
<p>//**************************************************************<br />
//**************************************************************<br />
// internal programs<br />
void selectProgram(); // used to gather user input</p>
<p>int programNumber; // global variable to assoiciate program number<br />
// end of internal programs<br />
//**************************************************************<br />
//**************************************************************</p>
<p>//**************************************************************<br />
//**************************************************************<br />
// Main Function<br />
int main()<br />
{<br />
selectProgram(); // function requesting user input for program</p>
<p>while (programNumber == 0)<br />
{<br />
return 1;<br />
}<br />
while(programNumber != 1 &amp;&amp;<br />
programNumber != 2)<br />
{<br />
cout &lt;&lt; &#8220;Your entry was not reconized.&#8221; &lt;&lt; endl &lt;&lt; endl;<br />
cin &gt;&gt; programNumber;<br />
}</p>
<p>while(programNumber == 1)<br />
{<br />
richUncle();<br />
selectProgram();<br />
}<br />
while(programNumber == 2)<br />
{<br />
richUncle_unresolved();<br />
selectProgram();<br />
}</p>
<p>return 0;<br />
}<br />
// end main function<br />
//**************************************************************<br />
//**************************************************************</p>
<p>//**************************************************************<br />
//**************************************************************<br />
// function requesting user input<br />
void selectProgram() // used to request user input.<br />
{<br />
cout &lt;&lt; &#8220;Welcome to Lab 8-6 Professor Sanford!&#8221; &lt;&lt; endl &lt;&lt; endl;<br />
cout &lt;&lt; &#8220;Please select a program to run.&#8221; &lt;&lt; endl;<br />
cout &lt;&lt; &#8220;To run the richUncle program enter 1&#8243; &lt;&lt; endl;<br />
cout &lt;&lt; &#8220;To run the richUncle_unresolved program enter 2&#8243; &lt;&lt; endl;<br />
cout &lt;&lt; &#8220;To end this program, enter 0&#8243; &lt;&lt; endl;<br />
cin &gt;&gt; programNumber;<br />
}<br />
// end function requesting user input<br />
//**************************************************************<br />
//**************************************************************</p>
<p>&nbsp;</p>
<div class="hr_shadow" /></div><h2>Problem Set 2: Lab 8-6 Case Study Maintenance</h2>
<p>Requirements:<br />
Exercise 1:<br />
Refactor an existing program. Recall that in a refactoring situation, the functional decomposition is done in light of the know solution to the problem. In many cases. it involves arragning existing statements into encapsulated functions so that the code is easer to understand and modify.<br />
Exercise 2:<br />
How many solutions does your refactored solution have?<br />
Exercise 3:<br />
List each function name along with the parameter list.</p>
<p>The first step in this was to create a flow chart of how the refactored solution would look. To do this I used Microsoft Visio to create a simplistic flow chart.<br />
Click here to view the flow chart: <a href="http://www.mikestratton.net/code/cplusplus/visio/lab8-6_Stratton.htm" target="_blank">Lab 8-6 Visio Flowchart</a><br />
<em>* Flowchart works best if viewed in Internet Explorer.</em></p>
<p>The biggest problem came as a result of having to refactor the existing code into separate functions.</p>
<p>Here is the existing code:</p>
<p>//********************************************************************<br />
// Rich Uncle Program<br />
// Percentage of characters in the file that belong to five categories:<br />
// uppercase characters,lowercase characters, decimal digits, blanks,<br />
// and end-of-sentence punctuation marks<br />
// Assumptions: Input file is not empty and percentages are based<br />
// on total number of characters in the file<br />
//******************************************************************</p>
<p>#include &lt;fstream&gt;<br />
#include &lt;iostream&gt;<br />
#include &lt;iomanip&gt;<br />
#include &lt;cctype&gt;</p>
<p>using namespace std;<br />
int richUncle() // originally named main<br />
{<br />
// Prepare file for reading<br />
ifstream text;<br />
char character;</p>
<p>// Declare and initialize counters<br />
int uppercaseCounter = 0;        // Number of uppercase letters<br />
int lowercaseCounter = 0;        // Number of lowercase letters<br />
int blankCounter = 0;            // Number of blanks<br />
int digitCounter = 0;            // Number of digits<br />
int punctuationCounter = 0;      // Number of end &#8216;.&#8217;, &#8216;?&#8217;, &#8216;!&#8217;<br />
int allElseCounter = 0;          // Remaining characters</p>
<p>string inFileName;      // User specified input file name<br />
cout &lt;&lt; &#8220;Enter the name of the file to be processed&#8221; &lt;&lt; endl;<br />
cin &gt;&gt; inFileName;<br />
text.open(inFileName.c_str());<br />
if (!text)<br />
{<br />
cout &lt;&lt; &#8220;Files did not open successfully.&#8221; &lt;&lt; endl;<br />
return 1;<br />
}<br />
text.get(character);             // Input one character<br />
do<br />
{</p>
<p>// Process each character<br />
if (isupper(character))<br />
uppercaseCounter++;<br />
else if (islower(character))<br />
lowercaseCounter++;<br />
else if (isdigit(character))<br />
digitCounter++;<br />
else<br />
switch (character)<br />
{<br />
case &#8216; &#8216; : blankCounter++;<br />
break;<br />
case &#8216;.&#8217; :<br />
case &#8216;?&#8217; :<br />
case &#8216;!&#8217; : punctuationCounter++;<br />
break;<br />
defualt  : allElseCounter++;<br />
break;</p>
<p>}<br />
text.get(character);<br />
} while (text);</p>
<p>// Calculate total number of characters<br />
float total = uppercaseCounter + lowercaseCounter<br />
+ blankCounter + digitCounter + punctuationCounter<br />
+ allElseCounter;<br />
cout &lt;&lt; &#8220;Analysis of characters on input file &#8221; &lt;&lt; inFileName<br />
&lt;&lt; endl;</p>
<p>// Write output on standard output device<br />
cout &lt;&lt; fixed &lt;&lt; setprecision(3)<br />
&lt;&lt; &#8220;Percentage of uppercase characters: &#8220;<br />
&lt;&lt; uppercaseCounter / total * 100 &lt;&lt; endl;<br />
cout &lt;&lt; fixed &lt;&lt; setprecision(3)<br />
&lt;&lt; &#8220;Percentage of lowercase characters: &#8220;<br />
&lt;&lt; lowercaseCounter / total * 100 &lt;&lt; endl;<br />
cout &lt;&lt; fixed &lt;&lt; setprecision(3) &lt;&lt; &#8220;Percentage of blanks: &#8220;<br />
&lt;&lt; blankCounter / total * 100 &lt;&lt; endl;<br />
cout &lt;&lt; fixed &lt;&lt; setprecision(3) &lt;&lt; &#8220;Percentage of digits: &#8220;<br />
&lt;&lt; digitCounter / total * 100 &lt;&lt; endl;<br />
cout &lt;&lt; fixed &lt;&lt; setprecision(3) &lt;&lt; &#8220;Percentage of end-of-sentence &#8220;<br />
&lt;&lt; &#8220;punctuation &#8221; &lt;&lt; punctuationCounter / total * 100 &lt;&lt; endl;<br />
text.close();<br />
// return 0; // removed as no longer main<br />
}</p>
<div class="hr_shadow" /></div><h2>Problem set 3: Lab 9-6 Case Study Maintenance</h2>
<p>Requirements:<br />
Exercise 1:<br />
Compile and run an existing program using data of your choice.<br />
Exercise 2:<br />
Enhance the program to meet a specific set of requirements.</p>
<p>The biggest problem of this problem set, came as a result of having to add an additional function to existing code.</p>
<p>The additional function must meet the following requirements.<br />
Requirements:<br />
For each person, print the number of high-risk categories into which that individual falls. Compile and run the program with sufficient data to check that each combination of high-risk categories is represented.</p>
<p>Here is the original code:</p>
<p>//******************************************************************<br />
// Profile Program<br />
// This program inputs a name, weight, height, blood pressure<br />
// readings, and cholesterol values.  Appropriate health messages<br />
// are written for each of the input values on file healthProfile.<br />
//******************************************************************</p>
<p>#include &lt;fstream&gt;<br />
#include &lt;iostream&gt;<br />
#include &lt;string&gt;<br />
#include &lt;iomanip&gt;</p>
<p>using namespace std;</p>
<p>// Function prototypes<br />
string Name();<br />
// This function inputs a name and returns it in first,<br />
// middle initial, and last order</p>
<p>void EvaluateCholesterol(ofstream&amp; healthProfile, string name);<br />
// This function inputs HDL (good cholesterol) and LDL (bad<br />
// cholesterol) and prints out a  health message based on their<br />
// values on file healthProfile.<br />
// Pre: Input file has been successfully opened</p>
<p>void EvaluateBMI(ofstream&amp; healthProfile, string name);<br />
// This function inputs weight in pounds and height in inches and<br />
// calculates the body mass index (BMI prints a health message<br />
// based on the BMI. Input in English weights.<br />
// Pre: Input file has been successfully opened</p>
<p>void EvaluateBloodPressure(ofstream&amp; healthProfile, string name);<br />
// This function gets blood pressure readings (systolic/diastolic)<br />
// and prints out a  health message based on their values<br />
// on file healthProfile.<br />
// Pre: Input file has been successfully opened</p>
<p>int main()<br />
{<br />
// Declare and open the output file<br />
ofstream healthProfile;<br />
healthProfile.open(&#8220;Profile&#8221;);<br />
string name;<br />
name = Name();</p>
<p>// Write patient&#8217;s name on output file<br />
healthProfile &lt;&lt; &#8220;Patient&#8217;s name &#8221; &lt;&lt; name &lt;&lt; endl;</p>
<p>// Evaluate the patient&#8217;s statistics<br />
EvaluateCholesterol(healthProfile, name);<br />
EvaluateBMI(healthProfile, name);<br />
EvaluateBloodPressure(healthProfile, name);<br />
healthProfile &lt;&lt; endl;</p>
<p>healthProfile.close();<br />
return 0;<br />
}</p>
<p>//******************************************************************</p>
<p>string Name()<br />
// This function inputs a name and returns it in first,<br />
// middle initial, and last order<br />
{<br />
// Declare the patient&#8217;s name<br />
string firstName;<br />
string lastName;<br />
char middleInitial;</p>
<p>// Prompt for and enter the patient&#8217;s name<br />
cout &lt;&lt; &#8220;Enter the patient&#8217;s first name: &#8220;;<br />
cin &gt;&gt; firstName;<br />
cout &lt;&lt; &#8220;Enter the patient&#8217;s last name: &#8220;;<br />
cin &gt;&gt; lastName;<br />
cout &lt;&lt; &#8220;Enter the patient&#8217;s middle initial: &#8220;;<br />
cin &gt;&gt; middleInitial;<br />
return firstName + &#8216; &#8216;  + middleInitial + &#8220;. &#8221; + lastName;<br />
}</p>
<p>//******************************************************************</p>
<p>void EvaluateCholesterol(ofstream&amp; healthProfile, string name)<br />
// This function inputs HDL (good cholesterol) and LDL (bad<br />
// cholesterol) and prints out a  health message based on their<br />
// values on file healthProfile.<br />
{<br />
int HDL;<br />
int LDL;</p>
<p>// Prompt for and enter HDL and LDL<br />
cout &lt;&lt; &#8220;Enter HDL for &#8221; &lt;&lt; name &lt;&lt; &#8220;: &#8220;;<br />
cin &gt;&gt; HDL;<br />
cout &lt;&lt; &#8220;Enter LDL for &#8221; &lt;&lt; name &lt;&lt; &#8220;: &#8220;;<br />
cin &gt;&gt; LDL;<br />
float ratio = (float)HDL/(float)LDL; // Calculate ratio of HDL to LDL</p>
<p>healthProfile &lt;&lt; &#8220;Cholesterol Profile &#8221; &lt;&lt; endl<br />
&lt;&lt; &#8220;   HDL: &#8221; &lt;&lt; HDL &lt;&lt; &#8220;  LDL: &#8221; &lt;&lt; LDL &lt;&lt; endl<br />
&lt;&lt; &#8220;   Ratio: &#8221; &lt;&lt; fixed &lt;&lt; setprecision(4)<br />
&lt;&lt; ratio &lt;&lt; endl;</p>
<p>// Print message based on HDL value<br />
if (HDL &lt; 40)<br />
healthProfile &lt;&lt; &#8220;   HDL is too low&#8221; &lt;&lt; endl;<br />
else if (HDL &lt; 60)<br />
healthProfile &lt;&lt; &#8220;   HDL is okay&#8221; &lt;&lt; endl;<br />
else<br />
healthProfile &lt;&lt; &#8220;   HDL is excellent&#8221; &lt;&lt; endl;<br />
// Print message based on LDL value<br />
if (LDL &lt; 100)<br />
healthProfile &lt;&lt; &#8220;   LDL is optimal&#8221; &lt;&lt; endl;<br />
else if (LDL &lt; 130)<br />
healthProfile &lt;&lt; &#8220;   LDL is near optimal&#8221; &lt;&lt; endl;<br />
else if (LDL &lt; 160)<br />
healthProfile &lt;&lt; &#8220;   LDL is borderline high&#8221; &lt;&lt; endl;<br />
else if (LDL &lt; 190)<br />
healthProfile &lt;&lt; &#8220;   LDL is high&#8221; &lt;&lt; endl;<br />
else<br />
healthProfile &lt;&lt; &#8220;   LDL is very high&#8221; &lt;&lt; endl;</p>
<p>if (ratio &gt; 0.3)<br />
healthProfile &lt;&lt; &#8220;   Ratio of HDL to LDL is good&#8221;<br />
&lt;&lt; endl;<br />
else<br />
healthProfile &lt;&lt; &#8220;   Ratio of HDL to LDL is not good&#8221;<br />
&lt;&lt; endl;<br />
}</p>
<p>//******************************************************************</p>
<p>void EvaluateBMI(ofstream&amp; healthProfile, string name )<br />
// This function inputs weight in pounds and height in inches and<br />
// calculates the body mass index Input in English weights.<br />
{<br />
const int BMI_CONSTANT = 703;  // Constant in English formula<br />
int pounds;<br />
int inches;</p>
<p>// Enter the patient&#8217;s weight and height<br />
cout &lt;&lt; &#8220;Enter the weight in pounds for &#8221; &lt;&lt; name &lt;&lt; &#8220;: &#8220;;<br />
cin &gt;&gt; pounds;<br />
cout &lt;&lt; &#8220;Enter the height in inches for &#8221; &lt;&lt; name &lt;&lt; &#8220;: &#8220;;<br />
cin &gt;&gt; inches;<br />
int bodyMassIndex = pounds * BMI_CONSTANT / (inches * inches);</p>
<p>healthProfile &lt;&lt; &#8220;Body Mass Index Profile&#8221; &lt;&lt; endl<br />
&lt;&lt; &#8220;   Weight: &#8221; &lt;&lt; pounds &lt;&lt; &#8220;  Height: &#8220;<br />
&lt;&lt; inches &lt;&lt; endl;<br />
// Print bodyMassIndex<br />
healthProfile &lt;&lt; &#8220;   Body mass index is &#8221; &lt;&lt; bodyMassIndex<br />
&lt;&lt; endl;<br />
healthProfile &lt;&lt; &#8220;   Interpretation of BMI &#8221; &lt;&lt; endl;</p>
<p>// Print interpretation of BMI<br />
if (bodyMassIndex &lt;20)<br />
healthProfile &lt;&lt; &#8220;   Underweight&#8221;<br />
&lt;&lt; endl;<br />
else if (bodyMassIndex &lt;=25)<br />
healthProfile &lt;&lt; &#8220;   Normal&#8221;  &lt;&lt; endl;<br />
else if (bodyMassIndex &lt;= 30)<br />
healthProfile &lt;&lt; &#8220;   Overweight&#8221;<br />
&lt;&lt; endl;<br />
else<br />
healthProfile &lt;&lt; &#8220;   Obese&#8221;<br />
&lt;&lt; endl;<br />
}</p>
<p>//******************************************************************</p>
<p>void EvaluateBloodPressure(ofstream&amp; healthProfile, string name)<br />
// This function gets blood pressure readings (systolic/diastolic)<br />
// and prints out a  health message based on their values<br />
// on file healthProfile.<br />
{<br />
// Declare the blood pressure readings<br />
int systolic;<br />
int diastolic;</p>
<p>// Enter the patient&#8217;s blood pressure readings<br />
cout &lt;&lt; &#8220;Enter the systolic blood pressure reading for &#8220;<br />
&lt;&lt; name &lt;&lt; &#8220;: &#8220;;<br />
cin &gt;&gt; systolic;<br />
cout &lt;&lt; &#8220;Enter the diastolic blood pressure reading for &#8220;<br />
&lt;&lt; name &lt;&lt; &#8220;: &#8220;;<br />
cin &gt;&gt; diastolic;</p>
<p>// Print interpretation of systolic reading<br />
healthProfile &lt;&lt; &#8220;Blood Pressure Profile &#8221; &lt;&lt; endl<br />
&lt;&lt; &#8220;   Systolic: &#8221; &lt;&lt; systolic<br />
&lt;&lt; &#8220;   Diastolic: &#8221; &lt;&lt; diastolic &lt;&lt; endl;<br />
if (systolic &lt; 120)<br />
healthProfile &lt;&lt; &#8220;   Systolic reading is optimal&#8221; &lt;&lt; endl;<br />
else if (systolic &lt; 130)<br />
healthProfile &lt;&lt; &#8220;   Systolic reading is normal&#8221; &lt;&lt; endl;<br />
else if (systolic &lt; 140)<br />
healthProfile &lt;&lt; &#8220;   Systolic reading is high normal&#8221;<br />
&lt;&lt; endl;<br />
else if (systolic &lt; 160)<br />
healthProfile &lt;&lt;<br />
&#8220;   Systolic indicates hypertension Stage 1&#8243; &lt;&lt; endl;<br />
else if (systolic &lt; 180)<br />
healthProfile &lt;&lt;<br />
&#8220;   Systolic indicates hypertension Stage 2&#8243; &lt;&lt; endl;<br />
else<br />
healthProfile &lt;&lt;<br />
&#8220;   Systolic indicates hypertension Stage 3&#8243; &lt;&lt; endl;</p>
<p>// Print interpretation of diastolic reading<br />
if (diastolic &lt; 80)<br />
healthProfile &lt;&lt; &#8220;   Diastolic reading is optimal&#8221; &lt;&lt; endl;<br />
else if (diastolic &lt; 85)<br />
healthProfile &lt;&lt; &#8220;   Diastolic reading is normal&#8221; &lt;&lt; endl;<br />
else if (diastolic &lt; 90)<br />
healthProfile &lt;&lt; &#8220;   Diastolic reading is high normal&#8221;<br />
&lt;&lt; endl;<br />
else if (diastolic &lt; 100)<br />
healthProfile &lt;&lt;<br />
&#8220;   Diastolic indicates hypertension Stage 1&#8243; &lt;&lt; endl;<br />
else if (diastolic &lt; 110)<br />
healthProfile &lt;&lt;<br />
&#8220;   Diastolic indicates hypertension Stage 2&#8243; &lt;&lt; endl;<br />
else<br />
healthProfile &lt;&lt;<br />
&#8220;   Diastolic indicates hypertension Stage 3&#8243; &lt;&lt; endl;<br />
}</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/09/divide-conquer/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>What is JavaScript?</title>
		<link>http://www.mikestratton.net/2011/09/what-is-javascript/</link>
		<comments>http://www.mikestratton.net/2011/09/what-is-javascript/#comments</comments>
		<pubDate>Mon, 19 Sep 2011 04:29:49 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[javascript]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4520</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/09/what-is-javascript/">What is JavaScript?</a></p><p>First and foremost JavaScript is a client side scripting language used to improve the usbability and functionality of web sites and web applications.<br />
A simple example of this is client-side validation. Without client side validation, a programmer would have to process the contents of a form via a web server, and then send a response back if the form was completed incorrectly. JavaScript can eliminate this by simply validating the data directly in a web browser.<br />
JavaScript is also not ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/09/what-is-javascript/">What is JavaScript?</a></p><p>First and foremost JavaScript is a client side scripting language used to improve the usbability and functionality of web sites and web applications.</p>
<p>A simple example of this is client-side validation. Without client side validation, a programmer would have to process the contents of a form via a web server, and then send a response back if the form was completed incorrectly. JavaScript can eliminate this by simply validating the data directly in a web browser.</p>
<p>JavaScript is also not the best langauge for a complex software program, it was intended for smaller programs.</p>
<p>Now to the &#8220;good stuff&#8221;.</p>
<p>I am going to share several links that will not only improve your ability to add functionality within a website, the use and understanding of these websites alone can very well land you a decent job opportunity.</p>
<p>jQuery &#8211; <a href="http://jquery.com/" target="_blank">http://jquery.com/</a><br />
Add unbelievable functionality to ANY website by simply copying and pasting a jQuery plugin into your website.</p>
<p>MooTools &#8211; <a href="http://mootools.net/" target="_blank">http://mootools.net/</a><br />
Just like jQuery, MooTools is a JavaScript library with a ton of resources for rocketing your website to the top of the charts.</p>
<p>Script-Aculo-Us &#8211; <a href="http://script.aculo.us/" target="_blank">http://script.aculo.us/</a><br />
Another JavaScript library, with some simply amazing features and functionaliy.</p>
<p>Google Code &#8211; <a href="http://code.google.com/" target="_blank">http://code.google.com/</a><br />
Everything google &amp; more at the tips of your fingers, at absolutely no cost to you.</p>
<p>Yahoo! User Interface (YUI) Library &#8211; <a href="http://developer.yahoo.com/yui/" target="_blank">http://developer.yahoo.com/yui/</a><br />
Build a rich internet application in no time with use of Yahoo&#8217;s JavaScript/CSS library.</p>
<p>Finally, I would like to leave you with a term you may or may not of heard before.<br />
AJAX (Acronym for &#8220;asynchronous JavaScript and XML&#8221;).|<br />
Ajax allows web applications to send data and retrieve data from, a server asynchronously (in the background) without interfering with the display and behavior of the existing page<br />
Practically everything you do on the web will include AJAX on some level.<br />
Ajax should not be considered a &#8220;programming langauge&#8221;; but rather, Ajax is a combination of programming langauges and protocols.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/09/what-is-javascript/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>How to Design a Loop</title>
		<link>http://www.mikestratton.net/2011/09/how-to-design-a-loop/</link>
		<comments>http://www.mikestratton.net/2011/09/how-to-design-a-loop/#comments</comments>
		<pubDate>Thu, 15 Sep 2011 06:52:29 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4512</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/09/how-to-design-a-loop/">How to Design a Loop</a></p><p>How to Design a Loop with C++ Samples<br />
What are the seven questions that must be answered to design a loop?<br />
Designing the Flow of Control<br />
The answer to the above questions depends on the type of termination conditions.<br />
Reference:<br />
Dale, N. and Weems, C. (2010). Programming and Problem Solving with C++, 5th Edition, Jones and Bartlett Publishers, LLC, Sudbury, MA.<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/09/how-to-design-a-loop/">How to Design a Loop</a></p><h2>How to Design a Loop with C++ Samples</h2>
<p>What are the seven questions that must be answered to design a loop?</p>
<ul class="list list4">
<li>1) What condition ends the loop?</li>
<li>2) How should the condition be initialized?</li>
<li>3) How should the condition be updated?</li>
<li>4) What process is being repeated?</li>
<li>5) How should the process be initialized?</li>
<li>6) How should the process be updated?</li>
<li>7) What is the state of the program on exiting the loop?</li>
</ul>
<h3>Designing the Flow of Control</h3>
<ul class="list list3">
<li>What is the condition that ends the loop?</li>
<li>How should the condition be initialized?</li>
<li>How should the condition be updated?</li>
</ul>
<p>The answer to the above questions depends on the type of termination conditions.</p>
<ul class="list">
<li>Count-Controlled Loops</li>
<li>Sentinel Controlled Loops<br />
For example: (Testing that a file opened correctly)<br />
int main()<br />
{<br />
ifstream inData;<br />
inData.open(&#8220;inData.dat&#8221;);    int sum, number;<br />
sum = 0;<br />
while (!inData) // if the inData is in fail state, sentinel loop condition<br />
{<br />
cout &lt;&lt; &#8220;File open error!&#8221; &lt;&lt; endl; // print error statement<br />
return 0;<br />
}<br />
}</li>
<li>EOF-Controlled Loops (End of File)</li>
<li>Flag Controlled Loops<br />
A Boolean flag variable is initialized to true or false and then updated when the condition changes.</li>
</ul>
<p>Reference:<br />
Dale, N. and Weems, C. (2010). Programming and Problem Solving with C++, 5th Edition, Jones and Bartlett Publishers, LLC, Sudbury, MA.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/09/how-to-design-a-loop/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>C++ Resources</title>
		<link>http://www.mikestratton.net/2011/09/c-resources/</link>
		<comments>http://www.mikestratton.net/2011/09/c-resources/#comments</comments>
		<pubDate>Fri, 09 Sep 2011 20:52:31 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[computer science]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4478</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/09/c-resources/">C++ Resources</a></p><p>Massachusetts Institute of Technology OpenCourseWare &#8211; Intro to C++<br />
http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-096-introduction-to-c-january-iap-2011/<br />
There is no one who dreams of technology that has not given thought to how an education at MIT could send us to the top of the Computer Scientists charts. Although most of us may not be able to attend MIT, we can still take the classes they offer, and for FREE I might add. MIT OpenCourseWare is a name you should have tattoed across your chest, forearm, or forehead, ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/09/c-resources/">C++ Resources</a></p><h2>Massachusetts Institute of Technology OpenCourseWare &#8211; Intro to C++</h2>
<p><a href="http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-096-introduction-to-c-january-iap-2011/">http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-096-introduction-to-c-january-iap-2011/</a></p>
<p>There is no one who dreams of technology that has not given thought to how an education at MIT could send us to the top of the Computer Scientists charts. Although most of us may not be able to attend MIT, we can still take the classes they offer, and for FREE I might add. MIT OpenCourseWare is a name you should have tattoed across your chest, forearm, or forehead, as it is a name you should not forget.</p>
<p>The MIT OpenCourseWare websites about page states that:<br />
&#8220;MIT OpenCourseWare (OCW) is a web-based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity.&#8221;</p>
<p>&nbsp;</p>
<hr />
<p>&nbsp;</p>
<h2>Bjarne Stroustrup&#8217;s: Creator of the C++ Programming Language</h2>
<p><a href="https://parasol.tamu.edu/people/bs/">https://parasol.tamu.edu/people/bs/</a></p>
<p>http://www2.research.att.com/~bs/homepage.html</p>
<p>For obvious reasons, Bjarne Stroustrup&#8217;s home pages are a neccessity for the C++ programmer. Bjarne Stroustrup is the creator and owner of C++, so nothing C++ happens without some connection to Stroustrup. During a job interview for a C++ position, there is a slight chance that one might bring up Bjarne Stroustrup&#8217;s work. You might actually have a chance for the position as long as you do not confuse Bjarne Stroustrup with &#8220;Cambel&#8217;s Soup stuff&#8221;.</p>
<p>&nbsp;</p>
<hr />
<p>&nbsp;</p>
<h2>Microsoft&#8217;s Visual C++</h2>
<p>http://msdn.microsoft.com/en-us/visualc</p>
<p>Visual C++ is Microsoft&#8217;s proprietary version and interpretation of the C++, and for any C++ programmer who ventures into the world of Microsoft and/or asp.net, MSDN is also a necessity. All things Microsoft software development can be learned via MSDN.microsoft.com, so don&#8217;t get caught without it!</p>
<p>It&#8217;s a widely accepted fact that all things technology pass through the proprietary scope of Microsoft at some point in time. So you make a call from your iPhone via Verizon Wireless? Microsoft Server is in the mix. How about playing an online game on your Mac computer? Microsoft Server, again, in the mix. So you visit www.mountainstate.edu &#8211; Microsoft Server AND asp.net &#8211; in the mix.</p>
<p>&nbsp;</p>
<hr />
<p>&nbsp;</p>
<h2>Apple&#8217;s iOS Dev Center</h2>
<p>http://developer.apple.com/devcenter/ios/index.action</p>
<p>So you have came up with an iPhone app that can GPS and photo the exact location of a new species of bug, search for life on Mars, create $100 bills, as well as cures cancer. You know your app is going to make you rich while alotting you the next selection as the Nobel Piece Prize recipient.</p>
<p>My friend, please make sure to bookmark this website, and do take note that iPhone apps CAN and ARE developed in C++.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/09/c-resources/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>C++ Numeric Types, Expressions, and Output</title>
		<link>http://www.mikestratton.net/2011/09/c-numeric-types-expressions-and-output/</link>
		<comments>http://www.mikestratton.net/2011/09/c-numeric-types-expressions-and-output/#comments</comments>
		<pubDate>Wed, 07 Sep 2011 04:29:19 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4466</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/09/c-numeric-types-expressions-and-output/">C++ Numeric Types, Expressions, and Output</a></p><p>Overview of Chapter 3, Programming and Problem Solving with C++, 5th edition (2010)<br />
C++ Data Types<br />
<br />
* Types CHAR, SHORT, INT, and LONG are unsigned. An unsigned integer value is assumed to be only positive or zero.<br />
Examples of Named Constant Declarations for Numberic Types:<br />
const float PI = 3.14159;<br />
const float E = 2.71828;<br />
const float int = MAX_SCORE = 100;<br />
const float int MIN_SCORE = -100;<br />
const char = LETTER = &#8216;W&#8217;;<br />
const string NAME = &#8220;Elizabeth&#8221;;<br />
Examples of ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/09/c-numeric-types-expressions-and-output/">C++ Numeric Types, Expressions, and Output</a></p><p>Overview of Chapter 3, Programming and Problem Solving with C++, 5th edition (2010)</p>
<h3>C++ Data Types<br />
<img class="alignnone size-full wp-image-4473" title="C++ Data Types" src="http://www.mikestratton.net/assets/c_plus_data_types1.png" alt="C++ Data Types" width="580" height="240" /></h3>
<p>* Types CHAR, SHORT, INT, and LONG are unsigned. An unsigned integer value is assumed to be only positive or zero.</p>
<p>Examples of Named Constant Declarations for Numberic Types:<br />
const float PI = 3.14159;<br />
const float E = 2.71828;<br />
const float int = MAX_SCORE = 100;<br />
const float int MIN_SCORE = -100;<br />
const char = LETTER = &#8216;W&#8217;;<br />
const string NAME = &#8220;Elizabeth&#8221;;</p>
<p>Examples of Variable Declarations:<br />
int studentCount;<br />
int sumOfScores;<br />
float average;<br />
char grade;<br />
string stuName;</p>
<p>Given the following declarations:<br />
int num;<br />
int alpha;<br />
float rate:<br />
char ch;<br />
the following are appropriate assignment statements:<br />
alpha = 2856;<br />
rate = 0.36;<br />
ch = &#8216;B&#8217;;<br />
num = alpha;</p>
<p>Operators<br />
+ Unary plus<br />
- Unary minus<br />
+ Addition<br />
- Substraction<br />
* Multipication<br />
/ Division (Integer dvision is without a fractional part)<br />
% Modulus (Remainder from integer divsion)</p>
<p>The modules sign <strong>%</strong> is used to find the remainder of an integer division. Integer division is without floating point numbers therefore 7/2 is equal to 3. With use of modulus 7%2 is equal to 1, as this is the remainder when you divide 7/2. (p. 95)</p>
<p>Increment ++<br />
Decrement &#8211;</p>
<p>Type Coercion<br />
The implicit (automatic) conversion of a value from one data type to another.<br />
For example:<br />
float myFloat;<br />
myFloat = 12;<br />
Coercion changes the integer value of 12 in the above statement to the float value of 12.0.<br />
Another example:<br />
int myInt;<br />
myInt = 4.852;<br />
Coercion changes the float 4.852 into an integer 4, as the the floating point was removed.</p>
<p>Type Casting<br />
The explicit conversion of a value from one data type to another; also know as type conversion.<br />
For example:<br />
myInt = myFloat + 8.2;<br />
or<br />
myInt = int(myFloat + 8.2);<br />
In both examples, the type <strong>int</strong> is cast into type <strong>float</strong>.</p>
<p>Mixed type expression<br />
An expression that contains operands of different data types; also called mixed mode expression.<br />
For example:<br />
myInt * myFloat<br />
Or:<br />
4.8 + myInt &#8211; 3</p>
<p>Sample Program to Clarify Function Calls:</p>
<ol>
<li>int main()</li>
<li>{</li>
<li>count &lt;&lt; &#8220;The square of 10 is &#8221; &lt;&lt; Square(10) &lt;&lt; endl:</li>
<li>return 0;</li>
<li>}</li>
<li>int Square ( int n )</li>
<li>{</li>
<li>return n * n;</li>
<li>}</li>
</ol>
<p>The statement in line 3, the (<strong>main</strong>) causes the servant (<strong>Square)</strong> to compute the square of 10 and return the result back to the main.<br />
In line 3 <strong>Square(10)</strong> is a function call or function invocation. The computer temporarily puts the<strong> main</strong> function on hold and starts the <strong>Square</strong> function running. When <strong>Square </strong>has finished, the computer goes back to <strong>main</strong> and picks up where it left off.</p>
<p>Function call (function invocation)<br />
The mechanism that translates control to a function.</p>
<p>Argument list<br />
A mechanism by which functions communicate with each other.</p>
<p>In line 3, the number 10 is known as an <em>argument (or actual parameter).</em> Arguments make it possible for the same function to work on many different values.<br />
For example:<br />
cout &lt;&lt; Square(4);<br />
cout &lt;&lt; Square(125);</p>
<p>Syntax Template for a Function Call:<br />
FunctionName( ArgumentList)</p>
<p>Some functions have two, three, four, or more arguments in the list, all separated by commas.</p>
<p>Library Functions<br />
Programming languages include a large collegction of prewritten functions, data types, and other items that any programmer may use. In C++, the functions in the library are placed into separate files known as header files.<br />
Example:<br />
Header file: &lt;cmath&gt;<br />
Function: sqrt(x)<br />
Argument type: float<br />
Result type: float<br />
Result (Value Returned): Square root of x.</p>
<p>To use a library function, add the include statment at the top of your program.<br />
For example:<br />
#include &lt;cmath&gt;<br />
The above example adds the library &lt;cmath&gt; that includes the sqrt function (Square root).</p>
<p>Void function (procedure)<br />
A function that does not return a function to its caller and is invoked as a separate statement.</p>
<p>Value-returning function<br />
A function that returns a single value to its caller and is invoked from within an expression.</p>
<p>Manipulators are used only in input and ouput statements.<br />
For example, the the line:<br />
cout &lt;&lt; myInt &lt;&lt; endl &lt;&lt; myFloat;<br />
uses the &#8220;End Line&#8221; manipulator (endl).<br />
Syntax Template:<br />
cout &lt;&lt; ExpressionOrManipulator &lt;&lt; ExpressionOrManiuplator &#8230; ;</p>
<p>Some other examples of manipulators:<br />
Set Width: setw<br />
Fix large floating point numbers: fixed<br />
(Large values floating point numbers may be written as scientific numbers; the fixed manipulator causes a decimal to be displayed).<br />
Set desired number of decimal points: setprecision<br />
* Set Width applies only to the very next item printed. Set Precision applies to all subsequent values.</p>
<p>References<br />
Dale, N. and Weems, C. (2010). Programming and Problem Solving with C++, 5th Edition, Jones and Bartlett Publishers, LLC, Sudbury, MA.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/09/c-numeric-types-expressions-and-output/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Software Development Life Cycle &#8211; Unified Process</title>
		<link>http://www.mikestratton.net/2011/09/software-development-life-cycle-unified-process/</link>
		<comments>http://www.mikestratton.net/2011/09/software-development-life-cycle-unified-process/#comments</comments>
		<pubDate>Tue, 06 Sep 2011 02:15:12 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4454</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/09/software-development-life-cycle-unified-process/">Software Development Life Cycle &#8211; Unified Process</a></p><p>The development of software includes a series of steps kwown as the Software Development Life Cycle. A modern method of of SDLC is known as the Unified Process. This post has been created to list the steps involved within the Unified Process.<br />
<br />
Business Modeling<br />
Requirements Discipline<br />
Design Discipline<br />
Implementation<br />
Testing Discipline<br />
Deployment Discipline<br />
<br />
<br />
Reference:<br />
Burd, S. (2006). Systems Architecture, 5th edition, Thomson Learning, Boston, Massachusetts.<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/09/software-development-life-cycle-unified-process/">Software Development Life Cycle &#8211; Unified Process</a></p><p>The development of software includes a series of steps kwown as the Software Development Life Cycle. A modern method of of SDLC is known as the Unified Process. This post has been created to list the steps involved within the Unified Process.</p>
<ol>
<li>Business Modeling</li>
<li>Requirements Discipline</li>
<li>Design Discipline</li>
<li>Implementation</li>
<li>Testing Discipline</li>
<li>Deployment Discipline</li>
</ol>
<p><img class="size-full wp-image-4455 alignnone" title="Unified Model" src="http://www.mikestratton.net/assets/unified_model.jpg" alt="Unified Model" width="396" height="398" /></p>
<p>Reference:<br />
Burd, S. (2006). Systems Architecture, 5th edition, Thomson Learning, Boston, Massachusetts.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/09/software-development-life-cycle-unified-process/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Learn PHP in 24 Hours</title>
		<link>http://www.mikestratton.net/2011/09/learn-php-in-24-hours/</link>
		<comments>http://www.mikestratton.net/2011/09/learn-php-in-24-hours/#comments</comments>
		<pubDate>Thu, 01 Sep 2011 09:47:00 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[PHP]]></category>
		<category><![CDATA[association for computing machinery]]></category>
		<category><![CDATA[php]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4412</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/09/learn-php-in-24-hours/">Learn PHP in 24 Hours</a></p><p>SAMS Teach Yourself PHP in 24 Hours, 3rd Edition courtesy of the Association for Computing Machinery<br />
This post was created as a reference point.<br />
PHP Standard Data Types<br />
There are 6 standard data types in PHP. They are:<br />
Integer<br />
Double<br />
String<br />
Boolean<br />
Object<br />
Array<br />
<br />
There are also 2 Special Data Types. They are:<br />
Resource<br />
Null<br />
<br />
Testing for a specific data type.<br />
Functions to test data types<br />
is_array()<br />
is_bool()<br />
is_double()<br />
is_int()<br />
is_object()<br />
is_string()<br />
is_null()<br />
is_resource()<br />
<br />
Operators and Expressions<br ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/09/learn-php-in-24-hours/">Learn PHP in 24 Hours</a></p><h2>SAMS Teach Yourself PHP in 24 Hours, 3rd Edition courtesy of the Association for Computing Machinery</h2>
<p>This post was created as a reference point.</p>
<h3>PHP Standard Data Types</h3>
<p>There are 6 standard data types in PHP. They are:</p>
<li>Integer</li>
<li>Double</li>
<li>String</li>
<li>Boolean</li>
<li>Object</li>
<li>Array</li>
<p></p>
<p>There are also 2 Special Data Types. They are:</p>
<li>Resource</li>
<li>Null</li>
<p></p>
<h3>Testing for a specific data type.</h3>
<p>Functions to test data types</p>
<li>is_array()</li>
<li>is_bool()</li>
<li>is_double()</li>
<li>is_int()</li>
<li>is_object()</li>
<li>is_string()</li>
<li>is_null()</li>
<li>is_resource()</li>
<p></p>
<h3>Operators and Expressions</h3>
<p>An operator is a symbol or series of symbols that, when used in conjunction with values, performs an action and usually produces a new value.<br />
<br />
An operand is a value used in conjunction with an operator. There are usually two operands to one operator.</p>
<p>An expression is any combination of functions, values, and operators that resolves to a value. As a rule of thumb, if you can use it as if it were a value, it is an expression.</p>
<p>The concatenation operator is a single period (.). <br />
&#8220;hello&#8221;.&#8221; world&#8221;</p>
<h3>Constants</h3>
<p>You must use PHP’s built-in function define() to create a constant. </p>
<h3>Functions</h3>
<p>A function is a self-contained block of code that can be called by your scripts. When called, the function’s code is executed. You can pass values to functions, which they then work with. When finished, a function can pass a value back to the calling code.</p>
<p>To define a function: <br />
function my_function( $my_argument1, $my_argument2 ) {<br />
// function code here<br />
}</p>
<p>References</p>
<li>http://my.safaribooksonline.com/book/programming/php/0672326191</li>
<li>http://www.acm.org/</li>
<li>http://www.elementk.com/</li>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/09/learn-php-in-24-hours/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>JavaScript Budget Calculator</title>
		<link>http://www.mikestratton.net/2011/07/javascript-budget-calculator/</link>
		<comments>http://www.mikestratton.net/2011/07/javascript-budget-calculator/#comments</comments>
		<pubDate>Thu, 21 Jul 2011 05:43:22 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[javascript]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4325</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/07/javascript-budget-calculator/">JavaScript Budget Calculator</a></p><p> JavaScript Budget Calculator<br />
Do you need a quick and easy way to calculate your budget? If so, check out this JavaScript Budget Calculator.<br />
Click here for the JavaScript Budget Calculator<br />
JavaScript Budget Calculator Source Code<br />
Are you a programmer interested in the source code of this JavaScript? If so, here it is:<br />
(Just Copy and Paste into your HTML Editor and save as a .html file.)<br />
If you use this calculator, please link to this website.<br />
&#60;!DOCTYPE html PUBLIC ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/07/javascript-budget-calculator/">JavaScript Budget Calculator</a></p><h2><a href="http://www.mikestratton.net/javascript/calculator/javascript-budget-calculator2.html" target="_blank"><img class="alignleft size-full wp-image-4327" title="Javascript Budget Calculator" src="http://www.mikestratton.net/assets/calculator.png" alt="Javascript Budget Calculator" width="92" height="92" /> JavaScript Budget Calculator</a></h2>
<p>Do you need a quick and easy way to calculate your budget? If so, check out this JavaScript Budget Calculator.</p>
<p><a href="http://www.mikestratton.net/javascript/calculator/javascript-budget-calculator2.html" target="_blank">Click here for the JavaScript Budget Calculator</a></p>
<h3>JavaScript Budget Calculator Source Code</h3>
<p>Are you a programmer interested in the source code of this JavaScript? If so, here it is:<br />
(Just Copy and Paste into your HTML Editor and save as a .html file.)<br />
If you use this calculator, please link to this website.</p>
<p>&lt;!DOCTYPE html PUBLIC &#8220;-//W3C//DTD XHTML 1.0 Transitional//EN&#8221; &#8220;http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd&#8221;&gt;<br />
&lt;html xmlns=&#8221;http://www.w3.org/1999/xhtml&#8221;&gt;<br />
&lt;head&gt;<br />
&lt;meta http-equiv=&#8221;Content-Type&#8221; content=&#8221;text/html; charset=utf-8&#8243; /&gt;<br />
&lt;title&gt;JavaScript Budget Calculator&lt;/title&gt;<br />
&lt;style type=&#8221;text/css&#8221;&gt;<br />
.dollar-sign {<br />
text-align: right;<br />
margin-bottom: 5px;<br />
border-right: none;<br />
border-top: none;<br />
border-bottom: none;<br />
padding-right: 0px;<br />
border-left: none;<br />
}<br />
.income-name {<br />
text-align: right;<br />
width: 16px;<br />
padding-right: 5px;<br />
margin-bottom: 5px;<br />
border-left:none;<br />
border-right:none;<br />
border-top:none;<br />
}<br />
.number-table {<br />
padding-right: 12px;<br />
padding-left: 12px;<br />
margin-bottom: 5px;<br />
width: 12px;<br />
border: none;<br />
}<br />
.total-row {<br />
background-color: #CCC;<br />
}<br />
.align-middle {<br />
text-align: center;<br />
background-color: #D2F0FF;<br />
border-right: none;<br />
border-left: none;<br />
font-size: 18px;<br />
padding: 5px;<br />
}<br />
.pay-to-input {<br />
width: 210px;<br />
}<br />
.table-heading {<br />
background-color: #FFFFC6;<br />
text-align: center;<br />
color: #0080C0;<br />
padding: 11px;<br />
text-decoration: none;<br />
}<br />
.btn {<br />
font-size: 18px;<br />
background-color: orange;<br />
border: 6 outset black;<br />
padding-top: 3px;<br />
padding-right: 7px;<br />
padding-bottom: 3px;<br />
padding-left: 7px;<br />
margin: 5px;<br />
}<br />
.small-button {<br />
font-size: 18px;<br />
background-color: orange;<br />
border: 6 outset black;<br />
padding-top: 3px;<br />
padding-right: 7px;<br />
padding-bottom: 3px;<br />
padding-left: 7px;<br />
margin: 5;<br />
}<br />
.calc-table {<br />
padding-top: 5px;<br />
padding-right: 8px;<br />
padding-bottom: 5px;<br />
padding-left: 8px;<br />
border-right-style: none;<br />
border-bottom-style: none;<br />
border-left-style: none;<br />
text-align: center;<br />
border-top: none;<br />
}<br />
.blank-spacer {<br />
background-color: white;<br />
border-top-style: none;<br />
border-right-style: none;<br />
border-bottom-style: none;<br />
border-left-style: none;</p>
<p>padding-top:5px;<br />
}<br />
.div-wdith {<br />
width: 400px;<br />
}<br />
&lt;/style&gt;<br />
&lt;script type=&#8217;text/javascript&#8217; src=&#8217;http://code.jquery.com/jquery-1.4.2.min.js&#8217; &gt;&lt;/script&gt;<br />
&lt;script type=&#8221;text/javascript&#8221;&gt;&lt;/script&gt;<br />
&lt;/head&gt;</p>
<p>&lt;body style=&#8221;margin:10px 20px 20px 20px&#8221;&gt;</p>
<p>&lt;div&gt;</p>
<p>&lt;form&gt;<br />
&lt;table border=&#8221;1&#8243; align=&#8221;center&#8221; cellspacing=&#8221;1&#8243; cellpadding=&#8221;1&#8243;&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt;&lt;h1&gt;JavaScript Budget Calculator&lt;/h1&gt;&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt;&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt;&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt; BALANCE &#8211; Use this table for current balances. &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Checking Account&lt;/td&gt;<br />
&lt;td width=&#8221;21&#8243;&gt;$&lt;/td&gt;<br />
&lt;td width=&#8221;202&#8243;&#8221;&gt;<br />
&lt;input id=&#8221;cAct&#8221; name=&#8221;cAct&#8221; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt;</p>
<p>&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Savings Account&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;sAct&#8221; name=&#8221;sAct&#8221; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt;<br />
&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Other&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;oAct&#8221; name=&#8221;oAct&#8221; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt;<br />
&lt;/td&gt;<br />
&lt;/tr&gt;</p>
<p>&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt;<br />
&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt;&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt;&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt; INCOME &#8211; Use this table for income. &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Employment&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&#8221;&gt;<br />
&lt;input id=&#8221;eInc&#8221; name=&#8221;eInc&#8221; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt;<br />
&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Disability/Retirement&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;dInc&#8221; name=&#8221;dInc&#8221; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Other&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;oInc&#8221; name=&#8221;oInc&#8221; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;</p>
<p>&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt;&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt;&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt;EXPENSES &#8211; Use this table for current expenses. &lt;/td&gt;<br />
&lt;/tr&gt;</p>
<p>&lt;tr&gt;<br />
&lt;td&gt;Rent&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp1&#8243; name=&#8221;exp1&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Electric&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp2&#8243; name=&#8221;exp2&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Phone&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp3&#8243; name=&#8221;exp3&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Gas&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp4&#8243; name=&#8221;exp4&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Water&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp5&#8243; name=&#8221;exp5&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Car&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp6&#8243; name=&#8221;exp6&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Groceries&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp7&#8243; name=&#8221;exp7&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Cable&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;</p>
<p>&lt;input id=&#8221;exp8&#8243; name=&#8221;exp8&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Internet&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp9&#8243; name=&#8221;exp9&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Mobile&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp10&#8243; name=&#8221;exp10&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Necessities&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp11&#8243; name=&#8221;exp11&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;Miscellaneous&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp12&#8243; name=&#8221;exp12&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;&amp;nbsp;&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp13&#8243; name=&#8221;exp13&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;&amp;nbsp;&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;</p>
<p>&lt;input id=&#8221;exp14&#8243; name=&#8221;exp14&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;&amp;nbsp;&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input id=&#8221;exp15&#8243; name=&#8221;exp15&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;&amp;nbsp;&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;</p>
<p>&lt;input id=&#8221;exp16&#8243; name=&#8221;exp16&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;&amp;nbsp;&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;</p>
<p>&lt;input id=&#8221;exp17&#8243; name=&#8221;exp17&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;&amp;nbsp;&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;</p>
<p>&lt;input id=&#8221;exp18&#8243; name=&#8221;exp17&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;&amp;nbsp;&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;</p>
<p>&lt;input id=&#8221;exp19&#8243; name=&#8221;exp17&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;&amp;nbsp;&lt;/td&gt;<br />
&lt;td&gt;$&lt;/td&gt;<br />
&lt;td&gt;</p>
<p>&lt;input id=&#8221;exp20&#8243; name=&#8221;exp17&#8243; type=&#8221;text&#8221; value=&#8221;0&#8243; size=&#8221;12&#8243; /&gt; &lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt;&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243;&gt;&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;3&#8243; &gt;<br />
&lt;button id=&#8221;bCalc&#8221; onclick=&#8221;return false&#8221;&gt;Calculate Budget&lt;/button&gt; &lt;br /&gt;&lt;/td&gt;<br />
&lt;/tr&gt;</p>
<p>&lt;tr&gt;<br />
&lt;td bgcolor=&#8221;orange&#8221;&gt;Budget Total&amp;nbsp;&lt;/td&gt;<br />
&lt;td bgcolor=&#8221;orange&#8221;&gt;$&lt;/td&gt;<br />
&lt;td bgcolor=&#8221;orange&#8221;&gt;<br />
&lt;input id=&#8221;bTot&#8221; name=&#8221;bTot&#8221; type=&#8221;text&#8221; size=&#8221;12&#8243; /&gt;<br />
&lt;/td&gt;<br />
&lt;/tr&gt;</p>
<p>&lt;/table&gt;<br />
&lt;/form&gt;</p>
<p>&lt;script type=&#8221;text/javascript&#8221;&gt;&lt;!&#8211;<br />
$(&#8220;#bCalc&#8221;).click(function(){<br />
var c,s,o; // Current Account Balances<br />
var e,d,oi; // Current Income<br />
var B; // Budget Calculation<br />
var exp1,exp2,exp3,exp4,exp5,exp6,exp7,exp8,exp9,exp10,exp11,exp12,exp13,exp14,exp15,exp16,exp17,exp18,exp19,exp20; // expenses</p>
<p>c = parseFloat($(&#8220;#cAct&#8221;).val());<br />
s = parseFloat($(&#8220;#sAct&#8221;).val());<br />
o = parseFloat($(&#8220;#oAct&#8221;).val());<br />
e = parseFloat($(&#8220;#eInc&#8221;).val());<br />
d = parseFloat($(&#8220;#dInc&#8221;).val());<br />
oi = parseFloat($(&#8220;#oInc&#8221;).val());</p>
<p>exp1 = parseFloat($(&#8220;#exp1&#8243;).val());<br />
exp2 = parseFloat($(&#8220;#exp2&#8243;).val());<br />
exp3 = parseFloat($(&#8220;#exp3&#8243;).val());<br />
exp4 = parseFloat($(&#8220;#exp4&#8243;).val());<br />
exp5 = parseFloat($(&#8220;#exp5&#8243;).val());<br />
exp6 = parseFloat($(&#8220;#exp6&#8243;).val());<br />
exp7 = parseFloat($(&#8220;#exp7&#8243;).val());<br />
exp8 = parseFloat($(&#8220;#exp8&#8243;).val());<br />
exp9 = parseFloat($(&#8220;#exp9&#8243;).val());<br />
exp10 = parseFloat($(&#8220;#exp10&#8243;).val());<br />
exp11 = parseFloat($(&#8220;#exp11&#8243;).val());<br />
exp12 = parseFloat($(&#8220;#exp12&#8243;).val());<br />
exp13 = parseFloat($(&#8220;#exp13&#8243;).val());<br />
exp14 = parseFloat($(&#8220;#exp14&#8243;).val());<br />
exp15 = parseFloat($(&#8220;#exp15&#8243;).val());<br />
exp16 = parseFloat($(&#8220;#exp16&#8243;).val());<br />
exp17 = parseFloat($(&#8220;#exp17&#8243;).val());<br />
exp18 = parseFloat($(&#8220;#exp18&#8243;).val());<br />
exp19 = parseFloat($(&#8220;#exp19&#8243;).val());<br />
exp20 = parseFloat($(&#8220;#exp20&#8243;).val());</p>
<p>// Budget Calculation<br />
B = c + s + o + e + d + oi &#8211; exp1 &#8211; exp2 &#8211; exp3 &#8211; exp4 &#8211; exp5 &#8211; exp6 &#8211; exp7 &#8211; exp8 &#8211; exp9 &#8211; exp10 &#8211; exp11 &#8211; exp12 &#8211; exp13 &#8211; exp14 &#8211; exp15 &#8211; exp16 &#8211; exp17 &#8211; exp18 &#8211; exp19 &#8211; exp20;</p>
<p>if(!isNaN(B))<br />
{<br />
$(&#8220;#bTot&#8221;).val(B.toFixed(2));<br />
}<br />
else<br />
{<br />
$(&#8220;#bTot&#8221;).val(&#8216;There was an error&#8217;);<br />
}<br />
return false;<br />
});<br />
// &#8211;&gt;&lt;/script&gt;</p>
<p>&lt;/div&gt;<br />
&lt;p&gt;Copyright &amp;copy; 2011 Michael A. Stratton. All rights reserved. If you use this calculator, please link to this website. &lt;/p&gt;<br />
&lt;/body&gt;<br />
&lt;/html&gt;</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/07/javascript-budget-calculator/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Bit Decryption Algorithm 1:3 Ratio</title>
		<link>http://www.mikestratton.net/2011/07/decryption-bit-reading-algorithm-13-ratio/</link>
		<comments>http://www.mikestratton.net/2011/07/decryption-bit-reading-algorithm-13-ratio/#comments</comments>
		<pubDate>Mon, 18 Jul 2011 06:12:30 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[artificial life]]></category>

		<guid isPermaLink="false">http://www.mikestratton.net/?p=4308</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/07/decryption-bit-reading-algorithm-13-ratio/">Bit Decryption Algorithm 1:3 Ratio</a></p><p>This article is focused on how it is possible that an algorithm can read 1 bit of data yet store the results of 3 bits.<br />
The concept behind this idea is quite simple. We know that bits are sent via an encoded signal from the CPU of an informaton system. It is also known, that at the base of all CPU&#8217;s, the machine language is based on binary bits, represented as values of 1 or 0.<br />
Here is an example of how the ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/07/decryption-bit-reading-algorithm-13-ratio/">Bit Decryption Algorithm 1:3 Ratio</a></p><p>This article is focused on how it is possible that an algorithm can read 1 bit of data yet store the results of 3 bits.</p>
<p>The concept behind this idea is quite simple. We know that bits are sent via an encoded signal from the CPU of an informaton system. It is also known, that at the base of all CPU&#8217;s, the machine language is based on binary bits, represented as values of 1 or 0.</p>
<p>Here is an example of how the bit string 0110 might look if viewed as an encoded square wave:</p>
<p><img class="alignnone size-medium wp-image-4309" title="Bit String Encoded in Square Waves" src="http://www.mikestratton.net/assets/trieffectinary01-300x150.jpg" alt="Digital representation" width="300" height="150" /></p>
<p>If we created an algorithm that could read 1 bit of data from a encoded square wave, it is easy to see how it is possible to generate a 1:3 ratio of decryption.</p>
<p>Imagine that we are able to read the signal of exactly 1 bit of data. If we were to read such a signal, think in terms of reading the signal in a linear fashion. Rather then reading just one point on a line, we would need to read the signals equivelant to exactly 1 bit. In mathematical terms, this could be represented as [0.5, 1.5]. The following representation of an encoded square wave breaks down 1 bit of data a bit further.</p>
<p><img class="alignnone size-medium wp-image-4310" title="Encoded Wave Signal - 1 Bit Representation" src="http://www.mikestratton.net/assets/trieffectinary02-300x150.png" alt="1 Bit Signal" width="300" height="150" /></p>
<p>The 4 bits of data (0110) in this wave form are represented in a  linear fasion: [ [0.5, 1.5] | [1.5, 2.5] | [2.5, 3.5] | [3.5, 4.5] ]</p>
<p>Now lets break this down just a bit further by focusing on only 1 bit of data in this wave form.<br />
Our focus is going to turn to the 3rd bit of data in our signal (0 1 <strong><span style="text-decoration: underline;">1</span></strong> 0).</p>
<p><img class="alignnone size-medium wp-image-4312" title="1:3 Decryption Algorithm" src="http://www.mikestratton.net/assets/trieffectinary02-bit-110-300x150.jpg" alt="1:3 Ratio" width="300" height="150" /></p>
<p>Note that we captured 1 full bit of the wave form that included [2.5, 3.5]. At the beginning of the our signal was the end of the 2 bit, and at the end of our signal was the beginning of the 4th bit. As a result of the 2nd bit having a value of 1, the wave was a straight line at the point of 2.5.  As a result of the 4th bit having a value of 0, the line started to drop at the 3.5. The final result is simple, the bit before the our signal is a 1 and the bit after is a 0.</p>
<p>Do you have feedback (good, bad or indifferent, all feedback is welcome) about this article? Please feel free to drop me a message!</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/07/decryption-bit-reading-algorithm-13-ratio/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>JavaScript Basics</title>
		<link>http://www.mikestratton.net/2011/07/javascript-basics/</link>
		<comments>http://www.mikestratton.net/2011/07/javascript-basics/#comments</comments>
		<pubDate>Thu, 14 Jul 2011 09:59:13 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[javascript]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4301</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/07/javascript-basics/">JavaScript Basics</a></p><p>Basics of JavaScript<br />
This article was created to outline the basics of the JavaScript langauge.<br />
JavaScript &#8211; Unsupported Browsers<br />
When JavaScript is run in an unsupported browser, the script itself might be displayed as text within the browser. To prevent this from happening, it is best to use the HTML comment feature to comment out the code from the script.<br />
For example:<br />
&#60;SCRIPT TYPE="text/javascript"&#62;<br />
&#60;!--  HIDE THE SCRIPT<br />
FROM OTHER BROWSERS<br />
JavaScript program<br />
//<br />
STOP HIDING FROM OTHER<br />
BROWSERS  --&#62;<br ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/07/javascript-basics/">JavaScript Basics</a></p><h1>Basics of JavaScript</h1>
<p>This article was created to outline the basics of the JavaScript langauge.</p>
<h3>JavaScript &#8211; Unsupported Browsers</h3>
<p>When JavaScript is run in an unsupported browser, the script itself might be displayed as text within the browser. To prevent this from happening, it is best to use the HTML comment feature to comment out the code from the script.</p>
<p>For example:<br />
<tt><strong>&lt;SCRIPT TYPE="</strong>text/javascript<strong>"&gt;</strong></tt><br />
<tt><strong>&lt;!--  HIDE THE SCRIPT<br />
FROM OTHER BROWSERS</strong></tt><br />
<tt><strong>JavaScript program</strong></tt><br />
<tt><strong>//<br />
STOP HIDING FROM OTHER<br />
BROWSERS  --&gt;</strong></tt><br />
<tt><strong>&lt;/SCRIPT&gt;</strong></tt><br />
HTML is commented out as follows:<br />
&lt;!&#8211; This line is commented out<br />
So is this one.<br />
End of comment &#8211;&gt;</p>
<p>It also might be a good idea to use a JavaScript comment to remove text from the script itself, yet allowing the comment to be displayed within the HTML of a page.</p>
<p>For example:<br />
<tt><strong>&lt;SCRIPT TYPE="</strong>text/javascript<strong>"&gt;</strong></tt><br />
<tt><strong>// JavaScript Script Appears Here &lt;BR /&gt;</strong></tt><br />
<tt><strong>// Download a<br />
compatible browser to use it.</strong></tt><br />
<tt><strong>&lt;!--  HIDE THE SCRIPT FROM<br />
OTHER BROWSERS --&gt;<br />
</strong></tt><tt><strong>&lt;/SCRIPT&gt;<br />
The lines with // remove the text from the JavaScript but not from the HTML.<br />
Lines inclosed with the &lt;!-- and --&gt; brackets remove the script from the HTML but not from the script interpreter. The above example will simply notify the user that there browser does not support JavaScript, in the event this is the case. If the browser does support JavaScript, the script will work as it should.</strong></tt></p>
<p><tt><strong>Up to date browsers use the &lt;NOSCRIPT&gt;  &lt;/NOSCRIPT&gt;  tag to alert the user that their browser does not support JavaScript. For a website to be completely accessible, the &lt;NOSCRIPT&gt; tag must be used in every instance of &lt;SCRIPT TYPE="text/javascript&gt;.</strong></tt></p>
<p><tt><strong>Also note, that current day HTML/XHTML standards define that scripts should be defined without the use of capitalization. For purposes of this article, the &lt;SCRIPTS&gt; are capitalized for reference purposes only.</strong></tt></p>
<p><tt><strong>Also be aware that the use of commenting out a JavaScript will also remove the Script if one is using XHTML. To avoid any problems, the &lt;NOSCRIPT&gt; tag should be used.</strong></tt></p>
<p>&nbsp;</p>
<h3><tt>JavaScript Source Attribute</tt></h3>
<p><tt>In instances when a JavaScript may be extensive, the script is often stored in an external JavaScript file (scriptfile.js). The script can be called upon with use of the <tt><strong>&lt;SCRIPT TYPE="</strong>text/javascript<strong>"<br />
SRC=</strong>http://www.somewebsite.com/JavaScript.js<strong>&gt;</strong></tt><tt><strong>&lt;/SCRIPT&gt;</strong></tt> script.</tt></p>
<h3>JavaScript Objects</h3>
<div>
<div class="tabs-area"><ul class="tabset"><li><a href="#tab-0" class="tab"><span>window</span></a></li><li><a href="#tab-1" class="tab"><span>location</span></a></li><li><a href="#tab-2" class="tab"><span>history</span></a></li><li><a href="#tab-3" class="tab"><span>document</span></a></li><li><a href="#tab-4" class="tab"><span>string</span></a></li><li><a href="#tab-5" class="tab"><span>Math</span></a></li><li><a href="#tab-6" class="tab"><span>Date</span></a></li></ul><div id="tab-0" class="tab-box"><p>The window object provides methods and properties for dealing with the actual Navigator window, including objects for each frame.</p>
</div><div id="tab-1" class="tab-box"><p>The location object provides properties and methods for working with the currently open URL.</p>
</div><div id="tab-2" class="tab-box"><p>The history object provides information about the history list and enables limited interaction with the list.</p>
</div><div id="tab-3" class="tab-box"><p>The document object is one of the most heavily used objects in the hierarchy. It contains objects, properties, and methods for working with document elements including forms, links, anchors, and applets.</p>
</div><div id="tab-4" class="tab-box"><p>The string object enables programs to work with and manipulate strings of text, including extracting substrings and converting text to upper- or lower-case characters.</p>
</div><div id="tab-5" class="tab-box"><p>The Math object provides methods to perform trigonometric functions, such as sine and tangent, as well as general mathematical functions, such as square roots.</p>
</div><div id="tab-6" class="tab-box"><p>With the Date object, programs can work with the current date or create instances for specific dates. The object includes methods for calculating the difference between two dates and working with times.</p>
</div></div></div>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/07/javascript-basics/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Floating Point Numbers</title>
		<link>http://www.mikestratton.net/2011/07/floating-point-numbers/</link>
		<comments>http://www.mikestratton.net/2011/07/floating-point-numbers/#comments</comments>
		<pubDate>Wed, 13 Jul 2011 09:28:54 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[javascript]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4296</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/07/floating-point-numbers/">Floating Point Numbers</a></p><p>Floating Point Numbers<br />
While working on a JavaScript calculator I became stuck in what should be simple mathematics. The use of decimal points resulting in addition and subtraction caused erros in the calculations. The cause is in the way machine language calculates decimal points.<br />
Oracle offers some great insight into the cause and resolution: What Every Computer Scientist Should Know About Floating-Point Numbers<br />
The JavaScript Budget Calculator is a work in progress, to view how a machine interprets decimals check ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/07/floating-point-numbers/">Floating Point Numbers</a></p><h1>Floating Point Numbers</h1>
<p>While working on a JavaScript calculator I became stuck in what should be simple mathematics. The use of decimal points resulting in addition and subtraction caused erros in the calculations. The cause is in the way machine language calculates decimal points.</p>
<p>Oracle offers some great insight into the cause and resolution: <a href="http://download.oracle.com/docs/cd/E19957-01/806-3568/ncg_goldberg.html" target="_blank">What Every Computer Scientist Should Know About Floating-Point Numbers</a></p>
<p>The JavaScript Budget Calculator is a work in progress, to view how a machine interprets decimals check out the demo and then enter decimal points into the budget portion of the calculator: <a href="http://mikestratton.net/javascript/calculator/javascript-budget-calculator.html" target="_blank">http://mikestratton.net/javascript/calculator/javascript-budget-calculator.html</a></p>
<p>More information on this subject to follow shortly&#8230;</p>
<p>&nbsp;</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/07/floating-point-numbers/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Javascript Calculator</title>
		<link>http://www.mikestratton.net/2011/07/javascript-calculator/</link>
		<comments>http://www.mikestratton.net/2011/07/javascript-calculator/#comments</comments>
		<pubDate>Wed, 13 Jul 2011 04:19:20 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[javascript]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4292</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/07/javascript-calculator/">Javascript Calculator</a></p><p>JavaScript Calculator<br />
For a demo of the JavaScript calculator, click here<br />
*You must have a JavaScript enabled browser for the JavaScript Calculator demo to work.<br />
This calculator was created during a MindLeaders JavaScript tutorial. For more information on Mindreaders Tutorials and Training, go to:<br />
http://www.mindleaders.com <br />
JavaScript Calculator Source Code<br />
&#60;!DOCTYPE html PUBLIC &#8220;-//W3C//DTD XHTML 1.0 Transitional//EN&#8221;<br />
&#8220;http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd&#8221;&#62;<br />
&#60;html xmlns=&#8221;http://www.w3.org/1999/xhtml&#8221;&#62;<br />
&#60;head&#62;<br />
&#60;meta content=&#8221;text/html; charset=utf-8&#8243; http-equiv=&#8221;Content-Type&#8221; /&#62;<br />
&#60;title&#62;JavaScript Calculator&#60;/title&#62;<br />
&#60;script type=&#8221;text/javascript&#8221;&#62;<br />
var total = 0;<br />
var lastOperation = &#8220;+&#8221;;<br />
var newnumber ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/07/javascript-calculator/">Javascript Calculator</a></p><h1>JavaScript Calculator</h1>
<p>For a demo of the JavaScript calculator, <a href="http://mikestratton.net/javascript/calculator/" target="_blank">click here</a><br />
<em>*You must have a JavaScript enabled browser for the JavaScript Calculator demo to work.</em></p>
<p>This calculator was created during a MindLeaders JavaScript tutorial. For more information on Mindreaders Tutorials and Training, go to:<br />
<a href="http://www.mindleaders.com" target="_blank">http://www.mindleaders.com</a> </p>
<h2>JavaScript Calculator Source Code</h2>
<p>&lt;!DOCTYPE html PUBLIC &#8220;-//W3C//DTD XHTML 1.0 Transitional//EN&#8221;<br />
&#8220;http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd&#8221;&gt;<br />
&lt;html xmlns=&#8221;http://www.w3.org/1999/xhtml&#8221;&gt;</p>
<p>&lt;head&gt;<br />
&lt;meta content=&#8221;text/html; charset=utf-8&#8243; http-equiv=&#8221;Content-Type&#8221; /&gt;<br />
&lt;title&gt;JavaScript Calculator&lt;/title&gt;<br />
&lt;script type=&#8221;text/javascript&#8221;&gt;</p>
<p>var total = 0;<br />
var lastOperation = &#8220;+&#8221;;<br />
var newnumber = true;</p>
<p>function enterNumber(digit) {<br />
var form = digit.form;<br />
if (newnumber) {<br />
clearNumber(form);<br />
newnumber = false;<br />
}<br />
form.display.value = form.display.value + digit.name;<br />
}</p>
<p>function clear(form) {<br />
total = 0;<br />
lastOperation = &#8220;+&#8221;;<br />
form.display.value = &#8220;&#8221;;<br />
}</p>
<p>function clearNumber(form) {<br />
form.display.value = &#8220;&#8221;;<br />
}</p>
<p>function calculate(operation) {<br />
var form = operation.form;<br />
var expression = total + lastOperation + form.display.value;<br />
lastOperation = operation.value;<br />
total = eval(expression);<br />
form.display.value = total;<br />
newnumber = true;<br />
}</p>
<p>&lt;/script&gt;<br />
&lt;/head&gt;</p>
<p>&lt;body&gt;<br />
&lt;h1&gt;JavaScript Calculator&lt;/h1&gt;<br />
&lt;form&gt;<br />
&lt;table border=&#8221;1&#8243;&gt;<br />
&lt;tr&gt;<br />
&lt;td colspan=&#8221;4&#8243;&gt;<br />
&lt;input name=&#8221;display&#8221; onfocus=&#8221;this.blur();&#8221; type=&#8221;text&#8221; value=&#8221;" /&gt;<br />
&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;7&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 7 &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;8&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 8 &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;9&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 9 &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;+&#8221; onclick=&#8221;calculate(this);&#8221; type=&#8221;button&#8221; value=&#8221; + &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;4&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 4 &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;5&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 5 &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;6&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 6 &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;-&#8221; onclick=&#8221;calculate(this);&#8221; type=&#8221;button&#8221; value=&#8221; &#8211; &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;1&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 1 &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;2&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 2 &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;3&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 3 &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;*&#8221; onclick=&#8221;calculate(this);&#8221; type=&#8221;button&#8221; value=&#8221; * &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;tr&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;0&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 0 &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;C&#8221; onclick=&#8221;clear(this.form);&#8221; type=&#8221;button&#8221; value=&#8221; C &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;CE&#8221; onclick=&#8221;clearNumber(this.form);&#8221; type=&#8221;button&#8221; value=&#8221;CE&#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;td&gt;<br />
&lt;input name=&#8221;/&#8221; onclick=&#8221;calculate(this);&#8221; type=&#8221;button&#8221; value=&#8221; / &#8221; /&gt;<br />
&lt;/td&gt;<br />
&lt;/tr&gt;<br />
&lt;/table&gt;<br />
&lt;/form&gt;</p>
<p>&lt;p&gt;This calculator was created during a MindLeaders JavaScript tutorial. For<br />
more information on Mindreaders Tutorials and Training, go to: <br />
&lt;a href=&#8221;http://www.mindleaders.com&#8221;&gt;http://www.mindleaders.com&lt;/a&gt; &lt;/p&gt;<br />
&lt;p&gt;&amp;lt;form&amp;gt;&lt;br /&gt;<br />
&amp;lt;table border=&#8221;1&#8243;&amp;gt;&lt;br /&gt;<br />
&amp;lt;tr&amp;gt;&lt;br /&gt;<br />
&amp;lt;td colspan=&#8221;4&#8243;&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;display&#8221; onfocus=&#8221;this.blur();&#8221; type=&#8221;text&#8221; value=&#8221;" /&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;/tr&amp;gt;&lt;br /&gt;<br />
&amp;lt;tr&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;7&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 7 &#8220;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;8&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 8 &#8220;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;9&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 9 &#8220;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;+&#8221; onclick=&#8221;calculate(this);&#8221; type=&#8221;button&#8221; value=&#8221; + &#8221; /&amp;gt;&lt;br<br />
/&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;/tr&amp;gt;&lt;br /&gt;<br />
&amp;lt;tr&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;4&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 4 &#8220;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;5&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 5 &#8220;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;6&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 6 &#8220;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;-&#8221; onclick=&#8221;calculate(this);&#8221; type=&#8221;button&#8221; value=&#8221; &#8211; &#8221; /&amp;gt;&lt;br<br />
/&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;/tr&amp;gt;&lt;br /&gt;<br />
&amp;lt;tr&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;1&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 1 &#8220;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;2&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 2 &#8220;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;3&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 3 &#8220;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;*&#8221; onclick=&#8221;calculate(this);&#8221; type=&#8221;button&#8221; value=&#8221; * &#8221; /&amp;gt;&lt;br<br />
/&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;/tr&amp;gt;&lt;br /&gt;<br />
&amp;lt;tr&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;0&#8243; onclick=&#8221;enterNumber(this);&#8221; type=&#8221;button&#8221; value=&#8221; 0 &#8220;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;C&#8221; onclick=&#8221;clear(this.form);&#8221; type=&#8221;button&#8221; value=&#8221; C &#8220;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;CE&#8221; onclick=&#8221;clearNumber(this.form);&#8221; type=&#8221;button&#8221; value=&#8221;CE&#8221;<br />
/&amp;gt;&lt;br /&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;td&amp;gt;&lt;br /&gt;<br />
&amp;lt;input name=&#8221;/&#8221; onclick=&#8221;calculate(this);&#8221; type=&#8221;button&#8221; value=&#8221; / &#8221; /&amp;gt;&lt;br<br />
/&gt;<br />
&amp;lt;/td&amp;gt;&lt;br /&gt;<br />
&amp;lt;/tr&amp;gt;&lt;br /&gt;<br />
&amp;lt;/table&amp;gt;&lt;br /&gt;<br />
&amp;lt;/form&amp;gt;&lt;br /&gt;<br />
&lt;/p&gt;</p>
<p>&lt;/body&gt;</p>
<p>&lt;/html&gt;</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/07/javascript-calculator/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Java Swing Applet Calculator</title>
		<link>http://www.mikestratton.net/2011/07/java-swing-applet-calculator/</link>
		<comments>http://www.mikestratton.net/2011/07/java-swing-applet-calculator/#comments</comments>
		<pubDate>Wed, 13 Jul 2011 03:43:56 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[java]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4283</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/07/java-swing-applet-calculator/">Java Swing Applet Calculator</a></p><p>Simple Budget Calculator<br />
Created with Java Swing Applet<br />
Click here to see the demo live. <br />
You must have the Java jdk installed on your computer for the applet to work.<br />
Java Applet Code<br />
// Swing applet calculator demo<br />
import java.awt.Graphics;<br />
import javax.swing.JApplet;<br />
import javax.swing.JOptionPane;<br />
public class budgetCalculator extends JApplet<br />
{<br />
private double sum; // sum of values<br />
// initialize applet<br />
public void init()<br />
{<br />
// input total income from user<br />
String incomeNumber = JOptionPane.showInputDialog(<br />
&#8220;Enter your total income&#8221;);<br />
//inupt ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/07/java-swing-applet-calculator/">Java Swing Applet Calculator</a></p><h1>Simple Budget Calculator</h1>
<h2>Created with Java Swing Applet</h2>
<p><a href="http://mikestratton.net/java/budget-calculator/" target="_blank">Click here to see the demo live.</a> <br />
You must have the Java jdk installed on your computer for the applet to work.</p>
<h2>Java Applet Code</h2>
<p>// Swing applet calculator demo</p>
<p>import java.awt.Graphics;<br />
import javax.swing.JApplet;<br />
import javax.swing.JOptionPane;</p>
<p>public class budgetCalculator extends JApplet<br />
{<br />
private double sum; // sum of values</p>
<p>// initialize applet<br />
public void init()<br />
{<br />
// input total income from user<br />
String incomeNumber = JOptionPane.showInputDialog(<br />
&#8220;Enter your total income&#8221;);</p>
<p>//inupt total expenses from user<br />
String expenseNumber = JOptionPane.showInputDialog(<br />
&#8220;Enter your total expenses&#8221;);</p>
<p>// convert number from string to double<br />
double inNumber = Double.parseDouble(incomeNumber);<br />
double exNumber = Double.parseDouble(expenseNumber);</p>
<p>sum = inNumber &#8211; exNumber; // balance<br />
} // end method init</p>
<p>// draw results in a rectangle in background<br />
public void paint(Graphics g)<br />
{<br />
super.paint(g); // call superclass version of method paint</p>
<p>
//draw rectangle starting from (15,10) that is 270 pixels wide and 20 pixels<br />
tall<br />
g.drawString(&#8220;Your remaning balance is &#8221; + sum, 25, 25);<br />
} // end method paint</p>
<p>
} // end class budgetCalculator</p>
<h2>HTML Code (Enter into the &lt;body&gt; section &lt;/body&gt;</h2>
<p>&lt;applet code = &#8220;budgetCalculator.class&#8221; width = &#8220;300&#8243; height = &#8220;50&#8243;&gt;<br />
&lt;/applet&gt;</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/07/java-swing-applet-calculator/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Problem Solving Methodologies</title>
		<link>http://www.mikestratton.net/2011/07/problem-solving-methodologies/</link>
		<comments>http://www.mikestratton.net/2011/07/problem-solving-methodologies/#comments</comments>
		<pubDate>Sat, 09 Jul 2011 19:58:53 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[microsoft]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4222</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/07/problem-solving-methodologies/">Problem Solving Methodologies</a></p><p>Problem solving techniques can be applied to both life and the field of computer science. In both instances, there are different methodologies that can be applied; for, the use of a specific methodology is directly dependent on the type of problem that must be solved.<br />
This article will define the different types pf problem solving methodologies, as well as the different types of problems they can solve.<br />
Request-Response-Result Methodology<br />
The request-response-result methodology works best problems that have clear-cut answers and ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/07/problem-solving-methodologies/">Problem Solving Methodologies</a></p><p>Problem solving techniques can be applied to both life and the field of computer science. In both instances, there are different methodologies that can be applied; for, the use of a specific methodology is directly dependent on the type of problem that must be solved.</p>
<p>This article will define the different types pf problem solving methodologies, as well as the different types of problems they can solve.</p>
<h3>Request-Response-Result Methodology<img class="size-full wp-image-4228 alignright" title="Response-Request-Result" src="http://mikestratton.net/assets/response-request-result.png" alt="Response-Request-Result" width="138" height="47" /></h3>
<p>The request-response-result methodology works best problems that have clear-cut answers and solutions.</p>
<ol>
<li>A request is made</li>
<li>Response with steps of a rule</li>
<li>One correct result is acheived</li>
</ol>
<p>Examples: History exam, use of a calculator, microwave oven, embedded computer system, algorithm.</p>
<p>&nbsp;</p>
<h3>The IDEAL Problem Solving Methodology<img class="size-medium wp-image-4227 alignright" title="IDEAL" src="http://mikestratton.net/assets/ideal-300x144.png" alt="IDEAL" width="210" height="101" /></h3>
<p>The IDEAL problem sovling methodology works with problems that have a fairly defined outcome but with many solution strategies.</p>
<ol>
<li><span style="text-decoration: underline;"><strong>I</strong></span>dentify the problem</li>
<li><strong><span style="text-decoration: underline;">D</span></strong>efine the problem by sorting through relevant information</li>
<li><strong><span style="text-decoration: underline;">E</span></strong>xplore the possible options through brainstorming</li>
<li><strong><span style="text-decoration: underline;">A</span></strong>ct on the strategy selected</li>
<li><strong><span style="text-decoration: underline;">L</span></strong>ook back and evaluate the results of your actions</li>
</ol>
<p>Examples: Spreadsheet used for a budget, design of a LAN, transforming a case study into software design.</p>
<p>&nbsp;</p>
<h3> <img class="size-medium wp-image-4226 alignright" style="margin-top: 7px; margin-bottom: 7px;" title="Circle-Back Model" src="http://mikestratton.net/assets/circle-back-300x225.png" alt="Circle-Back Model" width="147" height="111" />The Circle-Back Model</h3>
<p>The Circle-Back Model works when a problem has no defined solution and no defined solution strategy. The Circle-Back Model is especially effective in complex, open-ended problems that require as much creativity as they do analytical problem solving skills.</p>
<ol>
<li>Step 1: Represent the Problem</li>
<li>Step 2: Search for Solutions</li>
<li>Step 3: Implement the Solution (Go to Step 1)</li>
</ol>
<p>Examples: Creation of a video game, finding a cure for cancer, creating artificial life, creating a global, neural network for law enforcement.</p>
<p>&nbsp;</p>
<p>Reference:<br />
Bits &amp; Bytes (2007), Microsoft Developer Network. URL: <a href="http://msdn.microsoft.com/library/bb330921.aspx" target="_blank">http://msdn.microsoft.com/library/bb330921.aspx</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/07/problem-solving-methodologies/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial Intelligence Applied to Robotics</title>
		<link>http://www.mikestratton.net/2011/07/artificial-intelligence-applied-to-robotics/</link>
		<comments>http://www.mikestratton.net/2011/07/artificial-intelligence-applied-to-robotics/#comments</comments>
		<pubDate>Mon, 04 Jul 2011 08:40:15 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[computer science]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4187</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/07/artificial-intelligence-applied-to-robotics/">Artificial Intelligence Applied to Robotics</a></p><p>Video Samples of Artificial Intelligence as Applied to Robotics<br />
&#160;<br />
Mars Rover &#8211; Curiosity<br />
<br />
Azimo<br />
<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/07/artificial-intelligence-applied-to-robotics/">Artificial Intelligence Applied to Robotics</a></p><h2>Video Samples of Artificial Intelligence as Applied to Robotics</h2>
<p>&nbsp;</p>
<h3>Mars Rover &#8211; Curiosity</h3>
<p><code><object width="560" height="349"><param name="movie" value="http://www.youtube.com/v/P4boyXQuUIw?version=3&amp;hl=en_US&amp;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube.com/v/P4boyXQuUIw?version=3&amp;hl=en_US&amp;rel=0" type="application/x-shockwave-flash" width="560" height="349" allowscriptaccess="always" allowfullscreen="true"></embed></object></code></p>
<h3>Azimo</h3>
<p><code><object width="560" height="349"><param name="movie" value="http://www.youtube.com/v/AF0WsvfG_nI?version=3&amp;hl=en_US&amp;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube.com/v/AF0WsvfG_nI?version=3&amp;hl=en_US&amp;rel=0" type="application/x-shockwave-flash" width="560" height="349" allowscriptaccess="always" allowfullscreen="true"></embed></object></code></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/07/artificial-intelligence-applied-to-robotics/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Genetic Programming Reference List</title>
		<link>http://www.mikestratton.net/2011/07/ginetic-programming-reference-list/</link>
		<comments>http://www.mikestratton.net/2011/07/ginetic-programming-reference-list/#comments</comments>
		<pubDate>Mon, 04 Jul 2011 05:25:18 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Stanford Engineering Everywhere]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[ginetic algorithm]]></category>
		<category><![CDATA[stanford engineering everywhere]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4180</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/07/ginetic-programming-reference-list/">Genetic Programming Reference List</a></p><p>Artificial Intelligence &#8211; Ginectic Programming<br />
The purpose of this post is to offer a comprehensive listing of resources related to the ginetic algorithm, which is being further developed by John Koza of Standford University.<br />
John Holland &#8211; Ginetic Algorithms (1975)<br />
Genetic Programming Inc.<br />
A privately funded research group that does research in applying genetic programming.<br />
What is Ginetic Programming?<br />
Springer: Ginetic Programming Publications<br />
ECJ 20<br />
A Java-based Evolutionary Computation Research System<br />
Yahoo Genetic Programming Group/Mailing List<br />
Genetic Algorithm Power Point Presentation<br />
Presented ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/07/ginetic-programming-reference-list/">Genetic Programming Reference List</a></p><h2>Artificial Intelligence &#8211; Ginectic Programming</h2>
<p>The purpose of this post is to offer a comprehensive listing of resources related to the ginetic algorithm, which is being further developed by John Koza of Standford University.</p>
<p><a href="http://en.wikipedia.org/wiki/John_Henry_Holland" target="_blank">John Holland &#8211; Ginetic Algorithms (1975)</a></p>
<p><a href="http://www.genetic-programming.com" target="_blank">Genetic Programming Inc.<br />
</a>A privately funded research group that does research in applying genetic programming.</p>
<p><a href="http://www.genetic-programming.com/gpanimatedtutorial.html" target="_blank">What is Ginetic Programming?</a></p>
<p><a href="http://www.springer.com/series/6016" target="_blank">Springer: Ginetic Programming Publications</a></p>
<p><a href="http://cs.gmu.edu/~eclab/projects/ecj/" target="_blank">ECJ 20<br />
</a>A Java-based Evolutionary Computation Research System</p>
<p><a href="http://tech.groups.yahoo.com/group/genetic_programming/" target="_blank">Yahoo Genetic Programming Group/Mailing List</a></p>
<p><a href="http://www.genetic-programming.com/c2003lecture1modified.ppt" target="_blank">Genetic Algorithm Power Point Presentation<br />
</a>Presented by John Koza, Stanford University</p>
<p><a href="http://www.genetic-programming.com/c2003lecture2basicga.pdf" target="_blank">Introduction to Genetic Algorithms</a></p>
<p><a href="http://ti.arc.nasa.gov/tech/asr/aces/" target="_blank">NASA: ACES (Adaptive Control and Evolutionary Systems)</a></p>
<p><a href="http://ti.arc.nasa.gov/m/pub-archive/archive/0333.pdf" target="_blank">NASA<br />
</a>Comparing a Co-evolutionary Genetic Algorithm for Multiobjective Optimization</p>
<p><a href="http://alglobus.net/NASAwork/papers/Cycle-ScavengingGA/paper.html" target="_blank">CPU Cycle-Scavenging by Genetic Algorithms</a></p>
<p><a href="http://setiathome.ssl.berkeley.edu/" target="_blank">SETI</a><br />
Cycle Scavenging used by the University of Berkley to find Extraterrestrial Intelligence</p>
<p><a href="http://math.hws.edu/xJava/GA/" target="_blank">Genetic Algorithm Demonstration<br />
</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/07/ginetic-programming-reference-list/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Stratton Earns Scholarship</title>
		<link>http://www.mikestratton.net/2011/07/stratton-earns-scholarship/</link>
		<comments>http://www.mikestratton.net/2011/07/stratton-earns-scholarship/#comments</comments>
		<pubDate>Mon, 04 Jul 2011 04:22:29 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4175</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/07/stratton-earns-scholarship/">Stratton Earns Scholarship</a></p><p>Mountain State University<br />
View this article on the Record Courier Website: http://www.recordpub.com/news/article/5031457<br />
Michael A. Stratton of Streetsboro has been selected as a recipient of the Mountain State Scholarship Circle scholarship award at Mountain State University, based in Beckley, W.Va.<br />
Stratton is currently a freshman enrolled in the computer science program at Mountain State University, with a current grade point average of 3.9. Scholarships at Mountain State University are awarded based on academic merit and financial need.<br />
Stratton is also a ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/07/stratton-earns-scholarship/">Stratton Earns Scholarship</a></p><h2>Mountain State University</h2>
<p>View this article on the Record Courier Website: <a href="http://www.recordpub.com/news/article/5031457" target="_blank">http://www.recordpub.com/news/article/5031457</a></p>
<p>Michael A. Stratton of Streetsboro has been selected as a recipient of the Mountain State Scholarship Circle scholarship award at Mountain State University, based in Beckley, W.Va.</p>
<p>Stratton is currently a freshman enrolled in the computer science program at Mountain State University, with a current grade point average of 3.9. Scholarships at Mountain State University are awarded based on academic merit and financial need.</p>
<p>Stratton is also a freelance web designer and web developer, and in spite of a disability, he has had success in his field as a volunteer web developer for nonprofit organizations.</p>
<p>To date, Stratton has volunteered for more than 60 nonprofit organizations with a running total of more than 1,400 hours of volunteer time.</p>
<p>As a result of receiving the MSSC scholarship, Stratton is inspired to continue his efforts as a volunteer web developer for nonprofits.</p>
<p>To learn more about Stratton&#8217;s volunteer work, go to <a href="http://www.MikeStratton.net">www.MikeStratton.net</a>.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/07/stratton-earns-scholarship/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Understanding Unified Modeling Language (UML)</title>
		<link>http://www.mikestratton.net/2011/07/understanding-unified-modeling-language-uml/</link>
		<comments>http://www.mikestratton.net/2011/07/understanding-unified-modeling-language-uml/#comments</comments>
		<pubDate>Sun, 03 Jul 2011 07:59:32 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[association for computing machinery]]></category>
		<category><![CDATA[UML]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4139</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/07/understanding-unified-modeling-language-uml/">Understanding Unified Modeling Language (UML)</a></p><p>Understanding Unified Modeling Language (UML)<br />
Overview<br />
UML is the de-facto standard for modeling Object Oriented software.<br />
UML allows software engineers to document models in a way that supports scalability. UML modeling raises the level of abstraction throughout the analysis and design process. UML modeling facilitates the creation of modular designs resulting in components and component libraries that expedite development.<br />
The UML architecture is based on the Meta-Object Facility (MOF). The MOF defines the foundation for creating modeling languages used for ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/07/understanding-unified-modeling-language-uml/">Understanding Unified Modeling Language (UML)</a></p><h2>Understanding Unified Modeling Language (UML)</h2>
<h3>Overview</h3>
<p>UML is the de-facto standard for modeling Object Oriented software.</p>
<p>UML allows software engineers to document models in a way that supports scalability. UML modeling raises the level of abstraction throughout the analysis and design process. UML modeling facilitates the creation of modular designs resulting in components and component libraries that expedite development.</p>
<p>The UML architecture is based on the Meta-Object Facility (MOF). The MOF defines the foundation for creating modeling languages used for object modeling (UML), and for data modeling (Common Warehouse Model or CWM). The MOF defines standard formats for the key elements of a model so that they can be stored in a common repository and exchanged between modeling tools and languages. XML Metadata Interchange (XMI) provides a method of sharing modeling elements between modeling tool vendors and between repositories.</p>
<p>UML models can be precise enough to generate code or even the entire application.</p>
<p>It is imperative that a software engineer understands how UML fits into the much larger plan by the Object Management Group (OMG) to standardize systems development with Model-Driven Architecture (MDA).</p>
<h3>Goal of UML</h3>
<p>“One of the primary goals of UML is to advance the state of the industry by enabling object visual modeling tool interoperability. However, to enable meaningful exchange of model information between tools, agreement on semantics and notation is required. “(Source: OMG Unified Modeling LanguageTM (OMG UML), Infrastructure <a href="http://www.omg.org/spec/UML/" target="_blank">http://www.omg.org/spec/UML/</a> )</p>
<h3>Model Driven Architecture</h3>
<p>MDA separates business and application logic from underlying platform technology.<br />
Model-Driven Architecture (MDA) separates the two fundamental elements of an application into two distinct models. The platform-independent model (PIM) defines business functionality and behavior, the essence of the system apart from implementation technologies. The platform-specific model (PSM) maps the PIM to a specific technology without altering the PIM. That last phrase is critical.</p>
<p><img class="size-full wp-image-4140 aligncenter" title="Model Driven Architecture" src="http://mikestratton.net/assets/mda_left_new2.gif" alt="Model Driven Architecture" width="319" height="328" /></p>
<h3>Meta-Object Facility (MOF)</h3>
<p>The Meta-Object Facility (MOF) is at the heart of the MDA strategy along with the UML, CWM, CORBA, and XMI.</p>
<h3>Common Warehouse Metamodel (CWM)</h3>
<p>Like UML, CWM is a language derived from the MOF. CWM provides the mapping from MDA PIMs to database schemas. CWM covers the full life cycle of designing, building, and managing data warehouse applications and supports management of the life cycle</p>
<h3>XML Metadata Interchange (XMI)</h3>
<p>At its simplest level, XMI defines a mapping from UML to XML</p>
<h3>MDA Relationships</h3>
<p>•	The Meta Object Facility (MOF) defines a common meta-language for building other languages.</p>
<p>•	UML defines a meta-language, derived from the MOF, for describing object-oriented systems.</p>
<p>•	The Common Warehouse Metamodel defines a meta-language, derived from the MOF, for describing data warehousing and related systems.</p>
<p>•	XML Metadata Interchange defines the means to share models derived from the MOF.</p>
<h3>The Four Layer Metamodel Architecture</h3>
<p>1.	Layer: Meta-metamodel (M3)<br />
Description: The infrastructure for a metamodeling architecture.  Defines the language for specifying metamodels.</p>
<p>2.	Layer: Metamodel (M2)<br />
Description: An instance of a meta-metamodel. Defines the language for specifying a model.</p>
<p>3.	Layer: Model (M1)<br />
Description: An instance of a metamodel. Defines a language to describe an information domain.</p>
<p>4.	Layer: User object (user data) (MO)<br />
Description: An instance of a model. Defines the values of a specific domain.</p>
<h3>References</h3>
<p>Pender, T. (2003). UML Bible, Wiley Publishing, Indianapolis, Indiana.</p>
<p>Object Management Group, Unified Modeling Language Specifications, Url: <a href="http://www.omg.org/spec/UML/" target="_blank">http://www.omg.org/spec/UML/</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/07/understanding-unified-modeling-language-uml/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial Intelligence &#8211; Neural Networks</title>
		<link>http://www.mikestratton.net/2011/06/artificial-intelligence-neural-networks/</link>
		<comments>http://www.mikestratton.net/2011/06/artificial-intelligence-neural-networks/#comments</comments>
		<pubDate>Thu, 23 Jun 2011 06:53:59 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[artificial life]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4041</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/artificial-intelligence-neural-networks/">Artificial Intelligence &#8211; Neural Networks</a></p><p>Neural Network Defined<br />
A neural network is an information system that is modeled after the human brain and nervous system. The network consists of a large number of units that are separated into 3 separate types (1) input units, (2) output units, and (3) hidden units. These units model the 3 units of the human nervous system (1) sensory neurons (input), (2) motor neurons (output), and (3) all other neurons (hidden).<br />
Examples of Neural Networks:<br />
The US Army Corps of ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/artificial-intelligence-neural-networks/">Artificial Intelligence &#8211; Neural Networks</a></p><h2><a href="http://mikestratton.net/assets/neural.jpg"></a>Neural Network Defined<a href="http://mikestratton.net/assets/neural1.jpg"><img class="alignright size-medium wp-image-4047" title="Neural Network" src="http://mikestratton.net/assets/neural1-300x225.jpg" alt="Neural Network" width="300" height="225" /></a></h2>
<p>A neural network is an information system that is modeled after the human brain and nervous system. The network consists of a large number of units that are separated into 3 separate types (1) input units, (2) output units, and (3) hidden units. These units model the 3 units of the human nervous system (1) sensory neurons (input), (2) motor neurons (output), and (3) all other neurons (hidden).</p>
<h3>Examples of Neural Networks:</h3>
<p>The US Army Corps of Engineers uses an Application of an Artificial Neural Network to Predict Tidal Currents in an Inlet</p>
<p>The Robust Tracking with a Neural Extended Kalman Filter (NEKF) project is an Office of Naval Research. The NEKF algorithm is used to improve motion-model prediction during maneuvers.</p>
<p><a href="http://mikestratton.net/assets/neural.jpg"></a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/artificial-intelligence-neural-networks/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>A Theological Objection to Artificial Intelligence</title>
		<link>http://www.mikestratton.net/2011/06/a-theological-objection-to-artificial-intelligence/</link>
		<comments>http://www.mikestratton.net/2011/06/a-theological-objection-to-artificial-intelligence/#comments</comments>
		<pubDate>Thu, 23 Jun 2011 05:52:01 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[computer science]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4033</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/a-theological-objection-to-artificial-intelligence/">A Theological Objection to Artificial Intelligence</a></p><p>Theological Objection?<br />
Many religous leaders or persons of faith will argue that the study of artificial intelligence is in direct contrast to God&#8217;s will.  I belive this view comes from a misconception and/or lack of education in the arena of information systems. That being said, the very same leaders that argue against the use of artificial intelligence, also depend on technology in every aspect of their day to day life.<br />
Any reference to the term &#8220;artificial intelligence&#8221; is responded with images from movies like ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/a-theological-objection-to-artificial-intelligence/">A Theological Objection to Artificial Intelligence</a></p><h2>Theological Objection?</h2>
<p>Many religous leaders or persons of faith will argue that the study of artificial intelligence is in direct contrast to God&#8217;s will.  I belive this view comes from a misconception and/or lack of education in the arena of information systems. That being said, the very same leaders that argue against the use of artificial intelligence, also depend on technology in every aspect of their day to day life.</p>
<p>Any reference to the term &#8220;artificial intelligence&#8221; is responded with images from movies like &#8220;The Terminator&#8221; or &#8220;The Matrix&#8221;. I belive this comes from a misconception and/or lack of education in the arena of information systems. In all actuality, the first computer, also known as &#8220;The Turing Machine&#8221; is an example of artificial intelligence. The Turing Machine, was originally created in 1937 and was instrumental in decrypting German Naval Ensigma messages. Above all else, the very first artificially intelligent machine could be considered an act of God with a man as his instrument. Quite obviously, the first intelligent system was beneficial to the Will of God and most certainly was not in direct contrast to God&#8217;s will.</p>
<p>Do you still have a theological objection to artificial intelligence? Maybe your view is derived from the concept that Darwin&#8217;s theory of evolution is in direct contrast with creationism, and that you may be sinning by even giving thought to topics such as evolution or intelligent systems. If this is your view, I would like to ask you to take an ethical approach to your belief. Before we discuss the meaning of ethics, let me first ask you if you wore clothes today? If you have,  by your own definition, you are sinning. Clearly, its easy for you to see that clothes are created by industry and that industry is driven by intelligent systems. Have you also considered the idea that commerce is driven by inteligent systems?</p>
<p>If you are still convinced that artificial intelligence is the work of the devil, let me quote the words of one who you may have faith in. Pope Benedict, leader of the Catholic Church recently (2007) took a view that is in support of evolution. <a href="http://www.dailymail.co.uk/news/article-447930/Pope-Benedict-believes-evolution.html" target="_blank">The Catholic Church&#8217;s unofficial position</a> is one that supports the idea that God used evolution as a method to evolve human life (Theistic evolution). Many other religions, <a href="http://www.umportal.org/article.asp?id=3869" target="_blank">the United Methodist Church</a> for example, have taken a position that religion and science are compatable rather then contradictory.</p>
<p>If you still are not convinced that artificial intelligence is complimentary to God&#8217;s will rather then contradictory, you best take your own advice and ban the use of any intelligent system. How might you do as such? First step in the process is to rid yourself of all things industry and technology and move into a remote portion of the world where you can live off the land. This includes phones, transportation, money, anything man-made, including your clothes. I doubt that you will make it to far before the use of an intelligent systems alerts the local police department of your current sinless and naked stance on religion and technology. Per your own beliefs, to do otherwise is sure to ban you to hell, and for eternity at that.</p>
<p>“Two things are infinite: the universe and <em>human stupidity</em>; and I&#8217;m not sure about the the universe.” <em>- Albert Enstien</em></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/a-theological-objection-to-artificial-intelligence/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Hypothesis &#8211; Artificial Intelligence &amp; Artificial Life</title>
		<link>http://www.mikestratton.net/2011/06/hypothesis-artificial-intelligence-artificial-life/</link>
		<comments>http://www.mikestratton.net/2011/06/hypothesis-artificial-intelligence-artificial-life/#comments</comments>
		<pubDate>Thu, 23 Jun 2011 04:11:20 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[artificial life]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=4026</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/hypothesis-artificial-intelligence-artificial-life/">Hypothesis &#8211; Artificial Intelligence &#038; Artificial Life</a></p><p>The purpose of this post is to document my research in the comprehension of artificial intelligence and the simulation/creation of an artificial life form.<br />
Artificial Intelligence &#8211; Research Question and Hypothesis<br />
Topic: Artificial Intelligence<br />
Narrowed Topic: Artificially intelligent algorithms and artificial life.<br />
Issue: Advancing and improving artificial intelligence for the purpose of creating artificial life forms, and/or artificial life simulations.<br />
Research Questions: Of the existing types of artificially intelligent algorithms, which has the greatest potential to improve and/or expand our ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/hypothesis-artificial-intelligence-artificial-life/">Hypothesis &#8211; Artificial Intelligence &#038; Artificial Life</a></p><p>The purpose of this post is to document my research in the comprehension of artificial intelligence and the simulation/creation of an artificial life form.</p>
<h2>Artificial Intelligence &#8211; Research Question and Hypothesis</h2>
<p><strong>Topic: </strong>Artificial Intelligence</p>
<p><strong>Narrowed Topic: </strong>Artificially intelligent algorithms and artificial life.</p>
<p><strong>Issue: </strong>Advancing and improving artificial intelligence for the purpose of creating artificial life forms, and/or artificial life simulations.</p>
<p><strong>Research Questions: </strong>Of the existing types of artificially intelligent algorithms, which has the greatest potential to improve and/or expand our current capabilities in the use of artificial life forms and/or artificial life simulations.</p>
<p><strong>Hypothesis: </strong>It is possible to create an artificial life form; for, the advancement in the design, development and enhancement of existing artificially intelligent algorithms.</p>
<p>&nbsp;</p>
<h3>Branches of Artificial Intelligence</h3>
<p>By defining the most commonly accepted branches of artificial intelligence; we can further evaluate the pros and cons of their use in existing information systems and applications. Some of the listed branches are considered concepts rather than actual branches of artificial intelligence. Regardless of whether a type of artificial intelligence is considered a branch or concept, research will be devoted on existing applications that are focused on these types. Initially, new methods in the use of artificial intelligence will not be tested. The initial goal is to simply establish the general consensus of professionals in the field of computer science as to what they believe is the most efficient use of artificial intelligence.</p>
<p>During my research process I initially believed that only a few artificial intelligent methods would suit this project. I quickly came to the conclusion that a combination of many branches of artificial intelligence may deliver the best results.</p>
<p>&nbsp;</p>
<h3>Branches of Artificial Intelligence</h3>
<ul class="list list3">
<ul>
<li>Neural Networks</li>
<li>Common Sense Knowledge and Reasoning (Expert Systems)</li>
<li>Genetic Algorithms</li>
<li>Learning Systems (Machine Learning)</li>
<li>Robotics</li>
<li>Pattern Recognition (Vision Systems)</li>
<li>Natural Language Processing</li>
<li>Search</li>
<li>Self-Aware Systems</li>
<li>Knowledge Representation</li>
<li>Logical AI</li>
<li>Inference</li>
<li>Planning</li>
<li>Epistemology</li>
<li>Ontology</li>
<li>Heuristics</li>
<li>Multi-Agent Systems (Distributed AI)</li>
<li>Emotions or Feelings???</li>
</ul>
</ul>
<p>&nbsp;</p>
<h3>Neural Network</h3>
<p>A neural network simulates the human brain and nervous system. The network consists many units split into 3 different types, (1) input, (2) output and (3) hidden (used for processing conditions).</p>
<p>Quite obviously, all life forms need a system for sensing, processing and responding to conditions within an environment.</p>
<p>&nbsp;</p>
<h3>Common Sense Knowledge and Reasoning (Expert Systems)</h3>
<p>Common sense knowledge and reasoning is the oldest and most commonly used form of artificial intelligence. Research initiated in the 1950&#8242;s.  A rule consists of two parts: condition (antecedent) part and conclusion (action, consequent) part, i.e.:<br />
IF (conditions) THEN (actions).</p>
<p>Present day applications of expert systems include medical diagnosis, air traffic controllers, speech interpretation, monitoring of nuclear plants, and more. The downside to an expert system is that has a narrow focus and needs instructions.</p>
<p>Cycorp initially developed what is known as the Cyc System in 1984. <a href="http://www.cyc.com" target="_blank">http://www.cyc.com</a></p>
<p>It is evident that an expert system would have great use in the creation of an artificial life form or artificial life form simulation. If we think in terms of environmental factors, there are many factors in our environment that are based on a set number of factors. For example, water evaporates dependent of a specific condition. Rain, is also produced dependent of specific conditions. Within an artificial life form simulation, these conditions could be emulated to create a stable environment.</p>
<p>In the creation of an actual artificial life form, an expert system may be utilized to define a creatures characteristics as a direct result of it&#8217;s DNA. The logic behind the DNA would change with each generation, but the current strand of DNA would be set to a specific set of mapped out charateristics.</p>
<p>The DNA logic could also be mapped out to define the probability of how a creature would react to a specific environmental condition. If we use a neural network as a method for an artificial life form to recieve input, an expert system as mapped from the DNA would offer a random yet approximate result.</p>
<p>In terms of human logic, if our environment is stressful, we have choices as to how we respond. Our DNA is at least partially responsible for the decision we make in response to our environment.</p>
<p>If the purpose of the artificial life form is survival and the survival of its species, the DNA may also store input of successful behaviors/characteristics, with a result of those characteristics becoming predominate after multiple generations.</p>
<p>&nbsp;</p>
<h3>Genetic Programming</h3>
<p>Genetic programming is a technique for getting programs to solve a task by mating random Lisp programs and selecting fittest in millions of generations. It is being developed by John Koza of Stanford University. <a href="http://www.genetic-programming.com" target="_blank">http://www.genetic-programming.com</a></p>
<p>Genetic programming clearly surpasses all other methods of developing an algorithm that mimics evolution. The downside to the genetic algorithm is that it needs an unbelievable amount of processing power needed to properly utilize its full capabilities. In the development of an artificial life form, or artificial life form simulation, one must consider the advances in this field.</p>
<p>&nbsp;</p>
<h3>Robotics</h3>
<p>Robotics is not necessarily a branch of AI; but rather, robotics is a mechanical technology that uses many separate types of AI methodologies. For example, a software program that controls cameras may use pattern recognition to identify objects; a unmanned vehicle may use machine learning to maneuver; or a robot may use a neural network to process any number of variables to reach a pre-determined goal.</p>
<p>In terms of the creation of an artificial life form, it is possible that a robot, such as one that is similar to the Mars Rover Curiosity, could be programmed so that its goals are to preserve itself using multiple types of artificially intelligent algorithms.</p>
<p>&nbsp;</p>
<h3> Pattern Recognition (Vision Systems)</h3>
<p>Although pattern recognition is primarily focused on the use of vision systems, it also has great use in other applications. For example, patterns in behavior, patterns in a history of events, etc.</p>
<p>In the creation of artificial life, pattern recognition could be utilized to both identify unknown objects and attach patterns of behavior of these objects in comparison to similar, known objects.</p>
<p>&nbsp;</p>
<h3>Natural Language Processing</h3>
<p>What are the goals of the field of Natural language Processing?</p>
<ul>
<li>Computers would be a lot more useful if they could handle our email, do our library research, talk to us&#8230;</li>
<li>Computers are unable to read natural human languages.</li>
<li>How can we tell computers about human language?</li>
<li>Can we help them to learn in the same way a child learns about our language?</li>
</ul>
<p>Natural language processing has no use in the realm of artificial life; although, the successful methods by which natural language processing is used may offer some insight into furthering learned communications among a species or through multiple species.</p>
<p><a href="http://see.stanford.edu/see/courseInfo.aspx?coll=63480b48-8819-4efd-8412-263f1a472f5a" target="_blank">Stanford Engineering Everywhere &#8211; Artificial Intelligence (Natural Langauge Processing) </a></p>
<p>&nbsp;</p>
<h3>Search</h3>
<p>Artificially intelligent search algorithms that examine large numbers of possibilities, e.g. moves in a chess game or inferences by a theorem proving program.</p>
<p>Two common methods of search (not necessarily AI related) are a linear search and binary search. A linear search exams each item from an existing pool of data to find a match. It examines each item, 1 by 1. A binary search sorts an existing pool of data into 3 separate elements (low, middle, high). Assuming the data is sorted in ascending order, and if a match is not found within the middle element, the search will continue to the appropriate element.</p>
<h4>Linear and Binary Examples:</h4>
<h5>Linear Search</h5>
<p>Linear search is looking for a match to the number 8 from a pool of integers from 1 &#8211; 9.<br />
Linear search sorts all integers one by one:<br />
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9<br />
Linear search then checks for a match on each integer until it finds a match:<br />
Does 1 = 8<br />
If no go to next<br />
Does 2 = 8<br />
If no go to next<br />
etc., etc.</p>
<h5>Binary Search</h5>
<p>Binary search is looking for a match to the number 8 from a pool of integers from 1 &#8211; 9.<br />
Binary searches the middle integer for a match from the existing pool of data:<br />
Does 5 = 8?<br />
Answer: No, 8 is greater than 5.<br />
Binary search then removes the number 1-5 from the search and then searches for a match from the remaining numbers (6-9)<br />
Does 7 = 8.<br />
This continues until a match is made.</p>
<p>A consideration must be given into the amount of effort used by an algorithm to perform a search. Big O Notation indicates the worst-case run-time for an algorithm. Worse case run-time is how hard an algorithm might have to work to solve a problem. For searching and sorting algorithms, obviously, the amount of data that is being processed affects the worst case run-time. (Chapter 19, Java How To Program Late Objects Version, Deitel, 2010)</p>
<h4>Google PageRank</h4>
<p>Google developed PageRank as a method of rating the level of importance a web page or website has to a keyword or phrase. <a href="http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf" target="_blank">http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf</a></p>
<h4>Artificial Life</h4>
<p>How is an artificial life form to search for energy or food? It must have some process to increase its chances for survival. Whether an artificial life form or artificial life form simulation, The importance and intensity of a search would increase dependent on its need to survive. The method by which a life form decides on how it is to survive could be directly dependent on searching data from previous experiences and/or DNA.</p>
<p>&nbsp;</p>
<h3>Self-Aware Systems</h3>
<p>&#8220;Self-aware computer systems will be capable of adapting their behavior and resources thousands of times a second to automatically find the best way to accomplish a given goal despite changing environmental conditions and demands.&#8221; (MIT, <a href="http://hdl.handle.net/1721.1/62151" target="_blank">http://hdl.handle.net/1721.1/62151</a> )</p>
<p>My thoughts on the creation of a self-aware system is to shift the focus from the system being self-aware to the environment in which a system or process resides in. In terms of human psychology, we are adept to any environment we are in, relating our current environment to data representation of our previous experiences that are similar. Our process is focused on a binary search that seeks out the most relevant data. We then act in response to our environment in an effort to control our environment to achieve results to meet our specific needs. For a self-aware system to be completely self-aware, it must not be self-aware; but rather, a self-aware system is aware of its environment and therefore its processes are a factor in that environment. A self-aware system does not heal itself, it heals its environment.</p>
<p><a href="http://domino.watson.ibm.com/comm/research.nsf/pages/r.ai.innovation.2.html" target="_blank">IBM Self-aware distributed systems</a></p>
<p>&nbsp;</p>
<h3>Knowledge Representation</h3>
<p>Facts about the world are used in some way, often represented by strings or mathematics. Theorem proving is a concept of reasoning against known facts. For example:<br />
Fred is an albino python.<br />
Albino Pythons are white snakes.<br />
Albino Pythons with names are pets.<br />
From the above representation of knowledge, Fred is a white snake and a pet.</p>
<p>From the aspect of an artificial life form simulation, knowledge representation combined with theorem proving on a scale from limited to advanced intelligence. As a species evolves, it may or may not advance its knowledge representation and ability to reason. From the standpoint of the creation of an artificial life form, knowledge representation and reasoning would represent the base for all DNA.</p>
<p>&nbsp;</p>
<h3>Logical AI</h3>
<p>&#8220;Logical AI involves representing knowledge of an agent&#8217;s world, its goals and the current situation by sentences in logic. The agent decides what to do by inferring that a certain action or course of action was appropriate to achieve the goals. The inference may be monotonic, but the nature of the world and what can be known about it often requires that the reasoning be nonmonotonic.</p>
<p>Logical AI has both epistemological problems and heuristic problems. The former concern the knowledge needed by an intelligent agent and how it is represented. The latter concerns how the knowledge is to be used to decide questions, to solve problems and to achieve goals. These are discussed in [MH69]. Neither the epistemological problems nor the heuristic problems of logical AI have been solved. The epistemological problems are more fundamental, because the form of their solution determines what the heuristic problems will eventually be like.&#8221;<br />
- <a href="http://www-formal.stanford.edu/jmc/concepts-ai/node1.html#SECTION00010000000000000000" target="_blank">John McCarthy, Stanford University</a></p>
<p>&nbsp;</p>
<h3>Inference</h3>
<p>&#8220;From some facts, others can be inferred. Mathematical logical deduction is adequate for some purposes, but new methods of non-monotonic inference have been added to logic since the 1970s. The simplest kind of non-monotonic reasoning is default reasoning in which a conclusion is to be inferred by default, but the conclusion can be withdrawn if there is evidence to the contrary. For example, when we hear of a bird, we man infer that it can fly, but this conclusion can be reversed when we hear that it is a penguin. It is the possibility that a conclusion may have to be withdrawn that constitutes the non-monotonic character of the reasoning. Ordinary logical reasoning is monotonic in that the set of conclusions that can the drawn from a set of premises is a monotonic increasing function of the premises. Circumscription is another form of non-monotonic reasoning.&#8221;<br />
<a href="http://www-formal.stanford.edu/jmc/whatisai/node2.html" target="_blank">John McCarthy, Stanford University</a></p>
<p>&nbsp;</p>
<h3>Planning</h3>
<p>&#8220; Planning programs start with general facts about the world (especially facts about the effects of actions), facts about the particular situation and a statement of a goal. From these, they generate a strategy for achieving the goal. In the most common cases, the strategy is just a sequence of actions. &#8220;<br />
- <a href="http://www-formal.stanford.edu/jmc/whatisai/node2.html" target="_blank">John McCarthy, Stanford University</a></p>
<p>&nbsp;</p>
<h3>Epistomology</h3>
<p>What is knowledge? Epistomology is the study of the different types of knowledge that are required to solve problems of the world.</p>
<p>&nbsp;</p>
<h3>Ontology</h3>
<p>Ontology is the representation of things that exist as objects within a domain, and the relationships between those objects.</p>
<p>&nbsp;</p>
<h3>Heuristics</h3>
<p>Heuristic is a technique that can discovers the most probable solution given a number of conditions, or a pre-determined solution set. Discovery of a solution does not need to be in direct alignment to a pre-determined solution set, a solution only needs to intersect with the solution set while showing high probability that a match exists.</p>
<p>&nbsp;</p>
<h3>Multi-Agent Systems (Distributed AI)</h3>
<p>A system within multiple intelligent agents that may or may not communicate with each other to solve a common problem(s).  Agents are at least partially autonomous of one another. An agent recieves sensory input from it&#8217;s environment, and then produces an output as an effort to change its enviroment.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/hypothesis-artificial-intelligence-artificial-life/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial Life &#8211; Simple Animation</title>
		<link>http://www.mikestratton.net/2011/06/artificial-life-simple-animation/</link>
		<comments>http://www.mikestratton.net/2011/06/artificial-life-simple-animation/#comments</comments>
		<pubDate>Mon, 13 Jun 2011 08:09:46 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[artificial life]]></category>
		<category><![CDATA[java]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3986</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/artificial-life-simple-animation/">Artificial Life &#8211; Simple Animation</a></p><p>One of the base things I must accomplish in the creation of a software program that emmulates the evolution and survival of life is a simplistic method of animating graphical objects. The graphics will be able to &#8220;see&#8221; and therefore will sense when they come in close contact with other objects. After a bit of research and development, I found an existing program, written in Java, that does just this.<br />
The artificial life simulation will take into account the cycle ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/artificial-life-simple-animation/">Artificial Life &#8211; Simple Animation</a></p><p>One of the base things I must accomplish in the creation of a software program that emmulates the evolution and survival of life is a simplistic method of animating graphical objects. The graphics will be able to &#8220;see&#8221; and therefore will sense when they come in close contact with other objects. After a bit of research and development, I found an existing program, written in Java, that does just this.</p>
<p>The artificial life simulation will take into account the cycle of life as well as evolution. All creatures will start in existence as an Amoeba and will evolve into one of several types of life forms over time. These life forms will include bacteria, insects, plants, herbivores, carnivores, omnivores and more. I have modified the program written in Java to include only 3 of these life forms, each which will have a reaction to the other life forms. When viewing this video, think in terms of survival in the African plains.</p>
<h3>Artificial Life &#8211; Simple Animation Video Screencast</h3>
<p><code><object width="425" height="349"><param name="movie" value="http://www.youtube-nocookie.com/v/w9lJ237LY-o?version=3&amp;hl=en_US&amp;rel=0" /><param name="allowFullScreen" value="true" /><param name="allowscriptaccess" value="always" /><embed type="application/x-shockwave-flash" width="425" height="349" src="http://www.youtube-nocookie.com/v/w9lJ237LY-o?version=3&amp;hl=en_US&amp;rel=0" allowscriptaccess="always" allowfullscreen="true"></embed></object></code></p>
<h3>Artificial Life Source Code</h3>
<pre>/*File Animate01.java
Copyright 2001, R.G.Baldwin

http://www.developer.com/java/other/article.php/893471/Fun-with-Java-Sprite-Animation-Part-1.html

This program displays several animated
colored spherical creatures swimming
around in an aquarium.  Each creature
maintains generally the same course
with until it collides with another
creature or with a wall.  However,
each creature has the ability to
occasionally make random changes in
its course.

**************************************/
import java.awt.*;
import java.awt.event.*;
import java.util.*;

public class AnimateLifeForms extends Frame
                  implements Runnable {
  private Image offScreenImage;
  private Image backGroundImage;
  private Image[] gifImages =
                          new Image[3];
  //offscreen graphics context
  private Graphics
                  offScreenGraphicsCtx;
  private Thread animationThread;
  private MediaTracker mediaTracker;
  private SpriteManager spriteManager;
  //Animation display rate, 12fps
  private int animationDelay = 83;
  private Random rand =
                new Random(System.
                  currentTimeMillis());

  public static void main(
                        String[] args){
    new AnimateLifeForms();
  }//end main
  //---------------------------------//

  AnimateLifeForms() {//constructor
    // Load and track the images
    mediaTracker =
                new MediaTracker(this);
    //Get and track the background
    // image
    backGroundImage =
        Toolkit.getDefaultToolkit().
          getImage("primordial-soup.png");
    mediaTracker.addImage(
                   backGroundImage, 0);

    //Get and track 3 images to use
    // for life forms
    gifImages[0] =
           Toolkit.getDefaultToolkit().
               getImage("redball.gif"); // carnivore
    mediaTracker.addImage(
                      gifImages[0], 0);
    gifImages[1] =
           Toolkit.getDefaultToolkit().
             getImage("greenball.gif"); // plant
    mediaTracker.addImage(
                      gifImages[1], 0);
    gifImages[2] =
           Toolkit.getDefaultToolkit().
              getImage("blueball.gif"); // herbivore
    mediaTracker.addImage(
                      gifImages[2], 0);
 /* gifImages[3] =
           Toolkit.getDefaultToolkit().
            getImage("orangeball.gif");
    mediaTracker.addImage(
                      gifImages[3], 0);
    gifImages[4] =
           Toolkit.getDefaultToolkit().
            getImage("purpleball.gif");
    mediaTracker.addImage(
                      gifImages[4], 0);
    gifImages[5] =
           Toolkit.getDefaultToolkit().
            getImage("yellowball.gif");
    mediaTracker.addImage(
                      gifImages[5], 0);
    */
    //Block and wait for all images to
    // be loaded
    try {
      mediaTracker.waitForID(0);
    }catch (InterruptedException e) {
      System.out.println(e);
    }//end catch

    //Base the Frame size on the size
    // of the background image.
    //These getter methods return -1 if
    // the size is not yet known.
    //Insets will be used later to
    // limit the graphics area to the
    // client area of the Frame.
    int width =
        backGroundImage.getWidth(this);
    int height =
       backGroundImage.getHeight(this);

    //While not likely, it may be
    // possible that the size isn't
    // known yet.  Do the following
    // just in case.
    //Wait until size is known
    while(width == -1 || height == -1){
      System.out.println(
                  "Waiting for image");
      width = backGroundImage.
                        getWidth(this);
      height = backGroundImage.
                       getHeight(this);
    }//end while loop

    //Display the frame
    setSize(width,height);
    setVisible(true);
    setTitle(
        "Copyright 2001, R.G.Baldwin, Revised by Michael A. Stratton 2011");

    //Create and start animation thread
    animationThread = new Thread(this);
    animationThread.start();

    //Anonymous inner class window
    // listener to terminate the
    // program.
    this.addWindowListener(
                   new WindowAdapter(){
      public void windowClosing(
                        WindowEvent e){
        System.exit(0);}});

  }//end constructor
  //---------------------------------//

  public void run() {
    //Create and add sprites to the
    // sprite manager
    spriteManager = new SpriteManager(
             new BackgroundImage(
               this, backGroundImage));
    //Create 15 sprites from 6 gif
    // files.
    for (int cnt = 0; cnt &lt; 15; cnt++){
      Point position = spriteManager.
        getEmptyPosition(new Dimension(
           gifImages[0].getWidth(this),
           gifImages[0].
                     getHeight(this)));
      spriteManager.addSprite(
        makeSprite(position, cnt % 3));
    }//end for loop

    //Loop, sleep, and update sprite
    // positions once each 83
    // milliseconds
    long time =
            System.currentTimeMillis();
    while (true) {//infinite loop
      spriteManager.update();
      repaint();
      try {
        time += animationDelay;
        Thread.sleep(Math.max(0,time -
          System.currentTimeMillis()));
      }catch (InterruptedException e) {
        System.out.println(e);
      }//end catch
    }//end while loop
  }//end run method
  //---------------------------------//

  private Sprite makeSprite(
      Point position, int imageIndex) {
    return new Sprite(
          this,
          gifImages[imageIndex],
          position,
          new Point(rand.nextInt() % 5,
                  rand.nextInt() % 5));
  }//end makeSprite()
  //---------------------------------//

  //Overridden graphics update method
  // on the Frame
  public void update(Graphics g) {
    //Create the offscreen graphics
    // context
    if (offScreenGraphicsCtx == null) {
      offScreenImage =
         createImage(getSize().width,
                     getSize().height);
      offScreenGraphicsCtx =
          offScreenImage.getGraphics();
    }//end if

    // Draw the sprites offscreen
    spriteManager.drawScene(
                 offScreenGraphicsCtx);

    // Draw the scene onto the screen
    if(offScreenImage != null){
         g.drawImage(
           offScreenImage, 0, 0, this);
    }//end if
  }//end overridden update method
  //---------------------------------//

  //Overridden paint method on the
  // Frame
  public void paint(Graphics g) {
    //Nothing required here.  All
    // drawing is done in the update
    // method above.
  }//end overridden paint method

}//end class Animate01
//===================================//

class BackgroundImage{
  private Image image;
  private Component component;
  private Dimension size;

  public BackgroundImage(
                  Component component,
                  Image image) {
    this.component = component;
    size = component.getSize();
    this.image = image;
  }//end construtor

  public Dimension getSize(){
    return size;
  }//end getSize()

  public Image getImage(){
    return image;
  }//end getImage()

  public void setImage(Image image){
    this.image = image;
  }//end setImage()

  public void drawBackgroundImage(
                          Graphics g) {
    g.drawImage(
               image, 0, 0, component);
  }//end drawBackgroundImage()
}//end class BackgroundImage
//===========================

class SpriteManager extends Vector {
  private BackgroundImage
                       backgroundImage;

  public SpriteManager(
     BackgroundImage backgroundImage) {
    this.backgroundImage =
                       backgroundImage;
  }//end constructor
  //---------------------------------//

  public Point getEmptyPosition(
                 Dimension spriteSize){
    Rectangle trialSpaceOccupied =
      new Rectangle(0, 0,
                    spriteSize.width,
                    spriteSize.height);
    Random rand =
         new Random(
           System.currentTimeMillis());
    boolean empty = false;
    int numTries = 0;

    // Search for an empty position
    while (!empty &amp;&amp; numTries++ &lt; 100){
      // Get a trial position
      trialSpaceOccupied.x =
        Math.abs(rand.nextInt() %
                      backgroundImage.
                      getSize().width);
      trialSpaceOccupied.y =
        Math.abs(rand.nextInt() %
                     backgroundImage.
                     getSize().height);

      // Iterate through existing
      // sprites, checking if position
      // is empty
      boolean collision = false;
      for(int cnt = 0;cnt &lt; size();
                                cnt++){
        Rectangle testSpaceOccupied =
              ((Sprite)elementAt(cnt)).
                    getSpaceOccupied();
        if (trialSpaceOccupied.
                 intersects(
                   testSpaceOccupied)){
          collision = true;
        }//end if
      }//end for loop
      empty = !collision;
    }//end while loop
    return new Point(
                 trialSpaceOccupied.x,
                 trialSpaceOccupied.y);
  }//end getEmptyPosition()
  //---------------------------------//

  public void update() {
    Sprite sprite;

    //Iterate through sprite list
    for (int cnt = 0;cnt &lt; size();
                                cnt++){
      sprite = (Sprite)elementAt(cnt);
      //Update a sprite's position
      sprite.updatePosition();

      //Test for collision. Positive
      // result indicates a collision
      int hitIndex =
              testForCollision(sprite);
      if (hitIndex &gt;= 0){
        //a collision has occurred
        bounceOffSprite(cnt,hitIndex);
      }//end if
    }//end for loop
  }//end update
  //---------------------------------//

  private int testForCollision(
                   Sprite testSprite) {
    //Check for collision with other
    // sprites
    Sprite  sprite;
    for (int cnt = 0;cnt &lt; size();
                                cnt++){
      sprite = (Sprite)elementAt(cnt);
      if (sprite == testSprite)
        //don't check self
        continue;
      //Invoke testCollision method
      // of Sprite class to perform
      // the actual test.
      if (testSprite.testCollision(
                               sprite))
        //Return index of colliding
        // sprite
        return cnt;
    }//end for loop
    return -1;//No collision detected
  }//end testForCollision()
  //---------------------------------//

  private void bounceOffSprite(
                    int oneHitIndex,
                    int otherHitIndex){
    //Swap motion vectors for
    // bounce algorithm
    Sprite oneSprite =
        (Sprite)elementAt(oneHitIndex);
    Sprite otherSprite =
      (Sprite)elementAt(otherHitIndex);
    Point swap =
           oneSprite.getMotionVector();
    oneSprite.setMotionVector(
        otherSprite.getMotionVector());
    otherSprite.setMotionVector(swap);
  }//end bounceOffSprite()
  //---------------------------------//

  public void drawScene(Graphics g){
    //Draw the background and erase
    // sprites from graphics area
    //Disable the following statement
    // for an interesting effect.
    backgroundImage.
                drawBackgroundImage(g);

    //Iterate through sprites, drawing
    // each sprite
    for (int cnt = 0;cnt &lt; size();
                                 cnt++)
      ((Sprite)elementAt(cnt)).
                    drawSpriteImage(g);
  }//end drawScene()
  //---------------------------------//

  public void addSprite(Sprite sprite){
    add(sprite);
  }//end addSprite()

}//end class SpriteManager
//===================================//

class Sprite {
  private Component component;
  private Image image;
  private Rectangle spaceOccupied;
  private Point motionVector;
  private Rectangle bounds;
  private Random rand; 

  public Sprite(Component component,
                Image image,
                Point position,
                Point motionVector){
    //Seed a random number generator
    // for this sprite with the sprite
    // position.
    rand = new Random(position.x);
    this.component = component;
    this.image = image;
    setSpaceOccupied(new Rectangle(
          position.x,
          position.y,
          image.getWidth(component),
          image.getHeight(component)));
    this.motionVector = motionVector;
    //Compute edges of usable graphics
    // area in the Frame.
    int topBanner = (
                 (Container)component).
                       getInsets().top;
    int bottomBorder =
                ((Container)component).
                    getInsets().bottom;
    int leftBorder = (
                (Container)component).
                     getInsets().left;
    int rightBorder = (
                (Container)component).
                    getInsets().right;
    bounds = new Rectangle(
         0 + leftBorder,
         0 + topBanner,
         component.getSize().width -
            (leftBorder + rightBorder),
         component.getSize().height -
           (topBanner + bottomBorder));
  }//end constructor
  //---------------------------------//

  public Rectangle getSpaceOccupied(){
    return spaceOccupied;
  }//end getSpaceOccupied()
  //---------------------------------//

  void setSpaceOccupied(
              Rectangle spaceOccupied){
    this.spaceOccupied = spaceOccupied;
  }//setSpaceOccupied()
  //---------------------------------//

  public void setSpaceOccupied(
                       Point position){
    spaceOccupied.setLocation(
               position.x, position.y);
  }//setSpaceOccupied()
  //---------------------------------//

  public Point getMotionVector(){
    return motionVector;
  }//end getMotionVector()
  //---------------------------------//

  public void setMotionVector(
                   Point motionVector){
    this.motionVector = motionVector;
  }//end setMotionVector()
  //---------------------------------//

  public void setBounds(
                     Rectangle bounds){
    this.bounds = bounds;
  }//end setBounds()
  //---------------------------------//

  public void updatePosition() {
    Point position = new Point(
     spaceOccupied.x, spaceOccupied.y);

    //Insert random behavior.  During
    // each update, a sprite has about
    // one chance in 10 of making a
    // random change to its
    // motionVector.  When a change
    // occurs, the motionVector
    // coordinate values are forced to
    // fall between -7 and 7.  This
    // puts a cap on the maximum speed
    // for a sprite.
    if(rand.nextInt() % 10 == 0){
      Point randomOffset =
         new Point(rand.nextInt() % 3,
                   rand.nextInt() % 3);
      motionVector.x += randomOffset.x;
      if(motionVector.x &gt;= 7)
                   motionVector.x -= 7;
      if(motionVector.x &lt;= -7)
                   motionVector.x += 7;
      motionVector.y += randomOffset.y;
      if(motionVector.y &gt;= 7)
                   motionVector.y -= 7;
      if(motionVector.y &lt;= -7)
                   motionVector.y += 7;
    }//end if

    //Move the sprite on the screen
    position.translate(
       motionVector.x, motionVector.y);

    //Bounce off the walls
    boolean bounceRequired = false;
    Point tempMotionVector = new Point(
                       motionVector.x,
                       motionVector.y);

    //Handle walls in x-dimension
    if (position.x &lt; bounds.x) {
      bounceRequired = true;
      position.x = bounds.x;
      //reverse direction in x
      tempMotionVector.x =
                   -tempMotionVector.x;
    }else if ((
      position.x + spaceOccupied.width)
          &gt; (bounds.x + bounds.width)){
      bounceRequired = true;
      position.x = bounds.x +
                  bounds.width -
                   spaceOccupied.width;
      //reverse direction in x
      tempMotionVector.x =
                   -tempMotionVector.x;
    }//end else if

    //Handle walls in y-dimension
    if (position.y &lt; bounds.y){
      bounceRequired = true;
      position.y = bounds.y;
      tempMotionVector.y =
                   -tempMotionVector.y;
    }else if ((position.y +
                  spaceOccupied.height)
         &gt; (bounds.y + bounds.height)){
      bounceRequired = true;
      position.y = bounds.y +
                 bounds.height -
                  spaceOccupied.height;
      tempMotionVector.y =
                   -tempMotionVector.y;
    }//end else if

    if(bounceRequired)
      //save new motionVector
                   setMotionVector(
                     tempMotionVector);
    //update spaceOccupied
    setSpaceOccupied(position);
  }//end updatePosition()
  //---------------------------------//

  public void drawSpriteImage(
                           Graphics g){
    g.drawImage(image,
                spaceOccupied.x,
                spaceOccupied.y,
                component);
  }//end drawSpriteImage()
  //---------------------------------//

  public boolean testCollision(
                    Sprite testSprite){
    //Check for collision with
    // another sprite
    if (testSprite != this){
      return spaceOccupied.intersects(
        testSprite.getSpaceOccupied());
    }//end if
    return false;
  }//end testCollision
}//end Sprite class
//===================================//</pre>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/artificial-life-simple-animation/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial Life &#8211; Simple Math</title>
		<link>http://www.mikestratton.net/2011/06/artificial-life-simple-math/</link>
		<comments>http://www.mikestratton.net/2011/06/artificial-life-simple-math/#comments</comments>
		<pubDate>Sat, 11 Jun 2011 10:01:40 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[java]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3977</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/artificial-life-simple-math/">Artificial Life &#8211; Simple Math</a></p><p>The following code transforms the struggle for survival into a mathematical equation. A user is asked to enter a number of carnivores to create between 1 &#8211; 100. Once the number has been decided, the plants, herbivores and carnivores reproduce contingent on a specific ratio between plants:herbivores:carnivores or 16:6:2.<br />
The program takes 3 separate life forms plants, herbivores and carnivores and increases or decreases their reproduction rate depedent on their ratio in comparison to the other life forms. A ratio ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/artificial-life-simple-math/">Artificial Life &#8211; Simple Math</a></p><p>The following code transforms the struggle for survival into a mathematical equation. A user is asked to enter a number of carnivores to create between 1 &#8211; 100. Once the number has been decided, the plants, herbivores and carnivores reproduce contingent on a specific ratio between plants:herbivores:carnivores or 16:6:2.</p>
<p>The program takes 3 separate life forms plants, herbivores and carnivores and increases or decreases their reproduction rate depedent on their ratio in comparison to the other life forms. A ratio of 2:1 was used for plants:animals and a ratio of 3:1 was used for herbivores:carnivores.</p>
<p>The program uses a while condition to verify the correct number was used for input and then uses a for counter to loop 100 times.</p>
<p>// artificial life psuedo code simple evolution math</p>
<p>import java.util.Scanner;</p>
<p>public class alpcsem</p>
<p>{<br />
public static void main( String[] args )<br />
{<br />
Scanner input = new Scanner(System.in);</p>
<p>double p;<br />
double h;<br />
double c;</p>
<p>p = 20;<br />
h = 8;</p>
<p>System.out.print(&#8220;Please enter the number of carnivores you would like to create(Between 1 &#8211; 100): &#8220;);<br />
c = input.nextDouble();<br />
while (c &gt; 100 || c &lt; 1)<br />
{<br />
System.out.print(&#8220;You must enter a number between 1 &#8211; 100 &#8220;);<br />
System.out.print(&#8220;Please enter the number of carnivores you would like to create(Between 1 &#8211; 100): &#8220;);<br />
c = input.nextDouble();<br />
} // end while</p>
<p>System.out.printf(&#8220;Plants %.0f\n&#8221;, p);<br />
System.out.printf(&#8220;Herbivores %.0f\n&#8221;, h);<br />
System.out.printf(&#8220;Carinvores %.0f\n&#8221;, c);</p>
<p>for (int count = 1; count &lt;= 100; count++) // counter<br />
// while (p/(h+c) != 2 &amp;&amp; h/c != 3 )<br />
{<br />
// ratio 2:1 for plants to animals =  p/(h+c)<br />
if (p/(h+c) &gt; 2) // increase animal production<br />
{<br />
p = p + 16;<br />
h = h + 12;<br />
c = c + 4;<br />
System.out.printf(&#8220;Plants %.0f\n&#8221;, p);<br />
System.out.printf(&#8220;Herbivores %.0f\n&#8221;, h);<br />
System.out.printf(&#8220;Carinvores %.0f\n&#8221;, c);<br />
} // end while</p>
<p>if (p/(h+c) &lt; 2) // reduce animal production<br />
{<br />
p = p + 16;<br />
h = h + 3;<br />
c = c + 1;<br />
System.out.printf(&#8220;Plants %.0f\n&#8221;, p);<br />
System.out.printf(&#8220;Herbivores %.0f\n&#8221;, h);<br />
System.out.printf(&#8220;Carinvores %.0f\n&#8221;, c);<br />
} // end while</p>
<p>if (h/c &gt; 3) // increase carnivore production<br />
{<br />
p = p + 16;<br />
h = h + 7;<br />
c = c + 1;<br />
} // end while</p>
<p>if (h/c &lt; 3) // increase herbivore production<br />
{<br />
p = p + 16;<br />
h = h + 5;<br />
c = c + 3;<br />
} // end if</p>
<p>} // end for</p>
<p>} // end method main<br />
} // end class alpcsem</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/artificial-life-simple-math/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial Life Simulation</title>
		<link>http://www.mikestratton.net/2011/06/artificial-life-simulation/</link>
		<comments>http://www.mikestratton.net/2011/06/artificial-life-simulation/#comments</comments>
		<pubDate>Sat, 11 Jun 2011 07:14:44 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Blog]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Science]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[java]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3971</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/artificial-life-simulation/">Artificial Life Simulation</a></p><p>I have many software projects that I have been working on. One of my favorites is an Artificial Life Simulation. I will be using the blog portion of mikestratton.net to keep a running record of my work. The Artificial Life Simulation is being developed in Java.<br />
Artificial Life Simulation Overview<br />
Create a simulation that emulates life and evolution.<br />
The simulation is governed by the same rules that govern our world. Graphic<br />
objects in simulation represent life forms and environmental objects. ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/artificial-life-simulation/">Artificial Life Simulation</a></p><p>I have many software projects that I have been working on. One of my favorites is an Artificial Life Simulation. I will be using the blog portion of mikestratton.net to keep a running record of my work. The Artificial Life Simulation is being developed in Java.</p>
<h3>Artificial Life Simulation Overview</h3>
<p>Create a simulation that emulates life and evolution.<br />
The simulation is governed by the same rules that govern our world. Graphic<br />
objects in simulation represent life forms and environmental objects. Life<br />
forms have attributes that evolve dependent on the success of each attribute<br />
(i.e. unsuccessful attributes drop off; successful attributes are accented or<br />
further developed). The purpose of the life forms is survival.</p>
<h3>Psuedo Code (Simple Version)</h3>
<p>// artificial life psuedo code simple</p>
<p>public class alpcs<br />
{<br />
public static void main( String[] args )<br />
{<br />
int p; // plant<br />
int h; // herbivore<br />
int c; // carnivore</p>
<p>// reproduce every 1 minute<br />
// plant to animal ratio<br />
method reproduce<br />
{<br />
new<br />
p = 20;<br />
h = 6;<br />
c = 4;<br />
// adjust reproduction dependent on p:h:c ratio<br />
// p:h:c ratio = 10:3:2<br />
if (p/(h+c) &gt; 2)<br />
p = 20;<br />
h = 12;<br />
c = 8;<br />
else if<br />
(p/(h+c) &lt; 2)<br />
p = 20;<br />
h = 6;<br />
c = 4;<br />
else if<br />
(p/(h+c) == 2)<br />
p = 10;<br />
h = 3;<br />
c = 2;<br />
return p,h,c;<br />
// reproduce every 1 minute<br />
// herbivore to carnivore ratio<br />
// h:c ratio = 3:2<br />
if (h/c &gt; 1.5)<br />
p = 10;<br />
h = 3;<br />
c = 4;<br />
else if<br />
(h/c &lt; 1.5)<br />
p = 10;<br />
h = 6;<br />
c = 2;<br />
else if<br />
(h/c == 1.5)<br />
p = 10;<br />
h = 3;<br />
c = 2;<br />
return p,h,c;<br />
} // end method reproduce</p>
<p>method nest // reproduction takes place in nest<br />
{<br />
hnest = orange, 12&#215;12, x/y coordinate; // size, location, and color of nest<br />
cnest = orange 12&#215;12 x/y coordinate; // size, location, and color of nest<br />
} // end method nest</p>
<p>method pGrowth<br />
{<br />
p = plantFood; // number of returned plants transform from plantGrowth to plants<br />
} // end method pGrowth</p>
<p>method move<br />
{<br />
string plant = 4&#215;4 green; // 4&#215;4 green square<br />
string herbivore = 4&#215;4 blue; // 4&#215;4 blue square<br />
string carnivore = 4&#215;4 red; // 4&#215;4 red square<br />
p = number of plant;<br />
plant is stationary<br />
h = number of herbivore<br />
herbivore moves randomly at rate of 4 units/second<br />
c = number of carnivore<br />
carnivore moves randomly at rate of 5 units/second</p>
<p>} // end method move</p>
<p>method sight<br />
{<br />
if (carnivore x coordinate/y coordinate + 4 = herbivore)<br />
carnivore move towards herbivore<br />
else if (herbivore x coordinate/y coordinate + 3 = carnivore)<br />
herbivore moves away from carnivore<br />
} // end method sight</p>
<p>method die<br />
{<br />
plant, herbivore, carnivore = 4&#215;4 brown, stationary // 4&#215;4 brown stationary square<br />
4&#215;4 brown = pFood; // plant, herb, or carn dies, plants can grow<br />
} // end method die</p>
<p>method eat<br />
{<br />
if (carnivore x coordinate/y coordinate + 1 = herbivore)<br />
herbivore = method die;<br />
else if<br />
(herbivore x coordinate/y coordinate + 1 = plant)<br />
plant = method die;<br />
} // end method eat</p>
<p>method health<br />
{<br />
if (herbivore eat &gt; 1 minute or carnivore time &gt; 3 minutes)<br />
herbivore = method die<br />
if (carnivore eat &gt; 1 minute or carnivore time &gt; 3 minutes)<br />
carnivore = method die<br />
if (plant time &gt; 3 minutes)<br />
plant = method die<br />
if (pFood &gt; 3 minutes)<br />
remove pFood<br />
} // end method health</p>
<p>} // end method main<br />
} // end class alpcs</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/artificial-life-simulation/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Java Script Browser Detection</title>
		<link>http://www.mikestratton.net/2011/06/java-script-browser-detection/</link>
		<comments>http://www.mikestratton.net/2011/06/java-script-browser-detection/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 06:14:10 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[java script]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3942</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/java-script-browser-detection/">Java Script Browser Detection</a></p><p>Java Script Browser Detection &#38; Redirection<br />
Part of the process of web development includes testing to verify if a website<br />
works in different browsers. Once you understand how the site will function in<br />
each browser, you can better understand how to resolve errors. Although I do not<br />
recommend the use of a client side script for detection and redirection for<br />
high-traffic sites and/or web applications, I do recommend this script if you<br />
are on a budget and/or you are in ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/java-script-browser-detection/">Java Script Browser Detection</a></p><h1>Java Script Browser Detection &amp; Redirection</h1>
<p>Part of the process of web development includes testing to verify if a website<br />
works in different browsers. Once you understand how the site will function in<br />
each browser, you can better understand how to resolve errors. Although I do not<br />
recommend the use of a client side script for detection and redirection for<br />
high-traffic sites and/or web applications, I do recommend this script if you<br />
are on a budget and/or you are in need of a temporary fix until a better server<br />
side detection and redirection can be implemented.</p>
<p>Follows are 2 different types of scripts.</p>
<p>The first script simply detects and outputs(writes) the browser you have to<br />
the page in the form of HTML. This script could be modified to notify the end user of having an outdated browser along with a link to update to a more current browser.</p>
<p>The second script detects your browser and redirects to another page. The<br />
problem with using this script is that it increases download time and increases<br />
load on server. A server side script would allow the detection and redirection<br />
to be made at the server as opposed to this scripts method; which is, a client<br />
side redirection script downloads a page to client, detects browser and then<br />
requests another page from server and then downloads to client again.
</p>
<p><em>*Please Note: This script includes detection for only 3 browsers. Obviously, a<br />
more extensive detection of existing browsers is needed. </em>
</p>
<h2>Browser Detection with document.write Output<br />
</h2>
<h3>Firefox Browser?</h3>
<p>&nbsp;&lt;script type=&#8221;text/javascript&#8221;&gt;</p>
<p>if (/Firefox[\/\s](\d+\.\d+)/.test(navigator.userAgent)){ //test for Firefox/x.x<br />
or Firefox x.x (ignoring remaining digits);<br />
var ffversion=new Number(RegExp.$1) // capture x.x portion and store as a number<br />
if (ffversion&gt;=3)<br />
document.write(&#8220;You&#8217;re using FF 3.x or above&#8221;)<br />
else if (ffversion&gt;=2)<br />
document.write(&#8220;You&#8217;re using FF 2.x&#8221;)<br />
else if (ffversion&gt;=1)<br />
document.write(&#8220;You&#8217;re using FF 1.x&#8221;)<br />
}<br />
else<br />
document.write(&#8220;n/a&#8221;)</p>
<p>&lt;/script&gt;
</p>
<h3>
<p>Internet Explorer Browser?<br />
</h3>
<p>&lt;script type=&#8221;text/javascript&#8221;&gt;</p>
<p>if (/MSIE (\d+\.\d+);/.test(navigator.userAgent)){ //test for MSIE x.x;<br />
var ieversion=new Number(RegExp.$1) // capture x.x portion and store as a number<br />
if (ieversion&gt;=8)<br />
document.write(&#8220;You&#8217;re using IE8 or above&#8221;)<br />
else if (ieversion&gt;=7)<br />
document.write(&#8220;You&#8217;re using IE7.x&#8221;)<br />
else if (ieversion&gt;=6)<br />
document.write(&#8220;You&#8217;re using IE6.x&#8221;)<br />
else if (ieversion&gt;=5)<br />
document.write(&#8220;You&#8217;re using IE5.x&#8221;)<br />
}<br />
else<br />
document.write(&#8220;n/a&#8221;)<br />
&lt;/script&gt;
</p>
<h3>
<p>Opera Browser?</h3>
<p>&lt;script type=&#8221;text/javascript&#8221;&gt;<br />
//Note: userAgent in Opera9.24 WinXP returns: Opera/9.24 (Windows NT 5.1; U; en)<br />
// userAgent in Opera 8.5 (identified as IE) returns: Mozilla/4.0 (compatible;<br />
MSIE 6.0; Windows NT 5.1) Opera 8.50 [en]<br />
// userAgent in Opera 8.5 (identified as Opera) returns: Opera/8.50 (Windows NT<br />
5.1; U) [en]</p>
<p>if (/Opera[\/\s](\d+\.\d+)/.test(navigator.userAgent)){ //test for Opera/x.x or<br />
Opera x.x (ignoring remaining decimal places);<br />
var oprversion=new Number(RegExp.$1) // capture x.x portion and store as a<br />
number<br />
if (oprversion&gt;=10)<br />
document.write(&#8220;You&#8217;re using Opera 10.x or above&#8221;)<br />
else if (oprversion&gt;=9)<br />
document.write(&#8220;You&#8217;re using Opera 9.x&#8221;)<br />
else if (oprversion&gt;=8)<br />
document.write(&#8220;You&#8217;re using Opera 8.x&#8221;)<br />
else if (oprversion&gt;=7)<br />
document.write(&#8220;You&#8217;re using Opera 7.x&#8221;)<br />
else<br />
document.write(&#8220;n/a&#8221;)<br />
}<br />
else<br />
document.write(&#8220;n/a&#8221;)<br />
&lt;/script&gt;</p>
<p>Source for this Script:Source:<br />
http://www.javascriptkit.com/javatutors/navigator.shtml
</p>
<h2>
<p>Browser Detection with window.location Redirection<br />
</h2>
<p>To create this script, I simply replaced the document.write lines with window.location.</p>
<p>&lt;script type=&#8221;text/javascript&#8221;&gt;</p>
<p>if (/Firefox[\/\s](\d+\.\d+)/.test(navigator.userAgent)){ //test for Firefox/x.x<br />
or Firefox x.x (ignoring remaining digits);<br />
var ffversion=new Number(RegExp.$1) // capture x.x portion and store as a number<br />
if (ffversion&gt;=3) <br />
window.location = &#8220;redirect.html&#8221;<br />
else if (ffversion&gt;=2)<br />
window.location = &#8220;redirect.html&#8221;<br />
else if (ffversion&gt;=1)<br />
window.location = &#8220;redirect.html&#8221;<br />
}<br />
else<br />
document.write(&#8220;n/a&#8221;)</p>
<p>&lt;/script&gt;</p>
<p>
&lt;script type=&#8221;text/javascript&#8221;&gt;</p>
<p>if (/MSIE (\d+\.\d+);/.test(navigator.userAgent)){ //test for MSIE x.x;<br />
var ieversion=new Number(RegExp.$1) // capture x.x portion and store as a number<br />
if (ieversion&gt;=8)<br />
window.location = &#8220;redirect.html&#8221;<br />
else if (ieversion&gt;=7)<br />
window.location = &#8220;redirect.html&#8221;<br />
else if (ieversion&gt;=6)<br />
window.location = &#8220;redirect.html&#8221;<br />
else if (ieversion&gt;=5)<br />
window.location = &#8220;redirect.html&#8221;<br />
}<br />
else<br />
document.write(&#8220;n/a&#8221;)<br />
&lt;/script&gt;</p>
<p>&lt;script type=&#8221;text/javascript&#8221;&gt;<br />
//Note: userAgent in Opera9.24 WinXP returns: Opera/9.24 (Windows NT 5.1; U; en)<br />
// userAgent in Opera 8.5 (identified as IE) returns: Mozilla/4.0 (compatible;<br />
MSIE 6.0; Windows NT 5.1) Opera 8.50 [en]<br />
// userAgent in Opera 8.5 (identified as Opera) returns: Opera/8.50 (Windows NT<br />
5.1; U) [en]</p>
<p>if (/Opera[\/\s](\d+\.\d+)/.test(navigator.userAgent)){ //test for Opera/x.x or<br />
Opera x.x (ignoring remaining decimal places);<br />
var oprversion=new Number(RegExp.$1) // capture x.x portion and store as a<br />
number<br />
if (oprversion&gt;=10)<br />
window.location = &#8220;redirect.html&#8221;<br />
else if (oprversion&gt;=9)<br />
window.location = &#8220;redirect.html&#8221;<br />
else if (oprversion&gt;=8)<br />
window.location = &#8220;redirect.html&#8221;<br />
else if (oprversion&gt;=7)<br />
window.location = &#8220;redirect.html&#8221;<br />
else<br />
document.write(&#8220;n/a&#8221;)<br />
}<br />
else<br />
document.write(&#8220;n/a&#8221;)<br />
&lt;/script&gt;</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/java-script-browser-detection/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>RFC 20 &#8211; ASCII Character Chart</title>
		<link>http://www.mikestratton.net/2011/06/rfc-20-ascii-character-chart/</link>
		<comments>http://www.mikestratton.net/2011/06/rfc-20-ascii-character-chart/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 06:13:05 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[ASCII]]></category>
		<category><![CDATA[mountain state university]]></category>
		<category><![CDATA[rfc]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3940</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/rfc-20-ascii-character-chart/">RFC 20 &#8211; ASCII Character Chart</a></p><p>ASCII Code Chart<br />
<br />
ASCII format for Network Interchange<br />
Network Working Group Vint Cerf<br />
Request for Comments: 20 UCLA<br />
October 16, 1969<br />
ASCII format for Network Interchange<br />
For concreteness, we suggest the use of standard 7-bit ASCII embedded in an 8 bit byte whose high order bit is always 0. This leads to the standard code given on the attached page, copies from USAS X3, 4-1968. This code will be used over HOST-HOST primary connections. Break characters will be defined ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/rfc-20-ascii-character-chart/">RFC 20 &#8211; ASCII Character Chart</a></p><h2>ASCII Code Chart</h2>
<p><a href="http://tools.ietf.org/pdf/rfc20.pdf" target="_blank"><br />
ASCII format for Network Interchange</a></p>
<p>Network Working Group Vint Cerf<br />
Request for Comments: 20 UCLA<br />
October 16, 1969<br />
ASCII format for Network Interchange<br />
For concreteness, we suggest the use of standard 7-bit ASCII embedded in an 8 bit byte whose high order bit is always 0. This leads to the standard code given on the attached page, copies from USAS X3, 4-1968. This code will be used over HOST-HOST primary connections. Break characters will be defined by the receiving remote <a href="http://www.webhostingsearch.com" target="_blank">host</a>, e.g. SRI uses &#8220;.&#8221; (ASCII X’2E’ or 2/14) as the end-of-line character, where as UCLA uses X’OD’ or 0/13 (carriage return).<br />
USA Standard Code for Information Interchange<br />
1. Scope<br />
This coded character set is to be used for the general interchange of<br />
information among information processing systems, communication<br />
systems, and associated equipment.</p>
<p><img src="http://www.mikestratton.net/images/rfc_20_ascii_code_chart.png" alt="ASCII Code Chart" width="500" height="198" /></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/rfc-20-ascii-character-chart/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Security Policy Overview</title>
		<link>http://www.mikestratton.net/2011/06/security-policy-overview/</link>
		<comments>http://www.mikestratton.net/2011/06/security-policy-overview/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 06:11:45 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[cyber security]]></category>
		<category><![CDATA[information security]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3938</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/security-policy-overview/">Security Policy Overview</a></p><p>Simplistic Overview of a Security Policy<br />
A security policy is used to build an effective security infrastructure.<br />
Without an effective security policy, a firewall implementation is ineffective.<br />
An infrastructure with an effective security policy:<br />
&#8211;&#62; Secures resources, including information and systems<br />
&#8211;&#62; Improves employee performance<br />
&#8211;&#62; Determines what traffic your firewall will allow or deny.<br />
A security policy is the first line of defense in establishing a secure<br />
systems infrastructure. It must be effective in providing guidelines for the<br />
entire ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/security-policy-overview/">Security Policy Overview</a></p><h2>Simplistic Overview of a Security Policy</h2>
<p>A security policy is used to build an effective security infrastructure.<br />
Without an effective security policy, a firewall implementation is ineffective.</p>
<p>An infrastructure with an effective security policy:<br />
&#8211;&gt; Secures resources, including information and systems<br />
&#8211;&gt; Improves employee performance<br />
&#8211;&gt; Determines what traffic your firewall will allow or deny.</p>
<p>A security policy is the first line of defense in establishing a secure<br />
systems infrastructure. It must be effective in providing guidelines for the<br />
entire organziation.</p>
<p><strong>To reduce risk, the following steps should be followed:</strong><br />
&#8211;&gt; Classify your systems (If a system was breached, what effect would this have<br />
on the network? Example: A exposed server poses a much greater risk then an<br />
exposed User Desktop)<br />
&#8211;&gt; Determine security policies for each system.<br />
&#8211;&gt; Assign risk factors.<br />
&#8211;&gt; Define acceptable and unacceptable activities.<br />
&#8211;&gt; Educate employees about security.<br />
&#8211;&gt; Determine administrator of policy.</p>
<p>After a determination is made as to the risks and priorties of all resources,<br />
the security policy should be documented on a resource-by-resource basis, with<br />
the most critical resources requiring the most detailed and stringent<br />
protections.</p>
<h3>Systems Classifications</h3>
<p><strong>Level I:<br />
</strong>Systems that are centralized to the business&#39; operation. Ex: Email<br />
server, web server, employee database, user account database.</p>
<p><strong>Level II:<br />
</strong>Systems that are needed but not critical to daily operation. A system<br />
that could be offline for a day or two without crippling the company is an<br />
example of Level II Classification.</p>
<p><strong>Level III:<br />
</strong>A local desktop is an example of this, as long as this computer does<br />
not affect Level I or Level II systems.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/security-policy-overview/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Association for Computing Machinery</title>
		<link>http://www.mikestratton.net/2011/06/association-for-computing-machinery/</link>
		<comments>http://www.mikestratton.net/2011/06/association-for-computing-machinery/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 06:08:24 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[acm]]></category>
		<category><![CDATA[association for computing machinery]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3934</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/association-for-computing-machinery/">Association for Computing Machinery</a></p><p>Association for Computing Machinery &#8211; Student Membership <br />
 <br />
What is the Association for Computing Machinery(ACM)?<br />
ACM, the world’s largest educational and scientific computing society, delivers resources that advance computing as a science and a profession. ACM provides the computing field&#8217;s premier Digital Library and serves its members and the computing profession with leading-edge publications, conferences, and career resources.<br />
To learn more about the ACM go to: </p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/association-for-computing-machinery/">Association for Computing Machinery</a></p><h2>Association for Computing Machinery &#8211; Student Membership </p>
<p> </h2>
<h3>What is the Association for Computing Machinery(ACM)?</h3>
<p>ACM, the world’s largest educational and scientific computing society, delivers resources that advance computing as a science and a profession. ACM provides the computing field&#8217;s premier Digital Library and serves its members and the computing profession with leading-edge publications, conferences, and career resources.</p>
<p>To learn more about the ACM go to: <a href="http://www.acm.org target="_blank">http://www.acm.org</a></p>
<p>To view Michael Stratton&#8217;s Association for Computing Machinery Virtual Business Card click here: <a href="http://member.acm.org/~mstratton" target="_blank">http://member.acm.org/~mstratton</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/association-for-computing-machinery/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MIT &#8211;  Introduction to Copyright Law</title>
		<link>http://www.mikestratton.net/2011/06/mit-introduction-to-copyright-law/</link>
		<comments>http://www.mikestratton.net/2011/06/mit-introduction-to-copyright-law/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 06:07:19 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3932</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/mit-introduction-to-copyright-law/">MIT &#8211;  Introduction to Copyright Law</a></p><p>MIT 6.912 Introduction to Copyright Law<br />
Topics Covered: Introduction; Basics of Legal Research; Legal Citations<br />
Instructor: Keith Winstein<br />
Instructor: Keith Winstein<br />
View the complete course: <br />
http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-912-introduction-to-copyright-law-january-iap-2006/index.htm<br />
<br />
Introduction to Copyright Law: Class Notes<br />
<br />
US Constitution: Article 1 Section 8 (Intellectual Property Clause) <br />
The Congress shall have Power&#8230;. <br />
To promote the Progress of Science and useful Arts, by securing for limited Times to Authors and Inventors the exclusive Right to their respective Writings and Discoveries;<br />
The Sunny ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/mit-introduction-to-copyright-law/">MIT &#8211;  Introduction to Copyright Law</a></p><h2>MIT 6.912 Introduction to Copyright Law</h2>
<p>Topics Covered: Introduction; Basics of Legal Research; Legal Citations</p>
<p>Instructor: Keith Winstein</p>
<p>Instructor: Keith Winstein</p>
<p>View the complete course: </p>
<p>http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-912-introduction-to-copyright-law-january-iap-2006/index.htm</p>
<p><object width="480" height="385"><param name="movie" value="http://www.youtube-nocookie.com/v/zqtx0gA5K2s?fs=1&amp;hl=en_US&amp;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/zqtx0gA5K2s?fs=1&amp;hl=en_US&amp;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="480" height="385"></embed></object></p>
<h3>Introduction to Copyright Law: Class Notes</h3>
<p></p>
<p>US Constitution: Article 1 Section 8 (Intellectual Property Clause) <br />
The Congress shall have Power&#8230;. <br />
To promote the Progress of Science and useful Arts, by securing for limited Times to Authors and Inventors the exclusive Right to their respective Writings and Discoveries;</p>
<p><strong>The Sunny Bono Copyright Term Extension Act </strong><br />
In 1998, congress retroactively extended the lenght of time an individuals work can be copyrighted. The time was extended to 70 years after the date of the persons death.
</p>
<p>Intellectual Property Is:<br />
Use<br />
Deny the Use <br />
Right to Benefit</p>
<p>Property is a set of rights that the government will protect.</p>
<p>Eminate Domain: <br />
The government can take your property(land) for public use, but must compensate you.</p>
<p><p>A copyright, obviously is not physical.</p>
<p>Rivarly:<br />
Mutual benefits to persons that may wish to use(purchase) my property. </p>
<p>Exclusion: Write to deny the use of your property from certain people.</p>
<p>Private Goods: <br />
You are the only one that benefits.<br />
Includes both rivarly and exclusion. (You cannot sale one person only 1 yet offer someone else 100. If someone wishes to just take your property you can exclude them.)</p>
<p>Public Goods<br />
Exclusion but not rivalry. (Cable TV for example. Cable TV can exclude you from recieving HBO, but cannot exclude the number of people that use it). </p>
<p>Common Access Resource <br />
Rivarly but not exclusion. (River, highway). </p>
<p>Pure Public Good: <br / ><br />
Not rivarly nor exclusion.<br />
(Free SoftwareClean air, National defense).
</p>
<p>Patent &#8211; For an invention. Only last for 20 years.</p>
<p>Trade Secret &#8211; Proprietory secret for a specific product.</p>
<p>Trademark &#8211; Used to avoid confusion in a consumer. A brand, like Disney, or Coca-Cola, or Rated PG-13(owned by the Motion Picture Association).</p>
<p>Right of Publicity: <br />
Protection of an individuals identity in commercial publications.(A public picture can be taken of an individual for a web page, but you would not be able to sale the photo of the person for use on sights like Nikon.(/p)</p>
<p>Orphan Drug Protection<br />
A drug companies right to have exclusve rights to sale a drug for a period of 7 years.</p>
<p>Designation of Origin <br />
America does not use this, but in Europe only a town by the name of Champane could sale a product named Champane.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/mit-introduction-to-copyright-law/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Security Risk Management Guide</title>
		<link>http://www.mikestratton.net/2011/06/security-risk-management-guide/</link>
		<comments>http://www.mikestratton.net/2011/06/security-risk-management-guide/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 06:04:54 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[cyber security]]></category>
		<category><![CDATA[information security]]></category>
		<category><![CDATA[microsoft]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3928</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/security-risk-management-guide/">Security Risk Management Guide</a></p><p>The Security Risk Management Guide<br />
Download The Security Risk Management Guide here<br />
<br />
The Security Risk Management Guide Overview<br />
Chapter 1: Introduction to the Security Risk Management Guide<br />
Chapter 1 introduces the Security Risk Management Guide (SRMG) and provides a brief overview of subsequent chapters. It also provides information about the following:<br />
<br />
Keys to succeeding with a security risk management program <br />
Key terms and definitions <br />
Style conventions in the papers <br />
References for further information <br />
<br ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/security-risk-management-guide/">Security Risk Management Guide</a></p><h2><strong>The Security Risk Management Guide</strong></h2>
<p><a href="http://technet.microsoft.com/en-us/library/cc163143.aspx" target="_blank">Download The Security Risk Management Guide here</a></p>
<p></p>
<h3>The Security Risk Management Guide Overview</h3>
<p><strong>Chapter 1: Introduction to the Security Risk Management Guide</strong></p>
<p>Chapter 1 introduces the Security Risk Management Guide (SRMG) and provides a brief overview of subsequent chapters. It also provides information about the following:</p>
<ul>
<li>Keys to succeeding with a security risk management program </li>
<li>Key terms and definitions </li>
<li>Style conventions in the papers </li>
<li>References for further information </li>
</ul>
<p><strong>Chapter 2: Survey of Security Risk Management Practices</strong></p>
<p>Chapter 2 lays a foundation and provides context for the SRMG by reviewing other approaches to security risk management and related considerations, including how to determine your organization&#8217;s risk management maturity level.</p>
<p><strong>Chapter 3: Security Risk Management Overview</strong></p>
<p>Chapter 3 provides a more detailed look at the four phases of the SRMG process while introducing some of its important concepts and keys to success. The chapter also offers advice on preparing for the program by planning effectively and placing strong emphasis on building a solid Security Risk Management Team that has well defined roles and responsibilities.</p>
<p><strong>Chapter 4: Assessing Risk</strong></p>
<p>Chapter 4 addresses the first phase, Assessing Risk, in detail. Steps in this phase include planning, data gathering, and risk prioritization. Risk prioritization itself is comprised of summary and detailed levels, balancing qualitative and quantitative approaches in order to provide reliable risk information within reasonable trade-offs of time and effort. The output from the Assessing Risk phase is a list of significant risks with detailed analysis that the team can use to make business decisions during the next phase of the process.</p>
<p><strong>Chapter 5: Conducting Decision Support</strong></p>
<p>Chapter 5 addresses the second phase, Conducting Decision Support. During this phase, teams determine how to address the key risks in the most effective and cost efficient manners. Teams identify controls; estimate costs; assess the degree of risk reduction; and then determine which controls to implement. The output of the Conducting Decision Support phase is a clear and actionable plan to control or accept each of the top risks identified in the Assessing Risk phase.</p>
<p><strong>Chapter 6: Implementing Controls and Measuring Program Effectiveness</strong></p>
<p>Chapter 6 addresses the final two phases of the SRMG: Implementing Controls and Measuring Program Effectiveness. During the Implementing Controls phase, the Mitigation Owners create and execute plans based on the list of control solutions that emerged during the decision support process.</p>
<p>When the first three phases of the security risk management process are complete, organizations should estimate their progress with regard to security risk management as a whole. The final phase, Measuring Program Effectiveness, introduces the concept of a &#8220;Security Risk Scorecard&#8221; to assist in this effort.</p>
<p><strong>Appendix A: Ad-Hoc Risk Assessments</strong></p>
<p><strong>Appendix B: Common Information System Assets</strong></p>
<p><strong>Appendix C: Common Threats</strong></p>
<p><strong>Appendix D: Vulnerabilities</strong></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/security-risk-management-guide/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Microsoft Virtual Earth API</title>
		<link>http://www.mikestratton.net/2011/06/microsoft-virtual-earth-api/</link>
		<comments>http://www.mikestratton.net/2011/06/microsoft-virtual-earth-api/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 06:01:06 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[api]]></category>
		<category><![CDATA[application]]></category>
		<category><![CDATA[microsoft]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3924</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/microsoft-virtual-earth-api/">Microsoft Virtual Earth API</a></p><p>Microsoft Virtual Earth API<br />
<br />
Your browser does not support inline frames or is currently configured not to display inline frames.<br />
<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/microsoft-virtual-earth-api/">Microsoft Virtual Earth API</a></p><h2>Microsoft Virtual Earth API</h2>
<p><iframe name="Iframe1" src="http://www.mikestratton.net/microsoft-api/microsoft-virtual-earth-api.html" style="width:430px; height:440px; "><br />
Your browser does not support inline frames or is currently configured not to display inline frames.<br />
</iframe></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/microsoft-virtual-earth-api/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Physics I: Classical Mechanics #1</title>
		<link>http://www.mikestratton.net/2011/06/physics-i-classical-mechanics-1/</link>
		<comments>http://www.mikestratton.net/2011/06/physics-i-classical-mechanics-1/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 06:00:02 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>
		<category><![CDATA[physics]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3922</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/physics-i-classical-mechanics-1/">Physics I: Classical Mechanics #1</a></p><p>8.01 Physics I: Classical Mechanics<br />
Lecture #1: This lecture is about units, dimensions, measurements and associated uncertainties, dimensional analysis, and scaling arguments.<br />
<br />
Instructor/speaker:<br />
 Prof. Walter Lewin<br />
 <br />
View the complete course at: <br />
http://ocw.mit.edu/courses/physics/8-01-physics-i-classical-mechanics-fall-1999/<br />
License: Creative Commons BY-NC-SA<br />
<br />
More information at http://ocw.mit.edu/terms<br />
<br />
More courses at http://ocw.mit.edu<br />
&#160;<br />
&#160;<br />
Physics 1: Classical Mechanics Notes<br />
Length = meters<br />
Time = sec<br />
Mass = kg<br />
Profressor references a video entitled &#34;The Powers of Ten&#34; by Charles and Ray<br ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/physics-i-classical-mechanics-1/">Physics I: Classical Mechanics #1</a></p><h2>8.01 Physics I: Classical Mechanics</h2>
<h3>Lecture #1: This lecture is about units, dimensions, measurements and associated uncertainties, dimensional analysis, and scaling arguments.<br />
</h3>
<p>Instructor/speaker:<br />
 Prof. Walter Lewin
 </p>
<p>View the complete course at: </p>
<p>http://ocw.mit.edu/courses/physics/8-01-physics-i-classical-mechanics-fall-1999/</p>
<p>License: Creative Commons BY-NC-SA<br />
<br />
More information at <a href="http://ocw.mit.edu/terms">http://ocw.mit.edu/terms</a><br />
<br />
More courses at <a href="http://ocw.mit.edu">http://ocw.mit.edu</a><br />
&nbsp;</p>
<p><object width="320" height="255"><param name="movie" value="http://www.youtube-nocookie.com/v/PmJV8CHIqFc?fs=1&amp;hl=en_US&amp;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/PmJV8CHIqFc?fs=1&amp;hl=en_US&amp;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="320" height="255"></embed></object>&nbsp;</p>
<h4>Physics 1: Classical Mechanics Notes</h4>
<p>Length = meters<br />
Time = sec<br />
Mass = kg</p>
<p>Profressor references a video entitled &quot;The Powers of Ten&quot; by Charles and Ray<br />
Eames and Pyramid Media. After some searching I found the video, it displays 40<br />
powers of 10 with the 1st power 1 meter from a man having a picnic in a park. At<br />
1 x 10<sup>24</sup> it shows an image at the far reaches of space, the farthest mapped universe. The video then takes you back to the 1st power, and than goes<br />
into negative powers until you reach 1 x10<sup>-15</sup> in which you are at a<br />
single proton.</p>
<p>Length Time and Mass are the 3 fundamental qualities in physics.</p>
<p>L T M<br />All other quantities in physicscan be derived from these fundamental<br />
quantities.
</p>
<p>Examples:<br />
The dimension of speed:<br />
[ speed ] = [ L ] / [ T ] (the dimension of length divided by the dimension of time)<br />
Volume:<br />
[ volume ] = [ L ] <sup>3</sup> (length to the power three) <br />
Density:<br />
[ density ] = [ M ] / [ L ] <sup>3</sup> (length to the power three.)<br />
Acceleration:<br />
[ accel] = [ L ] / [ T ] <sup>2</sup> (length divided by time squared.)</p>
<p>All other quantities can be derived from these 3 fundamentals. (Length Time<br />
Mass)</p>
<p>The professor states that: &#8220;Any measurement that you make without the knowledge<br />
of its uncertainty is completely meaningless&#8221;.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/physics-i-classical-mechanics-1/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>OOA Analysis &amp; Design</title>
		<link>http://www.mikestratton.net/2011/06/ooa-analysis-design/</link>
		<comments>http://www.mikestratton.net/2011/06/ooa-analysis-design/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:59:08 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[Object Oriented Analysis]]></category>
		<category><![CDATA[software development]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3920</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/ooa-analysis-design/">OOA Analysis &#038; Design</a></p><p>Analyzing a Problem and Designing a Solution<br />
Topics covered: <br />
Analyze a problem using object-oriented analysis (OOA).<br />
Design classes for creating objects for an application.<br />
Case Study: Requirements of Fabrikam, Inc<br />
The requirements of the new order entry system at Fabrikam, Inc, are as<br />
follows:<br />
<br />
Online order entry for customers.<br />
Online availability of items with prices according to current catalog.<br />
Verification of the availability of items for online orders.<br />
Verification of the payment.<br />
Submission of the order to the ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/ooa-analysis-design/">OOA Analysis &#038; Design</a></p><h2>Analyzing a Problem and Designing a Solution</h2>
<p>Topics covered: <br />
Analyze a problem using object-oriented analysis (OOA).<br />
Design classes for creating objects for an application.</p>
<h3>Case Study: Requirements of Fabrikam, Inc</h3>
<p>The requirements of the new order entry system at Fabrikam, Inc, are as<br />
follows:</p>
<ul class="auto-style1">
<li>Online order entry for customers.</li>
<li>Online availability of items with prices according to current catalog.</li>
<li>Verification of the availability of items for online orders.</li>
<li>Verification of the payment.</li>
<li>Submission of the order to the warehouse.</li>
<li>Confirmation of the order to the customers by providing an order ID and<br />
	telephone extension number of the CSR for orders placed on the phone.
	</li>
</ul>
<h3>Define Problem Domain</h3>
<ol>
<li>Gather customer requirements.</li>
<li>Determine the scope of the problem and write a statement of scope that<br />
	briefly states what you want to achieve.</li>
<li>Identify the objects that will interact to solve the problem.
	</li>
</ol>
<h3>Identifying Objects</h3>
<p>The properties of an object are as follows:<br />
<strong>Conceptual or Physical &#8211; </strong><br />
A customer account cannot be touched; therefore it is conceptual. An ATM can be<br />
touched; therefore it is physical.<br />
<strong>Attributes -</strong><br />
Size, name, shape, boolean, data type<br />
<strong>Operations -</strong><br />
Activities that an object can perform, for example, setting a value, performing<br />
a calculation, displaying a UI.</p>
<p><img alt="Cow" height="272" src="http://www.mikestratton.net/images/cow.png" width="344" />
</p>
<h3>Additional Criteria for Recognizing an Object</h3>
<p><strong>Relevance to problem domain<br />
</strong>Does the object exist within the boundaries of the problem domain?<br />
Is the object required for the solution to be complete?<br />
Is the object required as part of an interaction between a user and the<br />
solution?<br />
Some items in a problem domain can be attributes of objects or objects<br />
themselves. For example, temperature can be an attribute of an object in a<br />
medical system, or it can be an object in a scientific system that tracks<br />
weather patterns.</p>
<p><strong>Independent existence</strong><br />
Does the object need to exist independently rather than being an attribute of<br />
another object?
</p>
<h3>Case Study: Identifying Objects for Fabrikam, Inc.</h3>
<p>Objects in the problem domain for Fabrkikam:<br />
Order<br />
Shirt<br />
Customer
</p>
<h3>Case Study: Identifying Object Attributes and Operations</h3>
<p>Examples of Attributes:<br />
Data: Order ID, customer ID<br />
Another Object: Customer having an order would be defined as an attribute of the<br />
customer object.
</p>
<h3>Case Study: Attribute References to Other Objects</h3>
<p>An attribute can be a reference to another object, but the association may or<br />
may not be necessary to solve the problem.<br />
* You should use attribute and operation names that clearly describe the<br />
attribute or operation.
</p>
<h3>Case Study: Attributes and Operations for Fabrikam, Inc</h3>
<p>There will be different attributes and operations for the following three<br />
objects:</p>
<p><strong>Order Object:</strong><br />
Attributes: OrderID, date, *shirt(s), totalPrice, *Form of Payment, *CSR, status<br />
Operations: calculate order id, calculate total price, add shirt to order,<br />
remove shirt from order, submit the order</p>
<p><strong>Shirt Object:</strong><br />
Attributes: shirtID, price, description, size, color code<br />
Operations: calculate shirt id, display shirt information</p>
<p><strong>Customer Object:</strong><br />
Attributes: customerID, name, address, phone, email address, *Order,<br />
Operations: assign a customer ID
</p>
<h3>Case Study: Solution</h3>
<p>Tables depicting a partial list of objects including most of there attributes<br />
and operations, are displayed on the screen. Additional objects can include a<br />
warehouse and a supplier.<br />
* Although implied, not all attributes in the solution are specifically defined<br />
in the case study. For example, the <strong>Payment Object</strong> has an<br />
expiration date attribute used for a credit card expiration date.
</p>
<h2>Designing Classes and Creating Instances</h2>
<p>A class or blueprint is defined for each object in a system after the objects<br />
have been identified. The feature of an object created from a class are:<br />
It has a specific state or value for every attribute in the class<br />
It has the same attributes and operations as other objects created from the same<br />
class.</p>
<p>In terms of Object Oriented Design, let&#39;s use the following example:<br />
Window manufactures great a blueprint for every style of window they make. These<br />
blueprints define a range of {colors: blue, green, black} and {styles: small,<br />
medium, large} that can be selected when purchasing a window. The blueprints are<br />
the basis for any number of windows, with any number of combinations of color<br />
and style. In terms of object oriented design, each window is an object and the<br />
generic blueprint (large/blue, small/black) is a class. Each object created<br />
using the class is called an instance of a class. More specifically, each object<br />
created from a class can have a specific state or value for each of the<br />
attributes it possesses, but will have the same attributes and operations.<br />
Class: The American Heritage Dictionary defines class to be &quot;a group whose<br />
members have certain attributes in common.&quot;
</p>
<h3>Classes and Objects</h3>
<p>An example of classification in terms of OOAD is:<br />
Whale is a class.<br />
Blue whale is an object instance of the whale class.
</p>
<h3>Fabrikam Case Study: Classes and Objects</h3>
<p>Class: A class defines an object. For example, the shirt class defines all<br />
shirts to have a shirt ID, size, color code, description, and price.</p>
<p>Object: An object is a unique instance of a class, for example, a large blue<br />
polo shirt costing $19.99 with shirt ID 2425-A.</p>
<p>Every class has a class that it originated from. In OOAD terminology, this<br />
parent class is referred to as superclass. For example, a whale might have<br />
originated from the superclass mammals.
</p>
<h3>Variables and Methods</h3>
<p><strong>Variable:</strong> A variable is a Java programming language<br />
mechanism for holding data or representing an attribute.<br />
<strong>Method:</strong> A method is a Java programming language mechanism for<br />
performing an operation.<br />
* Variables also hold other data besides attribute data, such as values used<br />
solely inside a method.
</p>
<h3>Modeling Classes</h3>
<p>The first phase of the design stage consists of visually organizing or<br />
modeling a program and its classes. To model a program and its classes, use the<br />
following rules:<br />
Each class in a design must be enclosed in a box, with the class name on top.<br />
The class name must be followed by a list of attribute variables.<br />
Attribute variables must be followed by method names.<br />
Example:<br />
ClassName<br />
attributeVariableName [range of value]<br />
attributeVariableName [range of value]<br />
attributeVariableName [range of value]<br />
&#8230;<br />
methodName()<br />
methodName()<br />
methodName()<br />
&#8230;</p>
<p>OR:<br />
ShirtClass<br />
shirtID<br />
price<br />
description<br />
size<br />
colorCode R=Red, B=Blue, G=Green<br />
&#8230;<br />
calculateShirtID()<br />
displayShirtInformation()<br />
&#8230;</p>
<p>* Modeling classes is similar to modeling database structures. In fact, your<br />
objects can be stored in a database using the Java Database Connectivity (JDBC)<br />
API. The JDBC API allows you to read and write records using structured query<br />
language (SQL) statements within your Java technology programs.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/ooa-analysis-design/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Aristotle&#8217;s Definition of Beauty</title>
		<link>http://www.mikestratton.net/2011/06/aristotles-definition-of-beauty/</link>
		<comments>http://www.mikestratton.net/2011/06/aristotles-definition-of-beauty/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:57:07 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[aristotle]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3918</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/aristotles-definition-of-beauty/">Aristotle&#8217;s Definition of Beauty</a></p><p>Aristotle Definition of Beauty<br />
Mountain State University &#8211; Art Discussion Assignment<br />
ART101 &#8211; Art Appreciatation <br />
Instructor Amy Landrum &#8211; Mountain State University<br />
What are your thoughts on the brief excerpt on Beauty by Aristotle? Do you agree or disagree, why? Make reference to art found anywhere in your text to prove your point. <br />
BEAUTY <br />
From Metaphysics<br />
(1078a 31-1078b 6)<br />
Book XIII<br />
&#8220;Now since the good and the beautiful are different (for the former always implies conduct as ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/aristotles-definition-of-beauty/">Aristotle&#8217;s Definition of Beauty</a></p><h2>Aristotle Definition of Beauty</h2>
<h3>Mountain State University &#8211; Art Discussion Assignment</h3>
<p>ART101 &#8211; Art Appreciatation <br />
Instructor Amy Landrum &#8211; Mountain State University</p>
<p><em>What are your thoughts on the brief excerpt on Beauty by Aristotle? Do you agree or disagree, why? Make reference to art found anywhere in your text to prove your point.</em> </p>
<p>BEAUTY <br />
From Metaphysics<br />
(1078a 31-1078b 6)<br />
Book XIII</p>
<p>&#8220;Now since the good and the beautiful are different (for the former always implies conduct as its subject, while the beautiful is found also in motionless things), those who assert that the mathematical sciences say nothing of the beautiful or the good are in error. For these sciences say and prove a great deal about them; if they do not expressly mention them, but prove attributes which are their results or their definitions, it is not true to say that they tell us nothing about them. The chief forms of beauty are order and symmetry and definiteness, which the mathematical sciences demonstrate in a special degree. And since these (e.g. order and definiteness) are obviously causes of many things, evidently these sciences must treat this sort of causative principle also (i.e. the beautiful) as in some sense a cause. But we shall speak more plainly elsewhere about these matters.&#8221;*</p>
<p>* [See Poetics, Chap. 7, for further remarks on beauty.]</p>
<p>Excerpted from authors Hofstadter and Kuhns &#8211; “Philosophies of Art and Beauty: Selected Readings in Aesthetics from Plato to Heidegger,” University of Chicago Press, 1976, page 96, ISBN: 0-226-34812-1</p>
<h4>Michael Stratton Discussion of Artistole&#8217;s Definition of Beauty</h4>
<p>Artistole defined beauty as &quot;a concept of beauty occurs when all parts work together in harmony so that no one part draws unjust attention to itself&quot;. When we think in beauty from this definition we can easily see that beauty does not just exist from what we believe is pleasing to the eyes. If beauty occurs when all parts work together then beauty exists in much more then just that in which our eyes see.</p>
<p>Is it not beautiful when one puts their key in the ignition of their car and the engine starts and they drive away? <br />Would it not be ugly if the engine did not work and we were stranded?</p>
<p>Is it not beautiful how our legs are able to take us from point a to point b in response to our need to move? <br />Would it not be ugly if we broke our leg after tripping over something?</p>
<p>Is it not beautiful when a child learns how to count, 1&#8230;2&#8230;3&#8230;? <br />Would it not be ugly if mankind never defined mathematics and therefore we were never able to advance technology beyond the basic use of a tool?</p>
<p>Is not it beautiful that an echocardiogram can tell the physical condition of ones heart? <br />
Is it not ugly when an individual dies instantly from unexpected heart failure?</p>
<p>Is it not beautiful that nature is able to balance itself so that only the strong survive and therefore a species evolves and survives. <br />Would it not be ugly had we never evolved?</p>
<p align="left">On page 116 of Living With Art, 9th ed., Getlein (2010) shows us how Isamu Noguchi is able to impossibly balance a sculpture of a Red Cube.</p>
<p align="left">Some might argue that this is not beautiful art. To those that offer this view, a response might be: &quot;would it not be uglier had it never been created? Does not the mere value of offering our view of its beauty therefore give it value into the structure of human values? Our view reflects our own morals, and from the standpoint of our own perspective our view is correct. The Red Cube sculpture by Isamu Noguchi allows our own values to work as they should and is the part of an equation that works without error, an equation that includes ones own self image&quot;.</p>
<p align="left">If beauty occurs when all parts work together the Red Cube shows the beauty of human values regardless if one finds it a valuable work of art and/or aesthetically pleasing.</p>
<p align="left"><img border="0" alt="" src="http://www.noguchi.org/sites/default/files/redcube1.jpg" /><br />
Image Source:<br /><a href="http://www.noguchi.org" target="_blank">Museum and education center devoted to the artist and his work &#8211; Isamu Noguchi </a></p>
<p>References </p>
<p>Getlein, M (2010). Living With Art, 9th ed., The McGraw-Hill Companies, New York, NY. ISBN: 978-0-07-337920-3</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/aristotles-definition-of-beauty/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Big O Notation</title>
		<link>http://www.mikestratton.net/2011/06/big-o-notation/</link>
		<comments>http://www.mikestratton.net/2011/06/big-o-notation/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:56:16 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[big o notation]]></category>
		<category><![CDATA[learn to progam]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3916</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/big-o-notation/">Big O Notation</a></p><p>What is &#8220;Big O&#8221; Notation?<br />
Big O notation: Indicates the worse-case run time for an algorithm&#8211;that is, how hard an algorithm may have to work to solve a problem.<br />
Big O example:<br />
Suppose an algorithm is designed to test whether the first element of an array is equal to the second. If the array has 10 elements, this algorithm requries one comparison. If the array has 15,000 elements, it still requires one comparison. In fact, the algorithm is completely independent ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/big-o-notation/">Big O Notation</a></p><h2>What is &#8220;Big O&#8221; Notation?</h2>
<p>Big O notation: Indicates the worse-case run time for an algorithm&#8211;that is, how hard an algorithm may have to work to solve a problem.</p>
<p><strong>Big O example:<br /></strong><br />
Suppose an algorithm is designed to test whether the first element of an array is equal to the second. If the array has 10 elements, this algorithm requries one comparison. If the array has 15,000 elements, it still requires one comparison. In fact, the algorithm is completely independent of the number of elements in the array. This algorithm is said to have a <strong>constant run time</strong>, which is representing in Big O notation as <strong>O(1)</strong>. An algorithm that is O(1) doesn not necessarily require only one comparison. O(1) just means that the number of comparisons is constant&#8211;it does not grow as the size of the array increases. An algorithm that tests whether the first element of an array is equal to any of the next three elements is still O(1) even though it requires three comparisons. <br />
Reference: <em>Deitel, P.(2009) Java how to program: Late objects version, 8th Edition. Uppper Saddle River: Prentice Hall.</em></p>
<h3>Big O Notation &#8211; Useful Links</h3>
<p><a href="http://www.nist.gov/itl/" target="_blank"><br />
NIST Information Technology Labratory</a> </p>
<p><a href="http://www.nist.gov/itl/ssd/" target="_blank"><br />
NIST Information Technology Labratory &#8211; Software and Systems Division</a> </p>
<p><a href="http://xw2k.nist.gov/dads/" target="_blank"><br />
NIST Dictionary of Algorithms and Data Structures</a> </p>
<p><a href="http://xw2k.nist.gov/dads//HTML/bigOnotation.html" target="_blank"><br />
National Institute of Standards and Technology &#8211; big-O Notation</a> </p>
<p><a href="http://xw2k.nist.gov/dads//HTML/littleOnotation.html" target="_blank"><br />
National Institute of Standards and Technology &#8211; little-O Notation</a> </p>
<p><a href="http://mathworld.wolfram.com/LandauSymbols.html" target="_blank"><br />
Wolfram Mathworld &#8211; Landau Symbols</a> </p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/big-o-notation/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial Intelligence &#8211; Our Need to Understand</title>
		<link>http://www.mikestratton.net/2011/06/artificial-intelligence-our-need-to-understand/</link>
		<comments>http://www.mikestratton.net/2011/06/artificial-intelligence-our-need-to-understand/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:55:25 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3914</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/artificial-intelligence-our-need-to-understand/">Artificial Intelligence &#8211; Our Need to Understand</a></p><p>Artificial Intelligence: Our Need to Understand<br />
Michael A. Stratton<br />
ENGL 101: English Composition<br />
Instructor C. Pengilly, Mountain State University<br />
March 27, 2011<br />
Artificial Intelligence: Our Need to Understand<br />
As an undergraduate majoring in computer science at Mountain State<br />
University, I understand that artificial intelligence has been depicted in many<br />
science fiction venues; although, artificial intelligence it is not just an<br />
element of science fiction. It is important to understand that artificial<br />
intelligence is a legitimate field of study within the ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/artificial-intelligence-our-need-to-understand/">Artificial Intelligence &#8211; Our Need to Understand</a></p><h2>Artificial Intelligence: Our Need to Understand</h2>
<p>Michael A. Stratton<br />
ENGL 101: English Composition<br />
Instructor C. Pengilly, Mountain State University<br />
March 27, 2011</p>
<h3>Artificial Intelligence: Our Need to Understand</h3>
<p>As an undergraduate majoring in computer science at Mountain State<br />
University, I understand that artificial intelligence has been depicted in many<br />
science fiction venues; although, artificial intelligence it is not just an<br />
element of science fiction. It is important to understand that artificial<br />
intelligence is a legitimate field of study within the field of computer<br />
science; for, the study of artificial intelligence can be as devastating as it<br />
is beneficial. As advances in artificial intelligence technology become more<br />
prudent, it is imperative that the general public understands both the potential<br />
for disaster and the potential for technological miracles. To ignore what<br />
artificial intelligence is and what it can do is a recipe for disaster; a<br />
disaster that may have lasting effects on the human race.</p>
<p>Before I began my undergraduate studies at Mountain State University, I spent<br />
a great deal of time learning computer science theory via free resources from<br />
universities such as Massachusetts Institute of Technology, Stanford University,<br />
Microsoft Corporation, and other online resources. In terms of computer science,<br />
artificial intelligence is not related to science fiction. In all actuality,<br />
artificial intelligence is a term used for an algorithm that is able to “think”<br />
for itself; for example, an application can adjust its algorithms to meet a<br />
pre-defined condition.</p>
<p>Research and development in the use and creation of artificial intelligent<br />
algorithms encompasses most areas of science and technology in some shape or<br />
form. For example, physicians use medical systems that can take symptoms as an<br />
input and respond with related diagnoses. Accredited universities also study<br />
artificial intelligence in the use of everything from robotic systems that can<br />
think for themselves to Nanobots that can cure human disease. The research and<br />
development of intelligent systems is uncovering technologies that previously we<br />
had only dreamed of.</p>
<p>For purposes of establishing how artificial intelligence may directly affect<br />
you, imagine an artificially intelligent algorithm diagnosing your medical<br />
condition. Berner (2007) commented on an existing problem within the legislature<br />
that encompasses intelligent medical systems “who is at fault if the end user<br />
makes a decision… legal issues have not really been tested or clariﬁed”. For<br />
society to ignore the potential for disaster such as a medical failure is simply<br />
absurd. If we can better understand the dangers that exist, we are better suited<br />
in demanding that decisions are made by the government and policy makers that<br />
will minimize these dangers, as well as plan for a worse-case-scenario in the<br />
event a disaster happens.</p>
<p>We need to understand that artificial intelligence is not just a fictional<br />
phrase as artificial intelligence can truly benefit our lives. Professor Toriumi<br />
(2010), of MIT, offered quite an astounding view of artificial intelligence when<br />
he quoted Ray Kurzwell’s (2005) concept of singularity: “by 2020, artificial<br />
intelligence will rival human intelligence and consciousness”. As far-fetched as<br />
this sounds, advances are being made as we speak that are nothing short of<br />
miracles. These benefits can turn instantly catastrophic if placed in the wrong<br />
hands. What, if anything, do we as the general public really know about these<br />
technological miracles? Who is monitoring these so called “Artificially<br />
Intelligent Advances” to insure they are not motivated by self-indulgence,<br />
righteousness, or religion? Although we do not necessarily need to understand<br />
the technical nature of these advances, we most certainly need to understand<br />
what is being done to reduce the risks involved.</p>
<p>Our current capabilities with intelligence systems are simply astounding. The<br />
“Polyworld” algorithm (Larry Yeager, 2008) was is an algorithm designed to mimic<br />
the evolution of a life form. Cooling systems such as a nuclear power plant are<br />
controlled by algorithms that that are designed to keep the core temperature<br />
within a specific range. The U.S. Department of Defense uses algorithms that are<br />
integrated with satellites to guide missile systems to an exact location. The<br />
core of our electric grid is also managed by a network of algorithms<br />
(mainframes). We are yet at the infancy of what technology is and can do.<br />
Intelligent systems will take us to places we have never been.</p>
<p>The design and development of an artificially intelligent algorithm will<br />
match the requirements of a specific project as defined by its creator(s).<br />
Theoretically, a human can easily input a few lines of code replacing a<br />
directive, such as: “heat nuclear core” rather than: “cool nuclear core”. The<br />
advances of artificial intelligence combined with an individual or a group of<br />
individuals who are motivated by self-interest is a recipe for catastrophic<br />
disaster of biblical proportions.</p>
<p>Artificial intelligence – the human race needs to understand. We need to<br />
educate ourselves in the risks involved, and what is being done to minimize<br />
these risks. We cannot ignore the possibility of a disaster, as it will<br />
inevitably happen. If we are diligent in our efforts that insure there are laws<br />
and fail-safe practices, the catastrophic damage may be greatly reduced.</p>
<h3>References:</h3>
<p>Berner, E. (2007). Clinical Decision Support Systems, Theory and Practice 2nd<br />
ed., Springer Science + Business Media, LLC, New York, NY (p. 30)</p>
<p>Toriumi (2010). 3.003 Principles of Engineering Practice, Case Study #4:<br />
Semiconductors and Learning Curves, MIT OpenCourseWare, Cambridge, MA. Retrieved<br />
from<br />
<a href="http://ocw.mit.edu/courses/materials-science-and-engineering/3-003-principles-of-engineering-practice-spring-2010/case-studies/MIT3_003S10_cs4_sw1.pdf"></p>
<p>http://ocw.mit.edu/courses/materials-science-and-engineering/3-003-principles-of-engineering-practice-spring-2010/case-studies/MIT3_003S10_cs4_sw1.pdf</a></p>
<p>Kurzwell, R. (2005). The Singularity Is Near: When Humans Transcend Biology,<br />
Penguin Group, Toronto, Ontario, Canda</p>
<p>Yeager, L. (2008). PolyWorld: Life in a New Context [Computer Software].<br />
Apple Computer, Inc, Cupertino, CA. Retrieved from<br />
<a href="http://www.beanblossom.in.us/larryy/PolyWorld.html"></p>
<p>http://www.beanblossom.in.us/larryy/PolyWorld.html</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/artificial-intelligence-our-need-to-understand/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>APA Publication Manual</title>
		<link>http://www.mikestratton.net/2011/06/apa-publication-manual/</link>
		<comments>http://www.mikestratton.net/2011/06/apa-publication-manual/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:54:25 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[apa publication manual]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3912</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/apa-publication-manual/">APA Publication Manual</a></p><p>Reference: Modified APA Style<br />
<br />
http://www.apastyle.org/manual/index.aspx <br />
<br />
Attribution:<br />
All information that is not your own thought needs to be cited within the posts.<br />
Textual references will follow typical APA Style. For example, a reference to an<br />
idea‟s source might be constructed in one of the following methods:<br />
Since 1998, a number of hospitals have adopted the democratic leadership style<br />
over the autocratic style employed in the past for quality circles (Swarbrick &#38;<br />
Pegg, 2004).<br />
Swarbrick and Pegg (2004) concluded ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/apa-publication-manual/">APA Publication Manual</a></p><h2>Reference: Modified APA Style</h2>
<p><a href="http://www.apastyle.org/manual/index.aspx" target="_blank"><br />
http://www.apastyle.org/manual/index.aspx</a> 
</p>
<p><strong>Attribution:</strong><br />
All information that is not your own thought needs to be cited within the posts.<br />
Textual references will follow typical APA Style. For example, a reference to an<br />
idea‟s source might be constructed in one of the following methods:</p>
<p>Since 1998, a number of hospitals have adopted the democratic leadership style<br />
over the autocratic style employed in the past for quality circles (Swarbrick &amp;<br />
Pegg, 2004).</p>
<p>Swarbrick and Pegg (2004) concluded that, since 1998, hospital quality circles<br />
have adopted a democratic leadership style replacing the once prevalent<br />
autocratic mode of control
</p>
<p><strong>Quotations:</strong><br />
Direct quotations must include page numbers as shown below.</p>
<p>Nicol (2006) observed that “a myriad of problems has arisen with Microsoft‟s<br />
aggressive nature in releasing products before they were adequately tested” (p.<br />
296).</p>
<p>Nicol observed that “a myriad of problems has arisen with Microsoft‟s aggressive<br />
nature in releasing products before they were adequately tested” (2006, p. 296).
</p>
<p><strong>Reference Listings:</strong><br />
Since there is a minimum level of control of the formatting within the<br />
discussion room, all reference listings will follow APA guidelines with some<br />
exceptions. References will be placed at the end of the post and will be single<br />
spaced and not contain any indentation. Double space between each entry as<br />
illustrated below:</p>
<p>Nicol, S. (2006). Pass go and give me $200 – Monopoly and antitrust in American<br />
information technology corporations. Montville, CT: The Gardner Group.</p>
<p>O‟Day, H.E. (n.d.) [Data file]. The geology of Mt. Desert Island. Tremont, ME:<br />
Down East Historical Consortium. Retrieved June 8, 2006 from http://www.acadia.org/mt_desert_island/geology.htm.</p>
<p>Swarbrick, D. &amp; Pegg, D. (2004). Groupthink in medical care: A case management<br />
approach, 2nd ed. London, ON: Fairport Press.</p>
<p>Zay, E. (2003, November). Copyright guidelines for educators. American Teacher<br />
29(6). pp. 45-56.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/apa-publication-manual/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Data Storage &amp; System Integration</title>
		<link>http://www.mikestratton.net/2011/06/data-storage-system-integration/</link>
		<comments>http://www.mikestratton.net/2011/06/data-storage-system-integration/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:53:36 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>
		<category><![CDATA[systems architecture]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3910</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/data-storage-system-integration/">Data Storage &#038; System Integration</a></p><p>Mountain State University Systems Architecture Assignment<br />
Data Storage Technology / System Integration &#038; Performance<br />
<br />
What is the difference between static and dynamic RAM? <br />
Static RAM is implemented entirely with transistors and Dynamic RAM uses transistors<br />
and capacitors. DRAM circuitry is less complex than SRAM circuitry. DRAM uses capacitors<br />
to store data dynamically. It is considered dynamic because capacitors quickly lose<br />
their charge and require thousands of refresh operations per second. In contrast,<br />
SRAM stores data with transistors only. ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/data-storage-system-integration/">Data Storage &#038; System Integration</a></p><h2>Mountain State University Systems Architecture Assignment</h2>
<h3>Data Storage Technology / System Integration &#038; Performance</p>
</h3>
<h4>What is the difference between static and dynamic RAM? </h4>
<p>Static RAM is implemented entirely with transistors and Dynamic RAM uses transistors<br />
and capacitors. DRAM circuitry is less complex than SRAM circuitry. DRAM uses capacitors<br />
to store data dynamically. It is considered dynamic because capacitors quickly lose<br />
their charge and require thousands of refresh operations per second. In contrast,<br />
SRAM stores data with transistors only. The transistors implement complex operations<br />
without the need of refresh cycles to hold its charge. SRAM is much faster and much<br />
more expensive than DRAM because of its complex architecture. DRAM has a higher<br />
density of memory cells in comparison to SRAM. The high number of refresh cycles<br />
make it so that DRAM less efficient and slower than SRAM. </p>
<p>
</p>
<h4>How is data stored and retrieved on a magnetic storage device?</h4>
<p>A magnetic storage device converts electrical signals into magnetic charges.<br />
A magnetic storage device consists of a magnetic storage medium, and a read/write<br />
head. The read/write head consists of an in/out electrical current that it converts<br />
into a magnetic field with both a positive and negative polarity. The magnetic storage<br />
medium stores charges from the read/write head as a result of the magnetic field<br />
coming in contact with the read/write head. Electrical switches at either end of<br />
the in/out electrical current detect the direction of current flow and sense either<br />
a zero or one bit value. The read operation of a magnetic storage device is the<br />
opposite (inverse) of the write operation. </p>
<p>
</p>
<h4>What is the difference between physical access and logical access?</h4>
<p>Physical access is the exact location of specific data. For example a specific<br />
sector on a hard drive platter may hold data for a needed program to run. The portion<br />
of the hard drive that holds what is known as the “Boot Sector” has a specific location<br />
on the hard drive. Logical access is a method by which the CPU and system bus interact<br />
with each peripheral device. The CPU interprets all peripheral components as if<br />
they were a storage device. Each hypothetical storage device is seen as holding<br />
one or more bytes in sequentially numbered addresses.
</p>
<p>Physical access can be considered the “Physical location” from which data or an electrical signal is held. Logical<br />
access can be considered the set of instructions and naming conventions the CPU<br />
uses to access the physical location of a peripheral or stored data. In Logical<br />
access everything, including all peripherals are considered physical locations,<br />
and named accordingly. </p>
<p>
</p>
<h4>What is a multicore processor? </h4>
<p>High performance CPU’s use multiple CPUs and cache memory on a single chip. What<br />
are its advantages compared to multi-CPU architecture? Multi-CPU architecture uses<br />
two or more single core CPUs on a single motherboard. Multiple CPUs share primary<br />
storage and a single system bus. When used within a single system, the speed at<br />
which instructions are implemented are much slower as a result of multiple CPUs<br />
sharing a single system bus and primary storage. Why have multicore processors only<br />
recently been available? Improvements in fabrication technology enable large caches<br />
on the same chip as the CPU. Continuing improvements in fabrication technology could<br />
enable even larger caches, but at the cost of performance. Recent advances in semiconductor<br />
fabrication has allowed the multicore architecture to become available. (As of 2005)<br />
As of 2010 Intel have both a Quad-Core and Six-Core Multicore processor on the market.<br />
As of the writing of our textbook, only dual-core were available. Further advancements<br />
in fabrication technology and CPU design architecture will continue to increase<br />
the processing power of CPU’s. </p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/data-storage-system-integration/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Moore&#8217;s Law &amp; Economic Disaster</title>
		<link>http://www.mikestratton.net/2011/06/moores-law-economic-disaster/</link>
		<comments>http://www.mikestratton.net/2011/06/moores-law-economic-disaster/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:52:34 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[mit opencourseware]]></category>
		<category><![CDATA[moores law]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3908</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/moores-law-economic-disaster/">Moore&#8217;s Law &#038; Economic Disaster</a></p><p>Will Moore&#8217;s Law Lead To Economic Disaster?<br />
Our economy is driven by Technology. Moore&#8217;s law states that every 18 months computing power will double. This is the result of improved manufacturing and improvements in technology.<br />
A computer that cost $1,500 dollars today has over 12 times the processing power of a $1,500 computer built 10 years ago.<br />
Moore&#8217;s law is the result of improved Silicon technology, and Silicon manufacturing technology will eventually reach it&#8217;s max ability to increase the number ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/moores-law-economic-disaster/">Moore&#8217;s Law &#038; Economic Disaster</a></p><h2>Will Moore&#8217;s Law Lead To Economic Disaster?</h2>
<p>Our economy is driven by Technology. Moore&#8217;s law states that every 18 months computing power will double. This is the result of improved manufacturing and improvements in technology.</p>
<p>A computer that cost $1,500 dollars today has over 12 times the processing power of a $1,500 computer built 10 years ago.<br />
Moore&#8217;s law is the result of improved Silicon technology, and Silicon manufacturing technology will eventually reach it&#8217;s max ability to increase the number of transistors on one chip. It is rumored that silicon technology may reach it&#8217;s end as early as 2020. This may result in world-wide economic crisis, as a computer that costs $1,500 in 2020 will increase its cost with inflation yet will not increase in computing power. </p>
<p>As the number of hardware, software, and data continue to increase, we will need to continue to increase computing power. Not to do as such could result in economic disaster. Computing power could be increased by increasing the number of processors and hardware, which would result in a huge increase in the costs associated with computers.</p>
<p>The answer to this huge economic dilemma just might be &#8220;cloud computing&#8221;. Cloud computing allows an application to be &#8220;shared within a cloud of multiple computers or farms of computers&#8221;. Rather than having to improve the processing power of your desktop computer, you need only improve the connection speed at which you connect to the cloud.</p>
<p>The future may hold the use of practically no hardware, you would only need a keyboard, mouse, and monitor with a fast connection to the &#8220;cloud&#8221;.</p>
<p>Simply stated, the core of resolving this problem may also lie in our government improving the nations &#8220;Internet backbone&#8221; so that the our connections are based on fiber optics as opposed to cable which would result in efficient use of a &#8220;terminal node network&#8221; for the internet. Connection speed would eventually need to be equivelant to the same speed as if a terminal was connecting to its own processor/memory.</p>
<h2>Will Moore&#8217;s Law Lead to Economic Delusions of Cloud Computing Granduer?</h2>
<p>Futurists who believed that Moore&#8217;s Law would lead to economic disaster derived there belief from a basic physcis fact. The fact is that the number of transistors that could be placed onto a semiconductor is limited, and that eventually we would reach a point when a semiconductor could not be scalled further. Futurists failed to reconize some simple physics basics when reaching this analogy. Moore&#8217;s law is based upon scalling a semiconductor horizontally.</p>
<p>The IT industry scrambles. What should we do to overcomve the future of computing? Super Computer&#8217;s built in the cloud? Moore&#8217;s Law will end in 2020! We must build a processor based on the Quantum level. We must find a way to manipulate organic atoms to insure the future of our planet! We must contact an alien race with advanced technology to save us!</p>
<h2>The Future of Computing</h2>
<p><object classid="clsid:d27cdb6e-ae6d-11cf-96b8-444553540000" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=9,0,0,0" width="481" height="361" id="Main" align="middle"><param name="allowScriptAccess" value="always" /><param name="movie" value="http://mitworld.mit.edu/flash/player/Main.swf?host=cp58255.edgefcs.net&#038;flv=mitw-01172-mpc-big-engineering-3003-agarwal-computing-28apr2009&#038;preview=http://mitworld.mit.edu//uploads/mitwstill01172mpcbigengineering3003agarwalcomputing28apr2009.jpg" /><param name="quality" value="high" /><param name="bgcolor" value="#000000" /><embed src="http://mitworld.mit.edu/flash/player/Main.swf?host=cp58255.edgefcs.net&#038;flv=mitw-01172-mpc-big-engineering-3003-agarwal-computing-28apr2009&#038;preview=http://mitworld.mit.edu//uploads/mitwstill01172mpcbigengineering3003agarwalcomputing28apr2009.jpg" quality="high" bgcolor="#000000" width="481" height="361" name="Main" align="middle" allowScriptAccess="always" type="application/x-shockwave-flash" pluginspage="http://www.macromedia.com/go/getflashplayer" /></object><br />
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/moores-law-economic-disaster/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Product Life Cycle (PLC)</title>
		<link>http://www.mikestratton.net/2011/06/product-life-cycle-plc/</link>
		<comments>http://www.mikestratton.net/2011/06/product-life-cycle-plc/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:49:40 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3906</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/product-life-cycle-plc/">Product Life Cycle (PLC)</a></p><p>Software Development &#8211; Product Life Cycle<br />
&#34;Good analysis of the problem leads to a good design of the solution and<br />
to decreased development time.&#34;<br />
<br />
1. Analysis<br />
Analysis Stage<br />
Analysis is the process of investigating a problem that you wish to solve with<br />
your product.<br />
Clearly define the problem that needs to be solved, the market niche that you<br />
wish to feel, or the system you want to create and setting the scope of the<br />
project.<br />
Identify key sub components ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/product-life-cycle-plc/">Product Life Cycle (PLC)</a></p><h2>Software Development &#8211; Product Life Cycle</h2>
<p><em>&quot;Good analysis of the problem leads to a good design of the solution and<br />
to decreased development time.&quot;<br />
</em></p>
<h3>1. Analysis</h3>
<p>Analysis Stage<br />
Analysis is the process of investigating a problem that you wish to solve with<br />
your product.<br />
Clearly define the problem that needs to be solved, the market niche that you<br />
wish to feel, or the system you want to create and setting the scope of the<br />
project.<br />
Identify key sub components that compose of your overall product.
</p>
<h3>2. Design</h3>
<p>Design Stage<br />
The process of applying the findings you made during the analysis stage to the<br />
actual design of the product. During the design stage, the primary task is<br />
developing blueprints or specifications for the products or components of your<br />
system.
</p>
<h3>3. Development</h3>
<p>Development Stage<br />
Development consists of using the blueprints or specifications to create actual<br />
components.
</p>
<h3>4. Testing</h3>
<p>Testing Stage<br />
Ensure that the developed product and individual components meet the<br />
specifications created during the design stage.<br />
Testing is usually performed by an external team so that the product is tested<br />
without bias on behalf of the developer.
</p>
<h3>5. Implementation</h3>
<p>Implementation Stage<br />
The product is made available to the customers. The implementation stage is also<br />
referred to as the FCS (first customer ship) in the computer industry.
</p>
<h3>6. Maintenance</h3>
<p>Maintenance Stage<br />
Fixing problems with the product and releasing the product as a new version or<br />
revision.
</p>
<h3>7. End-of-life (EOL)</h3>
<p>EOL consists of carrying out all the tasks to ensure that the customers and<br />
employees are aware that the product is no longer being sold and supported and<br />
that a new product is available.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/product-life-cycle-plc/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Duke the Java Mascot!</title>
		<link>http://www.mikestratton.net/2011/06/duke-the-java-mascot/</link>
		<comments>http://www.mikestratton.net/2011/06/duke-the-java-mascot/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:44:48 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[java]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3901</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/duke-the-java-mascot/">Duke the Java Mascot!</a></p><p>Duke the Java Mascot!<br />
This is Duke, the Java Mascot. Duke and I share one thing in common, we both<br />
love Java! To show my support for Duke and all of his Java escapades, I have<br />
added his portrait to this site!<br />
<br />
<br />
Would you like to learn more about the Java platform? Go to: http://www.java.com <br />
Would you like to learn more about Duke, the Java Mascot? Go to:<br />
<br />
http://kenai.com/projects/duke/pages/Home <br />
<br />
<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/duke-the-java-mascot/">Duke the Java Mascot!</a></p><h2>Duke the Java Mascot!</h2>
<p>This is Duke, the Java Mascot. Duke and I share one thing in common, we both<br />
love Java! To show my support for Duke and all of his Java escapades, I have<br />
added his portrait to this site!</p>
<p style="text-align:center">
<img alt="Duke the Java Mascot!" height="308" src="http://www.mikestratton.net/images/java_duke.png" width="360" /></p>
<p>Would you like to learn more about the Java platform? Go to: <a href="http://www.java.com">http://www.java.com</a> </p>
<p>Would you like to learn more about Duke, the Java Mascot? Go to:<br />
<a href="http://kenai.com/projects/duke/pages/Home"><br />
http://kenai.com/projects/duke/pages/Home</a> </p>
<p style="text-align:center">
<img alt="Duke and Netbeans Power Tools" height="270" src="http://www.mikestratton.net/images/duke_java_netbeans.png" width="339" /></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/duke-the-java-mascot/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Java Fractal Examples</title>
		<link>http://www.mikestratton.net/2011/06/java-fractal-examples/</link>
		<comments>http://www.mikestratton.net/2011/06/java-fractal-examples/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:40:56 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[fractal]]></category>
		<category><![CDATA[java]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3899</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/java-fractal-examples/">Java Fractal Examples</a></p><p>Java Fractal Examples<br />
What exactly is a fractal? Wikipedia defines a fractal as &#8220;a rough or fragmented geometric shape that can be split into parts, each of which is (at least approximately) a reduced-size copy of the whole,&#8221;[1] a property called self-similarity.<br />
Java Fractals &#8211; Artistic Expression<br />
I have created some Java fractals for two purposes. <br />
1) Computer Science Artistic Expression <br />
2) Examples of Fractals written in Java<br />
To view the fractals, click here: Fractal Gear Machine<br />
<br ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/java-fractal-examples/">Java Fractal Examples</a></p><h2>Java Fractal Examples</h2>
<p>What exactly is a fractal? Wikipedia defines a fractal as &#8220;a rough or fragmented geometric shape that can be split into parts, each of which is (at least approximately) a reduced-size copy of the whole,&#8221;[1] a property called self-similarity.</p>
<h3>Java Fractals &#8211; Artistic Expression</h3>
<p>I have created some Java fractals for two purposes. <br />
1) Computer Science Artistic Expression <br />
2) Examples of Fractals written in Java</p>
<p>To view the fractals, click here: <a href="http://www.mikestratton.net/fractals/gear-machine.html" target="_blank">Fractal Gear Machine</a></p>
<p></p>
<p><strong>References</strong></p>
<p>Deitel P. &#038; Deitel H. (2010). Java &#8211; How to Program (Late Objects Version), Pearson Education, Inc., Upper Saddle River, New Jersey</p>
<p>&#8220;Fractal&#8221; (2010) Wikipedia. http://en.wikipedia.org/w/index.php?title=Fractal</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/java-fractal-examples/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Mountain State Universtiy References</title>
		<link>http://www.mikestratton.net/2011/06/mountain-state-universtiy-references/</link>
		<comments>http://www.mikestratton.net/2011/06/mountain-state-universtiy-references/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:38:10 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3895</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/mountain-state-universtiy-references/">Mountain State Universtiy References</a></p><p>Mountain State University References<br />
This page is devoted to list points of reference aquired during undergraduate studies in the field of computer science at Mountain State University. Each point of reference will list the class and method by which the references was aquired.<br />
Unified Modeling LanguageFall I 2010 &#8211; CIS 120 &#8211; How to Program JavaDeitel &#8211; Java, How To Program 8th Edition (ISBN-13: 978-0-13-612371-2) Deitel referenced the Unifed Modeling Languagehttp://www.uml.org  http://www.omg.org/spec/UML/index.htm<br />
Other UML Resources:MSDN Extending UML Models and ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/mountain-state-universtiy-references/">Mountain State Universtiy References</a></p><h2>Mountain State University References</h2>
<p>This page is devoted to list points of reference aquired during undergraduate studies in the field of computer science at Mountain State University. Each point of reference will list the class and method by which the references was aquired.</p>
<p><strong><span style="text-decoration: underline;">Unified Modeling Language</span></strong><br />Fall I 2010 &#8211; CIS 120 &#8211; How to Program Java<br />Deitel &#8211; Java, How To Program 8th Edition (ISBN-13: 978-0-13-612371-2) <br />Deitel referenced the Unifed Modeling Language<br /><a href="http://www.uml.org" target="_self">http://www.uml.org</a>  <br /><a href="http://www.omg.org/spec/UML/index.htm">http://www.omg.org/spec/UML/index.htm</a></p>
<p><strong>Other UML Resources:<br /></strong>MSDN Extending UML Models and Diagrams: <a href="http://msdn.microsoft.com/en-us/library/ee329484.aspx">http://msdn.microsoft.com/en-us/library/ee329484.aspx</a> <br />IBM Rational UML: <a href="http://www-01.ibm.com/software/rational/uml/">http://www-01.ibm.com/software/rational/uml/</a> <br />Object-Oriented Analysis &amp; Design: Methods: <a href="http://www.cetus-links.org/oo_ooa_ood_methods.html">http://www.cetus-links.org/oo_ooa_ood_methods.html</a> <br />Microsoft Security Development Lifecycle: <a href="http://msdn.microsoft.com/en-us/library/cc307891.aspx">http://msdn.microsoft.com/en-us/library/cc307891.aspx</a></p>
<p><strong>Other Resources from this class: <br /></strong><a href="http://www.deitel.com/resourcecenters.html">www.deitel.com/resourcecenters.html</a> | <a href="http://www.techcrunch.com">www.techcrunch.com</a> | <a href="http://www.slashdot.org">www.slashdot.org</a> | <a href="http://www.agilealliance.org">www.agilealliance.org</a> | <a href="http://www.agilemanifesto.org">www.agilemanifesto.org</a> | <a href="http://gettingreal.37signals.com/toc.php">http://gettingreal.37signals.com/toc.php</a> | <a href="http://www.jgrasp.org">www.jgrasp.org</a> | <a href="http://www.bluej.org">www.bluej.org</a> | <a href="http://www.eclipse.org">www.eclipse.org</a> | <a href="http://www.netbeans.org">www.netbeans.org</a> | <a href="http://www.jcreator.com">www.jcreator.com</a> | <a href="http://www.textpad.com">www.textpad.com</a> | <a href="http://www.editplus.com">www.editplus.com</a> | <a href="http://www.jedit.org">www.jedit.org</a></p>
<p><strong>Carbon Footprint Calculator</strong><br /><a href="http://www.terrapass.com/carbon-footprint-calculator/">http://www.terrapass.com/carbon-footprint-calculator/</a> | <a href="http://www.carbonfootprint.com/calculator.aspx">http://www.carbonfootprint.com/calculator.aspx</a></p>
<p><strong>Body Mass Index Calculator</strong><br /><a href="http://www.nhlbisupport.com/bmi/">http://www.nhlbisupport.com/bmi/</a></p>
<p><strong>Periodocal Literature</strong><br />ACM Computing Surveys &#8211; <a href="http://csur.acm.org">http://csur.acm.org</a><br />Computerworld &#8211; <a href="http://www.computerworld.com">http://www.computerworld.com</a> <br />Comnmunications of the ACM &#8211; <a href="http://cacm.acm.org">http://cacm.acm.org</a> <br />Current List of Recommended Periodicals &#8211; <a href="http://averia.mgt.unm.edu">http://averia.mgt.unm.edu</a></p>
<p><strong>Professional Societies</strong><br />Association for Information Technology Professionals &#8211; <a href="http://www.aitp.org">http://www.aitp.org</a> <br />Association for Computing Machinery &#8211; <a href="http://www.acm.org">http://www.acm.org</a> <br />IEEE Computer Society &#8211; <a href="http://www.computer.org">http://www.computer.org</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/mountain-state-universtiy-references/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Java Exception Handling</title>
		<link>http://www.mikestratton.net/2011/06/java-exception-handling/</link>
		<comments>http://www.mikestratton.net/2011/06/java-exception-handling/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:37:17 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3893</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/java-exception-handling/">Java Exception Handling</a></p><p>Java Exception Handling<br />
Moutain State University Java Study Notes<br />
(Week 1 CIS 220 Computer Science II)<br />
Java exception handling is based in part on Andrew Koenig&#39;s and Bjarne<br />
Stroustrup&#39;s paper, &#34;Exception Handling for C++ (revised).<br />
(Reference: A. Koenig, and B. Stroustrup, &#34;Exception Handling for C++<br />
(revised).&#34; Proceedings of the Usenix C++ Conference, pp. 149-176, San<br />
Francisco, April 1990.)<br />
Only classes that extend THROWABLE (package.java.lang) dirctly or indirectly<br />
can be used with exception handling.<br />
Error Handling Overview Psuedocode<br />
Perform a task<br ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/java-exception-handling/">Java Exception Handling</a></p><h2>Java Exception Handling</h2>
<h3>Moutain State University Java Study Notes<br />
<em><span class="auto-style1">(Week 1 CIS 220 Computer Science II)</span></em></h3>
<p>Java exception handling is based in part on Andrew Koenig&#39;s and Bjarne<br />
Stroustrup&#39;s paper, &quot;Exception Handling for C++ (revised).<br />
<em>(Reference: A. Koenig, and B. Stroustrup, &quot;Exception Handling for C++<br />
(revised).&quot; Proceedings of the Usenix C++ Conference, pp. 149-176, San<br />
Francisco, April 1990.)</em></p>
<p>Only classes that extend THROWABLE (package.java.lang) dirctly or indirectly<br />
can be used with exception handling.</p>
<h3>Error Handling Overview Psuedocode</h3>
<p><em>Perform a task</p>
<p>If the preceeding task did not execute correctly<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Perform error processing</p>
<p>Perform next task</p>
<p>If the preceeding task did not execute correctly<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Perform error processing</p>
<p></em></p>
<h4>Public Class without Exception Handling</h4>
<p>// Intro to Java page 454 figure 11.1<br />
// Integer division WITHOUT exception handling<br />
import java.util.Scanner;</p>
<p>public class DivideByZeroNoExceptionHandling<br />
{<br />
// demonstrates throwing an exception when a divide-by-zero occurs<br />
&nbsp;&nbsp;&nbsp; public static int quotient( int numerator, int denominator )<br />
&nbsp;&nbsp;&nbsp; {<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return numerator / denominator; //<br />
possible division by zero<br />
&nbsp;&nbsp;&nbsp; } // end method quotient</p>
<p>&nbsp;&nbsp;&nbsp; public static void main( String[] args )<br />
&nbsp;&nbsp;&nbsp; {<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Scanner scanner = new Scanner(<br />
System.in ); // scanner for input</p>
<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; System.out.print( &quot;Please enter an<br />
integer numerator: &quot; );<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; int numerator = scanner.nextInt();<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; System.out.print( &quot;Please enter an<br />
integer denominator: &quot; );<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; int denominator = scanner.nextInt();</p>
<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; int result = quotient( numerator,<br />
denominator );<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; System.out.printf(<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &quot;\nResult: %d<br />
/ %d = %d\n&quot;, numerator, denominator, result );<br />
&nbsp;&nbsp;&nbsp; } // end method main<br />
} // end class DivideByZeroNoExceptionHandling</p>
<p><strong>RETURNS:<br />
</strong>Please enter an integer numerator: 100<br />
Please enter an integer denominator: 0<br />
Exception in thread &quot;main&quot; java.lang.ArithmeticException: / by zero<br />
at<br />
DivideByZeroNoExceptionHandling.quotient(DivideByZeroNoExceptionHandling.java:10)<br />
at DivideByZeroNoExceptionHandling.main(DivideByZeroNoExceptionHandling.java:22)<br />
<strong>OR:</strong><br />
Please enter an integer numerator: 100<br />
Please enter an integer denominator: hello<br />
Exception in thread &quot;main&quot; java.util.InputMismatchException<br />
at java.util.Scanner.throwFor(Scanner.java:840)<br />
at java.util.Scanner.next(Scanner.java:1461)<br />
at java.util.Scanner.nextInt(Scanner.java:2091)<br />
at java.util.Scanner.nextInt(Scanner.java:2050)<br />
at DivideByZeroNoExceptionHandling.main(DivideByZeroNoExceptionHandling.java:20)</p>
<h4>Public Class With Exception Handling</h4>
<p>// Java intro to programming page 456 Figure 11.2<br />
// Handling ArithmeticExceptions and InputMismatchExceptions</p>
<p>import java.util.InputMismatchException;<br />
import java.util.Scanner;</p>
<p>public class DivideByZeroWithExceptionHandling<br />
{<br />
&nbsp;&nbsp;&nbsp; // demonstrates throwing an exception when a divide-by-zero<br />
occurs<br />
&nbsp;&nbsp;&nbsp; public static int quotient( int numerator, int denominator )<br />
&nbsp;&nbsp;&nbsp; throws ArithmeticException<br />
&nbsp;&nbsp;&nbsp; {<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return numerator / denominator; //<br />
possible division by zero<br />
&nbsp;&nbsp;&nbsp; } // end method quotient</p>
<p>&nbsp;&nbsp;&nbsp; public static void main( String[] args )<br />
&nbsp;&nbsp;&nbsp; {<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Scanner scanner = new Scanner(<br />
System.in ); // scanner for input<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; boolean continueLoop = true; //<br />
determines if more input is needed</p>
<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; do<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; try // read<br />
two numbers and calculate quotient<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
System.out.print( &quot;Please enter an integer numerator: &quot;);<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
int numerator = scanner.nextInt();<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
System.out.print( &quot;Please enter an integer denominator: &quot; );<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
int denominator = scanner.nextInt();</p>
<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
int result = quotient( numerator, denominator );<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
System.out.printf( &quot;\nResult: %d / %d = %d\n&quot;, numerator, denominator, result );<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
continueLoop = false; // input successful; end looping<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; } // end try<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; catch (<br />
InputMismatchException inputMismatchException )<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
System.err.printf( &quot;\nException: %s\n&quot;,<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
inputMismatchException );<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
scanner.nextLine(); // discard input so user can try again<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
System.out.println(<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
&quot;You must enter integers. Please try again. \n&quot; );<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; } // end<br />
catch<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; catch<br />
(ArithmeticException arithmeticException )<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; {<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
System.err.printf( &quot;\nException: %s\n&quot;, arithmeticException );<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
System.out.println(<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
&quot;Zero is an invalid denominator. Please try again.\n&quot; );<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; } // end<br />
catch<br />
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; } while ( continueLoop ); // end<br />
do&#8230;while<br />
&nbsp;&nbsp;&nbsp; }&nbsp; // end method main <br />
} // end class DivideByZeroWithExceptionHandling</p>
<h4>Error Prevention Tip:</h4>
<p>Read the online API documentation for a method before using that method in a<br />
program. The documentation specifies the exceptions thrown by a method and<br />
indicates reasons why exceptions occur. Next, read the online API documentation<br />
for the specified exception classes. The documentation for an exception class<br />
typically contains potential reasons that such exceptions occur. Finally,<br />
provide for handling those exceptions in your program.<br />
Java Documentation:<br />
<a href="http://download.oracle.com/javase/1.4.2/docs/api/overview-summary.html" target="_blank" ><br />
http://download.oracle.com/javase/1.4.2/docs/api/overview-summary.html</a> </p>
<h4>When to use exception handling?</h4>
<p>Exception handling is designed to process synchronous errors, which occur<br />
when a statement executes.</p>
<h4>Java Exception Hierarchy</h4>
<p>All Java exception classes inherit directly or indirectly from class<br />
Exception, forming an inheritance hierarchy.</p>
<p>The class Throwable is the superclass of class exception. Class Throwable has<br />
two subclasses: Exception and Error.<br />
Class Throwable API documentation:<br />
<a href="http://download.oracle.com/javase/6/docs/api/java/lang/Throwable.html" target="_blank" ><br />
http://download.oracle.com/javase/6/docs/api/java/lang/Throwable.html</a> </p>
<h4>printStackTrace, getStackTrace and getMessage</h4>
<p><strong>printStackTrace</strong> &#8211; Outputs to the standard error stream the<br />
stack trace.<br />
<strong>getStackTrace</strong> &#8211; Retrieves the stack-trace information that must<br />
be printed by printStackTrace.<br />
<strong>getMessage </strong>- Returns the descriptive string stored in an<br />
exception.</p>
<h4>Chained Exceptions</h4>
<p>Chained exceptions enable a exception object to maintain the complex<br />
stack-trace information from the original exception.</p>
<h4>Declaring New Exception Types</h4>
<p>A new exception class must extend an existing exception class to ensure that<br />
the class can be used with the exception-handling mechanism. Like any other<br />
class, an exception class can contain fields and methods. However, a typical new<br />
exception class contains only for constructors; one that takes no arguments and<br />
passes a default error message String to the superclass constructor; one that<br />
recieves a customized error message as a String and passes it to the superclass<br />
constructor; one that recieves a customized error message as a String and a<br />
Throwable (for chaning exceptions) and passes both to the superclass<br />
constructor; and one that receives a Throwable (for chaining exceptions) and<br />
passes it to the superclass constructor.</p>
<h4>Preconditions and Postconditions</h4>
<p>Programmers spend a signifcant amounts of time maintaining and debugging<br />
code. To facilitate these tasks and to improve the overall design, they can<br />
specifiy the expected states before and after a method&#39;s execution. A<br />
precondition must be true when a method is invoked. A postcondition is true<br />
after the method is invoked.</p>
<h4>Assertions</h4>
<p>When implementing and debugging a class, it&#39;s sometimes useful to state<br />
conditions that should be true at a paticular point in a method. These<br />
conditions, called assertions, help ensure a program&#39;s validity by catching<br />
potential bugs and identifying possible logic errors during development.</p>
<p>
<em>Source: P. Deitel, and H. Deitel (2010). Java, Late Objects Version, How To<br />
Program (Eight Edition) pp 452-477, Upper Saddle River, New Jersey: Pearson<br />
Education, Inc </em></p>
<p>
<a href="http://www.amazon.com/Java-How-Program-Objects-Version/dp/0136123716" target="_blank" ><br />
http://www.amazon.com/Java-How-Program-Objects-Version/dp/0136123716</a> </p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/java-exception-handling/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Entrepreneurship and Business Planning</title>
		<link>http://www.mikestratton.net/2011/06/entrepreneurship-and-business-planning/</link>
		<comments>http://www.mikestratton.net/2011/06/entrepreneurship-and-business-planning/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:35:01 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3889</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/entrepreneurship-and-business-planning/">Entrepreneurship and Business Planning</a></p><p>Mountain State University Introduction to Business Assignment<br />
Entrepreneurship and Business Planning<br />
<br />
Small Business Case Study<br />
<br />
Creating a business<br />
<br />
Alys Navarro used to tutor her friends in math for free. She realized that<br />
she was very effective at tutoring and has decided to create a math tutoring<br />
business. She will not just try to explain the concepts, but will create a set<br />
of questions that can help students determine whether they really understand the<br />
concepts. She views this ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/entrepreneurship-and-business-planning/">Entrepreneurship and Business Planning</a></p><h3>Mountain State University Introduction to Business Assignment</h3>
<h3>Entrepreneurship and Business Planning<br />
</h3>
<h3>Small Business Case Study</p>
</h3>
<h4>Creating a business<br />
</h4>
<p>Alys Navarro used to tutor her friends in math for free. She realized that<br />
she was very effective at tutoring and has decided to create a math tutoring<br />
business. She will not just try to explain the concepts, but will create a set<br />
of questions that can help students determine whether they really understand the<br />
concepts. She views this strategy as a competitive advantage over the other<br />
students who already provide math tutorial services. Alys established this<br />
business with very little funding because she does not need an office to provide<br />
the service. She will rely on cheap advertising in the school newspaper and will<br />
post messages on bulletin boards for students who may need to hire a tutor. She<br />
also hopes to receive referrals from previous customers. </p>
<p>
</p>
<h4>Impact of competition and demand<br />
</h4>
<p><strong>Why might the demand for the math tutorial services offered by Alys change over time in response to the competition?<br />
</strong><br />
An increase in the amount of competition may decrease the demand for Alys services. In contrast, if Alys method of doing business results in a stronger market share; therefore reducing the numbers of competitors, the demand for her services may increase.</p>
<p>
</p>
<h4>Establishing a competitive advantage</h4>
<p><strong>How do you think customers who rely on Alys for the Tutorial service will judge whether her service was worthwhile?<br />
</strong><br />
Other tutors may not offer the same quality of services as Alys. For example, she explains the concepts and uses a question set to determine whether her students understand the concepts. Alys customers will judge her services by comparing everything that encompasses Alys business; including marketing, advertising, delivery method, and costs, to other businesses.</p>
<p>
</p>
<h4>Risk of Business Expansion</h4>
<p><strong>If Alyss expands her business by hiring new employees, why might she possibly lose her competitive advantage over time?<br />
</strong><br />
Alys business is based on her expertise and reputation as an individual and not as a company. She has established a market share through her competitive advantage as an individual tutor. Customers may wish to work directly with an individual and not a company; therefore, Alys could lose here competitive advantage. </p>
<p>
</p>
<h4>Risk of a business dominated by one person</h4>
<p><strong>Explain why the math tutorial business is risky as a result of heavy reliance on one owner?<br />
</strong><br />
By establishing a firm that relies on the service of an individual, the firm may suffer greatly in the event the owner gets sick or passes away. The firm was established and built by marketing and advertising the services of one individual; therefore, the firm is the individual. Also, as a sole proprietorship, the liability lies completely on the owner. In the event the owner is not able to respond to financial responsibility of the firm, the firm will fail. In contrast, a firm that has shared responsibility, such as a partnership, the financial responsibility is shared among the partners. </p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/entrepreneurship-and-business-planning/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Java Math.PI Circle Radius</title>
		<link>http://www.mikestratton.net/2011/06/java-math-pi-circle-radius/</link>
		<comments>http://www.mikestratton.net/2011/06/java-math-pi-circle-radius/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:33:00 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3887</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/java-math-pi-circle-radius/">Java Math.PI Circle Radius</a></p><p>Mountain State University Java Assisgnment<br />
2.28 (Diameter, Circumference, and Area of a Circle<br />
Write an application that inputs from the user the radius of a circle as an integer and prints the circle&#8217;s diameter, circumference, and area using the floating-point 3.14159 for PI. <br />
Java circlePi.java Source Code<br />
<br />
import java.util.Scanner;<br />
public class circlePi {<br />
public static void main( String[] args )<br />
{<br />
Scanner input = new Scanner( System.in );<br />
int cRadius; //radius of circle<br />
System.out.print( &#34;Enter the radius of ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/java-math-pi-circle-radius/">Java Math.PI Circle Radius</a></p><h2>Mountain State University Java Assisgnment</h2>
<h3>2.28 (Diameter, Circumference, and Area of a Circle</h3>
<p>Write an application that inputs from the user the radius of a circle as an integer and prints the circle&#8217;s diameter, circumference, and area using the floating-point 3.14159 for PI. </p>
<h4>Java circlePi.java Source Code</h4>
<p>
import java.util.Scanner;</p>
<p>public class circlePi {</p>
<p>public static void main( String[] args )<br />
{<br />
Scanner input = new Scanner( System.in );</p>
<p>int cRadius; //radius of circle</p>
<p>System.out.print( &quot;Enter the radius of a circle &quot; ); // prompt for user input<br />
cRadius = input.nextInt();</p>
<p>//Math.PI example System.out.println(&quot;Pi is &quot; + Math.PI); </p>
<p>// diameter = &#39;cRadius * cRadius<br />
// circumference = &#39;Math.PI * 2 * cRadius&#39;<br />
// area = cRadius * cRadius * Math.PI&#39;<br />
System.out.printf( &quot;The diameter is %d\n&quot;, cRadius * cRadius ); // prints<br />
results for int<br />
System.out.printf( &quot;The circumference is %f\n&quot;, 2 * Math.PI * cRadius ); //<br />
prints results for float<br />
System.out.printf( &quot;The area is %f\n&quot;, Math.PI * cRadius *cRadius ); // prints<br />
results for float</p>
<p>} // end method main</p>
<p>
} //end class circlePi</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/java-math-pi-circle-radius/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Sunday Dress and a Polar Bear</title>
		<link>http://www.mikestratton.net/2011/06/sunday-dress-and-a-polar-bear/</link>
		<comments>http://www.mikestratton.net/2011/06/sunday-dress-and-a-polar-bear/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:31:59 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3885</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/sunday-dress-and-a-polar-bear/">Sunday Dress and a Polar Bear</a></p><p>Mountain State University Summer 2010 Semester English Assignment for week 5.<br />
Essay assignment.<br />
Sunday Dress and a Polar Bear<br />
by Michael Stratton<br />
The 21st century is plagued with men who wear dresses and woman that wrestle polar bears. Although it may sound biased to say such a thing, in all actuality, I am simply stating the facts.<br />
The statement “woman that wrestles polar bears”, simply implies that the woman of today can easily do some of the jobs previously dominated ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/sunday-dress-and-a-polar-bear/">Sunday Dress and a Polar Bear</a></p><h2>Mountain State University Summer 2010 Semester English Assignment for week 5.</h2>
<p>Essay assignment.</p>
<h3>Sunday Dress and a Polar Bear</h3>
<p><i>by Michael Stratton</i></p>
<p>The 21<sup>st</sup> century is plagued with men who wear dresses and woman that wrestle polar bears. Although it may sound biased to say such a thing, in all actuality, I am simply stating the facts.</p>
<p>The statement “woman that wrestles polar bears”, simply implies that the woman of today can easily do some of the jobs previously dominated by men. In the essay “Girl in an Oven”, by Sara Jeanette Smith, Sara describes her success as a firefighter, thus proving that a woman can be successful in a male dominated career.</p>
<p>In the essay “One Man’s Kids” by Daniel Meier, Daniel put’s on his “Sunday dress” every day before he teaches his first grade class. Daniel states that when he interviews for a job, he offers a “male” response. Daniel’s “Sunday dress” is only a figurative example used to describe the ever evolving view of men who work in jobs previously dominated by woman.</p>
<p>60 years ago you could only find woman wrestling polar bears during a show at a traveling circus, and any man that wore a dress in public risked being arrested. Although that was the view of then, today are views are not so harsh.</p>
<p>We still believe that our roles as men and woman in the workplace are predefined; yet, we are challenging some of these beliefs.</p>
<p>Recently during a hospital stay I held the hand of a male nurse during a procedure that was painful. As a means of dealing with the pain, I squeezed his hand as hard as I could, without reservation. If he had been wearing a dress, I would have worried about hurting his hand.</p>
<p>A few years back I worked with a female personal trainer at a gym. Thanks to her training I was soon able to lift 600 pounds. Today I am now overweight and out of shape, and she is renowned body builder.</p>
<p>The days of outrageous polar bear wrestlers and bizarre Sunday dress stylists are over, as are our beliefs in the roles of men and woman in the work place. We still make outrageous and biased views on our counterparts, but those views are easily challenged by successful examples of our counterparts doing our jobs better.</p>
<p>Yes, men wear dresses, and yes, woman wrestle polar bears.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/sunday-dress-and-a-polar-bear/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Managerial Leading Styles</title>
		<link>http://www.mikestratton.net/2011/06/managerial-leading-styles/</link>
		<comments>http://www.mikestratton.net/2011/06/managerial-leading-styles/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:31:01 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[moutain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3883</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/managerial-leading-styles/">Managerial Leading Styles</a></p><p>Mountain State University Introduction to Business Discussion Assignment<br />
<br />
Discussion &#8211; Managerial Leading Styles<br />
Our assignment was to describe the different managerial leadership styles and<br />
indicated the pros and cons of each style. Discuss different scenarios in which<br />
one style might be more appropriate than others. Give at least one scenario for<br />
each leadership style.<br />
<br />
<br />
Autocratic, Free-rein, and Particpative <br />
by Michael Stratton<br />
Leadership styles can be classified into 3 types including autocratic,<br />
free-rein, and participative.<br />
Autocratic -<br ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/managerial-leading-styles/">Managerial Leading Styles</a></p><h2>Mountain State University Introduction to Business Discussion Assignment<br />
</h2>
<h3>Discussion &#8211; Managerial Leading Styles</h3>
<p>Our assignment was to describe the different managerial leadership styles and<br />
indicated the pros and cons of each style. Discuss different scenarios in which<br />
one style might be more appropriate than others. Give at least one scenario for<br />
each leadership style.</p>
<p>
</p>
<h4><strong>Autocratic, Free-rein, and Particpative <br />
</strong><em>by Michael Stratton</em></h4>
<p>Leadership styles can be classified into 3 types including autocratic,<br />
free-rein, and participative.</p>
<p><strong>Autocratic -</strong><br />
Managers retain full authority for decision making with little or no input from<br />
employees. When a company&#39;s product loses sales over a period of time, a manager<br />
may need to lay off employees. Autocratic would be the best management style in<br />
this situation.</p>
<p><strong>Free-rein &#8211; <br />
</strong>Authority is delegated to employees. Management communicate goals to<br />
employees but allow the employees to to choose how to complete the objectives.<br />
Free-rein would be a good choice for a sales team that is well educated and<br />
versed in the product and sales. The sales team would be judged on there<br />
performance, and self motivation would be a key factor in a positive<br />
performance.</p>
<p><strong>Participative -<br />
</strong>Managers accept some employee input but usually make the final<br />
decision. A manufacturing plant may choose this type to encourage employee moral<br />
and production. The manager could ask for ways to improve the line; therefore,<br />
the employees could offer input into any problem areas. This would result in the<br />
employee feeling a sense of importance with and to the company, as opposed to<br />
being just &quot;line workers&quot; with no input on employees decisions. This feeling of<br />
importance would translate into the employees working harder to produce positive<br />
results for the company.</p>
<p>
</p>
<h4>Additional Leadership Styles<br />
<em>by Professor Nancy Wood</em></h4>
<p>Class,</p>
<p>Excellent discussion postings and reply postings this week! Well done.</p>
<p>May I add, other types of leadership styles that can be found, are:</p>
<p><strong>Charismatic Leadership:</strong> In charismatic leadership, the leader<br />
puts in energy and enthusiasm into the project of the team. He/she does motivate<br />
and helps employees; though he/she may, at times, tend to boast much about his<br />
leadership skills and capabilities.</p>
<p><strong>Bureaucratic Leadership:</strong> A bureaucratic leader is one who makes<br />
sure that the standard procedures of the process is followed by the team<br />
members. This style rules out the scope for trying out new problem solving<br />
methods and enhancing the project performance.</p>
<p><strong>Relation-oriented Leadership:</strong> This style is also referred to as<br />
people-oriented style. In this corporate leadership style, the leader tries<br />
his/her best to support and mentor the team members, which in turn turns out to<br />
be beneficial for the project.</p>
<p><strong>Servant Leadership:</strong> In servant leadership, the leader is not<br />
officially intended to act as a leader. He/she is just an informal leader who<br />
takes one step forward on behalf of his/her team members. He/she takes decisions<br />
collectively by consulting with his/her colleagues.</p>
<p><strong>Transformational Leadership:</strong> This is a good leadership style<br />
that is suitable for any work environment. In transformational leadership, the<br />
leader provides motivation to his/her team, to perform tasks for the on-time<br />
deliverable of the project.</p>
<p><strong>Task-oriented Leadership:</strong> A task-oriented leader is usually<br />
known for only focusing on what his/her team has to achieve. Though, unlike in<br />
autocratic leadership, he might understand the needs and welfare of the team<br />
members.</p>
<p><strong>Transactional Leadership:</strong> This is a somewhat direct kind of<br />
effective leadership. It includes a direct authority given to the leader with<br />
regards to punishing and rewarding team members, owing to the results of the<br />
project.</p>
<p><strong>Situational Leadership:</strong> As the name suggests, situational<br />
leadership is not associated with any kind of style. It is adopted when a leader<br />
changes types of leadership styles in order to get the work done considering the<br />
situation.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/managerial-leading-styles/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Book Review: Visual Basic 2010</title>
		<link>http://www.mikestratton.net/2011/06/book-review-visual-basic-2010/</link>
		<comments>http://www.mikestratton.net/2011/06/book-review-visual-basic-2010/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:30:10 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[microsoft]]></category>
		<category><![CDATA[visual basic]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3881</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/book-review-visual-basic-2010/">Book Review: Visual Basic 2010</a></p><p>Visual Basic 2010 Step by Step<br />
Visual Basic 2010 Step by Step is an essential tool in learning Visual Basic. The Step by Step series has once again extended it&#8217;s series with another must-have for the visual basic programmer. This book is also a great refresher course for the intermediate visual basic programmer.<br />
The author, Michael Halvorson is an award winning author and what I consider a Visual Basic Hall of Famer. His experience with Visual Basic extends beyond that ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/book-review-visual-basic-2010/">Book Review: Visual Basic 2010</a></p><h2>Visual Basic 2010 Step by Step</h2>
<p>Visual Basic 2010 Step by Step is an essential tool in learning Visual Basic. The Step by Step series has once again extended it&#8217;s series with another must-have for the visual basic programmer. This book is also a great refresher course for the intermediate visual basic programmer.</p>
<p>The author, Michael Halvorson is an award winning author and what I consider a Visual Basic Hall of Famer. His experience with Visual Basic extends beyond that as a writer, as he is also an editor and a Visual Basic guru for Microsoft.</p>
<p>For those of us who do not have the software and intergrated environment to learn visual basic, this book is one step in a simple solution to this problem. Microsoft offers a free download of their Visual Basic Express edition. Visit <a href="http://www.microsoft.com/press" target="_blank">www.microsoft.com/press</a> to download the software. The book also comes with a fully featured CD that includes practice files for book exercises as well as sample databases, and also a searchable eBook.</p>
<p>When it comes to Visual Basic programming, the phrase <br />
Dim strCode As String <br />
may not be something you understand currently. Do not worry, becuase by the end of reading Visual Basic 2010 Step by Step you will be <br />
&#8220;Dim Visual.Basic.Code As (A.Pro)&#8221;</p>
<p>Are you interested in more great technial books? Check out O&#8217;Reilly Media! O&#8217;Reilly Media is considered one of the industry&#8217;s best when it comes to resources for technical professionals.</p>
<p><a href="http://oreilly.com/" target="_blank"> O&#8217;Reilly Media</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/book-review-visual-basic-2010/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial Intelligence</title>
		<link>http://www.mikestratton.net/2011/06/artificial-intelligence/</link>
		<comments>http://www.mikestratton.net/2011/06/artificial-intelligence/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:28:58 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3879</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/artificial-intelligence/">Artificial Intelligence</a></p><p>Artificial Intelligence References<br />
This page lists references to the computer science field of Artificial Intelligence.<br />
Social Implications of AI<br />
&#8220;&#8230;.an ultraintelligent machine could design even better machines; there would then unquestionably be an &#8220;intelligence explosion&#8221;, and the intelligence of man would be left far behind. Thus the first ultraintelligent machine is the last invention man need ever make.&#8221;<br />
- Irving Good, 1965<br />
Adaptaive AI, Inc<br />
Imagine if computers could learn and think.<br />
Imagine if software was more flexible and adaptable ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/artificial-intelligence/">Artificial Intelligence</a></p><h2>Artificial Intelligence References</h2>
<p>This page lists references to the computer science field of Artificial Intelligence.</p>
<p><strong>Social Implications of AI</strong><br />
&#8220;&#8230;.an ultraintelligent machine could design even better machines; there would then unquestionably be an &#8220;intelligence explosion&#8221;, and the intelligence of man would be left far behind. Thus the first ultraintelligent machine is the last invention man need ever make.&#8221;<br />
<em>- Irving Good, 1965</em></p>
<p><a href="http://www.adaptiveai.com" target="_blank">Adaptaive AI, Inc</a><br />
Imagine if computers could learn and think.<br />
Imagine if software was more flexible and adaptable to work the way you want it to.<br />
Imagine if you could converse with your computer in plain English.<br />
Imagine if more intelligent computers helped organizations operate more efficiently and effectively while enhancing the satisfaction of their customers.<br />
We are Adaptive AI, Inc. We bring artificial general intelligence to life in business, entertainment and consumer products with far-reaching innovations that will revolutionize how humans and computers interact with each other.</p>
<p><a href="https://aij.dev.java.net/" target="_blank">AIJ &#8211; Artificial<br />
Intelligence API&#8217;s for Java</a><br />
AIJ aims to define a set of Artificial Intelligence API&#8217;s for Java on both J2ME and J2SE platforms.<br />
The AIJ Alpha interfaces are avaliable for public review.</p>
<p><a href="http://www.a-i.com/" target="_blank">Ai Research &#8211; Creating a new form<br />
of life</a><br />
Ai Research is a leading artificial intelligence research project. At Ai, we&#8217;re<br />
creating a new form of life. Our expanding web site is an essential part of the<br />
emerging global discussion about artificial intelligence. On this website, we showcase<br />
the state of the art in pattern-matching conversational machines, demonstrated by<br />
Alan, and in reinforcement learning algorithms, demonstrated by HAL. Use our forums,<br />
original papers, online labs, demos and links to explore what&#8217;s happening both at<br />
Ai (the project) and in AI (the field).</p>
<p><a href="http://aima.cs.berkeley.edu/" target="_blank">Artificial<br />
Intelligence &#8211; A Modern Approach</a><br />
The leading textbook in Artificial Intelligence.<br />
Used in over 1100 universities in over 100 countries.<br />
The 85th most cited publication on Citeseer.</p>
<p><a href="http://citeseerx.ist.psu.edu/" target="_blank">CiteSeerX</a></p>
<p>Scientific Literature Digital Library and Search Engine</p>
<p><a href="http://www.cs.unm.edu/~luger/ai-final/" target="_blank">Artificial Intelligence: Structures and Strategies for Complex Problem<br />
Solving </a><br />
This is the official website for George Luger&#8217;s AI textbook,<br />
now in its sixth edition. Here, you will find a variety of accompanying<br />
materials including source code implementing AI algorithms, demonstrations of<br />
algoritms running, links to related material, and much more. Use the navigation<br />
bar above to find what you need.</p>
<p><a href="http://www.csail.mit.edu/" target="_blank">CSAIL</a><br />
Computation lies at the heart of understanding all physical and biological systems. Many solutions to the most challenging problems of our lives, our work, and our world, therefore, are based in computation. MIT’s Computer Science and Artificial Intelligence Laboratory (CSAIL) studies this vast, compelling field in an effort to unlock the secrets of human intelligence, extend the functional capabilities of machines, and explore human/machine interactions. We apply that knowledge with a long-term lens to engineer innovative solutions with global impact.</p>
<p><a href="http://code.google.com/p/encog-java/">Encog-Java</a><br />
Encog is an advanced neural network and bot programming library. Encog can be used independently either to create neural networks or HTTP bot programs. Encog also includes classes that combine these two advanced features. Encog contains classes for Feedforward Neural Networks, Hopfield Neural Networks, and self organizing maps. Training can be accomplished using backpropagation, simulated annealing, and genetic optimization. Additional classes are provided for pruning neural networks.<br />
Encog also includes advanced HTTP bot programming features. A multithreaded spider that can store its workload either in memory on a database is provided. HTML parsing is provided, as well as advanced form and cookie handling.</p>
<p><a href="http://www.genetic-programming.com" target="_blank">Genetic Programming<br />
Inc.</a><br />
A privately funded research group that does research in applying genetic programming.</p>
<p><a href="http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-034-artificial-intelligence-fall-2006/" target="_blank">MIT OpenCourseWare</a><br />
MIT Computer Science course for the department&#8217;s &#8220;Artificial Intelligence and Applications&#8221; concentration. This course introduces students to the basic knowledge representation, problem solving, and learning methods of artificial intelligence. Upon completion of 6.034, students should be able to: develop intelligent systems by assembling solutions to concrete computational problems, understand the role of knowledge representation, problem solving, and learning in intelligent-system engineering, and appreciate the role of problem solving, vision, and language in understanding human intelligence from a computational perspective.</p>
<p><a href="http://novamente.net" target="_blank">Novamente LLC</a><br />
Leveraging its uniquely powerful artificial general intelligence technology, Novamente supplies software products and services to power intelligent virtual agents for virtual worlds, computer games, and simulations.</p>
<p><a href="http://selfawaresystems.com" target="_blank">Self Aware Systems</a><br />
This site has talks and papers by Steve Omohundro about natural intelligence, artificial intelligence, and cooperative technology. Steve is currently writing a book about how to use insights into emergent intelligence to transform your business, your life, and your future.</p>
<p><a href="http://singinst.org/" target="_blank">Singularity Institute for Artificial Intelligence</a><br />
In the coming decades, humanity will likely create a powerful artificial intelligence. The Singularity Institute for Artificial Intelligence (SIAI) exists to confront this urgent challenge, both the opportunity and the risk. Our objectives as an organization are:</p>
<p>-&gt; To ensure the development of friendly Artificial Intelligence, for the benefit of all mankind;<br />
-&gt; To prevent unsafe Artificial Intelligence from causing harm;<br />
-&gt; To encourage rational thought about our future as a species</p>
<p><a href="http://sunset.usc.edu/csse/research/COCOMOII/cocomo_main.html" target="_blank">Software Cost Estimation</a><br />
COnstructive COst MOdel II (COCOMO II) is a model that allows one to estimate the cost, effort, and schedule when planning a new software development activity. COCOMO II is the latest major extension to the original COCOMO (COCOMO 81) model published in 1981.</p>
<p><a href="http://see.stanford.edu/" target="_blank">Stanford School of Engineering</a><br />
For the first time in its history, Stanford is offering some of its most popular engineering classes free of charge to students and educators around the world. Stanford Engineering Everywhere (SEE) expands the Stanford experience to students and educators online. A computer and an Internet connection are all you need. View lecture videos, access reading lists and other course handouts, take quizzes and tests, and communicate with other SEE students, all at your convenience.</p>
<p><a href="http://e-drexler.com" target="_blank">The Trajectory of Nanotechnology</a><br />
E-drexler.com explores a line of technological development that begins with current laboratory capabilities for molecular engineering and extends along an incremental path toward the transformative technologies of high-throughput atomically precise manufacturing.</p>
<p><a href="http://www-formal.stanford.edu/jmc/whatisai/whatisai.html" target="_blank"><br />
What is artificial intelligence?</a><br />
Presented by John McCarthy, Computer Science Department at Stanford University.<br />
This article for the layman answers basic questions about artificial intelligence.<br />
The opinions expressed here are not all consensus opinion among researchers in AI.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/artificial-intelligence/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Software Company CEO</title>
		<link>http://www.mikestratton.net/2011/06/software-company-ceo/</link>
		<comments>http://www.mikestratton.net/2011/06/software-company-ceo/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:27:52 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>
		<category><![CDATA[software]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3877</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/software-company-ceo/">Software Company CEO</a></p><p>Mountain State University Summer 2010 Semester English Journal Checkpoint Assignment for week 5.<br />
Essay assignment.<br />
Software Company CEO<br />
The CEO of a successful software company is guaranteed an extremely lucrative pay scale. The time and effort to become the CEO of a successful software company is great, and the time and effort involved in continuing any success is greater yet.<br />
Many of the world’s greatest CEO’s were software programmers before they became business executives, some even who dropped out of ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/software-company-ceo/">Software Company CEO</a></p><h2>Mountain State University Summer 2010 Semester English Journal Checkpoint Assignment for week 5.</h2>
<p>Essay assignment.</p>
<h3>Software Company CEO</h3>
<p>The CEO of a successful software company is guaranteed an extremely lucrative pay scale. The time and effort to become the CEO of a successful software company is great, and the time and effort involved in continuing any success is greater yet.</p>
<p>Many of the world’s greatest CEO’s were software programmers before they became business executives, some even who dropped out of college. Although billionaires Bill Gates of Microsoft and Mark Zuckerberg of Facebook are both college dropouts, they are pure genius as software engineers.</p>
<p>A CEO who is a business executive secondary to being a software programmer is guaranteed a successful career even if they fail as a CEO. Failure as a CEO can be easily remedied by a successful career outlook as a software engineer.</p>
<p>The biggest barrier to becoming the successful CEO of a software company is lack of experience either as a software engineer or as a CEO, or both. A CEO without a vast understanding of business is guaranteed to fail. A CEO in the software industry with absolutely no comprehension of software engineering can easily be taken advantage of and over run by the stiff competition for software sales by companies with better applications.</p>
<p>The CEO of Google, Eric E. Schmidt, earned a PhD in EECS, and earns a salary of over $550,000 a year. Eric also taught at Stanford Business School as a part time professor.</p>
<p>Failure as a CEO of a software company will only increase your chances for success as a software engineer; which, in turn can improve future opportunities as the CEO of a software company.</p>
<p>The demand for software is expected to increase dramatically through the year of 2020, thus insuring opportunities for success as either a software company CEO or software engineer.</p>
<p>Any software engineer or CEO must have at the very least an above average IQ. The job demands critical analytical skills and relevant education or experience. The pay scale is wonderful and will insure a financially secure future. If you are a math wizard with critical analytical skills who loves computer technology, chances are you will do well as a software engineer or CEO of a software company.</p>
<h4>References:</h4>
<p>http://www.bls.gov/oco/ocos012.htm<br />Bureau of Labor Statistics,&nbsp; Top Executives</p>
<p>http://www.bls.gov/oco/ocos303.htm <br />Bureau of Labor Statistics,&nbsp; Computer Software Engineers and Computer Programmers</p>
<p>http://www.payscale.com/research/US/Job=Chief_Executive_Officer_(CEO)/Salary/by_Employer_Type<br />Salary median for CEO’s of companies.</p>
<p>http://www.forbes.com/static/pvp2005/LIRZBED.html<br />Forbes.com Executive pay of Steven A Ballmer</p>
<p>http://www.twincommas.com/billionaire-college-dropouts <br />Billionaire College Dropouts</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/software-company-ceo/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Honey Bees &amp; Human Hair</title>
		<link>http://www.mikestratton.net/2011/06/honey-bees-human-hair/</link>
		<comments>http://www.mikestratton.net/2011/06/honey-bees-human-hair/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:26:56 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3875</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/honey-bees-human-hair/">Honey Bees &#038; Human Hair</a></p><p>Mountain State University Summer 2010 Semester English Assignment for week 3.<br />
The readings by Klagsbrun and Lott rely on anecdotes, or brief stories, to portray a family member. Write an essay (2-3 paragraphs) in which you use two or three brief anecdotes to characterize one of your family members (Moseley &#038; Harris, p. 136).<br />
<br />
Honey Bees &#038; Human Hair<br />
Horror and laughter are emotions that are rarely shared. Bee nests and human hair serve a common purpose, as they ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/honey-bees-human-hair/">Honey Bees &#038; Human Hair</a></p><h2>Mountain State University Summer 2010 Semester English Assignment for week 3.</h2>
<p>The readings by Klagsbrun and Lott rely on anecdotes, or brief stories, to portray a family member. Write an essay (2-3 paragraphs) in which you use two or three brief anecdotes to characterize one of your family members (Moseley &#038; Harris, p. 136).</p>
<p></p>
<h3>Honey Bees &#038; Human Hair</h3>
<p>Horror and laughter are emotions that are rarely shared. Bee nests and human hair serve a common purpose, as they both meet the needs of a species. When my grandfather was a younger man, he survived an attack from a swarm of raging honey bees.  Although he walked away with his life, he was unable to walk away with a full head of hair. </p>
<p>At the age of five I was horrified when my grandfather told me and my 3 older sisters a story about how he lost his hair. I could not understand why my older 3 sisters laughed uncontrollably as he described the swarm of bees that swooped down and stole his hair. Later, after his story, my grandfather offered me a piece of bread with a light layer of honey and butter on it. As I sunk my teeth into the bread, I imagined my grandfather as being a magical giant. “Honey bees make honey Mike” he said just as my eyes brightened wide as the sweet taste of honey saturated into my taste buds. My grandfather continued to inform me that he was being silly when he told his story, and I should not be afraid. I took another bite, and my grandfather smiled. He offered me a glass of milk.</p>
<p>That’s the kind of guy my grandfather was, he could make magical honey out of a head of bald hair. When the sky was dark and gray, he showed me how to plant a tree and grow some faith. If he were still alive today, I am sure we would be fishing and talking about better things.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/honey-bees-human-hair/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Compiled and Interpreted Programs</title>
		<link>http://www.mikestratton.net/2011/06/compiled-and-interpreted-programs/</link>
		<comments>http://www.mikestratton.net/2011/06/compiled-and-interpreted-programs/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:25:56 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3873</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/compiled-and-interpreted-programs/">Compiled and Interpreted Programs</a></p><p>Mountain State University Systems Architecture Discussion Assignment<br />
Discussion Compiled and Interpreted Programs<br />
Our assignment was to compare and contrast the execution of compiled programs to interpreted programs in terms of CPU and memory utilization.<br />
 <br />
Compiled Program For most programming languages, there are four source code instruction types: 1. Data Declarations Defines the name and data type of one or more program variables. When a compiler reads a data declaration, it allocates memory to store data item. The amount ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/compiled-and-interpreted-programs/">Compiled and Interpreted Programs</a></p><h2>Mountain State University Systems Architecture Discussion Assignment</h2>
<h3>Discussion Compiled and Interpreted Programs</h3>
<p>Our assignment was to compare and contrast the execution of compiled programs to interpreted programs in terms of CPU and memory utilization.</p>
<p> </p>
<p><strong>Compiled Program </strong><br />For most programming languages, there are four source code instruction types: <br />1. Data Declarations <br />Defines the name and data type of one or more program variables. When a compiler reads a data declaration, it allocates memory to store data item. The amount of memory depends on the data type and the number of bytes to represent that data type in the CPU. The compiler uses a symbol table to keep track of data names, types, and assigned memory addresses. <br />2. Data Operations <br />An instruction that updates or computes a data value. The compiler translates data operation instructions into data instructions for the CPU. The compiler refers to the symbol table to determine memory addresses for instructions. <br />3. Control Structure <br />Source code instruction that controls the execution of other source code instructions, including Goto statements, conditional branches such as if-then-else, and loops such as while-do and repeat-until. Control structures require a CPU branch instruction. Each CPU instruction is preceded by its memory address. <br />4. Function Calls <br />Programmer defines a named instruction sequence that is executed by a call instruction. The flow of control to and from functions is similar to the operating system interrupt handler.</p>
<p>To simplify, a compiler takes the source code and allocates different instructions into different memory addresses, and then the compiler transforms separate source code instructions into separate CPU instructions. In essence, the compiler in itself is a program running in memory that takes the source code and modifies it into CPU instructions and memory locations of such instructions.</p>
<p>In contrast, an interpreter source code are compiled and linked as a whole. That is to say, all source code is active in memory, line by line as it is used. This takes up a great deal more memory then that of a compiler as the instructions are only executed for a short period of time within memory.</p>
<p>The following table further contrasts the difference between interpretation and compilation. </p>
<table border="1" width="100%" cellpadding="1" cellspacing="2">
<tr>
<td>Resource</td>
<td>Interpretation</td>
<td>Compilation</td>
</tr>
<tr>
<td>Memory Contents</td>
<td></td>
<td></td>
</tr>
<tr>
<td>Interpreter or Compiler</td>
<td>Yes</td>
<td>no</td>
</tr>
<tr>
<td>Source Code</td>
<td>Partial</td>
<td>No</td>
</tr>
<tr>
<td>Executable Code</td>
<td>Yes</td>
<td>Yes</td>
</tr>
<tr>
<td>CPU Instructions</td>
<td></td>
<td></td>
</tr>
<tr>
<td>Translation Operations</td>
<td>Yes</td>
<td>No</td>
</tr>
<tr>
<td>Library Linking</td>
<td>Yes</td>
<td>No</td>
</tr>
<tr>
<td>Application Program</td>
<td>Yes</td>
<td>Yes</td>
</tr>
</table>
<p>Source: Systems Architecture Fifth Edition Author Stephen D. Burd</p>
</p>
<p>Interpreted: Source Code goes directly into interpreter then outputs results. <br />Compiled: Source code goes to compiler and/or checker, then creates object code.<br />Interpreted Languages are easier to debug but do not run as fast. <br />Compiled languages execute much faster but are more difficult to debug. (Source: Massachusetts Institute of Technology <a href="http://www.mikestratton.net/index.php?option=com_content&amp;view=article&amp;id=143:intro-do-computer-science-and-programming&amp;catid=55:mit&amp;Itemid=130">http://www.mikestratton.net/index.php?option=com_content&amp;view=article&amp;id=143:intro-do-computer-science-and-programming&amp;catid=55:mit&amp;Itemid=130</a>)</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/compiled-and-interpreted-programs/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CIS 115 Week 1 DB Assisgnment</title>
		<link>http://www.mikestratton.net/2011/06/cis-115-week-1-db-assisgnment/</link>
		<comments>http://www.mikestratton.net/2011/06/cis-115-week-1-db-assisgnment/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:23:56 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[microsoft]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3871</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/cis-115-week-1-db-assisgnment/">CIS 115 Week 1 DB Assisgnment</a></p><p>Week 1 Introduction to Computers<br />
Discussion Assignment: <br />
Perform an Internet search to learn more about operating systems. Compare Vista to XP and research Max OS X. Share what you have learned with the rest of the class, especially any good informative links.<br />
Windows XP, Vista, &#038; 7 Comparisons<br />
&#160;This article is going to offer a technical comparison between Windows XP, Windows Vista, and Windows 7. The advances in today’s technology happen at an extremely fast rate. The book we ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/cis-115-week-1-db-assisgnment/">CIS 115 Week 1 DB Assisgnment</a></p><h2>Week 1 Introduction to Computers</h2>
<p>Discussion Assignment: <br />
Perform an Internet search to learn more about operating systems. Compare Vista to XP and research Max OS X. Share what you have learned with the rest of the class, especially any good informative links.</p>
<p><strong>Windows XP, Vista, &#038; 7 Comparisons</strong></p>
<p>&nbsp;This article is going to offer a technical comparison between Windows XP, Windows Vista, and Windows 7. The advances in today’s technology happen at an extremely fast rate. The book we are studying from was written in 2008; we are now in 2010 and Microsoft’s latest operating system is named Windows 7. As a Microsoft Certified Systems Administrator, I will do my best to offer only the relevant comparisons from the stand point of the end user and not from the stand point of the Information Technology professional.  I hope that these comparisons will help you to better understand in a simplistic format the major differences between all 3 operating systems. I will also offer a more technical viewpoint for those that may have interest in viewpoints of technical nature.</p>
<p>Windows XP was originally placed on the market in 2001. Windows XP comes in 4 separate editions. These editions are Home Edition, Professional Edition, Media Center Edition, and Professional x64 Edition. Each edition was designed to meet the specific needs of the end user. Windows XP Professional and Windows XP Professional x64 Edition were designed to easily communicate with Windows Servers, and have added security in comparison to the other 2 editions. Windows XP Professional x64 Edition is was created for systems that utilize only 64 bit hardware, as opposed to 32 bit hardware. Windows Home Edition and Windows Media Edition were designed for the user that does not have a need to connect to a business network both editions are not recommended for use with VPN’s, LAN’s and networks of this sort. The biggest down fall to using or purchasing a Windows XP based computer as opposed to purchasing a Windows Vista computer is support and compatibility. Support is still offered for Windows XP, but as of July 13, 2010 Microsoft will no longer offer support for XP Service Pack 2 (Source:<br />
<a href="http://windows.microsoft.com/en-us/windows/help/end-support-windows-xp-sp2-windows-vista-without-service-packs?os=other">http://windows.microsoft.com/en-us/windows/help/end-support-windows-xp-sp2-windows-vista-without-service-packs?os=other</a>). Service packs include multiple security, performance, and stability updates packed into 1 update. Windows XP does offer a Service Pack 3, and the support for this service pack does not have a current end date.  In consideration of today’s ever changing advances in technology, it is always a best practice to purchase a computer that has the most current operating system.
</p>
<p>Windows Vista was released in 2006. Windows Vista comes in 4 separate editions. These editions include Home Basic, Home Premium, Business, and Ultimate.  The Home Basic and Home Premium were designed with the non-professional home user in mind. The Business edition was created for use on a business level only, and the Ultimate Edition was created for the professional or the home user in mind. The Ultimate Edition has all of the security support as the Business Edition, and also offers a wide selection of media based applications. As of June 2010 Microsoft has not announced an end date to support for Windows Vista Service Packs. The use of Windows Vista Business Edition or Ultimate Edition is a good choice when thinking of current available technology. The only negative in comparison to Windows XP is that are some software applications that were created for use with Windows XP that may be incompatible with Windows Vista. Even though there may be this backward-compatibility issue with Windows Vista, it is better to utilize an operating system that is compatible with today’s software applications then an operating system such as Windows XP that works best with outdated software applications.</p>
<p>Windows 7 was introduced to the market in 2009. Windows 7 comes in 3 separate editions. These editions include Home Premium, Professional, and Ultimate. Home Premium was created with the home user in mind, and the Ultimate Edition and the Professional Edition were both created for users who are career professional or users who use a computer connected to a business network. Microsoft offers extensive support Windows 7, being that Windows 7 is Microsoft’s current release of an operating system.  Utilizing Windows 7 is the best decision when considering future compatibility of both hardware and software used for computer systems. The only downfall is that some currently released software applications may not be compatible with Windows 7. Even so, I would advice use of Windows 7 for all of your professional and personal computer needs.</p>
<p>Anyone who is on the market for a new computer or who is considering upgrading their computer must have a basic understanding of  the compatibility of operating systems, hardware and software. Microsoft offers what is called “required” specifications for each separate operating system. Microsoft states that each operating system has a minimum requirement for the hardware to work correctly with the operating system. For those of us who work in the Information Technology industry, it is well understood that some Microsoft’s minimum requirements may allow a system to perform, but may not allow the system to perform well.</p>
<p>The minimum hardware requirements for Windows XP Home Edition are:<br />
<br />
•	Pentium 233-megahertz (MHz) processor or faster (300 MHz is recommended)<br />
<br />
•	At least 64 megabytes (MB) of RAM (128 MB is recommended)<br />
<br />
•	At least 1.5 gigabytes (GB) of available space on the hard disk<br />
<br />
•	CD-ROM or DVD-ROM drive<br />
<br />
•	Keyboard and a Microsoft Mouse or some other compatible pointing device<br />
<br />
•	Video adapter and monitor with Super VGA (800 x 600)or higher resolution<br />
<br />
•	Sound card<br />
<br />
•	Speakers or headphones<br />
<br />
Source: <a href="http://support.microsoft.com/kb/314865">http://support.microsoft.com/kb/314865</a>
</p>
<p>The minimum hardware requirements for Windows XP Professional include:<br />
<br />
•	Pentium 233-megahertz (MHz) processor or faster (300 MHz is recommended)<br />
<br />
•	At least 64 megabytes (MB) of RAM (128 MB is recommended)<br />
<br />
•	At least 1.5 gigabytes (GB) of available space on the hard disk<br />
<br />
•	CD-ROM or DVD-ROM drive<br />
<br />
•	Keyboard and a Microsoft Mouse or some other compatible pointing device<br />
<br />
•	Video adapter and monitor with Super VGA (800 x 600) or higher resolution<br />
<br />
•	Sound card<br />
<br />
•	Speakers or headphones<br />
<br />
Source: <a href="http://support.microsoft.com/kb/314865">http://support.microsoft.com/kb/314865</a>
</p>
<p>The minimum hardware requirements for Windows Vista are:<br />
<br />
•	800 megahertz (MHz) processor and 512 MB of system memory<br />
<br />
•	20 GB hard drive with at least 15 GB of available space<br />
<br />
•	Support for Super VGA graphics<br />
<br />
•	CD-ROM drive<br />
Source: http://windows.microsoft.com/en-us/windows-vista/products/system-requirements </p>
<p>The requirements to run Windows 7 are:<br />
<br />
•	1 gigahertz (GHz) or faster 32-bit (x86) or 64-bit (x64) processor<br />
<br />
•	1 gigabyte (GB) RAM (32-bit) or 2 GB RAM (64-bit)<br />
<br />
•	16 GB available hard disk space (32-bit) or 20 GB (64-bit)<br />
<br />
•	DirectX 9 graphics device with WDDM 1.0 or higher driver<br />
<br />
Source:<br />
<a href="http://www.microsoft.com/windows/windows-7/get/system-requirements.aspx">http://www.microsoft.com/windows/windows-7/get/system-requirements.aspx</a>
</p>
<p>Here are Some Windows links of interest:<br />
<br />
Windows 7 Home Page: <a href="http://www.microsoft.com/windows/windows-7/">http://www.microsoft.com/windows/windows-7/</a><br />
<br />
Windows Vista Home Page:<br />
<a href="http://windows.microsoft.com/en-US/windows-vista/products/home">http://windows.microsoft.com/en-US/windows-vista/products/home</a><br />
<br />
Windows XP Home Page:<br />
<a href="http://www.microsoft.com/windows/windows-xp/default.aspx">http://www.microsoft.com/windows/windows-xp/default.aspx</a><br />
<br />
Microsoft News: <a href="http://www.microsoft.com/presspass/default.mspx">http://www.microsoft.com/presspass/default.mspx</a>
</p>
<p><strong>Research on Mac OS X</p>
<p></strong></p>
<p>After a bit of searching for relevant information on Apple’s Max OS X operating system, I found a wide variety of information. I combined this information with my knowledge of the Max OS X operating system, and on occasion offered a comparison to Microsoft technologies.</p>
<p>Mac OS X is Apple’s answer to Microsoft’s Windows operating systems. Traditionally Mac operating systems are known to be feature rich from a fully featured media rich &#038; graphical standpoint, but not always the best choice for end users whose primary need is for business perspectives. Many will argue this is not true, but to the IT professional it is well understood that it takes extra work to manage a Mac based computer on a Windows based network environment. Windows is considered by many to be the best choice for business networks. Windows also holds the largest market share for sales in operating systems worldwide.</p>
<p>It is possible to duel boot Max OS X with Windows XP. The phrase “duel boot” means that you can choose which operating system you would like to use when you computer starts up, as opposed to your computer automatically booting a pre-designated operating system. Youtube.com offered an interesting video how to duel boot Max OS X with Windows. View the video by clicking this link:<br />
<a href="http://www.youtube.com/watch?v=VxwuYTnfL-I">http://www.youtube.com/watch?v=VxwuYTnfL-I</a>
</p>
<p>Apple’s website offers some interesting downloads free of charge for Mac OS X. If you are using a computer with the Max OS X operating system, download and install a software application for free here: http://www.apple.com/downloads/macosx/ For Windows based computers you will find that you receive an error if you click on the download link. This error is a server response error. The server you send your http request to download the apple software from has identified your computer as a Windows based computer. In response to this you receive a pre generated error page.  Even if you were able to download the software, it would not work on a Windows based system.</p>
<p>Mac OS X utilizes the Safari web browser as its default browser.</p>
<p>Wikipedia.org states that the original release date of Mac OS X was its 1999 release of Mac OS X Server, as well as a desktop version, Mac OS X v10.0. View the full article here:<br />
<a href="http://en.wikipedia.org/wiki/Mac_OS_X">http://en.wikipedia.org/wiki/Mac_OS_X</a>
</p>
<p>The Max OS X offers operating systems for a server computer system or personal user computer system.</p>
<p>The Mac OS X operating system has separate editions. The latest desktop user version of the Mac OS X operating system is the Max OS X Snow Leopard (v10.6). </p>
<p>The general system requirements for the Mac OS X Leopard operating system are as follows:</p>
<p>
§	Mac computer with an Intel processor<br />
§	1GB of memory<br />
<br />
§	5GB of available disk space<br />
§	DVD drive for installation<br />
<br />
§	Some features require a compatible Internet service provider; fees may apply.<br />
<br />
§	Some features require Apple’s MobileMe service; fees and terms apply.<br />
<br />
Source: <a href="http://www.apple.com/macosx/specs.html">http://www.apple.com/macosx/specs.html</a>
</p>
<p>The Mac OS X operating system is used in correspondence with an Apple Mac computer. Apple facilitates all aspects of the hardware and software on their computers. This is different from computers that boot to Windows based operating systems. Microsoft allows external hardware vendors to create systems that are Windows compatible. </p>
<p>For more information on Max OS X, from the perspective of Apple, visit Apple’s OS X website: http://www.apple.com/macosx/  If you are interested in an article that opposes Apple’s viewpoint, check this article out:<br />
<a href="http://www.pcworld.com/article/130994/10_things_we_hate_about_apple.html">http://www.pcworld.com/article/130994/10_things_we_hate_about_apple.html</a>
</p>
<p>Thank you for reading these articles.  Any feedback you may offer is greatly appreciated.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/cis-115-week-1-db-assisgnment/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Java Palindrome</title>
		<link>http://www.mikestratton.net/2011/06/java-palindrome/</link>
		<comments>http://www.mikestratton.net/2011/06/java-palindrome/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:22:37 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3869</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/java-palindrome/">Java Palindrome</a></p><p>Mountain State University Java Assignment<br />
3.30 (Palindromes)<br />
Write an application that reads in a five digit integer and determines whether it&#8217;s a palindrome. If the number is not five digits long, display an error message and allow the user to enter a new value.<br />
Java Palindrome Source Code<br />
<br />
import java.util.Scanner; //initialize scanner<br />
public class palindrome // defines class name<br />
{<br />
public static void main( String[] args )<br />
{<br />
// Scanner = new Scanner( System.in );<br />
Scanner input = new ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/java-palindrome/">Java Palindrome</a></p><h2>Mountain State University Java Assignment</h2>
<h3>3.30 (Palindromes)</h3>
<p>Write an application that reads in a five digit integer and determines whether it&#8217;s a palindrome. If the number is not five digits long, display an error message and allow the user to enter a new value.</p>
<h4>Java Palindrome Source Code</h4>
<p>
import java.util.Scanner; //initialize scanner</p>
<p>public class palindrome // defines class name<br />
{</p>
<p>public static void main( String[] args )<br />
{<br />
// Scanner = new Scanner( System.in );<br />
Scanner input = new Scanner( System.in );</p>
<p>int digit; // enter 5 digits</p>
<p>System.out.print( &quot;Please enter a 5 digit number \n&quot; ); <br />
digit = input.nextInt();<br />
while (digit &lt; 10000 || digit &gt; 99999) <br />
{ <br />
System.out.printf(&quot;Please enter a 5 digit number only \n&quot;); <br />
System.out.print( &quot;Enter a 5 digit number \n &quot; ); <br />
digit = input.nextInt();<br />
} </p>
<p>if ( digit % 10 / 1 == digit % 100000 / 10000 ) <br />
{<br />
if ( digit % 100 / 10 == digit % 10000 / 1000 )<br />
System.out.printf( &quot;Your number is a palindrome.&quot; );<br />
else<br />
System.out.printf( &quot;Your number is not a palindrome.&quot; );<br />
}<br />
else<br />
System.out.printf( &quot;Your number is not a palindrome.&quot; );<br />
} // end main method</p>
<p>
} // end class</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/java-palindrome/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Mountain State University</title>
		<link>http://www.mikestratton.net/2011/06/mountain-state-university/</link>
		<comments>http://www.mikestratton.net/2011/06/mountain-state-university/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:20:41 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[computer science]]></category>
		<category><![CDATA[mit opencourseware]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3867</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/mountain-state-university/">Mountain State University</a></p><p>Mountain State University Online Computer Science Program<br />
I have been accepted into Mountain State Universities Online Computer Science Program! This is a dream come true, to attend college. It is also a delusion turned into reality, for me to study as an undergraduate in the field of computer science.<br />
If I accomplish the little bit of success that I have, it only proves that good works &#038; faith is a proven method for success for anyone! You can take all ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/mountain-state-university/">Mountain State University</a></p><h2><a target="_blank" href="http://www.mountainstate.edu/programs/online_csit/online_csit.aspx">Mountain State University Online Computer Science Program</a></h2>
<p>I have been accepted into Mountain State Universities Online Computer Science Program! This is a dream come true, to attend college. It is also a delusion turned into reality, for me to study as an undergraduate in the field of computer science.</p>
<p>If I accomplish the little bit of success that I have, it only proves that good works &#038; faith is a proven method for success for anyone! You can take all of the negative in my life and you can point the finger at me. All the positive is only proof that God exists, and that through him anything is possible.</p>
<h3>Computer Scientist<br />
<object width="480" height="290"><param name="movie" value="http://www.youtube-nocookie.com/v/29wPT6W1KVY&amp;hl=en_US&amp;fs=1?rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/29wPT6W1KVY&amp;hl=en_US&amp;fs=1?rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="480" height="290"></embed></object><br />
</h3>
<p>It doesn&#8217;t take a rocket scientist to validate out what is possible in this world.</p>
<p>If I can do this, thanks goes to God. If I fail, I can only blame the man in the mirror. Mountain State University, <strong>HERE I COME!</strong></p>
</p>
<h5>Thank you <a target="_blank" href="http://ocw.mit.edu/OcwWeb/web/home/home/index.htm">MIT OCW</a></h5>
<p>If not for having an opportunity to test the waters of undergraduate studies in computer science, I would have never even applied for the computer science program at Mountain State University. MIT&#8217;s OpenCourseWare gave me this opportunity. Initially I believed the waters of Computer Science would sink my ship, but after a short trip up stream I found much success in this pool of self-doubt. MIT offers a free trip upstream into many undergraduate studies into multiple technical fields. Take a test drive yourself here: <a target="_blank" href="http://ocw.mit.edu/OcwWeb/web/home/home/index.htm">http://ocw.mit.edu/OcwWeb/web/home/home/index.htm</a>.</p>
<p>Are you interested in just a taste of an MIT OCW&#8217;s class? <br /><a href="/index.php?option=com_content&#038;view=article&#038;id=143&#038;Itemid=109">Intro to Computer Science &#038; Programming Class notes.</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/mountain-state-university/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>PHP Best Practices</title>
		<link>http://www.mikestratton.net/2011/06/php-best-practices/</link>
		<comments>http://www.mikestratton.net/2011/06/php-best-practices/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:19:42 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[PHP]]></category>
		<category><![CDATA[php]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3865</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/php-best-practices/">PHP Best Practices</a></p><p>PHP Best Practices &#038; Notes<br />
The following notes are listed for reference to PHP development.<br />
<br />
MySql<br />
MySql Query Example <br />
// mysql_query(&#8220;SELECT * FROM searchengine WHERE keywords LIKE &#8216;%mike%&#8217; OR keywords LIKE &#8216;%stratton%&#8217;&#8221;);<br />
<br />
Apache<br />
<br />
PHP<br />
PHP Safe Mode is deprecated.<br />
<br />
http://php.net/manual/en/features.safe-mode.php <br />
<br />
The following php script can test the connection to your database.<br />
Create a php file with the following code and save as test.php. Upload to your web server and run the script from ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/php-best-practices/">PHP Best Practices</a></p><h2>PHP Best Practices &#038; Notes</h2>
<p>The following notes are listed for reference to PHP development.</p>
<h3>
<p>MySql</h3>
<p><strong>MySql Query Example</strong> <br />
// mysql_query(&#8220;SELECT * FROM searchengine WHERE keywords LIKE &#8216;%mike%&#8217; OR keywords LIKE &#8216;%stratton%&#8217;&#8221;);
</p>
<h3>Apache</h3>
<h3>
<p>PHP</h3>
<p>PHP Safe Mode is deprecated.<br />
<a href="http://php.net/manual/en/features.safe-mode.php" rel="nofollow" target="_blank"><br />
http://php.net/manual/en/features.safe-mode.php</a> </p>
<p></p>
<p><strong>The following php script can test the connection to your database.</strong><br />
Create a php file with the following code and save as test.php. Upload to your web server and run the script from a browser.<br />
&lt;?php<br />$host = &#8216;localhost&#8217;;<br />$user = &#8216;joomla_user;<br />$pass =<br />
&#8216;Your Password&#8217;;<br />$db = &#8216;joomla_db&#8217;;</p>
<p>//Don&#8217;t change below here<br />$conn<br />
= mysql_connect($host, $user, $pass);<br />mysql_select_db($db, $conn);<br />echo<br />
&#8216;&lt;hr /&gt;anything above this linebreak is BAD!&#8217;;</p>
<h3>
<p>XAMPP / WAMP</h3>
<p>After installing XAMPP start MySql and Apache. <br />
In your browser type in &quot;localhost&quot;<br />
On the left click on &quot;Security&quot;<br />
Make sure all tabs are green or yellow, except for running PHP in safe mode.<br />
This should be red and stay red. PHP safe mode is deprecated as of PHP 5.3.0 </p>
<p></p>
<p>After an install of XAMPP, creation of all sites and files should be saved in<br />
the mycomputer\xampp\htdocs directory. If you open localhost in your browser you<br />
will note that your url is entitled http://localhost/xampp This url is actually<br />
pointing to the mycomputer\xampp\htdocs directory. To simplify, create a new<br />
folder entitled &quot;php_sandbox&quot;. Save this folder here: mycomputer\xampp\htdocs\php_sandbox.<br />
Then type the following url into your browser: http://localhost/php_sandbox.&nbsp;<br />
Your browser will list all files and subfolders within the mycomputer\xampp\htdocs\php_sandbox<br />
folder.
</p>
<h3>
<p>Localhost</h3>
<h3>
<p>php.ini</h3>
<p>During development of PHP, it is best that all errors are displayed. To test<br />
if errors are turned on, type in the following code into a .php file, and then<br />
run from within your localhost.<br />
&lt;?php phpinfo(); ?&gt;<br />
<em>Note: Do not use this on a live site, as it is a security risk.<br />
</em>After running this file, it should display PHP configuration information.<br />
Scroll down to the box entitled &quot;Configuration PHP Core&quot;. Note that line that<br />
says &quot;display_errors&quot;. This line should be turned &quot;on&quot;. If it is not follow<br />
these instructions:<br />
1. Locate the php.ini file from the following directory: mycomputer\xampp\php\php.ini<br />
2. Open the php.ini file with notepad or similar text editor. DO NOT USE a word<br />
processor to open the php.ini file.<br />
3. Scroll down and Locate the &quot;; Error handling and logging ;&quot; section.<br />
4. After locating the &quot;Error handling and logging&quot; section, Slowly scroll down<br />
and find the following line: error_reporting = E_ALL &amp; ~E_NOTICE<br />
5. Comment out the &quot;error_reporting = E_ALL &amp; ~E_NOTICE&quot; line.<br />
6. Copy and paste the &quot;error_reporting = E_ALL &amp; ~E_NOTICE&quot; below the commented<br />
out line.<br />
7. Uncomment the new line and edit so that it says: &quot;error_reporting = E_ALL&quot;<br />
8. Save and close php.ini file.<br />
9. Run the &lt;?php phpinfo(); ?&gt; script.<br />
10. Verify that errors are being displayed.<br />
11. Upon completion, Eat a taco.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/php-best-practices/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificially Intelligent Machines</title>
		<link>http://www.mikestratton.net/2011/06/artificially-intelligent-machines/</link>
		<comments>http://www.mikestratton.net/2011/06/artificially-intelligent-machines/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:17:28 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[genetic algorithm]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3863</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/artificially-intelligent-machines/">Artificially Intelligent Machines</a></p><p>Artificially Intelligent Machines &#8211; Creative Common License<br />
In today&#8217;s technology we must adapt to the various interfaces and software programs available to suit our needs. Imagine a world in which the technology adapts to the users preferences and behaviors.<br />
A work in progress, I have offered an extremely simplistic view of the base of this technology. If you wish to collaborate on my work in its entirety, please feel free to read over the license at the bottom of the ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/artificially-intelligent-machines/">Artificially Intelligent Machines</a></p><h2>Artificially Intelligent Machines &#8211; Creative Common License</h2>
<p>In today&#8217;s technology we must adapt to the various interfaces and software programs available to suit our needs. Imagine a world in which the technology adapts to the users preferences and behaviors.</p>
<p>A work in progress, I have offered an extremely simplistic view of the base of this technology. If you wish to collaborate on my work in its entirety, please feel free to read over the license at the bottom of the page and then contact me. My cell phone is (330)802-0285 </p>
<p><object width="480" height="385"><param name="movie" value="http://www.youtube-nocookie.com/v/B2C6w_EvvLI?fs=1&amp;hl=en_US&amp;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/B2C6w_EvvLI?fs=1&amp;hl=en_US&amp;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="480" height="385"></embed></object></p>
<p><a rel="license" href="http://creativecommons.org/licenses/by-nc-nd/3.0/" target="_blank"><img alt="Creative Commons License" style="border-width:0" src="http://i.creativecommons.org/l/by-nc-nd/3.0/88x31.png" /></a><br /><span xmlns:dct="http://purl.org/dc/terms/" property="dct:title">Artificially Intelligent Machines</span> by <a xmlns:cc="http://creativecommons.org/ns#" target="_blank" href="http://www.mikestratton.net/artificially_intelligent_machine.pdf" property="cc:attributionName" rel="cc:attributionURL">Michael A. Stratton</a> is licensed under a <a rel="license" href="http://creativecommons.org/licenses/by-nc-nd/3.0/" target="_blank">Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License</a>.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/artificially-intelligent-machines/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Quantum Computing</title>
		<link>http://www.mikestratton.net/2011/06/quantum-computing/</link>
		<comments>http://www.mikestratton.net/2011/06/quantum-computing/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:14:32 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Stanford Engineering Everywhere]]></category>
		<category><![CDATA[quantum computing]]></category>
		<category><![CDATA[stanford engineering everywhere]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3859</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/quantum-computing/">Quantum Computing</a></p><p>Quantum Computing Reference<br />
This article was created as a reference point to the subject matter of Quantum Computing<br />
Quantum computer From Wikipedia, the free encyclopedia A quantum computer is a device for computation that makes direct use of quantum mechanical phenomena, such as superposition and entanglement, to perform operations on data. Quantum computers are different from traditional computers based on transistors. The basic principle behind quantum computation is that quantum properties can be used to represent data and perform operations ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/quantum-computing/">Quantum Computing</a></p><h2>Quantum Computing Reference</h2>
<p>This article was created as a reference point to the subject matter of Quantum Computing</p>
<p><strong>Quantum computer</strong> <br /><em>From Wikipedia, the free encyclopedia </em><br />A quantum computer is a device for computation that makes direct use of quantum mechanical phenomena, such as superposition and entanglement, to perform operations on data. Quantum computers are different from traditional computers based on transistors. The basic principle behind quantum computation is that quantum properties can be used to represent data and perform operations on these data.[1] A theoretical model is the quantum Turing machine, also known as the universal quantum computer.</p>
<p>Although quantum computing is still in its infancy, experiments have been carried out in which quantum computational operations were executed on a very small number of qubits (quantum bit). Both practical and theoretical research continues, and many national government and military funding agencies support quantum computing research to develop quantum computers for both civilian and national security purposes, such as cryptanalysis.</p>
<p>If large-scale quantum computers can be built, they will be able to solve certain problems much faster than any current classical computers (for example Shor&#8217;s algorithm). Quantum computers don&#8217;t allow the computations of functions that are not theoretically computable by classical computers, i.e. they do not alter the Church–Turing thesis. The gain is only in efficiency. <br /><em><a href="http://en.wikipedia.org/wiki/Quantum_computer" target="_blank" rel="nofollow">Read more&#8230;</a></em></p>
</p>
<h3>References</h3>
<ul>
<li><strong></strong><a href="http://qist.lanl.gov/qcomp_map.shtml" target="_blank" rel="nofollow">Quantum Information Science and Technology Roadmap</a> for a sense of where the research is heading.
</li>
<li>See also <a href="http://pqcrypto.org/" target="_blank" rel="nofollow">pqcrypto.org</a>, a bibliography maintained by Daniel J. Bernstein and Tanja Lange on cryptography not known to be broken by quantum computing.
</li>
<li><a href="http://www.its.caltech.edu/~sjordan/zoo.html" target="_blank" rel="nofollow">Quantum Algorithm Zoo</a> &#8211; Stephen Jordan&#8217;s Homepage
</li>
<li><a href="http://www.wired.com/science/discoveries/news/2007/02/72734" target="_blank" rel="nofollow">The Father of Quantum Computing</a> By Quinn Norton 02.15.2007, Wired.com
</li>
<li>Nizovtsev, A. P.; Kilin, S. Ya.; Jelezko, F.; Gaebal, T.; Popa, I.; Gruber, A.; Wrachtrup, J. (10-19-2004). <br /><a href="http://www.springerlink.com/content/5p6554lg35716085/" target="_blank" rel="nofollow">&#8220;A quantum computer based on NV centers in diamond:&#8221;</a>.
</li>
<li>Neumann, P.; Mizuochi, N.; Rempp, F.; Hemmer, P.; Watanabe, H.; Yamasaki, S.; Jacques, V.; Gaebel, T. <em>et al</em>. (June 6, 2008). <br /><a href="http://www.sciencemag.org/cgi/content/abstract/320/5881/1326" target="_blank" rel="nofollow">&#8220;Multipartite Entanglement Among Single Spins in Diamond&#8221;</a>.
</li>
<li>Rene Millman, IT PRO (2007-08-03).<br /> <a href="http://www.itpro.co.uk/news/121086/trapped-atoms-could-advance-quantum-computing.html" target="_blank" rel="nofollow">&#8220;Trapped atoms could advance quantum computing&#8221;</a>.
</li>
<li>Ohlsson, N.; Mohan, R. K.; Kröll, S. (January 1, 2002). <br /><a href="http://www.sciencedirect.com/science/article/B6TVF-44J3RM9-J/2/307aab59d157ddd2ebb8281f76f89138" target="_blank" rel="nofollow">&#8220;Quantum computer hardware based on rare-earth-ion-doped inorganic crystals&#8221;</a>.
</li>
<li>Longdell, J. J.; Sellars, M. J.; Manson, N. B. (September 23, 2004). <br /><a href="http://prola.aps.org/abstract/PRL/v93/i13/e130503" target="_blank" rel="nofollow">&#8220;Demonstration of conditional quantum phase shift between ions in a solid&#8221;</a>.
</li>
<li>Ann Arbor (2005-12-12). <br /><a href="http://www.umich.edu/news/index.html?Releases/2005/Dec05/r121205b" target="_blank" rel="nofollow">&#8220;U-M develops scalable and mass-producible quantum computer chip&#8221;</a>.
</li>
<li><a href="http://opa.yale.edu/news/article.aspx?id=6764" target="_blank" rel="nofollow">&#8220;Scientists Create First Electronic Quantum Processor&#8221;</a>. 2009-07-02
</li>
<li>New Scientist (2009-09-04). <br /><a href="http://www.newscientist.com/article/dn17736-codebreaking-quantum-algorithm-run-on-a-silicon-chip.html" target="_blank" rel="nofollow">&#8220;Code-breaking quantum algorithm runs on a silicon chip&#8221;</a>.
</li>
</ul>
<h3>External links</h3>
<ul>
<li><a href="http://plato.stanford.edu/entries/qt-quantcomp/" target="_blank" rel="nofollow">Stanford Encyclopedia of Philosophy: &#8220;Quantum Computing</a>
</li>
<li><a href="http://www.quantiki.org/" target="_blank" rel="nofollow">Quantiki</a> &#8211; Wiki and portal with free-content related to quantum information science.
</li>
<li><a href="http://jquantum.sourceforge.net/jQuantumApplet.html" target="_blank" rel="nofollow">jQuantum: Java quantum circuit simulator</a>
</li>
<li><a href="http://www.phys.cs.is.nagoya-u.ac.jp/~watanabe/qcad/index.html" target="_blank" rel="nofollow">QCAD: Quantum circuit emulator</a>
</li>
<li><a href="http://gna.org/projects/quantumlibrary" target="_blank" rel="nofollow">C++ Quantum Library</a>
</li>
<li><a href="http://hackage.haskell.org/cgi-bin/hackage-scripts/package/quantum-arrow" target="_blank" rel="nofollow">Haskell Library for Quantum computations</a>
</li>
<li><a href="http://www.quiprocone.org/Protected/DD_lectures.htm" target="_blank" rel="nofollow">Video Lectures by David Deutsch</a>
</li>
<li><a href="http://nanohub.org/resources/4778" target="_blank" rel="nofollow">Online lecture on An Introduction to Quantum Computing, Edward Gerjuoy (2008)</a></li>
</ul>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/quantum-computing/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Java Salary Calculator</title>
		<link>http://www.mikestratton.net/2011/06/java-salary-calculator/</link>
		<comments>http://www.mikestratton.net/2011/06/java-salary-calculator/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:12:37 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[mountain state university]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3857</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/java-salary-calculator/">Java Salary Calculator</a></p><p>Mountain State University Java Assignment<br />
3.20 (Salary Calculator)<br />
Develop a Java application that determines the gross pay for each of three employees. The company pays straight time for the first 40 hours worked by each employee and time and a half for all hours worked in excess of 40. You are given a list of the employees, their number of hours worked last week and their hourly rates. Your program should input this information for each employee, then determine and ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/java-salary-calculator/">Java Salary Calculator</a></p><h2>Mountain State University Java Assignment</h2>
<h3>3.20 (Salary Calculator)</h3>
<p>Develop a Java application that determines the gross pay for each of three employees. The company pays straight time for the first 40 hours worked by each employee and time and a half for all hours worked in excess of 40. You are given a list of the employees, their number of hours worked last week and their hourly rates. Your program should input this information for each employee, then determine and display the employee&#8217;s gross pay. Use the class Scanner to input the data.</p>
<h4>Java Salary Calculator Source Code</h4>
<p>
java.util.Scanner; //initialize scanner</p>
<p>public class salaryCalculator // defines class name<br />
{</p>
<p>public static void main( String[] args )<br />
{</p>
<p>// create Scanner to obtain input from command window<br />
Scanner input = new Scanner( System.in );</p>
<p>double hours; // number of hours worked input<br />
double pay; // rate of hourly wage input<br />
double overtime; // used to calculate overtime</p>
<p>// First input is for employee #1<br />
System.out.print( &quot;Enter the number of regular hours worked Jon Smith Worked &quot;<br />
); // prompt for user input<br />
hours = input.nextDouble();</p>
<p>System.out.print( &quot;Enter the number of overtime hours Jon Smith worked &quot; ); //<br />
prompt for user input<br />
overtime = input.nextDouble();</p>
<p>System.out.print( &quot;Enter the payrate of John Smith &quot; ); // prompt for user input<br />
pay = input.nextDouble();</p>
<p>if (overtime == 0 )</p>
<p>System.out.printf( &quot;Gross pay for this John Smith is %.2f\n&quot;, hours * pay );</p>
<p>else<br />
{</p>
<p>System.out.printf( &quot;Gross pay for this John Smith is %.2f\n&quot;, (hours * pay) +<br />
(overtime * (pay * 1.5)) );</p>
<p>}</p>
<p>
// Second input is for employee #2<br />
System.out.print( &quot;Enter the number of regular hours worked Betty Jones Worked &quot;<br />
); // prompt for user input<br />
hours = input.nextDouble();</p>
<p>System.out.print( &quot;Enter the number of overtime hours Betty Jones worked &quot; ); //<br />
prompt for user input<br />
overtime = input.nextDouble();</p>
<p>System.out.print( &quot;Enter the payrate of Betty Jones &quot; ); // prompt for user<br />
input<br />
pay = input.nextDouble();</p>
<p>if (overtime == 0 )</p>
<p>System.out.printf( &quot;Gross pay for this Betty Jones is %.2f\n&quot;, hours * pay );</p>
<p>else<br />
{</p>
<p>System.out.printf( &quot;Gross pay for this Betty Jones is %.2f\n&quot;, (hours * pay) +<br />
(overtime * (pay * 1.5)) );</p>
<p>}</p>
<p>// Third input is for employee #3<br />
System.out.print( &quot;Enter the number of regular hours worked LeMont Jordan Worked<br />
&quot; ); // prompt for user input<br />
hours = input.nextDouble();</p>
<p>System.out.print( &quot;Enter the number of overtime hours LeMont Jordan worked &quot; );<br />
// prompt for user input<br />
overtime = input.nextDouble();</p>
<p>System.out.print( &quot;Enter the payrate of LeMont Jordan &quot; ); // prompt for user<br />
input<br />
pay = input.nextDouble();</p>
<p>if (overtime == 0 )</p>
<p>System.out.printf( &quot;Gross pay for this LeMont Jordan is %.2f\n&quot;, hours * pay );</p>
<p>else<br />
{</p>
<p>System.out.printf( &quot;Gross pay for this Betty Jones is %.2f\n&quot;, (hours * pay) +<br />
(overtime * (pay * 1.5)) );</p>
<p>}</p>
<p>
} //end method main </p>
<p>} // end class salaryCalculator</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/java-salary-calculator/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>U.N. Climate Change Conference</title>
		<link>http://www.mikestratton.net/2011/06/u-n-climate-change-conference/</link>
		<comments>http://www.mikestratton.net/2011/06/u-n-climate-change-conference/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:11:29 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[blog]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3855</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/u-n-climate-change-conference/">U.N. Climate Change Conference</a></p><p>Support a Global Change<br />
This page is designated to the United Nations Climate Change Conference held in December of 2009. Learn more here: http://en.cop15.dk<br />
Our basic human perspective is based on what is in front of us, the here and now. We are an emotional based creature of high intelligence, and it is this very thing that shall become our downfall as a species.<br />
<br />
It is what is known as &#8220;to little to late&#8221;, and the only hope we ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/u-n-climate-change-conference/">U.N. Climate Change Conference</a></p><h3>Support a Global Change</h3>
<p>This page is designated to the United Nations Climate Change Conference held in December of 2009. <br />Learn more here: <a href="http://en.cop15.dk/" target="_blank">http://en.cop15.dk</a></p>
<p>Our basic human perspective is based on what is in front of us, the here and now. We are an emotional based creature of high intelligence, and it is this very thing that shall become our downfall as a species.</p>
<p><object width="560" height="340"><param name="movie" value="http://www.youtube-nocookie.com/v/NVGGgncVq-4&#038;hl=en_US&#038;fs=1&#038;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/NVGGgncVq-4&#038;hl=en_US&#038;fs=1&#038;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="448" height="272"></embed></object></p>
<p>It is what is known as &#8220;to little to late&#8221;, and the only hope we have for the human race is that we will learn from our mistakes. Those of us that survive the mass exstinction caused by our ever changing planet must remember that we were a race built on intelligence and capabilities, and self-satisfying demands to insure the bettering of only OURSELVES with no CONCERN for OTHERS. It is this very belief that has insured Global Warming, as the industrial age followed by the technology age has thrown our planet into a tailspin of catastrophic environmental changes. We have learned well to survive the elements by building greatly around us, yet as a species we have not evolved enough to know how to survie the elements if we could not build, or if our environment was to harsh to allow our structures to exist.</p>
<p>Direct blame can be placed on our ever expanding need to learn and grow with a simple use of a tool. That tool given to a race of insubordinate self loathing fools has helped us to achieve our greatness, yet we are to stupid to see our own mistakes before it is to late.</p>
<p>Our only hope for the human race is that some will survive the mass extinction caused by our great earth, and that they will evolve into a species that protects our species as a whole, and not a species that protects only themselves as individuals.</p>
<p>May we evolve to better understand that our emotional based way of seeing things was a false front for a much greater evil. The evil of human nature WILL destroy our planet. It is not a matter of IF it will or not, it is simply a matter of WHEN</p>
<p>Cock roaches will survive the mass exstinction, among other much more less-intelligent species.</p>
<p>THE ONLY HOPE FOR THE HUMAN RACE IS THAT SOME WILL SURVIVE THE MASS EXSTINCTION</p>
<p>THE ONLY HOPE FOR THE HUMAN RACE IS THAT THOSE THAT SURVIVE THE ERROR OF OUR OWN HUMANITY MAY USE WHAT TRUE INTELLIGENCE WE HAVE IN HELPING OUR FELLOW MAN</p>
<h2>Our Planet Is Doomed For Mass Exstinction, There Is <strong>NO HOPE</strong> . </h2>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/u-n-climate-change-conference/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Untested &#8220;Theory&#8221; of Instantaneous (0)x+y=0</title>
		<link>http://www.mikestratton.net/2011/06/untested-theory-of-instantaneous-0xy0/</link>
		<comments>http://www.mikestratton.net/2011/06/untested-theory-of-instantaneous-0xy0/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:10:01 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[physics]]></category>
		<category><![CDATA[quantum mechanics]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3853</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/untested-theory-of-instantaneous-0xy0/">Untested &#8220;Theory&#8221; of Instantaneous (0)x+y=0</a></p><p><br />
.style1 {<br />
	color: #FF0000;<br />
}<br />
.style2 {<br />
	color: #0000FF;<br />
}<br />
.style3 {<br />
	color: #008000;<br />
}<br />
.style4 {<br />
color: #FF9900;<br />
<br />
Theory of Instantaneous {“Purpose-Action-Reaction-Result &#8211;> Redefined”}<br />
<br />
Presently Physics Bases&#39; All of its Findings on the Following Concept:<br />
<br />
(Purpose)Action +<br />
Reaction = Result  <br />
In mathematical terms it would be stated as follows:<br />
<br />
(Addition) 1 +<br />
1 = 2 <br />
In common day use of mechanics it would be stated as follows:<br />
<br />
<br />
(Electricity) Light ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/untested-theory-of-instantaneous-0xy0/">Untested &#8220;Theory&#8221; of Instantaneous (0)x+y=0</a></p><style type="text/css">
.style1 {
	color: #FF0000;
}
.style2 {
	color: #0000FF;
}
.style3 {
	color: #008000;
}
.style4 {
color: #FF9900;
</style>
<h2>Theory of Instantaneous <br />{“Purpose-Action-Reaction-Result &#8211;> Redefined”}</p>
</h2>
<p>Presently Physics Bases&#39; All of its Findings on the Following Concept:<br />
<br />
<span class="style1">(Purpose)</span><span class="style2">Action </span>+<br />
<span class="style3">Reaction = Result </span> </p>
<p>In mathematical terms it would be stated as follows:<br />
<br />
<span class="style1">(Addition)</span><span class="style2"> 1 </span>+<br />
<span class="style3">1 = 2 </span></p>
<p>In common day use of mechanics it would be stated as follows:<br />
<span class="style1"><br />
<br />
(Electricity)</span> <span class="style2">Light Switch</span> +<br />
<span class="style3">Open Switch = Lighted Room</span></p>
<p>Everything we do today has a purpose. The purpose defines what action we will take. The reaction then defines the result.</p>
<p>Here is an example in how this defines our lifestyle:<br />
<br />
(<span class="style1">Human Body Needs Water)</span> <span class="style2">Get up and get a glass of water</span> +<br />
<span class="style3">Drink Water = Necessity Fulfilled </span></p>
<p>What if this concept is what holds are current technology from advancing beyond its actual limits? What if there was a better way to advance our current technology?</p>
<p>“They say the world is flat, yet I believe it to be round. I am going to sail across the seas until I fall off of the edge of our great world.” </p>
<p>What if we have been approaching our current technology from a perspective that is a simplistic as the first man to light a fire? How about the genius that invented the wheel? Simplistic approach to a complex world – our current technology is derived from a simplistic way of viewing the world in which we live.</p>
<p>What if our next step in advancing technology is to find a way to resolve a yet untested concept?<br />
Let us step through to the next age in technology, by first redefining our basic concepts in physics. Let us open the door to a very simplistic approach to the current world we live in.
</p>
<p>What if we found a way to have the <br />
<span class="style1">(Purpose)</span><span class="style2">Action </span>+<br />
<span class="style3">Reaction = Result </span><br />
happen in the same instance? </p>
<p>This is not a concept we can yet conceive, yet there is already evidence that it exists.</p>
<p>The following well known physics experiment offers some existing evidence (Figure 1).<br />
<br />
(<span class="style1">Physics)</span> <span class="style2">Ball in Motion</span> +<br />
<span class="style3">Strikes Ball at Rest = Ball in Motion Rests, Ball at Rest Motions<br />
</span></p>
<p>If you break down the experiment further you will find the following results:<br />
<br />
(Physics) Ball in Motion/Ball at Rest/Ball at Motion Rests/Ball at Rest Motions.<br />
<br />
The Purpose, action, reaction, &#038; result happen almost instantaneously.</p>
<h5>Figure 1: Physics Ball in Motion/Ball at Rest</p>
<p><img alt="Physics Ball in Motion/Ball at Rest" src="http://mikestratton.net/images/img9.jpg" /></h5>
<p>Another example of this is a simple element, h2o. </p>
<p>Although water is compromised of millions of much smaller particles, they come together as one to form a much larger body.  Take a spoon from this body, and still millions of particles perform the same result, water. Break down to only one particle and you get the element h2o. Addition of 1 more particle of h2o, and they merge seamlessly without a the equation of<br />
<br />
<span class="style1">(Purpose)</span><span class="style2">Action </span>+<br />
<span class="style3">Reaction = Result </span> </p>
<p>It happens instantaneously. If you were to try and monitor the amount of time it took for two separate bodies of h2o to become one it would not be possible, as time is not relevant in this instance. You may time the amount of time it takes for one drop of water to land on top of another drop, but it is not possible to record the time it takes to merge the 2. You could as well use a slow motion camera and watch as they merge and argue the point that it took time for the merger, but it was you that placed in motion the bonding of two separate entities of h2o. The bond will happen regardless of any purposeful event placed on the two separate entities. You could as well argue that when you release a drop of water into a glass, that it causes a reaction that moves the water away from the point of contact, stating that this proves the result is not instantaneous. My debate to this is to ask you how long did it take for the h20 to become h20 when they were placed together?</p>
<p>A possible avenue in defining the theory of instantaneous is to state that when you have an exact replica placed next to another replica, there is no reaction or action, all that happens within that interaction is<br />
instantaneous.</p>
<p>Another example of Theory of Instantaneous is to simply look in a mirror. While looking in the mirror blink twice and wave. What happens? How is it that the exact thing happens at the exact same time? Why yes of course you have to move your arm, but how is it that there is not a reaction needed for the same thing to happen in the mirror? Does it take time for your image in the mirror to be replicated? Does the amount of time it takes for your image to travel from your own person to the mirror change if you are distant? Is it really just an optical illusion? Or is it a very little researched process that we cannot yet comprehend?</p>
<p>They are the exact mirror of one another yet they are separate entities, consisting of separate atoms.
</p>
<p>Albert Einstein believed that time was relative, and was able to partially<br />
validate this belief via quantum physics.</p>
<p>My theory may seem an irrational and misinformed simplistic view of a much more complex physics fundementals, yet further research<br />
may validate some of my findings.</p>
<h3>Theory of Instantaneous</h3>
<p>I took our theory and used two examples. The first example displays what we know as to be fact in today&#8217;s physics: <br />
<span class="style1">(Transform a number to binary T2B)</span><span class="style2"> 3 </span>+<br />
<span class="style3"> T2B = 00000011 </span><br />
In the second example I used one that is not common to today&#8217;s physics: <br />
<span class="style4">(h20) h20 + h20 = h20 </span><br />
Immediately you notice that the if the action is the same as the purpose the reaction and result is the same as the purpose. When you take two seperate types, wether the action is different or wether the reaction is seperate from the purpose it causes things to happen over time, or incrimentally. When everything used in each value or function is the same, the result is instantaneous.</p>
<p>This leads to my next question: <br />
How do we make two seperate values the same, without a reaction or a linear equation?</p>
<p>What examples of Theory of Instantaneous do we have in basic arithmetic?  A circle, is a perfect example. No matter what where you start from in the center, the distance from the center is the same to the outer edge. No matter what angle you start at on the outer edge, the angle or purpose of that angle continues. A square changes the distance from center to outer edge dependant on the angle you point your line. The curve of a square is exactly the same, and then changes abrupbtly at a 90 degree angle. What is the circumference of a circle? Circumference of a circle is Pi2 and their the circumference goes on infinitely. You could argue that linear does not apply in regards to a circle in some sense.</p>
<p>My thoughts drift a bit in regards to this, what if we tried to take the average circumference of a triangle, square and a circle? Not possible in arithmetic terms?</p>
<p>Could we possibly consider that Pi is also the formula that defines infinite?</p>
<p>If you apply speed of motion to a circle, what is the result? Let&#8217;s state that the distance from the center of a circle to the edge is 10 units. How do we define units? Units is a linear equation, with step for step reaching the result measurement. What if we apply speed to our circle, the distance is the same in our terms, yet one end reaches the other end of the linear equation quicker. Does this not change what the actual eqaution is?</p>
<p>What if rather then taking our basic mathematical formules from a stand point of one dimension, why not apply 3 dimensional shape to our equations? Is this above our current intelligence?</p>
<p>Many many unanswered questions to a what all will all a delusional theory at best, yet those in physics may take interest in this concept.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/untested-theory-of-instantaneous-0xy0/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Universal Human Perspective</title>
		<link>http://www.mikestratton.net/2011/06/universal-human-perspective/</link>
		<comments>http://www.mikestratton.net/2011/06/universal-human-perspective/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:08:05 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[blog]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3851</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/universal-human-perspective/">Universal Human Perspective</a></p><p>Human Perspective &#038; The Known Universe<br />
We are just now in the infancy of understanding technology and the world around us. Our feeble human brains can only percieve what is in front of us, the here and now. Our belief system revolves around what we hear, see and feel, and is derived from our inperfect emotionally based need for survival.<br />
<br />
<br />
<br />
This video clearly details how feeble as a human race we really are. For us to continue ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/universal-human-perspective/">Universal Human Perspective</a></p><h2>Human Perspective &#038; The Known Universe</h2>
<p>We are just now in the infancy of understanding technology and the world around us. Our feeble human brains can only percieve what is in front of us, the here and now. Our belief system revolves around what we hear, see and feel, and is derived from our inperfect emotionally based need for survival.
</p>
<p>
<object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/17jymDn0W6U&#038;hl=en_US&#038;fs=1&#038;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/17jymDn0W6U&#038;hl=en_US&#038;fs=1&#038;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object></p>
<p>This video clearly details how feeble as a human race we really are. For us to continue or existence of our race, we must find a way to think beyond what we feel, think and believe to be of time and space&#8230;we must not only understand technology, we must question the path we follow in attaining such technological advances.</p>
<p>The question we must ask ourselves is more of a self assured statement, a statement that increases our need to better understand the world in which we exist. The question we must ask is not &#8220;What is out their&#8221; but more importantly, &#8220;Who am I&#8221;.</p>
<p>Our belief system is delusional at best, and is fueled by our self-satisfying need to survive. It is the very essence of this belief system that must be challanged for ust to advance in the arenas of Science, Technology, and Self-Presevervation.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/universal-human-perspective/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Java &#8211; Pythagorean Triples</title>
		<link>http://www.mikestratton.net/2011/06/java-pythagorean-triples/</link>
		<comments>http://www.mikestratton.net/2011/06/java-pythagorean-triples/#comments</comments>
		<pubDate>Wed, 01 Jun 2011 05:04:41 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[mountain state university]]></category>
		<category><![CDATA[pythagorean triple]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3849</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/06/java-pythagorean-triples/">Java &#8211; Pythagorean Triples</a></p><p>Java &#8211; Pythagorean Triples<br />
Mountain State University Java Assisgnment<br />
Java How to Program: Exercise 4.21 page 165<br />
4.21 (Pythagorean Triples)<br />
4.21 (Pythagorean Triples &#8211; Source Code)<br />
/*<br />
Pythagorean Triple<br />
A right triangle can have sides whose lengths are all integers.<br />
The set of three integer values for the lengths of the sides of a right triangle<br />
is called a Pythagorean Triple. The lengths of three sides must satisfy the relationship that the sum of the<br />
squares of two of the ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/06/java-pythagorean-triples/">Java &#8211; Pythagorean Triples</a></p><h2>Java &#8211; Pythagorean Triples</h2>
<h3>Mountain State University Java Assisgnment</p>
<p>Java How to Program: Exercise 4.21 page 165</h3>
<h4>4.21 (Pythagorean Triples)<br />
4.21 (Pythagorean Triples &#8211; Source Code)</h4>
<p>/*<br />
Pythagorean Triple<br />
A right triangle can have sides whose lengths are all integers.<br />
The set of three integer values for the lengths of the sides of a right triangle<br />
is called a Pythagorean Triple. The lengths of three sides must satisfy the relationship that the sum of the<br />
squares of two of the sides is equal to the square of the hypotenuse.Write an application that displays a table of Pythagorean triples for side1,<br />
side2, and hypotenuse,all no longer than 500. Use a triple-nested for loop that tries all possibilities. This method is an example of &#8220;brute force&#8221; computing. You&#8217;ll learn in more advanced computer science courses that for many interesting<br />
problems there is no known algorithmic approach other than sheer brute force.<br />
Algebra equation for a PythagoreanTriple is:(a*a) + (b*b) = (c*c)<br />
*/<br />
/*<br />
This program will include a counter that does the following(using base3 for<br />
example):<br />
111, 112, 113,<br />
121, 122, 123,<br />
131, 132, 133,<br />
211, 212, 213,<br />
221, 222, 223,<br />
231, 232, 233,<br />
311, 312, 313,<br />
321, 322, 323,<br />
331, 332, 333<br />
Program will need a counter capable of counting 3 lines of base 500<br />
Each time counter is incremented a test for pytha = hypo must be implemented.<br />
*/<br />
import java.util.Scanner; // initialize scanner<br />
public class PythagoreanTriple<br />
{<br />
public static void main( String[] args )<br />
{</p>
<p>for ( int a = 1; a &lt;= 500; a++ )<br />
{<br />
for ( int b = 1; b &lt;= 500; b++ )<br />
{<br />
for ( int c = 1; c &lt;= 500; c++ )<br />
{</p>
<p>if( (a * a) + (b * b) == (c * c) )<br />
{<br />
System.out.printf( &#8220;%d, %d, %d&#8221;, a, b, c );<br />
System.out.println();<br />
} // end if<br />
} // end 3rd loop inside of 2nd loop<br />
} // end 2nd loop inside of first loop<br />
} // end first loop</p>
<p>} // end method main</p>
<p>} // end class PythagoreanTriple</p>
<h4>4.21 (Pythagorean Triples &#8211; CMD Screenshot)<br />
<img src="/images/pythagorean_triples.png" alt="Pythagorean Triples Screenshot" /></h4>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/06/java-pythagorean-triples/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Stanford Engineering Everywhere</title>
		<link>http://www.mikestratton.net/2011/05/stanford-engineering-everywhere/</link>
		<comments>http://www.mikestratton.net/2011/05/stanford-engineering-everywhere/#comments</comments>
		<pubDate>Tue, 17 May 2011 13:37:03 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Stanford Engineering Everywhere]]></category>
		<category><![CDATA[stanford engineering everywhere]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3817</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/stanford-engineering-everywhere/">Stanford Engineering Everywhere</a></p><p>Engineering Department at Stanford University Offering Online Classes For Free<br />
Stanford University is offering a program comparible to MIT&#8217;s OpenCourse. Like MIT&#8217;s OpenCourseWare, you are given access to the exact same class material that students attending and paying for an education at Stanford Universtiy.<br />
Does Stanford University&#8217;s program entitled Stanford Engineering Everywhere (SEE)or MIT&#8217;s OpenCourseWare interest you? <br />
To learn more about Stanford Engineering Everywhere<br />
click here: http://see.stanford.edu/ <br />
To learn more about MIT&#8217;s OpenCourseWare <br />
click here: http://ocw.mit.edu <br ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/stanford-engineering-everywhere/">Stanford Engineering Everywhere</a></p><h3>Engineering Department at Stanford University Offering Online Classes For Free</h3>
<p>Stanford University is offering a program comparible to MIT&#8217;s OpenCourse. Like MIT&#8217;s OpenCourseWare, you are given access to the exact same class material that students attending and paying for an education at Stanford Universtiy.</p>
<p>Does Stanford University&#8217;s program entitled Stanford Engineering Everywhere (SEE)or MIT&#8217;s OpenCourseWare interest you? </p>
<p>To learn more about <a href="http://see.stanford.edu/" target="_blank">Stanford Engineering Everywhere</a><br />
click here: <a href="http://see.stanford.edu/" target="_blank">http://see.stanford.edu/</a> </p>
<p>To learn more about <a href="http://ocw.mit.edu" target="_blank">MIT&#8217;s OpenCourseWare</a> <br />
click here: <a href="http://ocw.mit.edu" target="_blank">http://ocw.mit.edu</a> </p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/stanford-engineering-everywhere/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Java Reference</title>
		<link>http://www.mikestratton.net/2011/05/3813/</link>
		<comments>http://www.mikestratton.net/2011/05/3813/#comments</comments>
		<pubDate>Tue, 17 May 2011 13:34:40 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Java]]></category>
		<category><![CDATA[Mountain State University]]></category>
		<category><![CDATA[java]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3813</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/3813/">Java Reference</a></p><p>Java Reference (Sun Microsystems)<br />
This page is utilized for a reference to Java.<br />
<br />
Url&#8217;s<br />
Java API: http://java.sun.com/javase/7/docs/api/&#160; <br />
Learn the Java Programming Language: http://edu.netbeans.org/bluej&#160;<br />
W3 Schools Tutorial:http://www.w3schools.com/js/default.asp&#160;<br />
Sun Microsystems Official Java Page: http://www.java.com/en&#160; <br />
Join the Sun Developers Network: <br />
http://developers.sun.com/user_registration/whyregister.jsp&#160; <br />
SDN Channel: http://developers.sun.com/channel/&#160; <br />
The NetBeans IDE BlueJ Plugin: <br />
http://edu.netbeans.org/bluej&#160; <br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/3813/">Java Reference</a></p><h2>Java Reference (Sun Microsystems)</h2>
<p>This page is utilized for a reference to Java.</p>
<p></p>
<p><strong>Url&#8217;s</strong></p>
<p>Java API: <br /><a href="http://edu.netbeans.org/bluej" target="_blank">http://java.sun.com/javase/7/docs/api/</a>&nbsp; </p>
<p>Learn the Java Programming Language:<br /> <a href="http://edu.netbeans.org/bluej" target="_blank">http://edu.netbeans.org/bluej</a>&nbsp;</p>
<p>W3 Schools Tutorial:<br /><a href="http://www.w3schools.com/js/default.asp" target="_blank">http://www.w3schools.com/js/default.asp</a>&nbsp;</p>
<p>Sun Microsystems Official Java Page:<br /> <a href="http://www.java.com/en" target="_blank">http://www.java.com/en</a>&nbsp; </p>
<p>Join the Sun Developers Network: <br />
<a href="http://developers.sun.com/user_registration/whyregister.jsp" target="_blank">http://developers.sun.com/user_registration/whyregister.jsp</a>&nbsp; </p>
<p>SDN Channel:<br /> <a href="http://developers.sun.com/channel/" target="_blank">http://developers.sun.com/channel/</a>&nbsp; </p>
<p>The NetBeans IDE BlueJ Plugin: <br />
<a href="http://edu.netbeans.org/bluej" target="_blank">http://edu.netbeans.org/bluej</a>&nbsp; </p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/3813/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Newton Raphson Method</title>
		<link>http://www.mikestratton.net/2011/05/newton-raphson-method/</link>
		<comments>http://www.mikestratton.net/2011/05/newton-raphson-method/#comments</comments>
		<pubDate>Tue, 17 May 2011 13:31:32 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3810</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/newton-raphson-method/">Newton Raphson Method</a></p><p>Newton Raphson Method Derivation from Taylor Series<br />
Follow up to Lecture 6 of Intro to Computers and Programming, via MIT OpenCoarseWare<br />
Refernce: An advanced understanding of Algeberic equations is needed to comprehend this video. This process is much more efficient then utilization of the Biconversion Method. For reference only.<br />
<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/newton-raphson-method/">Newton Raphson Method</a></p><h2>Newton Raphson Method Derivation from Taylor Series</h2>
<p>Follow up to Lecture 6 of Intro to Computers and Programming, via MIT OpenCoarseWare</p>
<p>Refernce: An advanced understanding of Algeberic equations is needed to comprehend this video. This process is much more efficient then utilization of the Biconversion Method. For reference only.
<p><object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/OR9DgzkB4Ag&#038;hl=en_US&#038;fs=1&#038;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/OR9DgzkB4Ag&#038;hl=en_US&#038;fs=1&#038;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/newton-raphson-method/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Bisection Method Algorithm</title>
		<link>http://www.mikestratton.net/2011/05/bisection-method-algorithm/</link>
		<comments>http://www.mikestratton.net/2011/05/bisection-method-algorithm/#comments</comments>
		<pubDate>Tue, 17 May 2011 13:30:43 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[Bisection Method Algorithm]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3808</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/bisection-method-algorithm/">Bisection Method Algorithm</a></p><p>Follow up to Lecture 6 of Intro to Computers and Programming, via MIT OpenCoarseWare<br />
Refernce: An advanced understanding of Algeberic equations is needed to comprehend this video. The Newton Raphson Method is a better function. More then likely only a base understanding of this process will be needed when coding. For reference only.<br />
<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/bisection-method-algorithm/">Bisection Method Algorithm</a></p><p>Follow up to Lecture 6 of Intro to Computers and Programming, via MIT OpenCoarseWare</p>
<p>Refernce: An advanced understanding of Algeberic equations is needed to comprehend this video. The Newton Raphson Method is a better function. More then likely only a base understanding of this process will be needed when coding. For reference only.</p>
<p><object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/Y2AUhxoQ-OQ&#038;hl=en_US&#038;fs=1&#038;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/Y2AUhxoQ-OQ&#038;hl=en_US&#038;fs=1&#038;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/bisection-method-algorithm/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>SQL Data Type Reference</title>
		<link>http://www.mikestratton.net/2011/05/sql-data-type-reference/</link>
		<comments>http://www.mikestratton.net/2011/05/sql-data-type-reference/#comments</comments>
		<pubDate>Tue, 17 May 2011 13:28:58 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[database]]></category>
		<category><![CDATA[microsoft]]></category>
		<category><![CDATA[sql]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3806</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/sql-data-type-reference/">SQL Data Type Reference</a></p><p>Microsoft SQL Database &#8211; Data Types Reference List<br />
The following data types are associated with Microsoft&#8217;s SQL database. Article Source: http://msdn.microsoft.com/en-us/library/aa258271(SQL.80).aspx<br />
<br />
Exact Numerics<br />
Integers<br />
bigintInteger (whole number) data from -2^63 (-9,223,372,036,854,775,808) through 2^63-1 (9,223,372,036,854,775,807).<br />
intInteger (whole number) data from -2^31 (-2,147,483,648) through 2^31 &#8211; 1 (2,147,483,647).<br />
smallintInteger data from -2^15 (-32,768) through 2^15 &#8211; 1 (32,767).<br />
tinyintInteger data from 0 through 255.<br />
bit<br />
bitInteger data with either a 1 or 0 value.<br />
decimal and numeric<br />
decimalFixed precision and scale ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/sql-data-type-reference/">SQL Data Type Reference</a></p><h2>Microsoft SQL Database &#8211; Data Types Reference List</h2>
<p>The following data types are associated with Microsoft&#8217;s SQL database. <br />Article Source: <a href="http://msdn.microsoft.com/en-us/library/aa258271(SQL.80).aspx" target="_blank">http://msdn.microsoft.com/en-us/library/aa258271(SQL.80).aspx</a></p>
<hr />
<h3>Exact Numerics</h3>
<h6><em>Integers</em></h6>
<p><strong>bigint</strong><br />Integer (whole number) data from -2^63 (-9,223,372,036,854,775,808) through 2^63-1 (9,223,372,036,854,775,807).</p>
<p><strong>int</strong><br />Integer (whole number) data from -2^31 (-2,147,483,648) through 2^31 &#8211; 1 (2,147,483,647).</p>
<p><strong>smallint</strong><br />Integer data from -2^15 (-32,768) through 2^15 &#8211; 1 (32,767).</p>
<p><strong>tinyint</strong><br />Integer data from 0 through 255.</p>
<h6><em>bit</em></h6>
<p><strong>bit</strong><br />Integer data with either a 1 or 0 value.</p>
<h6><em>decimal and numeric</em></h6>
<p><strong>decimal</strong><br />Fixed precision and scale numeric data from -10^38 +1 through 10^38 –1. </p>
<p><strong>numeric</strong><br />Functionally equivalent to decimal.</p>
<h6><em>money and smallmoney</em></h6>
<p><strong>money</strong><br />Monetary data values from -2^63 (-922,337,203,685,477.5808) through 2^63 &#8211; 1 (+922,337,203,685,477.5807), with accuracy to a ten-thousandth of a monetary unit.</p>
<p><strong>smallmoney</strong><br />Monetary data values from -214,748.3648 through +214,748.3647, with accuracy to a ten-thousandth of a monetary unit.</p>
<hr />
<h3>Approximate Numerics</h3>
<p><strong>float</strong><br />Floating precision number data with the following valid values: -1.79E + 308 through -2.23E &#8211; 308, 0 and 2.23E + 308 through 1.79E + 308.</p>
<p><strong>real</strong><br />Floating precision number data with the following valid values: -3.40E + 38 through -1.18E &#8211; 38, 0 and 1.18E &#8211; 38 through 3.40E + 38.</p>
<hr />
<h3>datetime and smalldatetime</h3>
<p><strong>datetime</strong><br />Date and time data from January 1, 1753, through December 31, 9999, with an accuracy of three-hundredths of a second, or 3.33 milliseconds.</p>
<p><strong>smalldatetime</strong><br />Date and time data from January 1, 1900, through June 6, 2079, with an accuracy of one minute.</p>
<hr />
<h3>Character Strings</h3>
<p><strong>char</strong><br />Fixed-length non-Unicode character data with a maximum length of 8,000 characters.</p>
<p><strong>varchar</strong><br />Variable-length non-Unicode data with a maximum of 8,000 characters.</p>
<p><strong>text</strong><br />Variable-length non-Unicode data with a maximum length of 2^31 &#8211; 1 (2,147,483,647) characters.</p>
<hr />
<h3>Unicode Character Strings</h3>
<p><strong>nchar</strong><br />Fixed-length Unicode data with a maximum length of 4,000 characters. </p>
<p><strong>nvarchar</strong><br />Variable-length Unicode data with a maximum length of 4,000 characters. sysname is a system-supplied user-defined data type that is functionally equivalent to nvarchar(128) and is used to reference database object names.</p>
<p><strong>ntext</strong><br />Variable-length Unicode data with a maximum length of 2^30 &#8211; 1 (1,073,741,823) characters.</p>
<hr />
<h3>Binary Strings</h3>
<p><strong>binary</strong><br />Fixed-length binary data with a maximum length of 8,000 bytes.</p>
<p><strong>varbinary</strong><br />Variable-length binary data with a maximum length of 8,000 bytes.</p>
<p><strong>image</strong><br />Variable-length binary data with a maximum length of 2^31 &#8211; 1 (2,147,483,647) bytes.</p>
<hr />
<h3>Other Data Types</h3>
<p><strong>cursor</strong><br />A reference to a cursor.</p>
<p><strong>sql_variant</strong><br />A data type that stores values of various SQL Server-supported data types, except text, ntext, timestamp, and sql_variant.</p>
<p><strong>table</strong><br />A special data type used to store a result set for later processing .</p>
<p><strong>timestamp</strong><br />A database-wide unique number that gets updated every time a row gets updated.</p>
<p><strong>uniqueidentifier</strong><br />A globally unique identifier (GUID).</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/sql-data-type-reference/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MIT Python Programming #2</title>
		<link>http://www.mikestratton.net/2011/05/mit-python-programming-2/</link>
		<comments>http://www.mikestratton.net/2011/05/mit-python-programming-2/#comments</comments>
		<pubDate>Tue, 17 May 2011 13:20:58 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>
		<category><![CDATA[python]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3798</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-2/">MIT Python Programming #2</a></p><p>Lecture 2: Operators and operands; statements; branching, conditionals, and iteration Instructors<br />
&#160;<br />
Massachusetts Institute of Technology: Introduction to Computer Science and Programming<br />
<br />
Introduction to Computer Science &#38; Programming Class Notes<br />
Primitive Data &#8211; 3 Types (Numbers, Strings, Booleans).<br />
No matter how complex a data structure you create, fundementally at there<br />
basis you will find some combination of NUMBERS, STRINGS, and BOOLEANS.<br />
Associated with every primitive value is a type.<br />
Strings: Strings<br />
Numbers: Integers, Floats<br />
Booleans: True, False<br />
Operands and ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-2/">MIT Python Programming #2</a></p><h2>Lecture 2: Operators and operands; statements; branching, conditionals, and iteration Instructors</h2>
<p>&nbsp;</p>
<h3>Massachusetts Institute of Technology: Introduction to Computer Science and Programming</h3>
<p><object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/Pij6J0HsYFA&amp;hl=en&amp;fs=1&amp;rel=0" /><param name="allowFullScreen" value="true" /><param name="allowscriptaccess" value="always" /><embed type="application/x-shockwave-flash" width="425" height="344" src="http://www.youtube-nocookie.com/v/Pij6J0HsYFA&amp;hl=en&amp;fs=1&amp;rel=0" allowscriptaccess="always" allowfullscreen="true"></embed></object></p>
<h3>Introduction to Computer Science &amp; Programming Class Notes</h3>
<p>Primitive Data &#8211; 3 Types (Numbers, Strings, Booleans).</p>
<p>No matter how complex a data structure you create, fundementally at there<br />
basis you will find some combination of NUMBERS, STRINGS, and BOOLEANS.</p>
<p>Associated with every primitive value is a type.</p>
<p>Strings: Strings<br />
Numbers: Integers, Floats<br />
Booleans: True, False</p>
<p>Operands and Operators are combined in programmatic expressions(code).</p>
<p>Interpreter evaluates and prints code. A script does not print unless it is<br />
explicit.</p>
<p>The following expression resulted in a Syntax error:<br />
<strong> 3+ &#8216;ab&#8217;</strong><br />
The error<br />
is a SYNTAX error caused by combining 2<br />
different operands.<strong> 3 </strong>is an <strong>number</strong>(integer) and<br />
<strong>&#8216;ab&#8217;</strong> is a <strong>string</strong>(string). The following expression resolves this error:</p>
<p><strong>str(3) + &#8216;ab&#8217;</strong>(Type Conversion)</p>
<p><strong>str(3)</strong> redefines the integer value of 3 as a string. The error is a static semantic error(not syntax as previously stated).<br />
The syntax is ok as we use an operator(plus sign) and an operand(string,<br />
integer), The semantics is the problem because the operator was expecting a<br />
certain kind of structure.</p>
<p>All languages do either strong or weak type checking. Type checking can be<br />
defined as the interpreter validating statements within code meet standards set<br />
in place by such code. All codes offer a range of type checking of weak to<br />
strong.</p>
<p>The class was recorded in 2008 and utilized an older version of Python. An<br />
error was NOT FOUND with the following statement:<br />
<strong>&#8216;a&#8217; &lt; 3</strong><br />
Current version of Python(3.1.1)<br />
found an error within the above line. Python version used in video is an example<br />
of weak type checking as. The reason an error was not found is that the letter a<br />
was interpreted as being binary data(ASCII Standards).</p>
<p>The following statement<br />
<strong>9/5</strong><br />
turned the result<br />
<strong>1</strong>.</p>
<p>Reason being?</p>
<p>The number 9 and 5 are integers. A number with a decimal is a float hence they are to<br />
separate operand values.</p>
<p>The following example:<br />
<strong>3 + 4 * 5</strong></p>
<p>turned the following results:<br />
<strong>23</strong></p>
<p>Cause &#8211; Operators Precedence</p>
<p>Operator Precedence<br />
<strong>**   &gt;&gt;   * /<br />
&gt;&gt;  + -</strong></p>
<p>Exponentiation (**) before multiplication and division ( * / ) before addition<br />
and subtraction ( + &#8211; )</p>
<p>So the expression 3 + 4 * 5 multiplied 4 * 5 = 20 before adding 3 (20 + 3 =<br />
23)</p>
<p>To get the result of 35 we use an exponentiation formatted as follows:<br />
(3 + 4) * 7</p>
<p>When in doubt use parans. (I believe he meant parenthesis)</p>
<p>Variables-<br />
When a certain value is achieved, use a name so that value can be<br />
referred to in other places.</p>
<p>Variables are set using an assignment statement.<br />
Example: <strong>x = 3 * 5</strong></p>
<p><img src="http://mikestratton.net/images/img1.jpg" alt="Code Links to Machine" /></p>
<p>Type of variable &#8211; Gets from value. (7 is an integer, &#8216;xyz&#8217; is a string)</p>
<p>X = 3 (X becomes an integer)</p>
<p>Python (Dynamic Types)</p>
<p>If later in program after defining x = 3  you redefine x = &#8216;abc&#8217;, x then<br />
changes its type back to a string.</p>
<p>This is a really bad idea. Don&#8217;t change types arbitrarily.<br />
<img src="http://mikestratton.net/images/img2.jpg" alt="That was a bad idea!" /></p>
<p>Statements &#8211; Legal commands that language can interpret.</p>
<p>Variables Names &#8211; Important to the statement.</p>
<p>In Python their are approximately 28 keywords that cannot be used as variable<br />
names.</p>
<p>Straight line program<br />
- Sequence of instructions 1 by 1. HTML could be considered an example of this.</p>
<p>Branching Programs<br />
- Can change order of instructions based on some test. (Usually value of variable)</p>
<p>Conditional<br />
<img src="http://mikestratton.net/images/img3.jpg" alt="If? Else:" /></p>
<p>Boolean Combination        (Boolean has 2<br />
values: <strong>True, False</strong>)</p>
<p>(and, or, not)</p>
<p>Example:</p>
<p>if x &lt; y and x &lt;  z print &#8216;x is least&#8217;</p>
<p>elseif y&lt;z: print &#8216;y is least.<br />
else: print &#8216;z is least&#8217;</p>
<p>The above Boolean first tests the values of  y and z to confirm if they<br />
are less then the value of x. If this is True it states to print x is least.<br />
The second line states, What else can I do if the above line turns false? Then tests for the value of y to be less then z and if<br />
the answer is TRUE, it prints &#8216;y is least&#8217;</p>
<p>The last line states print z is least, as all other possibilities of the equation have been exhausted.</p>
<p>Here is another example of the same program, written incorrectly:</p>
<p>if x &lt; y  print &#8216;x is least&#8217;</p>
<p>if y &lt; z print &#8216;y is least&#8217;<br />
if z &lt; x print &#8216;z is least&#8217;</p>
<p>Obviously the first line does not factor in all parts needed to properly run.</p>
<p>Iteration (loops) Note &#8211; Last 10 minutes of class may need to be reviewed.</p>
<p><em>The above is my personal notes in regards to this class to help me in the learning process.</em></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/mit-python-programming-2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Asp.net &#8211; Managing State</title>
		<link>http://www.mikestratton.net/2011/05/asp-net-managing-state/</link>
		<comments>http://www.mikestratton.net/2011/05/asp-net-managing-state/#comments</comments>
		<pubDate>Tue, 17 May 2011 13:19:16 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[C#]]></category>
		<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[Visual Basic]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[microsoft]]></category>
		<category><![CDATA[visual basic]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3796</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/asp-net-managing-state/">Asp.net &#8211; Managing State</a></p><p>Managing State of an ASP.NET Application<br />
<br />
We will focus on the following topics:<br />
Store and Retrieve Application State<br />
Store and Retrieve Session State<br />
Configure Session State Storage<br />
Client Side Cookies for State Storage<br />
<br />
Store and Retrieve Application State<br />
Advanced applications use pieces of data or variables that need to be maintained<br />
over multiple requests or multiple users. This data is known as &#34;STATE&#34;.<br />
Application State is any data that is shared among multiple users of an application.<br />
Application ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/asp-net-managing-state/">Asp.net &#8211; Managing State</a></p><h2>Managing State of an ASP.NET Application</h2>
<p></p>
<p>We will focus on the following topics:<br />
Store and Retrieve Application State<br />
Store and Retrieve Session State<br />
Configure Session State Storage<br />
Client Side Cookies for State Storage</p>
<p></p>
<h3>Store and Retrieve Application State</h3>
<p>Advanced applications use pieces of data or variables that need to be maintained<br />
over multiple requests or multiple users. This data is known as &quot;STATE&quot;.</p>
<p>Application State is any data that is shared among multiple users of an application.</p>
<p>Application State Storage is supplied by .NET Framework = HttpApplication-State<br />
c<em>lass</em> (Resides in System.Web <em>namespace.</em></p>
<p>Every ASP.NET page inherits from the Page <em>class.</em></p>
<p>Synchronize Access to Application State<br />
Multiple users that update information simultaneously&nbsp; could cause corruption<br />
of state. Classic ASP did not offer a way to over come this, but current ASP.NET<br />
offers the ASP.NET Application <em>object. </em>The Application <em>object </em>&nbsp;provides<br />
lock &amp; unlock methods to ensure only a single user can modify stored data at any<br />
given instance at any given time.</p>
<p><strong>Application State Limitations:</strong><br />
<em>Durability</em> &#8211; Lasts only as long as Web Application is running. Information that<br />
needs to persist between app restarts(Server restart for example) should be stored<br />
in a database.<br />
<em>Web Farms</em> &#8211; Not shared across multiple servers. Shared hosting would not properly<br />
store application state where as dedicated hosting would.<br />
<em>Memory</em> &#8211; Server has limited physical memory. Overuse of application state can force<br />
use of virtual memory, and would slow application response time down to an inexcusable<br />
rate.
</p>
<h3>Using Session State</h3>
<p>Managing application-state information is especially challenging utilizing<br />
http.</p>
<p>The web server must first identify a series of requests as coming from some<br />
user. The web server must link these requests with the app state information for<br />
that user.</p>
<p>Classis asp met these challenges with a session object.</p>
<p>Classic asp session state could not be scaled across multiple servers such as<br />
a web farm.
</p>
<h4>State &amp; Scalability</h4>
<p>The scalability of an application is impacted greatly by where you choose to<br />
store store state information. Scalability refers to the ability of an<br />
application to service requests from an increasing number of users without a<br />
decrease in performance.</p>
<p><strong>The following conditions negatively affect application scalability:</p>
<p></strong><em>Failure to Disable Session State &#8211; </em>If not in use disable via<br />
the web.config vile with Visual Studio. For limited use insure that pages that<br />
do not use session state include the &quot;enable session state=false&quot; as part of the<br />
@Page directive.</p>
<p><em>Misuse of Application.Lock</p>
<p>Storing references to single(or apartment) threaded objects.</p>
<p>In-Process Session State &#8211; </em>It may be necessary to utilize a web farm to<br />
allow multiple servers to handle requests. In this instance set application<br />
session to StateServer or SQLServer.</p>
<p><em>Overuse of session or application storage &#8211; </em>Storing multiple object<br />
references or data sets at application level can exhaust web servers physical<br />
memory.</p>
<h3>Configuring Session State Storage</h3>
<p>* In-process (InProc)<br />
&nbsp;&nbsp; Acts similar to Classic ASP</p>
<p>* Out-of-process (StateServer)<br />
&nbsp;&nbsp; Session state is stored by a server running the ASP.NET state<br />
service.</p>
<p>* SQL Server (SQLServer)<br />
&nbsp;&nbsp; Session state is stored in a Microsoft SQL Server database.</p>
<p>* Cookie less Sessions<br />
&nbsp;&nbsp; This setting maintains state even if browsers do no support<br />
cookies.</p>
<p>* ASP.NET Server Control State<br />
&nbsp;&nbsp;&nbsp; Resolves problems of unstable HTML forms. HTML does maintain<br />
the state of individual from elements, in classic ASP developers would have to<br />
develop work-around for storing HTML form input data. ASP.NET resolved this<br />
problem with server control architecture., All ASP.NET server controls can<br />
maintain there own state through ViewState. In some instances this is enhanced<br />
further with use of browser side scripting such as Ajax or JavaScripts. </p>
<p>By default .net applications will store session state <strong>&quot;in-process&quot;.</strong></p>
<p>&nbsp;</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/asp-net-managing-state/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MIT Python Programming #1</title>
		<link>http://www.mikestratton.net/2011/05/mit-python-programming-1/</link>
		<comments>http://www.mikestratton.net/2011/05/mit-python-programming-1/#comments</comments>
		<pubDate>Tue, 17 May 2011 12:59:59 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3776</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-1/">MIT Python Programming #1</a></p><p>Lesson 1: Goals of the course; what is computation; introduction to data types, operators, and variables<br />
&#160;<br />
Massachusetts Institute of Technology: Introduction to Computer Science and Programming<br />
Instructors: Prof. Eric Grimson, Prof. John Guttag<br />
View the complete course at: http://ocw.mit.edu/6-00F08<br />
License: Creative Commons BY-NC-SA<br />
More information at http://ocw.mit.edu/terms<br />
More courses at http://ocw.mit.edu<br />
<br />
Introduction to Computer Science &#38; Programming Notes<br />
Computational Thinking (Write Code)<br />
Understand Code (Read Code)<br />
Map Problems Into Computation (Analysis &#38; Design)<br />
What is Computation? To better ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-1/">MIT Python Programming #1</a></p><h2>Lesson 1: Goals of the course; what is computation; introduction to data types, operators, and variables</h2>
<p>&nbsp;</p>
<h3>Massachusetts Institute of Technology: Introduction to Computer Science and Programming</h3>
<p>Instructors: Prof. Eric Grimson, Prof. John Guttag</p>
<p>View the complete course at: http://ocw.mit.edu/6-00F08</p>
<p>License: Creative Commons BY-NC-SA</p>
<p>More information at http://ocw.mit.edu/terms</p>
<p>More courses at http://ocw.mit.edu</p>
<p><object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/k6U-i4gXkLM&amp;hl=en&amp;fs=1&amp;rel=0" /><param name="allowFullScreen" value="true" /><param name="allowscriptaccess" value="always" /><embed type="application/x-shockwave-flash" width="425" height="344" src="http://www.youtube-nocookie.com/v/k6U-i4gXkLM&amp;hl=en&amp;fs=1&amp;rel=0" allowscriptaccess="always" allowfullscreen="true"></embed></object></p>
<h3>Introduction to Computer Science &amp; Programming Notes</h3>
<p>Computational Thinking (Write Code)</p>
<p>Understand Code (Read Code)</p>
<p>Map Problems Into Computation (Analysis &amp; Design)</p>
<p>What is Computation? To better answer this question let me first ask you:<br />
What is knowledge?</p>
<p>Their are two types of knowledge:</p>
<ol>
<li>Declarative<br />
<img src="http://mikestratton.net/images/img1.png" alt="Declarative" width="200" height="74" /></li>
<li>Imperative<br />
<img src="http://mikestratton.net/images/img2.png" alt="Imperative" width="200" height="100" /></li>
</ol>
<p><strong>Declarative</strong><br />
Another way to think of a declarative is that&#8230;. it is a statement that defines.</p>
<p>Example: X =  √2<br />
The above statement defines the letter x to be<br />
equivalent to the square root of the number 2. This statement does not tell us<br />
how to find the square root, it only makes a definition.</p>
<p><strong>Imperative</strong><br />
Another way to think of Imperative is a statement that teaches you something, or gives instructions.<br />
Example: IF someone types the number one THEN I want you to PRINT &#8220;1-2-3&#8243;<br />
The above statement gives you a set of instructions to follow, but no declaration is made.</p>
<p>Earliest Computers</p>
<p>The earliest computers were Fixed Program Computers. This means that they had<br />
a piece of circuitry fixed to do something set on a specific set of rules.</p>
<p><strong>Examples:</strong><br />
<em>Calculator</em><br />
<em>Atanasoff</em> &#8211; Developed in 1941 it solved Linear Equations<br />
<em>Turing Bombe (Pronounced BOOM</em> &#8211; Alan Turing designed a computer that broke the German Enigma Codes in WWII.</p>
<p>Imagine a computer that could take the programmatic circuitry of any other computer and instantly run that circuitry within itself.<br />
A simple input from another computer and it would output the results in the same<br />
manner.</p>
<p>That computer exists and it is known as the stored program computer, or<br />
better known as today&#8217;s modern computer.<br />
<img src="http://www.mikestratton.net/images/img3.png" alt="Stored Program Computer" width="450" height="450" /></p>
<p>A computer program is a recipe or sequence of instructions.</p>
<p>Touring Compatibility: Anything done in one programming language can be done<br />
in another programming language.</p>
<p>How do you describe the different types of recipes? Programming language.<br />
Examples: C, Matlap, LISP, Phython.</p>
<p>General questions about languages:<br />
High Level or Low Level?<br />
General or Targeted? (Supports a Broad Range of Apps or a Targeted App)<br />
Interpreted or Compiled?</p>
<p>Interpreted: Source Code(Source Code is the code you wrote) goes directly<br />
into interpreter then outputs results.</p>
<p>Compiled: Source code goes to compiler and/or checker, then creates object<br />
code.</p>
<p>Interpreted Languages are easier to debug but do not run as fast. Compiled<br />
languages execute much faster but are more difficult to debug.</p>
<p>Python is a high level, broad range, interpreted langage.</p>
<p>Programming Code Defined:<br />
Syntax: What are the legal expressions? (&#8220;cat dog boy&#8221;)<br />
Static Semantics: Which expressions make sense? (&#8220;My desk is Susan&#8221;)</p>
<p>Semantics: What is the meaning of the program? (Good programming style is a must)</p>
<p>Python<br />
Values:<br />
Numbers 3(integer)    3.14(floating point)<br />
Strings &#8211; type  &#8216;abc&#8217;    &#8216;def3&#8242;<br />
Operations =,*,-,/<br />
Variables myString = &#8220;Mike Stratton&#8221;</p>
<p><em>The above is my personal notes in regards to this class to help me in the learning process.</em></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/mit-python-programming-1/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Blender Keyboard Shortcuts</title>
		<link>http://www.mikestratton.net/2011/05/blender-keyboard-shortcuts/</link>
		<comments>http://www.mikestratton.net/2011/05/blender-keyboard-shortcuts/#comments</comments>
		<pubDate>Tue, 17 May 2011 12:55:30 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[blog]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3774</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/blender-keyboard-shortcuts/">Blender Keyboard Shortcuts</a></p><p>Simple List of Blender Keyboard Shortcuts<br />
The following list is a quick keyboard shortcut reference list for those that<br />
	use the Blender Open Source 3D Modeling Software.<br />
	<br />
Blender Keyboard Reference<br />
<br />
<br />
0 = Camera<br />
3 = Side View<br />
<br />
<br />
7 = Top View<br />
1 = Front View<br />
<br />
<br />
alt + left click = Free Rotate<br />
s = Resize<br />
<br />
<br />
g = Move<br />
r = Rotate<br />
<br />
<br />
ctrl + d = Duplicate<br />
spacebar = Object ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/blender-keyboard-shortcuts/">Blender Keyboard Shortcuts</a></p><h2>Simple List of Blender Keyboard Shortcuts</h2>
<p>The following list is a quick keyboard shortcut reference list for those that<br />
	use the Blender Open Source 3D Modeling Software.
	</p>
<h3>Blender Keyboard Reference</h3>
<table style="width: 100%">
<tr>
<td>0 = Camera</td>
<td>3 = Side View</td>
</tr>
<tr>
<td>7 = Top View</td>
<td>1 = Front View</td>
</tr>
<tr>
<td>alt + left click = Free Rotate</td>
<td>s = Resize</td>
</tr>
<tr>
<td>g = Move</td>
<td>r = Rotate</td>
</tr>
<tr>
<td>ctrl + d = Duplicate</td>
<td>spacebar = Object Menu</td>
</tr>
<tr>
<td>F12 = Render</td>
<td>Tab = Mesh Table</td>
</tr>
<tr>
<td>a = Select All</td>
<td>right click = Select Point</td>
</tr>
<tr>
<td>shift + right click = Select Multiple</td>
<td>&nbsp;</td>
</tr>
<tr>
<td>&nbsp;</td>
<td>&nbsp;</td>
</tr>
<tr>
<td>&nbsp;</td>
<td>&nbsp;</td>
</tr>
</table>
<p></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/blender-keyboard-shortcuts/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MIT Python Programming #7</title>
		<link>http://www.mikestratton.net/2011/05/mit-python-programming-7/</link>
		<comments>http://www.mikestratton.net/2011/05/mit-python-programming-7/#comments</comments>
		<pubDate>Tue, 17 May 2011 12:53:14 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3771</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-7/">MIT Python Programming #7</a></p><p>Lesson 7: Lists and mutability, dictionaries, pseudocode, introduction to efficiency <br />
<br />
Massachusetts Institute of Technology (Open Course Ware): Introduction to Computer Science and Programming<br />
View the complete course at: http://ocw.mit.edu/6-00F08<br />
<br />
Introduction to Computer Science &#38; Programming Class Notes<br />
Lists and mutability, dictionaries, pseudo code, introduction<br />
to efficiency <br />
Lesson 6 we discussed lists. Lists are mutable.<br />
Ivys [ 1 ] = -15&#160;&#160;&#160; The object 1 within the<br />
Ivys list is now given a value of -15<br />
Ivys = ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-7/">MIT Python Programming #7</a></p><h2>Lesson 7: Lists and mutability, dictionaries, pseudocode, introduction to efficiency </p>
</h2>
<h3>Massachusetts Institute of Technology (Open Course Ware): Introduction to Computer Science and Programming</h3>
<p>View the complete course at: http://ocw.mit.edu/6-00F08</p>
<p><object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/tuRYbBvOMRo&#038;hl=en_US&#038;fs=1&#038;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/tuRYbBvOMRo&#038;hl=en_US&#038;fs=1&#038;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object></p>
<h3>Introduction to Computer Science &amp; Programming Class Notes</h3>
<h4>Lists and mutability, dictionaries, pseudo code, introduction<br />
to efficiency </h4>
<p>Lesson 6 we discussed lists. Lists are mutable.</p>
<p><strong>Ivys [ 1 ] = -15&nbsp;&nbsp;&nbsp; </strong>The object 1 within the<br />
Ivys list is now given a value of -15</p>
<p><strong>Ivys = [ &#39;Yale&#39;, &#39;-1&#39;, &#39;Princeton&#39; ]&nbsp;&nbsp;&nbsp;&nbsp; (</strong>Original<br />
Statement)<br />
<strong>Ivys [ 1 ] = -15<br />
print Ivys<br />
[ &#39;Yale&#39;, -15, &#39;Princeton&#39; ]</strong></p>
<p>Items in a list are objects.<br />
<strong>L1 = [ 1, 2, 3 ]<br />
L2 = L1<br />
print L2<br />
[ 1, 2, 3 ]<br />
L1 [ 0 ] = 4<br />
print L1<br />
[ 4, 2, 3 ]<br />
print L2<br />
[ 4, 2, 3 ]</strong></p>
<p>L1 and L2 are both bound to the same object.</p>
<p><strong>a = 1<br />
b = a<br />
a = 2<br />
print b<br />
1<br />
</strong>Printing b returns 1. Why is this so? In the example of L1 and L2 we<br />
stated that the existing object(list) is defined as 1, 2, 3. We then appended<br />
the object(list) to change the 1 to the integer 4. In the example a and b we<br />
first assigned the value of 1 to the a. We then assigned the same object to b.<br />
(b = a). In the final statement we assigned the value of 2 to a. This was a<br />
assignment different object and not an append to a current object. (L1 L2<br />
example we appended an object within the list).</p>
<p>
<img alt="Mutable Types" height="272" src="http://mikestratton.net/images/mutable_types.png" width="402" /></p>
<h3>Dictionaries</h3>
<p>Like lists, dictionaries are mutable. Like lists they can be heterogeneous.<br />
(contain strings, numbers, other dictionaries, etc)<br />
Unlike lists, they are not ordered.</p>
<p>Generalized Indexing<br />
Every element of a dictionary is a &lt;key, value&gt;<br />
Example:<br />
<strong>if showDicts ( ) :</strong>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Defines a<br />
function<br />
<strong>EtoF = { &#39;one&#39; : &#39;un&#39;, &#39;soccer&#39; : &quot;football&quot; }</strong>&nbsp;&nbsp;&nbsp;&nbsp;<br />
Think of this as English to French.<br />
<strong>print EtoF ( 0 )<br />
&quot;traceback error&#8230;&#8230;&quot;<br />
</strong>Dictionaries are not ordered. Print EtoF ( 0 ) makes a request to print<br />
the first item. Since dictionaries are not ordered their is not first item. </p>
<p><strong>Dictionaries </strong>are <strong>NOT ORDERED.<br />
Lists</strong> &amp;<strong> Strings </strong>are <strong>ORDERED</strong></p>
<p>If you define a value within a list and them make a call to that value a call<br />
is made in a linear fashion.<br />
List = Is my value defined in the first item? What about the second? Third?<br />
Forth? &#8230;&#8230;.etc.</p>
<p>Dictionaries use a &quot;magical&quot; function for finding the value bound by a key.<br />
It is called <strong>HASHING.</strong></p>
<p><strong>Hashing &#8211; </strong>Values can be retrieved in <strong>Constant Time</strong>(stored<br />
in memory). Values attached to keys are found instantly. More on hashing later<br />
in term).</p>
<p>How do you use the idea of functions to organize code? So far this term we<br />
have done this implicitly.</p>
<p>Lets focus on using functions explicitly.<br />
We will do this by:<br />
Finding the length of a hypotenuse of a right triangle.</p>
<p>Pseudo Code<br />
Write a description of the steps to be taken for the code. Simply going to write<br />
what we are going to do.</p>
<p>Pseudo Code &#8211; Hypotenuse Length of a Right Triangle<br />
- input value for base as a float<br />
-&nbsp;&nbsp;&nbsp; &quot;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &quot;&nbsp;&nbsp;&nbsp;<br />
&quot;&nbsp;&nbsp;&nbsp;&nbsp; height&nbsp; &quot;&nbsp;&nbsp;&nbsp; &quot;<br />
- square root of b*b + h*h (solve as float in hypothesis)<br />
- print something out</p>
<p><img alt="Hypotenuse" height="320" src="http://mikestratton.net/images/hypotenuse.jpg" width="400" /></p>
<p>Use pseudo code.<br />
- Write out the steps<br />
- A good programmer will go back and modify pseudo code when it is needed during<br />
programming.<br />
- Use it to define the flow of control. What are the basic modules? What<br />
information needs to be passed between these modules in order to make the code<br />
work?</p>
<p>Efficiency (Orders of Growth)<br />
- Important consideration when designing code.<br />
- Best to use code that works initially then later code can be rewritten to be<br />
more efficient.</p>
<p>Efficiency Example: Google processes 10,000,000,000 pages.</p>
<p>Brute Force Methods are not efficient.</p>
<p>Clever(original) algorithm are difficult to develop. Better to take a problem<br />
and map into a class of algorithms that are familiar.</p>
<p>Efficiency is defined by the algorithm.<br />
Efficiency maps problems into class of algorithms.<br />
Efficiency is a measure of SPACE and TIME.</p>
<p>Space is defined as the amount of memory used.</p>
<p>This course will focus on time.</p>
<p>How long does it take an algorithm to run?<br />
To define the time of the algorithm as this question: What is the # of basic<br />
steps as a function of input size?</p>
<p>Random Access Model<br />
Random access model states that all algorithms are defined as being accessed in<br />
constant time, no matter the data type. <br />
Obviously this is not true but merely a way of representing EFFICIENCY TIME.<br />
Some functions are linear, as well as arithmetic equations are not within<br />
constant time. Use of Random Access Model is for better understanding of<br />
Efficiency Time.</p>
<p>Random Access Model (Define Efficiency Time)<br />
- Best Case (Minimum # Computations)<br />
- Worst Case (Maximum # Computations)<br />
- Expected Case (Average # Computations)</p>
<p>Best practices of measuring Efficiency Time focus on Worst Case analysis.</p>
<p><em>The above is my personal notes in regards to this class to help me in the<br />
learning process.</em></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/mit-python-programming-7/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Joomla Troubleshooting &#8211; Admin Login</title>
		<link>http://www.mikestratton.net/2011/05/joomla-troubleshooting-admin-login/</link>
		<comments>http://www.mikestratton.net/2011/05/joomla-troubleshooting-admin-login/#comments</comments>
		<pubDate>Tue, 17 May 2011 12:49:12 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[joomla]]></category>
		<category><![CDATA[mysql]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3763</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/joomla-troubleshooting-admin-login/">Joomla Troubleshooting &#8211; Admin Login</a></p><p>Joomla Troubleshooting<br />
Joomla Super Administrator Can&#8217;t Login, No Error Message<br />
A volunteer client contacted me in a panic requesting some assistance. They<br />
stated they had decided to only allow users they invite to register to submit<br />
articles and were trying to block any unapproved registration. They had stated<br />
they are not sure what they did, but they could no longer login to their joomla<br />
application, and state they had not changed their password. When trying to login<br />
to Joomla their ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/joomla-troubleshooting-admin-login/">Joomla Troubleshooting &#8211; Admin Login</a></p><h2>Joomla Troubleshooting</h2>
<h3>Joomla Super Administrator Can&#8217;t Login, No Error Message</h3>
<p>A volunteer client contacted me in a panic requesting some assistance. They<br />
stated they had decided to only allow users they invite to register to submit<br />
articles and were trying to block any unapproved registration. They had stated<br />
they are not sure what they did, but they could no longer login to their joomla<br />
application, and state they had not changed their password. When trying to login<br />
to Joomla their was no error stating invalid password or invalid user name, the<br />
web page refreshed to the initial login screen with no further information. They<br />
were positive that they had used the correct user name and password for joomla,<br />
and as well had cookies enabled. &nbsp; </p>
<p>After just a little bit of research here is what I found that they had done:
</p>
<ol>
<li><strong>Logged </strong>into joomla </li>
<li>Clicked on the <strong>Top Menu:</strong> “<strong>Extensions</strong>” &#8211; -&gt; “<strong>Plugins</strong>”
	</li>
<li>Within the <strong>Plugin Manager</strong>: <strong>Right Side Drop Down</strong><br />
	Menu: Selected &quot;<strong>Type</strong>” &#8211; - &gt; &nbsp;“<strong>user</strong>” </li>
<li>Selected: “<strong>Edit – Plugin</strong>” &#8211; - &gt; “<strong>User – Joomla!</strong>”
	</li>
<li><strong>Plugin Edit Page</strong>: Name: “<strong>User – Joomla</strong>!”
	</li>
<li><strong>Radio Box</strong>: “<strong>Enabled</strong>” &#8211; - &gt; “<strong>No</strong>”
	</li>
</ol>
<p>The <strong>default</strong> setting for the <strong>Radio Box</strong> is “<strong>Yes</strong>”.<br />
When changing the Radio box to select “<strong>No</strong>” you are preventing<br />
<strong>ANY JOOMLA USER</strong> from logging in, including the Super<br />
Administrator. This is security feature that will prevent anyone from logging in<br />
to the Joomla interface and is best used when backend .php/MySql development is<br />
taking place. When this plugin is disabled, all changes have to be made via the<br />
MySql Database( phpMyAdmin). &nbsp; </p>
<h4>Here is the resolution: </h4>
<ol>
<li>Login to phpMyAdmin </li>
<li>Click on the database for Joomla on the left. </li>
<li>On the left, scroll down and find the table with the id of “jos_plugins”
	</li>
<li>At the top make sure the tab “Browse” is selected. </li>
<li>Scroll down and find the table entitled: “User – Joomla!” </li>
<li>Click on the Pencil Icon(Edit). </li>
<li>In the Field labeled “published” make sure the value is set to “1” and<br />
	not “0”. &nbsp; </li>
</ol>
<p>Granted that their may be other issues that cause this type of problem that<br />
prevents the super administrator from logging in, but if no errors are received<br />
when logging in, and the user is using the correct user name and password, this<br />
is the first place I would suggest checking. </p>
<p>I also suggested to my client that to increase security they should disable<br />
the login form module and allow me to register users for them, to help increase<br />
security. They agreed and are quite satisfied with the results for doing as<br />
such.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/joomla-troubleshooting-admin-login/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MIT Python Programming #4</title>
		<link>http://www.mikestratton.net/2011/05/mit-python-programming-4/</link>
		<comments>http://www.mikestratton.net/2011/05/mit-python-programming-4/#comments</comments>
		<pubDate>Tue, 17 May 2011 12:46:00 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3758</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-4/">MIT Python Programming #4</a></p><p>Decomposition and abstraction through functions; introduction to recursion <br />
Massachusetts Institute of Technology: Introduction to Computer Science and Programming<br />
<br />
Introduction to Computer Science &#38; Programming Class Notes<br />
In the previous 3 lessons we learned the following in our language:<br />
- Assignment<br />
- Conditionals<br />
- Input/Output<br />
- Looping Constructs (For, While)<br />
Touring Complete: The above fundamentals are enough to write<br />
any program. (This is technically correct, but to use just these would make writing<br />
a program difficult.)<br />
Decomposition &#38; Abstraction<br ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-4/">MIT Python Programming #4</a></p><h2>Decomposition and abstraction through functions; introduction to recursion </h2>
<h3>Massachusetts Institute of Technology: Introduction to Computer Science and Programming</h3>
<p><object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/SXR9CDof7qw&#038;hl=en_US&#038;fs=1&#038;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/SXR9CDof7qw&#038;hl=en_US&#038;fs=1&#038;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object></p>
<h3>Introduction to Computer Science &amp; Programming Class Notes</h3>
<p>In the previous 3 lessons we learned the following in our language:<br />
- Assignment<br />
- Conditionals<br />
- Input/Output<br />
- Looping Constructs (For, While)</p>
<p><strong>Touring Complete: </strong>The above fundamentals are enough to write<br />
any program. (This is technically correct, but to use just these would make writing<br />
a program difficult.)</p>
<p>Decomposition &amp; Abstraction</p>
<p><strong>Decomposition </strong>- A way to give the code structure. Its a way<br />
to break code into modules. Modules that make sense on their own, modules that can<br />
be reused in many places. Modules that isolate components of the process.</p>
<p><strong>Abstraction </strong>- Allows the ability to suppress the details, bury<br />
away specifics of something, and treat composition like a &quot;black box&quot;. Literally<br />
behaves like a mysterious black box. Constructs within black box take input and<br />
give output while suppressing the definition as to how the results are achieved.</p>
<p>Abstraction and decomposition allows us to &quot;abstract&quot; code separately. Separates<br />
from other modules of code.</p>
<p>One mechanism for abstraction is functions.</p>
<p><strong>Functions<br />
</strong>- break up into modules<br />
- suppress details<br />
- create a new &quot;primitive&quot;</p>
<p>The idea of a function is that you capture a common pattern of computation.<br />
Example: A block of code computes a square root. We can capture this block, give<br />
it a name. Details of how square root is computed is surpressed.</p>
<p>This in turn can create a new primitive. Addition and subtraction are examples<br />
of mathematical primitives.</p>
<p>What do you need to build abstractions, and how do you make it so they work together?<br />
Analogy<strong>: </strong>You were hired by PBS to write a 13 hour drama. You decide<br />
to break it up into 13 different sets and hire a writer to write a one hour portion.<br />
Each hour of drama is written great but has absolutely nothing to do with the other<br />
dramas. For this to work correctly you would need a contract with specifications.<br />
You would tell each writer that here is what you need at the <strong>input<br />
</strong>of the drama, and here is what I need at the <strong>output</strong> of<br />
the drama. The details of what happens inside the hour are up to them.</p>
<p>This analogy is exactly what needs to be done within our functions.</p>
<p><strong>Creation of a Function in Python:<br />
</strong>Line 1: def sqrt(x):<br />
##Returns the square root of x, if x is a perfect square.<br />
##Prints an error message and returns None otherwise<br />
Line 2: ans = 0<br />
Line 3: if x &gt;= 0:<br />
Line 4: while ans*ans &lt; x: ans = ans + 1<br />
Line 5: if ans*ans != x:<br />
Line 6: print x, &#39;is not a perfect square&#39;<br />
Line 7: return None<br />
Line 8: else: return ans<br />
Line 9: else:<br />
Line 10: print x, &#39;is a negative number&#39;<br />
Line 11: return None</p>
<p>Line 13: def f(x):<br />
Line 14: x = x + 1<br />
Line 15: return x</p>
<p>Line 1: <strong>def sqrt(x)</strong> Keyword <strong>def.</strong> (Creates a<br />
function) Followed by a name(sqrt stands for square root). <strong>sqrt (x)<br />
</strong>The x defines the formal parameters. In other words if x is given a value<br />
that value within the body of this function, that value will be used anywhere x<br />
is used.<br />
Line 7, 8, 11, 15: Keyword <strong>return. </strong>Return states that when you<br />
get to this point in the computation. Stop the computation. Return the control from<br />
this function and take the value of the next expression (<strong>none, return ans,<br />
return x</strong>) and return that as the value of the whole computation.</p>
<p><strong>None: </strong>Has a special value. None states that their is no value<br />
coming back from this computation. When this returns to the interpreter it doesn&#39;t<br />
print.</p>
<p>Every path ends in a return in this particular code. This is a good program discipline.</p>
<p>Invoke a function by passing in values for the parameters. <br />
Input 16: <strong>sqrt</strong><strong>(16) </strong>This binds the value of x to<br />
16. <strong>This binding is local. Only holds to this procedure.</strong></p>
<p>Local bindings do not affect any global bindings.</p>
<p>When you type things in Python, (Example: type x = 3) you are getting what&#39;s<br />
called global bindings. </p>
<p>Call function: Think of it as creating a local table within the interpreter.<br />
The value of x = 16 is only bound to the table sqrt. When a return is stepped into,<br />
a value is given back to the interpreter and the sqrt table goes away</p>
<p>
<img alt="Local Binding" height="240" src="http://www.mikestratton.net/images/local_binding.jpg" width="320" /></p>
<p>Decomposition? Suppose I wanted to use the square root construct in hundreds<br />
of places in my program. Without a function it would have to be copied everywhere.<br />
Now their is just one simple thing, as we have simply isolated the sqrt function<br />
within that module.</p>
<p>Abstraction? We have part of what we want with abstraction. Abstraction is a<br />
suppression of details.</p>
<p>Lets use what we have learned to solve a problem.</p>
<p><strong>Farmyard Problem<br />
</strong>A farmer has a bunch of pigs and a bunch of chickens.<br />
He walks out into the farmyard and observes 20 heads and 56 legs.<br />
How many pigs and how many chickens does he have?<br />
numP + numC = 20<br />
4* numP + 2* numC = 56</p>
<p>To solve the farmyard problem we will <strong>enumerate &amp; check </strong>the<br />
code. Enumerate &amp; check is known as a <strong>brute force algorithm.</strong> We<br />
will right a little loop that does this.</p>
<p>Farmyard Problem Code: </p>
<p><strong># 1 def solve(numLegs, numHeads): <br />
# 2 for numChicks in range(0, numHeads + 1):<br />
# 3 numPigs = numHeads &#8211; numChicks<br />
# 4 totLegs = 4*numPigs + 2*numChicks <br />
# 5 if totLegs == numLegs:<br />
# 6 return (numPigs, numChicks) <br />
# 7 return (None, None)</strong></p>
<p><strong># 8 def barnYard(): <br />
# 9 heads = int(raw_input(&#39;Enter number of heads: &#39;))&nbsp;&nbsp;&nbsp;&nbsp;<br />
<br />
#10 legs = int(raw_input(&#39;Enter number of legs: &#39;)) <br />
#11 pigs, chickens = solve(legs, heads) <br />
#12 if pigs == None: <br />
#13 print &#39;There is no solution&#39; <br />
#14 else: <br />
#15 print &#39;Number of pigs:&#39;, pigs<br />
#16 print &#39;Number of chickens:&#39;, chickens</strong></p>
<p><strong>Line 1 def solve(numLegs, numHeads): </strong><br />
Defines &quot;solve&quot; as a function. Values are taken from numLegs and numHeads<strong><br />
Line 2 for numChicks in range(0, numHeads + 1):<br />
</strong>For Loop. Use of a tuple. Defines the range(tuple) of the variables to<br />
be used within the function<strong>.<br />
Line 3 numPigs = numHeads &#8211; numChicks<br />
</strong>Defines number of pigs as being num of heads &#8211; num of chickens.(Range is<br />
defined by previous)<strong><br />
Line 4 totLegs = 4*numPigs + 2*numChicks <br />
</strong>Defines the total number of legs as = 4(num Pigs) + 2(num Chicks)<strong><br />
Line 5 if totLegs == numLegs:<br />
</strong>Boolean. Is the Total Legs equivelant to Number legs? True or False?<strong><br />
Line 6 return (numPigs, numChicks) <br />
</strong>If True return the number of Pigs and Number of chickens to the interpreter.<br />
If false go to line 3 until range as defined by tuple in line 2 is exhausted<strong>.<br />
Line 7 return (None, None)<br />
</strong>If boolean returns false until tuple is exhausted, return nothing to interpreter.</p>
<p><strong>Line 8 def barnYard(): <br />
</strong>Defines barnYard as a function.<strong><br />
Line 9 heads = int(raw_input(&#39;Enter number of heads: &#39;))&nbsp;&nbsp;&nbsp;&nbsp;<br />
<br />
</strong>Input take from use input as defined in line 1<strong><br />
Line 10 legs = int(raw_input(&#39;Enter number of legs: &#39;)) <br />
</strong>Input take from use input as defined in line 1<strong><br />
Line 11 pigs, chickens = solve(legs, heads) <br />
</strong>Calls results from solve function<strong><br />
Line 12 if pigs == None: </strong><br />
Boolean True or false? If pigs returned none, then all increments as defined in<br />
tuple in line 2 were exhausted.<strong><br />
Line 13 print &#39;There is no solution&#39; </strong><br />
True: No solution was found as their is not one.<strong><br />
Line 14 else: <br />
</strong>If it was not true it has to be False.<strong><br />
Line 15 print &#39;Number of pigs:&#39;, pigs<br />
</strong>Print to the screen number of pigs<strong><br />
Line 16 print &#39;Number of chickens:&#39;, chickens<br />
</strong>Print to the screen the number of chickens.</p>
<p><strong>Mathematical Equation of Farmyard Problem:<br />
</strong>Line 1&nbsp;&nbsp;&nbsp;&nbsp; 20,56&nbsp; (User Input)<br />
Line 2&nbsp;&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (Tuple<br />
Range: 0 &#8211; 20)<br />
Line 3&nbsp;&nbsp;&nbsp;&nbsp; 20 &#8211; 0 = 20<br />
Line 4&nbsp;&nbsp;&nbsp;&nbsp; 4(20) + 2(0) = 80<br />
Line 5&nbsp;&nbsp;&nbsp;&nbsp; 56 = 80 (Equivalent? True or False)</p>
<p>Line 2&nbsp;&nbsp;&nbsp;&nbsp; 1&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (Tuple<br />
Range: 0 &#8211; 20)<br />
Line 3&nbsp;&nbsp;&nbsp;&nbsp; 20 &#8211; 1 = 19<br />
Line 4&nbsp;&nbsp;&nbsp;&nbsp; 4(19) + 2(1) = 78<br />
Line 5&nbsp;&nbsp;&nbsp;&nbsp; 56 = 78 (Equivalent? True or False)</p>
<p>Line 2&nbsp;&nbsp;&nbsp;&nbsp; 2&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (Tuple<br />
Range: 0 &#8211; 20)<br />
Line 3&nbsp;&nbsp;&nbsp;&nbsp; 20 &#8211; 2 = 18<br />
Line 4&nbsp;&nbsp;&nbsp;&nbsp; 4(18) + 2(2) = 76<br />
Line 5&nbsp;&nbsp;&nbsp;&nbsp; 56 = 78 (Equivalent? True or False)</p>
<p>Line 2&nbsp;&nbsp;&nbsp;&nbsp; 3&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (Tuple<br />
Range: 0 &#8211; 20)<br />
Line 3&nbsp;&nbsp;&nbsp;&nbsp; 20 &#8211; 3 = 17<br />
Line 4&nbsp;&nbsp;&nbsp;&nbsp; 4(17) + 2(3) = 74<br />
Line 5&nbsp;&nbsp;&nbsp;&nbsp; 56 = 78 (Equivalent? True or False)</p>
<p>Line 2&nbsp;&nbsp;&nbsp;&nbsp; 4&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (Tuple<br />
Range: 0 &#8211; 20)<br />
Line 3&nbsp;&nbsp;&nbsp;&nbsp; 20 &#8211; 4 = 16<br />
Line 4&nbsp;&nbsp;&nbsp;&nbsp; 4(19) + 2(4) = 72<br />
Line 5&nbsp;&nbsp;&nbsp;&nbsp; 56 = 78 (Equivalent? True or False)</p>
<p>Line 2 increases to increment by 1 until either line 5 answers true to the Boolean,<br />
or until the range as defined by the Tuple in line 2 is exhausted. This particular<br />
problem turned results as the user input of 20 and 56 has a relevant answer.</p>
<p>Line 2&nbsp;&nbsp;&nbsp;&nbsp; 12&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (Tuple<br />
Range: 0 &#8211; 20)<br />
Line 3&nbsp;&nbsp;&nbsp;&nbsp; 20 &#8211; 12 = 8<br />
Line 4&nbsp;&nbsp;&nbsp;&nbsp; 4(8) + 2(12) = 56<br />
Line 5&nbsp;&nbsp;&nbsp;&nbsp; 56 = 56 (Equivalent? True or False)<br />
Lines 15 &amp; 16&nbsp;&nbsp;&nbsp;&nbsp; Print &#39;8 Chickens&nbsp;&nbsp;&nbsp; 12 Pigs&#39;</p>
<p><strong>Recursion </strong>The idea of recursion is that you take a problem and<br />
break down into a simpler version of the same problem, plus some steps you execute.<br />
- <strong>Base Case </strong>- Simplest possible solution<br />
- <strong>Inductive Step</strong> -Break same problem into a simpler version and<br />
some other steps.</p>
<p>Example: Definition of US natural born citizen: <br />
<strong>(</strong>Base Case) If you are born within the US, you are a US natural<br />
born citizen. <br />
(Inductive Step)<strong> </strong>If you were not born in the United States you<br />
still may be a US natural born citizen even if you were born outside the United<br />
States but only if both of your parents are citizens of the United States, and at<br />
least one parent has lived in the United States.</p>
<p>Example in Code:<br />
Testing a string for a Palindrome<br />
Does it read the same right to left as it does left to right?<br />
Base Case: Does the string have 0 or 1 element in it? Then its a Palindrome.<br />
If it is longer then 1 what do you do?<br />
Check the two end points, are they the same character?<br />
If they are, then you just need to know if everything else in the middle is a Palindrome.</p>
<p>def isPalindrome(s):<br />
&quot;&quot;&quot;Returns True if s is a palindrome and False otherwise&quot;&quot;&quot;<br />
if len(s) &lt;= 1: return True<br />
else: return s[0] == s[-1] and isPalindrome(s[1:-1])</p>
<p><em>(More time needs to be spent within the Python GUI to better utilize class assignment).</em></p>
<p>def fib(x):<br />
&quot;&quot;&quot;Return fibonacci of x, where x is a non-negative int&quot;&quot;&quot;<br />
if x == 0 or x == 1: return 1<br />
else: return fib(x-1) + fib(x-2)</p>
<p>Another example of recursion:<br />
Dating back to the 1500&#39;s:<br />
Fibonacci is the son of Nacci, apparently Nacci was a very friendly man.<br />
Fibonacci Number: Take the sum of the first two numbers to create the total, the<br />
next Fibonacci is the sum of the previous two, next Fibonacci is the sum of the<br />
previous two.<br />
Example (12 + 10 = 22) (10 +22 = 32) (32 + 22 = 54) (22 + 54 = 76) (76 + 54 = 130)<br />
(54 + 130 = 184) etc, etc.<br />
History of this is that Fibonacci was trying to count rabbits. The idea was that<br />
rabbits can mate after one month they have 2 offspring, those offspring then have<br />
offspring, the question was how many rabbits do you have at the end of 1 year, 2<br />
years etc.<br />
<strong>Fibonacci: <br />
Pairs(0) = 1&nbsp;&nbsp; </strong>Pairs from 0<strong> </strong>to 1. (Bought<strong><br />
</strong>2 rabbits!<strong>)<br />
Pairs(1) = 1&nbsp;&nbsp; </strong>Pairs at beginning of month is 1.<br />
<strong>Pairs (n) = Pairs(n-1) + Pairs(n-2)</p>
<p></strong>Fibonacci Code<strong>:<br />
</strong>def fib(x): <br />
&quot;&quot;&quot;Return fibonacci of x, where x is a non-negative int&quot;&quot;&quot;<br />
if x == 0 or x == 1: return 1 <br />
else: return fib(x-1) + fib(x-2) <br />
<em>An in depth review of this is needed before moving forward.</em></p>
<p><em>The above is my personal notes in regards to this class to help me in the<br />
learning process.</em></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/mit-python-programming-4/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MIT Python Programming #5</title>
		<link>http://www.mikestratton.net/2011/05/3754/</link>
		<comments>http://www.mikestratton.net/2011/05/3754/#comments</comments>
		<pubDate>Tue, 17 May 2011 12:42:38 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3754</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/3754/">MIT Python Programming #5</a></p><p>Lesson 5: Floating point numbers, successive refinement, finding roots<br />
Massachusetts Institute of Technology (OpenCoarseWare): Introduction to Computer Science and Programming<br />
View the complete course at: http://ocw.mit.edu/6-00F08<br />
  <br />
Introduction to Computer Science &#38; Programming Class Notes<br />
Floating point numbers, successive refinement, finding roots<br />
Python has 2 types of numbers:<br />
int (integers &#8211; whole numbers)<br />
Arbitrary precision (Long Integer)<br />
The following code displays arbitrary precision:<br />
a = 2**1000<br />
Type a into python and python returs the full answer followed by ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/3754/">MIT Python Programming #5</a></p><h2>Lesson 5: Floating point numbers, successive refinement, finding roots</h2>
<h3>Massachusetts Institute of Technology (OpenCoarseWare): Introduction to Computer Science and Programming</h3>
<p>View the complete course at: http://ocw.mit.edu/6-00F08</p>
<p> <object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/Pfo7r6bjSqI&#038;hl=en_US&#038;fs=1&#038;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/Pfo7r6bjSqI&#038;hl=en_US&#038;fs=1&#038;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object> </p>
<h3>Introduction to Computer Science &amp; Programming Class Notes</h3>
<p>Floating point numbers, successive refinement, finding roots</p>
<p>Python has 2 types of numbers:<br />
int (integers &#8211; whole numbers)<br />
Arbitrary precision (Long Integer)</p>
<p>The following code displays arbitrary precision:<br />
<strong>a = 2**1000<br />
</strong>Type a into python and python returs the full answer followed by the<br />
letter L. L stands for &quot;long integer&quot;. There is a better way for results.<br />
<strong>b = 2**999<br />
</strong>Type b and once again Python returns the &quot;long integer&quot; results.<br />
Type a/b and python displays 2L.<br />
<strong>x = 0.1<br />
</strong>Type x and Python returns: 0.1000000000000001<br />
Python and almost every other modern program language represent numbers using<br />
the<br />
<a href="http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?tp=&amp;isnumber=4610934&amp;arnumber=4610935&amp;punumber=4610933" target="_blank"><br />
IEEE Floating Standard.</a></p>
<p>
<a href="http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?tp=&amp;isnumber=4610934&amp;arnumber=4610935&amp;punumber=4610933" target="_blank"><br />
IEEE 754 Floating Point</a><br />
(A Variant of Scientific Notation &#8211; How to Handle Large Numbers)</p>
<p>Mantissa &#8211; The decimal point of a logarithm.<br />
In the logarithm 1.587264 the Mantissa is 0.587264.</p>
<p>Mantissa is also known as a Significand.</p>
<p>Computers run off of 64 bits.<br />
1 bit sign (Value or No Value 0 1) (Binary)<br />
Base 10: 125 x10(-1)<br />
Base 2:&nbsp;&nbsp; 1.0 x 2-(3)&nbsp;&nbsp;&nbsp; (Binary 0.001</p>
<p>1/10 = 0.1<br />
Base 10: 1 x 10(-1)<br />
Base 2: ???? Their is no binary number that represents 1/10. An infinite<br />
sequence is produced by this equation .00001100110011&#8230;&#8230;.</p>
<p>Base 2 is binary. Numbers are represented as values or no values, or<br />
(on/off). 0/1 <br />
The decimal number 26 would be represented as 00001110 in binary format.</p>
<p>Worry about == on floats.</p>
<p>Example:<br />
<strong>a = math.sqrt(2)&nbsp;&nbsp;&nbsp;&nbsp; </strong>(A equals the square<br />
root of 2).<br />
Type a and python returns 1.41421356 (Approximate value).<br />
Enter this equation into python:<br />
<strong>a * a == 2&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (</strong>Mathematically this<br />
makes sense)<br />
Python returns &#39;False&quot;<br />
The square root of 2 (defined previously) is an approximation to the square<br />
root.<br />
<strong>a * a&nbsp;&nbsp; </strong>Python returns 2.0000004</p>
<p>Never use == to compare floating points.<br />
Never test for equality, rather test for &quot;close enough&quot;.</p>
<p>Ask the following question:<br />
Is the absolute value of a * a &#8211; &lt;e epsilon&nbsp;&nbsp; (Are these two values<br />
within an epsilon of each other? If true then Im going to treat them as equal.<br />
<strong>abs(a*a &#8211; 2.0) &lt; epsilon</strong></p>
<p>Professor stated that when he writes a program dealing with floating point<br />
numbers he introduces a function called &quot;almost equal(or epsilon)&quot; which better<br />
defines the correct values of floating points.</p>
<p>Rather then writing<br />
<strong>x == y&nbsp;&nbsp;&nbsp;&nbsp; </strong>(Two Floating Points)<strong><br />
</strong>He writes<br />
<strong>Near x,y&nbsp;&nbsp;&nbsp; (</strong>Computes it for him)</p>
<p>Solving Problems using computers<br />
Finding the square root of a real number.</p>
<p>Lets pretend our job is to implement a math problem to solve the square root<br />
of a real number.</p>
<p>What are the issues?<br />
- Might not be an exact answer<br />
- Previously we used exhaustive enumeration to enumerate all possibilities and<br />
then returning the results. In this problem you cannot enumerate all guesses.<br />
(real guesses are uncountable).</p>
<p>Guess, check (Previous Farmyard problem guessed possibilities but did not<br />
know if the previous answer was better then the next.)</p>
<p>For the square root of a real number we will <strong>guess, check</strong>,<br />
and <strong>improve.</strong></p>
<p><strong>Guess, Check, Improve</strong></p>
<p>Successive Approximation<br />
<strong>guess = initial guess<br />
for int in range (100):<br />
if f(guess) close enough: return guess<br />
else: guess = better guess<br />
error</strong></p>
<p>Bisection method: Linear arranged space of possible answers. If possible<br />
answer is between 1-100 first guess will be in middle. Guess will be less then<br />
or more then the correct answer. If the correct answer is less then, then all<br />
numbers greater then the guess are counted as incorrect. The next guess is a<br />
guess in the middle of all possible answers.</p>
<p>Another method is now used, called the Newton Ralphson Method.</p>
<p>Newton Ralphson Method better defines numbers with an x &amp; y axis with an<br />
angled curve displaying the spectrum of guesses. First guessing point is marked<br />
and the angle of the curve is used to make contact with the x axis. The point in<br />
the spectrum of guesses is seen to be much closer then the first guess. The only<br />
time that this method DOES NOT work is in instances where the guess is directly<br />
in the middle of the spectrum.</p>
<h3>Newton Ralphson Method<br />
<img alt="Newton Ralphson Method" height="365" src="http://www.mikestratton.net/images/newton_ralphson_method.jpg" width="418" /></h3>
<p><em>The above is my personal notes in regards to this class to help me in the<br />
learning process.</em></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/3754/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MIT Python Programming #3</title>
		<link>http://www.mikestratton.net/2011/05/mit-python-programming-3/</link>
		<comments>http://www.mikestratton.net/2011/05/mit-python-programming-3/#comments</comments>
		<pubDate>Fri, 13 May 2011 09:59:22 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3700</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-3/">MIT Python Programming #3</a></p><p>Lesson 3: Common code patterns: iterative programs<br />
Massachusetts Institute of Technology: Introduction to Computer Science and Programming<br />
View the complete course at: http://ocw.mit.edu/6-00F08<br />
<br />
Introduction to Computer Science &#038; Programming Class Notes<br />
<br />
<br />
Data<br />
Operations<br />
Commands<br />
<br />
<br />
Numbers<br />
+ &#8211; * /<br />
Assignment (Bind a name to a value)<br />
<br />
<br />
Strings<br />
&#160;<br />
input/output (Print)<br />
<br />
<br />
Booleans<br />
and, or<br />
Conditionals (Branches)<br />
<br />
<br />
&#160;<br />
&#160;<br />
Loop Mechanisms (While)<br />
<br />
<br />
Good Programming Style: Use comments. Type discipline ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-3/">MIT Python Programming #3</a></p><h2>Lesson 3: Common code patterns: iterative programs</h2>
<h4>Massachusetts Institute of Technology: Introduction to Computer Science and Programming</h4>
<p>View the complete course at: http://ocw.mit.edu/6-00F08</p>
<p><object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/X6ilT3uUOBo&#038;hl=en&#038;fs=1&#038;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/X6ilT3uUOBo&#038;hl=en&#038;fs=1&#038;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object></p>
<h3>Introduction to Computer Science &#038; Programming Class Notes</h3>
<table style="width: 100%">
<tr>
<td><strong>Data</strong></td>
<td><strong>Operations</strong></td>
<td><strong>Commands</strong></td>
</tr>
<tr>
<td>Numbers</td>
<td>+ &#8211; * /</td>
<td>Assignment (Bind a name to a value)</td>
</tr>
<tr>
<td>Strings</td>
<td>&nbsp;</td>
<td>input/output (Print)</td>
</tr>
<tr>
<td>Booleans</td>
<td>and, or</td>
<td>Conditionals (Branches)</td>
</tr>
<tr>
<td>&nbsp;</td>
<td>&nbsp;</td>
<td>Loop Mechanisms (While)</td>
</tr>
</table>
<p><strong>Good Programming Style: </strong>Use comments. Type discipline (check<br />
types of operands to properly apply correct operations). Descriptive use of good<br />
variable names as a way of documenting code. Testing all possible branches<br />
through a piece of code.</p>
<p><strong>Iterative Programs</strong><br />How to tackle a program in an iteravie manor?<br />
- Choose a variable thats goint to &#8220;count&#8221;.<br />
- Initialize outside of loop<br />
- Set up correct end test (includes variable)<br />
- construct block of code properly. (Variable must change or an infinte loop or error will result).<br />
- What to do when I am done? What is the program to do next?
</p>
<h4>Figure 1.1 Flowchart &#8211; Finding a square root of a perfect square.<br />
<img alt="Flowchart" height="360" src="http://www.mikestratton.net/images/flow_chart.jpg" width="480" /></h4>
<p><strong>Python Code Defined</strong>
</p>
<ol>
<li><strong>x = 16 </strong>&nbsp;&nbsp; (An assignment statement giving the<br />
	value of 16 to X. Value of X could also be defined by user input.)</li>
<li><strong>ans = 0</strong> (Assignment: ans is given a value of 0.)</li>
<li><strong>while ans * ans &lt; = x: </strong>&nbsp;&nbsp; (Loop:&nbsp; While<br />
	ans * ans is less then or equal to x) </li>
<li><strong>ans = ans + 1&nbsp;&nbsp;&nbsp;&nbsp; </strong>(Conditional:<br />
	redefine ans as being ans + 1)</li>
<li><strong>print ans</strong>&nbsp;&nbsp;&nbsp; (Output: Prints the<br />
	appropriate answer, as the answer to the above Boolean was False.</li>
</ol>
<p>Note that this program found the square root of 16 to be 5. This is incorrect<br />
unless you are considering the current state of America&#39;s economy into the<br />
equation.</p>
<p>The following code resolves this problem:</p>
<ol>
<li>x = 16</li>
<li>ans = 0</li>
<li><strong>while ans * ans &lt; x:&nbsp;&nbsp; </strong>This line has been<br />
	changed to &quot;While ans * ans is less then x)</li>
<li>ans = ans + 1</li>
<li>print ans</li>
</ol>
<p>This is the correct way to write the code to find the root of a perfect<br />
square:<br />ans = 0<br />
if x &gt;= 0:<br />
while ans*ans &lt; x:<br />
ans = ans + 1<br />
print &#39;ans =&#39;, ans<br />
if ans*ans != x:<br />
print x, &#39;is not a perfect square&#39;<br />
else: print ans<br />
else: print x, &#39;is a negative number&#39;</p>
<p>Simulate code by hand. This ensures it terminates correctly and gives back a<br />
reasonable answer.</p>
<p><strong>Defensive Programming: </strong>Make sure all possible paths are in<br />
code, and that useful information is being returned for each branch of code.<br />
Make sure path through code does not loop or result in error.</p>
<p>Two things to consider in defensive programming:</p>
<ol>
<li>Write the program under the assumption the user will not necessarily<br />
	give the input program requested.</li>
<li>Write the program under the assumption that not only might the user make<br />
	a mistake but that other parts of the program might make a mistake.</li>
</ol>
<p>Best to use alot of tests to catch something gone wrong then for something to<br />
go wrong and not know.</p>
<p><strong>Exhaustive Enumeration: </strong>Walking through all possible values<br />
or factors within equation, testing everything with the very last line being the<br />
only remaining choice, and the correct answer(anticipated result).</p>
<p><strong>For Loop: </strong><br />for &lt;variable&gt; in &lt;some collection&gt;<br />
Block of Code(instructions)</p>
<p>For Loop Examples:</p>
<p><strong>Without For Loop: </strong></p>
<p>x = 10 </p>
<p>i = 1 </p>
<p>while(i&lt;x): </p>
<p>if x%i == 0: </p>
<p>print &#39;divisor &#39;,i </p>
<p>i = i+1&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &#8212;- This states add 1, with no limits<br />
to constructs.</p>
<p><strong>With For Loop</strong></p>
<p>x = 10 </p>
<p>for i in range(1, x):&nbsp;&nbsp;&nbsp; &#8212;- This example<br />
defines the exact contents of the constructs.</p>
<p>if x%i == 0: </p>
<p>print &#39;divisor &#39;,i </p>
<p></p>
<p><strong>Tuple &#8211; </strong>Ordered sequence of elements.(Instructions)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
-immutable (cannot change it)</p>
<p>Example in Phython:<br />Following<br />test = (1,2,3,4,5)</p>
<p>Computers start counting at 0.</p>
<p>test [0]&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &#8211; Returns the number 1 as<br />
the first entry was the number 1.</p>
<p>test [2]&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &#8211; Returns the number 3</p>
<p>test [10]&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &#8211; Returns an error, as there are not<br />
11 variables defined within the tuple.</p>
<p>test [-1]&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &#8211; Returns the number 5 as the<br />
last element is defined as -1</p>
<p>Slicing:</p>
<p>test [1:3]&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &#8211; Returns 2,3,4&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
Select 1 (up to but not including) 3</p>
<p>test [:3]&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &#8211; Returns 1,2,3&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
Select all up to but not including 3</p>
<p>test [2:]&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &#8211; Returns 3,4,5&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />
Select 2 up to (not defined so select all)</p>
<p></p>
<p><em>The above is my personal notes in regards to this class to help me in the learning process.</em></p>
<p>Note that during the process I &#8220;accidentilly(ha ha)&#8221; crashed Phython. It seems Python can only handle a infinte loop for so long that increases the square root of x so many times. X was defined initially as 256, then redefined as x * x, (print x), redefined as x * x (print x). That&#8217;s what I call bad programming style! : ). Even after I redefined x = 0, it still crashed each time a call for the value of x was requested. It seems that previous assignments of x were kept in cache. Either I am stupid or Phython is stupid, maybe a little of both? (Ha Ha)</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/mit-python-programming-3/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MIT Python Programming #6</title>
		<link>http://www.mikestratton.net/2011/05/mit-python-programming-6/</link>
		<comments>http://www.mikestratton.net/2011/05/mit-python-programming-6/#comments</comments>
		<pubDate>Fri, 13 May 2011 09:56:38 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3697</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-6/">MIT Python Programming #6</a></p><p>Lesson 6: Bisection methods, Newton/Raphson, introduction to lists<br />
<br />
<br />
Massachusetts Institute of Technology (OpenCoarseWare): Introduction to Computer Science and Programming<br />
<br />
View the complete course at: http://ocw.mit.edu/6-00F08<br />
<br />
<br />
<br />
Introduction to Computer Science &#38; Programming Class Notes<br />
Bisection methods, Newton/Raphson, introduction to lists <br />
Speed of Convergence<br />
sqrt(x)<br />
f(guess = guess2 -x<br />
f(guess) = 0<br />
As discussed in lesson 5, the best method to find the answer for<br />
differentiable functions is the Netwon/Ralphson Method.<br />
guess i = guess ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-6/">MIT Python Programming #6</a></p><h2>Lesson 6: Bisection methods, Newton/Raphson, introduction to lists<br />
</h2>
<p></p>
<h3>Massachusetts Institute of Technology (OpenCoarseWare): Introduction to Computer Science and Programming</h3>
<p>
View the complete course at: http://ocw.mit.edu/6-00F08
</p>
<p><object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/hVHqs38fPe8&#038;hl=en_US&#038;fs=1&#038;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/hVHqs38fPe8&#038;hl=en_US&#038;fs=1&#038;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object>
</p>
<h3>Introduction to Computer Science &amp; Programming Class Notes</h3>
<p>Bisection methods, Newton/Raphson, introduction to lists </p>
<p>Speed of Convergence<br />
<strong>sqrt(x)<br />
f(guess = guess2 -x<br />
f(guess) = 0</strong></p>
<p>As discussed in lesson 5, the best method to find the answer for<br />
differentiable functions is the Netwon/Ralphson Method.</p>
<p><strong>guess i = guess i &#8211; f (guess i) / 2 guess i&nbsp;&nbsp; </strong>(the<br />
letter i represents positive.)</p>
<p>Non-Scalar (Tuples &amp; Strings) Also worded as immutable.<br />
Lists are mutable.<br />
Lists differ from strings in two ways one is that strings are immutable, the<br />
other is that the value in lists need not be characters. <br />
Lists can compromise of numbers, characters, strings, they can even contain<br />
other lists.</p>
<p>Examples of lists in Python:<br />
<strong>Techs = [ &#39;MIT&#39;, &#39;Cal Tech&#39; ]<br />
Ivys = [ &#39;Harvard&#39;, &#39;Yale&#39;, &#39;Brown&#39;]<br />
Univs = [&nbsp;&nbsp; ]<br />
</strong>The values in the brackets for each including the empty univs bracket<br />
are objects. The Univs is an empty bracket but this is not equivalent to a value<br />
of none. It has a value, just nothing within that value.</p>
<p><strong>Univs = [ ], univs.append(techs)<br />
</strong>This prints: [ [ &#39;MIT&#39;, &quot;Cal Tech&#39; ] ]<br />
The function defined in this code takes the variable of univs and prints its<br />
current list and places the techs list within its own list.</p>
<p><strong><span class="style1">Objects<br />
</span>Method</strong></p>
<p>Method is a word for a function with a different syntax. (This will be<br />
discussed further in future lessons)</p>
<p><strong>Objects, Methods, Flatten</strong></p>
<p>Flatten<br />
<strong>Univs = Techs + Ivys<br />
</strong>The plus sign turns two separate lists into just one list. Python<br />
printed the following in response to the above input:<br />
[ &#39; MIT&#39;, &#39;Cal Tech&#39;, &#39;Harvard&#39;, &#39;Yale&#39;, &#39;Brown&#39;, ]<br />
The two lists are combined to return one list of five strings(or values as<br />
defined previously within list command)</p>
<p>Follows is a most appropriate function considering a real world problem with<br />
our current list:<br />
<strong>Ivys.remove(&#39;Harvard&#39;)<br />
</strong>This simply states to remove Harvard from the list of Ivy&#39;s.</p>
<p><strong>L = [ &#39;1&#39;, &#39;MIT&#39;,&nbsp; 3.3, [ &#39;a&#39; ] ]<br />
</strong>print L <br />
returned these results:<br />
[ &#39;1&#39;, &#39;MIT&#39;, 3.2999999999999....&#39;, [ &#39;a&#39; ] ]</p>
<p>L.remove ( &#39;MIT&#39; ) (removes MIT_<br />
L [ 0 ]&nbsp;&nbsp;&nbsp; Returns the first value just like strings.<br />
L [ -1 ] Returns the last element(value) of the list, also like strings.</p>
<p><em>The above is my personal notes in regards to this class to help me in the<br />
learning process.</em></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/mit-python-programming-6/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Technical Affiliations &#124; Social Networks</title>
		<link>http://www.mikestratton.net/2011/05/social-networking-websites/</link>
		<comments>http://www.mikestratton.net/2011/05/social-networking-websites/#comments</comments>
		<pubDate>Fri, 13 May 2011 09:54:06 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[blog]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3694</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/social-networking-websites/">Technical Affiliations | Social Networks</a></p><p>Mike Stratton&#8217;s Social Profiles &#038; Technical Affiliations<br />
Microsoft Virtual Business Card: <br />
 https://www.mcpvirtualbusinesscard.com/VBCServer/mikestratton/profile <br />
 Association for Computing Machinery Business Card: <br />
http://member.acm.org/~mstratton<br />
Twitter: <br />
http://twitter.com/WebDesgin <br />
Facebook: <br />
http://www.facebook.com/webdesgin<br />
<br />
YouTube: <br />
http://www.youtube.com/mikeisfree<br />
<br />
Freelancer: <br />
https://www.getafreelancer.com/users/477359.html<br />
<br />
Odesk: <br />
http://www.odesk.com/companies/Integrity-Technology-Specialists_~~301bf74f5ae9e6c6<br />
Linkedin: http://www.linkedin.com/in/nonprofitvolunteer<br />
<br />
Bank of America Small Business Online Community: <br />
http://smallbusinessonlinecommunity.bankofamerica.com/people/intechspecial<br />
Aniboom:http://www.aniboom.com/animator-portfolio/mikestratton<br />
<br />
MSN Money: http://msncaps.fool.com/player/freeits.aspx<br />
<br />
ASP.NET Developers Community:http://forums.asp.net (User Name &#34;intechspecial&#34;)<br />
GURU:http://www.guru.com/Freelancers/intechspecial/819687<br />
<br />
Microsoft Partner Program &#8211; Solution Finder:<br />
https://solutionfinder.microsoft.com/Partners/PartnerDetailsView.aspx?partnerid=d107641f78b14699ae503d57594a3de9<br />
</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/social-networking-websites/">Technical Affiliations | Social Networks</a></p><h2>Mike Stratton&#8217;s Social Profiles &#038; Technical Affiliations</h2>
<p>Microsoft Virtual Business Card: <br />
<a href="https://www.mcpvirtualbusinesscard.com/VBCServer/mikestratton/profile" target="_blank"> https://www.mcpvirtualbusinesscard.com/VBCServer/mikestratton/profile</a> </p>
<p> Association for Computing Machinery Business Card: <br />
<a href="http://member.acm.org/~mstratton" target="_blank">http://member.acm.org/~mstratton</a></p>
<p>Twitter: <br />
<a href="http://twitter.com/WebDesgin" target="_blank">http://twitter.com/WebDesgin</a> </p>
<p>Facebook: <br />
<a href="http://www.facebook.com/webdesgin" target="_blank">http://www.facebook.com/webdesgin</a>
</p>
<p>YouTube: <br />
<a href="http://www.youtube.com/mikeisfree" target="_blank">http://www.youtube.com/mikeisfree</a>
</p>
<p>Freelancer: <br />
<a href="https://www.getafreelancer.com/users/477359.html" target="_blank">https://www.getafreelancer.com/users/477359.html</a>
</p>
<p>Odesk: <a href="http://www.odesk.com/companies/Integrity-Technology-Specialists_~~301bf74f5ae9e6c6" target="_blank"></p>
<p>http://www.odesk.com/companies/Integrity-Technology-Specialists_~~301bf74f5ae9e6c6</a></p>
<p>Linkedin: <br /><a href="http://www.linkedin.com/in/nonprofitvolunteer" target="_blank">http://www.linkedin.com/in/nonprofitvolunteer</a>
</p>
<p>Bank of America Small Business Online Community: <a href="http://smallbusinessonlinecommunity.bankofamerica.com/people/intechspecial" target="_blank"></p>
<p>http://smallbusinessonlinecommunity.bankofamerica.com/people/intechspecial</a></p>
<p>Aniboom:<br /><a href="http://www.aniboom.com/animator-portfolio/mikestratton" target="_blank">http://www.aniboom.com/animator-portfolio/mikestratton</a>
</p>
<p>MSN Money: <br /><a href="http://msncaps.fool.com/player/freeits.aspx" target="_blank">http://msncaps.fool.com/player/freeits.aspx</a>
</p>
<p>ASP.NET Developers Community:<br /><a href="http://forums.asp.net" target="_blank">http://forums.asp.net</a> (User Name &quot;intechspecial&quot;)</p>
<p>GURU:<br /><a href="http://www.guru.com/Freelancers/intechspecial/819687" target="_blank">http://www.guru.com/Freelancers/intechspecial/819687</a>
</p>
<p>Microsoft Partner Program &#8211; Solution Finder:<br /><a href="https://solutionfinder.microsoft.com/Partners/PartnerDetailsView.aspx?partnerid=d107641f78b14699ae503d57594a3de9" target="_blank"></p>
<p>https://solutionfinder.microsoft.com/Partners/PartnerDetailsView.aspx?partnerid=d107641f78b14699ae503d57594a3de9</a></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/social-networking-websites/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Non Profit Volunteer Web Designer</title>
		<link>http://www.mikestratton.net/2011/05/non-profit-volunteer-web-designer/</link>
		<comments>http://www.mikestratton.net/2011/05/non-profit-volunteer-web-designer/#comments</comments>
		<pubDate>Fri, 13 May 2011 09:50:50 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Volunteer Web Designer]]></category>
		<category><![CDATA[volunteer web designer]]></category>
		<category><![CDATA[volunteer web developer]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3692</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/non-profit-volunteer-web-designer/">Non Profit Volunteer Web Designer</a></p><p>Non Profit Volunteer Web Designer<br />
We have offered over 1,400 hours of volunteer web design services for non profits to date. Web Design by MikeStratton.net offers volunteer web design services that meet and exceed your vision of success. Our volunteer web design services are focused on but not limited to:<br />
<br />
Volunteer HTML Web Design<br />
Volunteer Content Management System Design &#038; Development<br />
Volunteer Graphic Design<br />
Volunteer Web Design &#038; Development Consulations focused on industry standards<br />
Volunteer CSS Development<br />
Volunteer Open ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/non-profit-volunteer-web-designer/">Non Profit Volunteer Web Designer</a></p><h3>Non Profit Volunteer Web Designer</h3>
<p>We have offered over 1,400 hours of volunteer web design services for non profits to date. Web Design by MikeStratton.net offers volunteer web design services that meet and exceed your vision of success. Our volunteer web design services are focused on but not limited to:</p>
<ol style="padding-left: 12px;">
<li>Volunteer HTML Web Design</li>
<li>Volunteer Content Management System Design &#038; Development</li>
<li>Volunteer Graphic Design</li>
<li>Volunteer Web Design &#038; Development Consulations focused on industry standards</li>
<li>Volunteer CSS Development</li>
<li>Volunteer Open Source Design, Development, &#038; Customization</li>
</ol>
<p>This is just a short list of the services we have offered to date to non profits that help organizations world wide.</p>
<p>Thank you for letting us help you and your vision of success, and may the future hold much more success for not only our dreams but success for society.</p>
<h2>Non Profit Volunteer Web Designer @ Your Service!</h2>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/non-profit-volunteer-web-designer/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Joomla Web Design &amp; Development</title>
		<link>http://www.mikestratton.net/2011/05/joomla-web-design-development/</link>
		<comments>http://www.mikestratton.net/2011/05/joomla-web-design-development/#comments</comments>
		<pubDate>Fri, 13 May 2011 09:39:00 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Blog]]></category>
		<category><![CDATA[blog]]></category>
		<category><![CDATA[joomla]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3685</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/joomla-web-design-development/">Joomla Web Design &#038; Development</a></p><p>What is Joomla?<br />
Joomla is an award-winning content management system (CMS), which enables you to build Web sites and powerful online applications. Many aspects, including its ease-of-use and extensibility, have made Joomla the most popular Web site software available. Best of all, Joomla is an open source solution that is freely available to everyone.<br />
<br />
What&#8217;s a content management system (CMS)?<br />
A content management system is software that keeps track of every piece of content on your Web site, much ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/joomla-web-design-development/">Joomla Web Design &#038; Development</a></p><h2>What is Joomla?</h2>
<p>Joomla is an award-winning content management system (CMS), which enables you to build Web sites and powerful online applications. Many aspects, including its ease-of-use and extensibility, have made Joomla the most popular Web site software available. Best of all, Joomla is an open source solution that is freely available to everyone.</p>
<p></p>
<h3>What&#8217;s a content management system (CMS)?</h3>
<p>A content management system is software that keeps track of every piece of content on your Web site, much like your local public library keeps track of books and stores them. Content can be simple text, photos, music, video, documents, or just about anything you can think of. A major advantage of using a CMS is that it requires almost no technical skill or knowledge to manage. Since the CMS manages all your content, you don&#8217;t have to.</p>
<p></p>
<h3>What are some real world examples of what Joomla! can do?</h3>
<p>Joomla is used all over the world to power Web sites of all shapes and sizes. For example:</p>
<p>• Corporate Web sites or portals<br />
• Corporate intranets and extranets<br />
• Online magazines, newspapers, and publications<br />
• E-commerce and online reservations<br />
• Government applications<br />
• Small business Web sites<br />
• Non-profit and organizational Web sites<br />
• Community-based portals<br />
• School and church Web sites<br />
• Personal or family homepages</p>
<p></p>
<h3>Who uses Joomla?</h3>
<p>Here are just a few examples of Web sites that use Joomla:</p>
<p>• MTV Networks Quizilla (Social networking) -<br />
<a href="http://www.quizilla.com" target="_blank">http://www.quizilla.com</a> <br />
• IHOP (Restaurant chain) &#8211; <br />
<a href="http://www.ihop.com" target="_blank">http://www.ihop.com</a><br />
• Harvard University (Educational) &#8211; <a href="http://gsas.harvard.edu" target="_blank"><br />
http://gsas.harvard.edu</a> <br />
• Citibank (Financial institution intranet) &#8211; Not publicly accessible <br />
• The Green Maven (Eco-resources) &#8211; <a href="http://www.greenmaven.com" target="_blank"><br />
http://www.greenmaven.com</a> <br />
• Outdoor Photographer (Magazine) &#8211; <a href="http://www.outdoorphotographer.com" target="_blank"><br />
http://www.outdoorphotographer.com</a> <br />
• PlayShakespeare.com (Cultural) &#8211; <a href="http://www.playshakespeare.com" target="_blank"><br />
http://www.playshakespeare.com</a> <br />
• Senso Interiors (Furniture design) &#8211; <a href="http://www.sensointeriors.co.za" target="_blank"><br />
http://www.sensointeriors.co.za</a> </p>
<p>Web Design by MikeStratton.net offers a CMS website package</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/joomla-web-design-development/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MIT Python Programming I</title>
		<link>http://www.mikestratton.net/2011/05/mit-python-programming-i/</link>
		<comments>http://www.mikestratton.net/2011/05/mit-python-programming-i/#comments</comments>
		<pubDate>Fri, 13 May 2011 09:30:46 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3681</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-i/">MIT Python Programming I</a></p><p>Lesson 1: Goals of the course; what is computation; introduction to data types, operators, and variables<br />
<br />
Massachusetts Institute of Technology: Introduction to Computer Science and Programming<br />
Instructors: Prof. Eric Grimson, Prof. John Guttag<br />
<br />
View the complete course at: http://ocw.mit.edu/6-00F08<br />
<br />
License: Creative Commons BY-NC-SA<br />
More information at http://ocw.mit.edu/terms<br />
More courses at http://ocw.mit.edu <br />
<br />
Introduction to Computer Science &#038; Programming Notes<br />
Computational Thinking (Write Code)<br />
Understand Code (Read Code)<br />
Map Problems Into Computation (Analysis &#38; Design)<br />
What is ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/mit-python-programming-i/">MIT Python Programming I</a></p><h2>Lesson 1: Goals of the course; what is computation; introduction to data types, operators, and variables</h2>
<p></p>
<h3>Massachusetts Institute of Technology: Introduction to Computer Science and Programming</h3>
<p>Instructors: Prof. Eric Grimson, Prof. John Guttag<br />
<br /><br/><br />
View the complete course at: http://ocw.mit.edu/6-00F08<br />
<br/><br/><br />
License: Creative Commons BY-NC-SA<br/><br />
More information at http://ocw.mit.edu/terms<br/><br />
More courses at http://ocw.mit.edu </p>
<p><object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/k6U-i4gXkLM&#038;hl=en&#038;fs=1&#038;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/k6U-i4gXkLM&#038;hl=en&#038;fs=1&#038;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object></p>
<h3>Introduction to Computer Science &#038; Programming Notes</h3>
<p>Computational Thinking (Write Code)</p>
<p>Understand Code (Read Code)</p>
<p>Map Problems Into Computation (Analysis &amp; Design)</p>
<p>What is Computation? To better answer this question let me first ask you:<br />
What is knowledge?</p>
<p>Their are two types of knowledge:</p>
<ol>
<li>Declarative<br /><img alt="Declarative" height="74" src="http://www.mikestratton.net/images/img1.png" width="200" /></li>
<li>Imperative<br /><img alt="Imperative" height="100" src="http://www.mikestratton.net/images/img2.png" width="200" /></li>
</ol>
<p><strong>Declarative</strong><br />Another way to think of a declarative is that&#8230;. it is a statement that defines.<br /> <br />
Example: X =&nbsp; √2 <br />The above statement defines the letter x to be<br />
equivalent to the square root of the number 2. This statement does not tell us<br />
how to find the square root, it only makes a definition.</p>
<p><strong>Imperative</strong><br />Another way to think of Imperative is a statement that teaches you something, or gives instructions.<br />
Example: IF someone types the number one THEN I want you to PRINT &#8220;1-2-3&#8243;<br />
The above statement gives you a set of instructions to follow, but no declaration is made.</p>
<p>Earliest Computers</p>
<p>The earliest computers were Fixed Program Computers. This means that they had<br />
a piece of circuitry fixed to do something set on a specific set of rules.</p>
<p><strong>Examples:</strong><br />
<em>Calculator</em><br />
<em>Atanasoff</em> &#8211; Developed in 1941 it solved Linear Equations<br />
<em>Turing Bombe (Pronounced BOOM</em> &#8211; Alan Turing designed a computer that broke the German Enigma Codes in WWII.</p>
<p>Imagine a computer that could take the programmatic circuitry of any other computer and instantly run that circuitry within itself.<br />
A simple input from another computer and it would output the results in the same<br />
manner.</p>
<p>That computer exists and it is known as the stored program computer, or<br />
better known as today&#39;s modern computer.<br /><img alt="Stored Program Computer" height="450" src="http://www.mikestratton.net/images/img3.png" width="450" /></p>
<p>A computer program is a recipe or sequence of instructions.</p>
<p>Touring Compatibility: Anything done in one programming language can be done<br />
in another programming language.</p>
<p>How do you describe the different types of recipes? Programming language.<br />
Examples: C, Matlap, LISP, Phython.</p>
<p>General questions about languages:<br />High Level or Low Level?<br />
General or Targeted? (Supports a Broad Range of Apps or a Targeted App)<br />
Interpreted or Compiled?</p>
<p>Interpreted: Source Code(Source Code is the code you wrote) goes directly<br />
into interpreter then outputs results.</p>
<p>Compiled: Source code goes to compiler and/or checker, then creates object<br />
code.</p>
<p>Interpreted Languages are easier to debug but do not run as fast. Compiled<br />
languages execute much faster but are more difficult to debug.</p>
<p>Python is a high level, broad range, interpreted langage.</p>
<p>Programming Code Defined:<br />Syntax: What are the legal expressions? (&#8220;cat dog boy&#8221;)<br />Static Semantics: Which expressions make sense? (&#8220;My desk is Susan&#8221;)<br />
<br />Semantics: What is the meaning of the program? (Good programming style is a must)</p>
<p>Python<br />Values:<br />
Numbers 3(integer)    3.14(floating point)<br />
Strings &#8211; type  &#8216;abc&#8217;    &#8216;def3&#8242;<br />
Operations =,*,-,/<br />
Variables myString = &#8220;Mike Stratton&#8221;</p>
<p><em>The above is my personal notes in regards to this class to help me in the learning process.</em></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/mit-python-programming-i/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Chump Gets Psychiatric Help &#8211; Expression Blend</title>
		<link>http://www.mikestratton.net/2011/05/chump-gets-psychiatric-help-expression-blend/</link>
		<comments>http://www.mikestratton.net/2011/05/chump-gets-psychiatric-help-expression-blend/#comments</comments>
		<pubDate>Fri, 13 May 2011 09:27:12 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[microsoft]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3679</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/chump-gets-psychiatric-help-expression-blend/">Chump Gets Psychiatric Help &#8211; Expression Blend</a></p><p>Chump Gets Help<br />
In this episdoe our hero seeks professional help from a psychologist. As this video clearly states, the psychologist has no eyes and is blinded by his own inequities. He offers a persona of that of a band aid, and has become so lost in his twisted perception that not only can is he unable to fix himself, he is blinded by his own suave way of seeing and not seeing things..<br />
In a psychotic and sadistic twist ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/chump-gets-psychiatric-help-expression-blend/">Chump Gets Psychiatric Help &#8211; Expression Blend</a></p><h2>Chump Gets Help</h2>
<p>In this episdoe our hero seeks professional help from a psychologist. As this video clearly states, the psychologist has no eyes and is blinded by his own inequities. He offers a persona of that of a band aid, and has become so lost in his twisted perception that not only can is he unable to fix himself, he is blinded by his own suave way of seeing and not seeing things..</p>
<p>In a psychotic and sadistic twist of fate, the counselor transfers his own inequities and perceptions on to Chump the Super Hero. Chump will have none of it, and puts the blame where blame is do, and goes into an uncontrollable rage after dealing with such pyschologists inequities. After the session, Chump the Super Hero feels demoralized and violated, and the psychologist reports as to the gravity of Chumps severe psychotic mental state of mind.</p>
<p> <object width="480" height="385"><param name="movie" value="http://www.youtube-nocookie.com/v/CVSu4cb1yUg&amp;hl=en_US&amp;fs=1?rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/CVSu4cb1yUg&amp;hl=en_US&amp;fs=1?rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="480" height="385"></embed></object></p>
<p>Chump the Super Hero forgives, but trust is an issue when a person feels violated. Transferrence or paranoia, fact or fiction, Chump the Super Hero speaks his mind, irregardless of your perception of the facts.</p>
<h1>Chump the Super Hero Seeks Psychological Help!</h1>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/chump-gets-psychiatric-help-expression-blend/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Chump the Super Hero &#8211; Expression Blend</title>
		<link>http://www.mikestratton.net/2011/05/expression-blend/</link>
		<comments>http://www.mikestratton.net/2011/05/expression-blend/#comments</comments>
		<pubDate>Fri, 13 May 2011 09:24:15 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[microsoft]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3676</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/expression-blend/">Chump the Super Hero &#8211; Expression Blend</a></p><p>Expression Blend Silverlight Animation<br />
Chump the Super Hero is being designed and developed with use of Microsft Expression Blend. The expression blend interface allows for designers with limited knowledge of code to create animations, although a base understanding of XAML, java script, html, and css is needed to reach animations full potential within an html page. To increase functionality of silverlight application, extensive knowledge of Visual Basic and/or Visual C#, is needed. <br />
Design process is as follows: Expression design ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/expression-blend/">Chump the Super Hero &#8211; Expression Blend</a></p><h2>Expression Blend Silverlight Animation</h2>
<p>Chump the Super Hero is being designed and developed with use of Microsft Expression Blend. The expression blend interface allows for designers with limited knowledge of code to create animations, although a base understanding of XAML, java script, html, and css is needed to reach animations full potential within an html page. To increase functionality of silverlight application, extensive knowledge of Visual Basic and/or Visual C#, is needed. </p>
<p>Design process is as follows: Expression design is utilized to create backdrops, images, and XAML files. Expression blend is used to create animations. Visual Studio is used for HTML and CSS of Silverlight website, and to make changes within XAML. After the design of the silverlight animation, a screen recorder is utilized and the animation is recorder into a video format. Audio is recorded seperately, and then merged with video. Video uploaded to youtube.com for exposure and wahla! Chump the Super Hero is born!</p>
<p>Chume the Super Hero is a work in progress, with more vidoes to be posted here over time, thank you for your anticipation of upcoming Chump the Super Hero stories!</p>
<h3>Chump The Super Hero is Born!</h3>
<p><object width="425" height="344"><param name="movie" value="http://www.youtube-nocookie.com/v/DGnhGh4Dlxc&#038;hl=en&#038;fs=1&#038;rel=0"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube-nocookie.com/v/DGnhGh4Dlxc&#038;hl=en&#038;fs=1&#038;rel=0" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object></p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/expression-blend/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Massachusetts Institute of Technology</title>
		<link>http://www.mikestratton.net/2011/05/3672/</link>
		<comments>http://www.mikestratton.net/2011/05/3672/#comments</comments>
		<pubDate>Fri, 13 May 2011 09:20:52 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[MIT OpenCourseWare]]></category>
		<category><![CDATA[mit opencourseware]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3672</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/3672/">Massachusetts Institute of Technology</a></p><p>Massachusetts Institute of Technology OpenCourseWare<br />
Some of us that lack the capabilities either financial or otherwise to succeed at a university. All of us have the ability to advance ourselves both within education and technology thanks to the current digital age of information systems.<br />
MIT&#8217;s Open Course Ware gives us the ability to do what previously was impossible, which is, learn from MIT for free<br />
What is MIT OpenCourseWare? <br />
MIT OpenCourseWare is a free publication of MIT course materials ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/3672/">Massachusetts Institute of Technology</a></p><h2>Massachusetts Institute of Technology OpenCourseWare</h2>
<p>Some of us that lack the capabilities either financial or otherwise to succeed at a university. All of us have the ability to advance ourselves both within education and technology thanks to the current digital age of information systems.</p>
<p>MIT&#8217;s Open Course Ware gives us the ability to do what previously was impossible, which is, learn from MIT for free</p>
<p>What is MIT OpenCourseWare? <br />
MIT OpenCourseWare is a free publication of MIT course materials that reflects almost all the undergraduate and graduate subjects taught at MIT.</p>
<ul>
<li>OCW is not an MIT education.</li>
<li>OCW does not grant degrees or certificates.</li>
<li>OCW does not provide access to MIT faculty.</li>
<li>Materials may not reflect entire content of the course.</li>
</ul>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/3672/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Volunteer Web Design Request</title>
		<link>http://www.mikestratton.net/2011/05/volunteer-web-design-request/</link>
		<comments>http://www.mikestratton.net/2011/05/volunteer-web-design-request/#comments</comments>
		<pubDate>Fri, 13 May 2011 08:51:49 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[Volunteer Web Designer]]></category>
		<category><![CDATA[volunteer web designer]]></category>
		<category><![CDATA[volunteer web developer]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3667</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/volunteer-web-design-request/">Volunteer Web Design Request</a></p><p>Volunteer Web Designer @ Your Service<br />
If Web Design by MikeStratton.net could offer only free web design services to help people in need, we most certainly would.Without an occassional paying client we must cut back on our free web design services. If Web Design by MikeStratton.net never becomes successful on a financial level, at the very least Web Design by MikeStratton.net is successful as a volunteer web designer.<br />
As your volunteer, it is most certainly not a demand that you ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/volunteer-web-design-request/">Volunteer Web Design Request</a></p><h3>Volunteer Web Designer @ Your Service</h3>
<p>If Web Design by MikeStratton.net could offer only free web design services to help people in need, we most certainly would.Without an occassional paying client we must cut back on our free web design services. If Web Design by MikeStratton.net never becomes successful on a financial level, at the very least Web Design by MikeStratton.net is successful as a volunteer web designer.</p>
<p>As your volunteer, it is most certainly not a demand that you assist us in finding a paying client, merely a simple request. If you are able to pay for a portion of our volunteer web design services, we will accept this as well. Without the financial support of occassional paying clients, our success will be limited.</p>
<p>If you know of an individual or organization that could utilize our Web Design Services, please do get the word out. If you know of an organization that would be willing to fund our volunteer web design services, please do forward our contact information.</p>
<p>Every penny counts, and we previously accepted $25 for well over 60 hours of work. Our heart is in our committment, and our committment is to find a way to better society.  If the proper funding is put in place, the accomplishments we will acheive are sure to help many.</p>
<p>Funding would allow: Higher quality software to design &#038; develop at a more professional and more proficient level. </p>
<p>We cannot solicit donations, this company is structured as a sole proprietorship. Our only option is to find a sponsor, or to hope that the an occassional paying client will be sent our way.</p>
<p>Our Committent is as Your Volunteer Web Designer.<br />Our Request is as a Company with a dream for giving back to society.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/volunteer-web-design-request/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>ASP.net Starter Kits</title>
		<link>http://www.mikestratton.net/2011/05/asp-net-starter-kits/</link>
		<comments>http://www.mikestratton.net/2011/05/asp-net-starter-kits/#comments</comments>
		<pubDate>Fri, 13 May 2011 08:00:40 +0000</pubDate>
		<dc:creator>Mike</dc:creator>
				<category><![CDATA[.net]]></category>
		<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[asp.net]]></category>
		<category><![CDATA[microsoft]]></category>

		<guid isPermaLink="false">http://mikestratton.net/?p=3652</guid>
		<description><![CDATA[<p><p><a href="http://www.mikestratton.net/2011/05/asp-net-starter-kits/">ASP.net Starter Kits</a></p><p>ASP.net Starter Kits &#038; Open Source Applications<br />
The ASP.NET 2.0 Starter Kits &#038; Open Source Applications are fully functional sample applications to help web developers learn ASP.NET and accomplish common Web development scenarios. When utilized as a line of business web application, they can be expanded on to meet your organizations specific needs. Web Design by MikeStratton.net supports the installation, design and development of the following asp.net starter kits &#038; open source applications<br />
Follows are some examples of Starter Kits ...</p></p><p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.mikestratton.net/2011/05/asp-net-starter-kits/">ASP.net Starter Kits</a></p><h2>ASP.net Starter Kits &#038; Open Source Applications</h2>
<p>The ASP.NET 2.0 Starter Kits &#038; Open Source Applications are fully functional sample applications to help web developers learn ASP.NET and accomplish common Web development scenarios. When utilized as a line of business web application, they can be expanded on to meet your organizations specific needs. Web Design by MikeStratton.net supports the installation, design and development of the following asp.net <a href="http://www.asp.net/community/projects/#microsoft" target="_blank">starter kits</a> &#038; <a href="http://www.asp.net/community/projects/#applications" target="_blank">open source applications</a></p>
<h4>Follows are some examples of Starter Kits and Open Source Applications built upon the asp.net framework.</h4>
<p>PayPal eCommerce: <br />The PayPal-enabled eCommerce Starter Kit is an extensible open source web application that allows you to setup and manage your own ecommerce Web site.</p>
<p>Time Tracker Starter Kit:<br />
A business web application for keeping track of hours spent on a project with the ability to handle multiple resources as well as multiple projects.</p>
<p>Job Site Starter Kit: <br />Job Site Starter Kit is a web application that provides a platform for candidates seeking job and the employers to share their needs. The starter kit demonstrates many new features of ASP.NET 2.0 including themes, master pages, new data controls, membership, roles and profiles.
</p>
<p>Media Library Starter Kit:<br />
The Media Share Library Starter Kit enables you to easily create an application that allows registered users to present a collection of media items (such as movie DVDs, music CDs, books, and more) for other registered users to borrow.</p>
<p>ITracker: Inventory Tracking System<br />
ITracker provides a system to track inventory of any product type. The home page presents a reminder notice should an item’s quantity falls below its reorder point. Items and vendors can be located through search pages. Help pages show you how the sample is built, and hint at how you can extend it for your own specific use.</p>
<p>Employee Info Starter Kit:<br />
This starter kit allows for simple CRUD operations to maintain a company&#8217;s employee information. It is intended to be a guideline for building enterprise level projects, by utilizing new ASP.NET 2.0 and SQL Server 2005 features, as well as latest best coding practices.</p>
<p>Dropthings:<br />
Dropthings is a open source Web 2.0 Ajax Portal that shows the power of several .NET Framework 3.5 technologies. It supports widget based modularized website, drag and drop personalization of content and an open API for widgets. It is the sample featured in the book, &#8220;Building a Web 2.0 Portal with ASP.NET 3.5&#8243; and you can use it as a personal portal, a group website, a public portal or as a dashboard for an enterprise that aggregates services from different systems.</p>
<p>Splendid CRM:<br />
Splendid CRM is a commercial Customer Relationship Management application that offers a free, open-source version as well as a Professional (paid license) version that includes all the database code for enterprise integration.</p>
<p>.NET StockTrader Sample Application:<br />
An End-to-End Sample Application Illustrating Windows Communication Foundation and .NET Enterprise Technologies.<br />
<br />
This application is an end-to-end sample application for .NET Enterprise Application Server technologies. It is a service-oriented application based on Windows Communication Foundation (.NET 3.0) and ASP.NET, and illustrates many of the .NET enterprise development technologies for building highly scalable, rich &#8220;enterprise-connected&#8221; applications. It is designed as a benchmark kit to illustrate alternative technologies within .NET and their relative performance.</p>
<p>The application offers full interoperability with Java Enterprise, including IBM WebSphere&#8217;s Trade 6.1 sample application, and newly provided implementations on Oracle Application Server 10G (OC4J) and Oracle WebLogic Server 10.3 (Oracle implementations included with the download below). As such, the application offers an excellent opportunity for developers to learn about .NET and building interoperable, service-oriented applications.</p>
<p><a href="http://www.mikestratton.net">Northeast Ohio Freelance Web Developer - Ohio Freelance Web Developer</a></p>]]></content:encoded>
			<wfw:commentRss>http://www.mikestratton.net/2011/05/asp-net-starter-kits/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

