Error
  • JHTMLicon not supported. File not found.
  • JHTMLicon not supported. File not found.
  • JHTMLicon not supported. File not found.
  • JHTMLicon not supported. File not found.
  • JHTMLicon not supported. File not found.
  • JHTMLicon not supported. File not found.
  • JHTMLicon not supported. File not found.
  • JHTMLicon not supported. File not found.
  • JHTMLicon not supported. File not found.

bits

I'm a Lumberjack and I'm Okay, Keeping Toasty-Warm Thanks to My Giant Bloody Furnace [Fire]
Wednesday, 15 December 2010 09:00
Those Canadian lumberjacks must know a trick or two about staying warm. While gadgeteers console themselves in heated jackets and Slankets, lumberjacks were out there slapping bits of steel together to create the Bullerjan furnace. Toasty. [Bullerjan via Uncrate] More »


Read more: http://feeds.gawker.com/~r/gizmodo/full/~3/WciHp0gNRcs/im-a-lumberjack-and-im-okay-keeping-toasty+warm-thanks-to-my-giant-bloody-furnace

 
Creating 3D Holographic Videos with Microsoft Kinect [Video]
Sunday, 14 November 2010 18:58
How's this for amazing and slightly spooky? YouTube user okreylos has managed to get inside a Kinect and extract the bits that allow him to create 3D video captures of what the device "sees." More »


Read more: http://feeds.gawker.com/~r/gizmodo/full/~3/0S0ol4wLAcw/creating-3d-holographic-videos-with-microsoft-kinect

 
Base 10 to Binary Converter javascript
Wednesday, 08 September 2010 03:30
Synopsis
this is possibly the simplest toBinary function i've seen/written in javascript without using memory intensive power buiding until loops

Purpose
this function will take any numeric input (stripping out non numeric characters) and convert it into binary


function toBinary( n ) {
n = n.replace(/[^0-9]/,'');
if( !n || n == 0 ) return 0;
//calculate the number of bits required to store the number
var bits = Math.floor( Math.log( Math.pow( 2 , Math.ceil( Math.log( (Number( n ) +1 ) ) / Math.log( 2 ) ) ) ) / Math.log( 2 ) );
var bitArray = new Array();
var bitVal;
var i;

for( i = 0 ; i < bits ; i ++ ) {
bitArray[i] = 0;
//calculate the max value of this bit, make sure it starts as low as possible
bitVal = Math.pow(2,bits-i-1);
if( n >= bitVal) {
bitArray[i] = 1;
n = n - bitVal;
}
}

return bitArray.join("");
}

Read more: http://feeds.dzone.com/~r/dzone/snippets/~3/0GaRyFwDC6I/12185

 


Taxonomy by Zaragoza Online