I Made Krisna's Times

Fun Way to Train the Brain

I Made Krisna — Mon, 15 Mar 2010 15:24:02 +0000

Games is one of many ways to train our brain. Some games like puzzle make our brain work harder than other games, and if you want to get this kind of games just came to funbrain arcade. There you can find many that type of games.

I’ll review about one games i’ve played from funbrain arcade, Tower Blaster. The rule is create a tower as quick as we can before the enemy finished his tower. The tower must be build in ordered blocks and we get a random block on each turn. Each turn we can use the visible random block or use the “?” block is the visible block doesn’t suit our need.

Simple, just it and be quick…. but we must think and some gamble to decide our action.

This way is very can be implemented on children, study hard with books or else make them tired but with this way we can keep their mood to study…

Support Earth Hour, 27 March 2010 8.30 PM

Make a Simple Network using Packet Tracer 5.0

I Made Krisna — Fri, 12 Mar 2010 16:30:06 +0000

Okay this is my new knowledge from a course. Packet Tracer 5.0 by Cisco…

Before the course started better know a little about this software and playing a bit with it. Now, i’m gonna make a simple network topology with Packet Tracer 5.0 I’m just create 3 subnets which connected with 2 routers like below

Then we connect each network nodes with connector, oh i forgot… If you want place a network nodes just look at the bottom left of the application window, you’ll find some like this :

After connecting each nodes it will be like this. And the green indicator show the network already connected but if we look at the router there are red light that because we’re not setting it up yet.

How do we set up the routers…?? Click on the router then choose CLI and Check this out configuration for Router0 first

         --- System Configuration Dialog ---

Continue with configuration dialog? [yes/no]: no

Press RETURN to get started!

Router>en
Router#conf t
Enter configuration commands, one per line.  End with CNTL/Z.
Router(config)#interface FastEthernet0/0
Router(config-if)#ip address 10.151.35.1 255.255.255.0
Router(config-if)#no shutdown

%LINK-5-CHANGED: Interface FastEthernet0/0, changed state to up
Router(config-if)#exit
Router(config)#interface FastEthernet0/1
Router(config-if)#ip address 10.151.34.1 255.255.255.0
Router(config-if)#no shutdown

%LINK-5-CHANGED: Interface FastEthernet0/1, changed state to up
%LINEPROTO-5-UPDOWN: Line protocol on Interface FastEthernet0/1, changed state to up
Router(config-if)#exit
Router(config)#
Router(config)#ip route 10.151.36.0 255.255.255.0 10.151.35.2

And then router1

         --- System Configuration Dialog ---

Continue with configuration dialog? [yes/no]: no

Press RETURN to get started!

Router>en
Router#conf t
Enter configuration commands, one per line.  End with CNTL/Z.
Router(config)#interface FastEthernet0/0
Router(config-if)#ip address 10.151.35.2 255.255.255.0
Router(config-if)#no shutdown

%LINK-5-CHANGED: Interface FastEthernet0/0, changed state to up
%LINEPROTO-5-UPDOWN: Line protocol on Interface FastEthernet0/0, changed state to up
Router(config-if)#exit
Router(config)#interface FastEthernet0/1
Router(config-if)#ip address 10.151.36.1 255.255.255.0
Router(config-if)#no shutdown

%LINK-5-CHANGED: Interface FastEthernet0/1, changed state to up
%LINEPROTO-5-UPDOWN: Line protocol on Interface FastEthernet0/1, changed state to up
Router(config-if)#exit
Router(config)#
Router(config)#ip route 10.151.34.0 255.255.255.0 10.151.35.1

And don’t forget to set-up configuration on the PC, just click and choose Config :: Set Settings and FastEthernet

Example for Left

PC : Settings :: Gateway = 10.151.34.1 (just need gateway), then FastEthernet :: IP = 10.151.34.2, Subnet Mask = 255.255.255.0

Okay wait for a few minutes and you’ll see all indicator turn green…. And try to ping like this (from left PC)

Qen-di :: Recommended Restaurant on Sidoarjo

I Made Krisna — Sat, 06 Mar 2010 11:14:26 +0000

Qen-di, the name was taken from “kendi”, name of some indonesian pottery. This restaurant take the garden resto concepts with exotic local decoration like the combination of Balinese and Sunda.

Where is it? Taman Pinang Indah blok BB4 No 22-24, Sidoarjo, East Java – Indonesia. It located very near with the exit gate of Surabaya-Sidoarjo Toll Road and Gelora Delta Sidoarjo, main soccer stadium of Sidoarjo.

Is it deserve to tried? Of course, i’ve tried it and didn’t disappointing at all. The food so great and the price is cheap. The situation very nice, some of fish ponds before the place, the garden if you want to eat outdoor.

What i’ve tried? First, their special friend chicken, very soft and unique taste, they give a spice on the top of the chicken and it give very great combination. And for beverages, i tried Iced Mocha, wow unexpected like any “mocha” drink i’ve before, they didn’t use ice cream for the mocha. That’s the real mocha….

Finally, i just can say : Excellent!

For you, just go there and find your own culinary experience…

Qen-di Garden Resto and Grill

Taman Pinang Indah blok BB4 No 22-24, Sidoarjo, East Java – Indonesia

View Qen-di Garden Resto and Grill in a larger map

Photo by : http://www.eastjavatraveler.com

Informatics ITS :: Algorithm and Data Structure Labwork I

I Made Krisna — Thu, 04 Mar 2010 05:34:51 +0000

Algorithm and Data Structure Labwork C and D or “Praktikum Algoritma dan Struktur Data” from Informatics Engineering ITS.

First Module of this labwork is C++ Class, learning :

What is class and the difference with structure (struct)
Knowing what needed for creating class
Some word relating with class
Implementing class with C++ programming language

Here is the document

You can also download the document :

Soal Pendahuluan Modul 1 – Class.docx (Mircosoft Word 2007)
Soal Pendahuluan Modul 1 – Class.pdf (PDF Format)

For you, the participants of this course don’t forget to join at our Google Groups.

Subscribe to Praktikum Algoritma dan Struktur Data CD

Email:

Visit this group

Electrical Relay Station Explosion

I Made Krisna — Tue, 02 Mar 2010 14:51:12 +0000

Shocked then Dark!! That’s was happened at February 28, 2010.

Night evening, ordinary day at home…. Then very loud voice heard, “BANG!!” then blackout. A electrical relay station which near my house was exploded. I think it at 7, some people on my neighbourhood came out and want to know what was happended…

My family didn’t take the problems. We’re going to have dinner…. and after come back from dinner the light is on..

Support Earth Hour, 27 March 2010 8.30 PM

I Made Krisna — Tue, 23 Feb 2010 01:21:36 +0000

Supporting Earth Hour is something to be proud of. So show the world you’re taking action on climate change. It’s as simple as using these handy tools and downloads. Your leadership might even inspire others to do the same.

Earth Hour started in 2007 in Sydney, Australia when 2.2 million homes and businesses turned their lights off for one hour to make their stand against climate change. Only a year later and Earth Hour had become a global sustainability movement with more than 50 million people across 35 countries participating. Global landmarks such as the, Sydney Harbour Bridge, The CN Tower in Toronto, The Golden Gate Bridge in San Francisco, and Rome’s Colosseum, all stood in darkness, as symbols of hope for a cause that grows more urgent by the hour.

In March 2009, hundreds of millions of people took part in the third Earth Hour. Over 4000 cities in 88 countries officially switched off to pledge their support for the planet, making Earth Hour 2009 the world’s largest global climate change initiative.

Earth Hour 2010 takes place on Saturday 27 March at 8.30pm (local time) and is a global call to action to every individual, every business and every community throughout the world. It is a call to stand up, to take responsibility, to get involved and lead the way towards a sustainable future. Iconic buildings and landmarks from Europe to Asia to the Americas will stand in darkness. People across the world from all walks of life will turn off their lights and join together in celebration and contemplation of the one thing we all have in common – our planet. So sign up now and let’s make 2010 the biggest Earth Hour yet!.

It’s Showtime! Show the world what can be done.

Microsoft Visual Studio 2010 Ultimate Beta 2

How to use Facebook Chat using Pidgin

I Made Krisna — Sun, 21 Feb 2010 03:26:15 +0000

Good news… for you who are looking the way to chat on facebook but don’t want to open web browser or facebook site. And if you’re using ebuddy or digsby maybe they already have that services.

What if i’m using pidgin? There’s no need to worry…. Just follow this step

Make sure you’re not running pidgin, if it’s running just close it.
Download the facebook chat plugin for pidgin here
I recommend to download .exe if you’re using windows
Install the downloaded file
Run your pidgin again….
Add your facebook account like other account on pidgin

How to Remove “index.php” from CodeIgniter URL

I Made Krisna — Sun, 21 Feb 2010 02:53:59 +0000

CodeIgniter is the one of most famous PHP Framework now. But if we’re using CodeIgniter, by default the URL will be shown as http://localhost/index.php/welcome. Some people doesn’t like this way to accessing a website, the index.php suffix in the URL.

Here is some step that can make us accessing the website using http://localhost/welcome. But we’re also still accessing the url ith index.php suffix. Before, i will list my system so if we’re using different system it may cause different solution.

Apache 2.2.14
PHP 5.2.12

STEP one : create .htaccess file


RewriteEngine On
RewriteBase /

#Removes access to the system folder by users.
#Additionally this will allow you to create a System.php controller,
#previously this would not have been possible.
#‘system’ can be replaced if you have renamed your system folder.
RewriteCond %{REQUEST_URI} ^system.*
RewriteRule ^(.*)$ /index.php/$1 [L]

#Checks to see if the user is attempting to access a valid file,
#such as an image or css document, if this isn’t true it sends the
#request to index.php
RewriteCond %{REQUEST_FILENAME} !-f
RewriteCond %{REQUEST_FILENAME} !-d
#This last condition enables access to the images and css folders, and the robots.txt file
#Submitted by Michael Radlmaier (mradlmaier)
RewriteCond $1 !^(index\.php|images|robots\.txt|css)
RewriteRule ^(.*)$ index.php/$1 [L]



# If we don’t have mod_rewrite installed, all 404’s
# can be sent to index.php, and everything works as normal.
# Submitted by: ElliotHaughin

ErrorDocument 404 /index.php

STEP two : edit CodeIgniter Configuration

$config['index_page'] = "index.php";

$config['index_page'] = "";

That’s all. Go and try that….

Source and References

http://arifn.web.id/blog/2009/02/06/codeigniter-removing-indexphp.html

[ID] Review RPM Konten Multimedia

I Made Krisna — Sat, 13 Feb 2010 14:53:10 +0000

I’m sorry for my reader, this post was written in Indonesian language for avoiding misundersranding perception of word, sentence and meaning of this post. But if you want to read this you can use Google Translate.

Rancangan Peraturan Menteri Tentang Konten Multimedia

Review

[Bab II pasal 3] Penyelenggara dilarang mendistribusikan, mentransmisikan, dan/atau membuat dapat diaksesnya Konten yang menurut peraturan perundang-undangan merupakan: a) Konten Pornografi, b) Konten lain yang menurut hukum tergolong sebagai Konten yang melanggar kesusilaan.
1. Penyelenggara dalam hal ini memiliki tanggung jawab untuk tidak menyebarkan, berarti ISP , penyedia webhosting, dll akan menjadi orang yang bersalah akibat dari pasal ini walaupun mereka tidak tahu apa-apa tentang konten tersebut.
[Bab II pasal 6] silahkan merefer ke dokumen
1. Memperparah review nomor 1 :: penyelenggara harus tahu setiap konten itu benar tidaknya mungkin seperti wikipedia jika seorang author salah memberikan informasi maka ISP pengguna dapat dipersalahkan.
2. Poin b :: tahu sendiri situs-situs yang berbau agama di Indonesia ini seringkali bermuatan SARA (bisa saya buktikan) apakah menkominfo “BERANI” menutup situs itu? saya rasa tidak berani…
[Bab II pasal 7] silahkan merefer ke dokumen
1. Penyelenggara akan dipersalahkan saat muatan privasi seseorang ditembus, seperti saat hacker beroperasi, maka ISP yang digunakan oleh hacker tersebut juga memiliki kesalahan karena membiarkan hacker bisa menembus privasi seseorang
[Bab III pasal 8] Tentang peran penyelenggara silahkan merefer ke dokumen
1. Mungkinkah penyedia layanan dapat menangani seluruh pengguna dibawahnya, misalnya telkom speedy digunakan untuk warnet dan pengguna warnet mengakses situs porno maka matilah itu speedy.
[Bab III pasal 9] Merupakan “PENGEKANGAN” secara langsung terhadap akses kita.
[Bab III pasal 10 (2)] Penyelenggara wajib memastikan bahwa Sistem Elektronik sebagaimana dimaksud pada ayat (1) andal dan aman serta bertanggung jawab sebagaimana diatur dalam peraturan perundang-undangan.
1. Seberapa cerdas software yang dapat dibuat oleh manusia untuk memblokir semua situs berkonten yang dilarang? milik internet sehatpun tidak dapat menjamin / memastikan hal tersebut.
[Bab V pasal 30] Sanksi Administratif
1. Sanksi administratif sebagaimana dimaksud pada ayat (1) berupa teguran tertulis, denda administratif, pembatasan kegiatan usaha, dan/atau pencabutan izin sesuai dengan ketentuan peraturan perundang-undangan.
2. Pengenaan sanksi administratif sebagaimana dimaksud pada ayat (2) tidak menghapuskan pertanggungjawaban pidana.

Demikin tulisan ini saya buat untuk memberikan informasi sisi negatif yang kemungkinan besar muncul dengan tembahan peraturan di negara ini. Mungkin alasan “ini untuk tujuan yang baik” sudah tidak berlaku untuk saya, karena para (ke)aparat hukum di Indonesia ini sudah sangat pintar untuk mempermainkan perundang-undangan.

Semakin banyak perundang-undangan dibuat di Indonesia maka semakin banyak juga yang dapat dipermainkan oleh (ke)aparat hukum. Silahkan dipertimbangkan, tidak ada tali kekang yang akan menjinakkan seekor singa yang ada singa tersebut hanya diam dan menunggu kesempatan untuk membunuh sang pengekang kemudian mendapatkan kembali kebebasannya.

Go Green :: Dark Personality of My Laptop

I Made Krisna — Fri, 12 Feb 2010 10:21:40 +0000

Black mean Green, this is the concepts of green technology when we talk about computer technology…..

Black is this case is the color of any layout which is displayed on the monitor screen. With a lot of black or dark color in our display, we can save some energy without reducing computer performance like if we slowing the computer processor.

First thing that i do is change the color scheme of my windows 7 themes.

Right click on your desktop, then choose personalize
Click on Window Color on the bottom side
Set your color as dark as you like (darkest black recommended)

You also can change your wallpaper with any dark wallpaper, i choose this for my wallpaper [http://img696.imageshack.us/img696/3889/win7pro.jpg]

If you’re mozilla firefox user, try to change your firefox themes to dark too… for me, i choose darkfox themes. You can get that here [http://www.getpersonas.com/en-US/persona/5918]

The last thing that i do for now is change my Microsoft Office 2007 color themes to black. You can follow the step from my references [http://onlineitpro.com/?p=63]. The step just open your Mircosoft Word 2007 (i choose this for example because most people who use MS-Office 2007 installing Word)

Click on Windows Orb (circle logo of windows) on top left of Microsoft Word 2007
Click Word Options on bottom side of pop-up menu
On Popular Tab Look for Color Scheme
Change it to black

Naruto Shippuuden 147 Torrent Download

I Made Krisna — Fri, 12 Feb 2010 07:12:35 +0000

Naruto Shippuuden 147 – Rogue Ninja’s Past

Finally, Utakata’s profile revealed. Rogue Ninja from Hidden Mist… Naruto’s team make a deal with Hidden Mist’s Anbu Black Ops to release Lady Hotaru and temporarly bring Utakata until their mission done.

Download

Download via Torrent Here [[HorribleSubs] Naruto Shippuuden – 147 [720p].mkv.torrent]
1. [HorribleSubs] Naruto Shippuuden – 147 [720p].mkv [235 MB]

Creating Node for Linked List C++ Source Code

I Made Krisna — Thu, 11 Feb 2010 01:54:12 +0000

In this post, i’ll try to create a Node object with C++ Programming Language. Maybe you’ve create this object using java like my previous post in [Creating Linked List on Java I] So we can make the brother of that Java Node with C++

Directly to the source code, i will explain it below….

//Node.h
#ifndef NODE_H
#define NODE_H

#include 
using namespace std;

class Node{
private:
	string info;
public:
	Node* next;
	Node* prev;
public:
	Node(string info);
	string GetInfo();
	void SetInfo(string info);
};

#endif

Okay, let’s start the explaination… Start with

#ifndef NODE_H
#define NODE_H

//Cpp Node.h Code

#endif

This code is use to prevent the compiler including the same type of object or header. #ifndef mean “if not defined”. So if the object already defined, the compiler will just use the old one without defining new header.

#include 
using namespace std;

This code is like “import” when using Java, but there is some differenties. on C++ there are “#include” and “using”. What the different? When in Java, “import” will do “#include” and “using” automatically. In C++ we do it separately, “#include” just bring the header function and else to our code so we can use it. “using” mean we make a shortcut or default library that we’re use. Example : without using we must write std::cout << “String”; but if we use using std::cout; or directly using namespace std; we can just write cout << “String”;

//Node.cpp
#include "Node.h"

#include 
using namespace std;

Node::Node(string info){
	this->SetInfo(info);
	this->next = NULL;
	this->prev = NULL;
}

void Node::SetInfo(string info){
	this->info = info;
}

string Node::GetInfo(){
	return this->info;
}

Finally the code, from the Node.h above, we can create Node.cpp where implementing all of functions from Node.h header. This way (separating header and cpp) will make our code easier to read and simple. There are no significant differenties with Java, just we must remember that new object pointer in C++ is not null. So be careful with Node constructor, make sure the next and prev pointer was set to NULL

Movies :: Daybreakers

I Made Krisna — Wed, 10 Feb 2010 14:06:45 +0000

First thing from this film : “creative”. I said that because this movie’s story about the vampires. Many or almost all of vampires movie have the same main idea, “kill the vampire” or “prevent the end of world because vampires”. In this movie, the world is ruled by vampires.

There’s some past phenomenon that make the world changes. The vampires more than humans, and the vampire’s crisis happended. Blood, which the main food source of vampires going to exhaust. The human is going to extinct. And what the solution of this world??

Download

Download via torrent here [Daybreakers (2009) DVDSCR XviD-MAXSPEED.torrent]
1. Daybreakers (2009) DVDSCR XviD-MAXSPEED www.torentz.3xforum.ro.avi [900 MB]
2. Daybreakers (2009) DVDSCR XviD-MAXSPEED.nfo [2.11 kB]
3. screencaps.jpg [222 kB]
4. Torrent downloaded from Demonoid.com.txt [47 B]
5. Torrent downloaded from Rarbg.com.txt [33 B]
6. Torrent verified and recommended by vertor.com.txt [46 B]
7. tracked_by_h33t_com.txt [23 B]
Download subtitle here [Daybreakers (2009) DVDSCR XviD-MAXSPEED www.torentz.3xforum.ro.srt]

Naruto Shippuuden 146 Torrent Download

I Made Krisna — Wed, 10 Feb 2010 13:47:12 +0000

Naruto Shippuuden 146 – Successor’s Wish

Sense the strange of lady hotaru’s clan behavior, Naruto coming back to the village but lady hotaru already run from the unknown group. Other ninja group also appear to capture utakata, can naruto and his comrades save them?

Download

Download via torrent here [[HorribleSubs] Naruto Shippuuden – 146 [480p].mkv.torrent]
1. [HorribleSubs] Naruto Shippuuden – 146 [480p].mkv [145 MB]

Naruto Shippuuden 145 Torrent Download

I Made Krisna — Wed, 10 Feb 2010 13:38:24 +0000

Naruto Shippuuden 145 – Successor of Forbidden Jutsu

Still telling about the forbidden jutsu successor, she’s betrayed by her clan and come into the danger. Fortunately Utakata, her guardian is coming back to help

Download

Download via torrent here [[GoodAnime.net] Naruto Shippuuden episode – 145 [english sub][480p].avi.torrent]
1. [GoodAnime.net] Naruto Shippuuden episode – 145 [english sub][480p].avi [219 MB]

Buy Printer Stuff and Gadgets Online

I Made Krisna — Tue, 26 Jan 2010 15:44:04 +0000

HP Replacement Printer Ink Cartridges is one of website which sell the printer stuffs. Especially HP Printers… Ink, Catridge, Printers, and many more you can get there. And the most important is the discount! you will save your money when buying at HP Replacement Printer Ink Cartridges and of course like an other online shops, they can ship it for you if your transaction is over $50 FREE!!

Not interseresting about printer stuffs? They also sold online gadgets for you. And the most interesting for me is USBCell AA Rechageable Battery. a AA size battery which can be recharged just with USB plug, very simple…

Just come and look at HP Replacement Printer Ink Cartridges

Naruto Shippuuden 144 Torrent Download

I Made Krisna — Tue, 26 Jan 2010 02:17:19 +0000

Naruto Shippuuden 144 – Wanderer

There some unknown group chasing the clan which allied with hidden leaf (konoha) for the clan’s forbidden jutsu. Naruto and his team assigned by Hokage to rescue and protect that clan and the forbidden jutsu from the unkown group.

Download

Download via torrent here [[Narutoverse]_NARUTO_Shippuden_144.avi.torrent]
1. [Narutoverse]_NARUTO_Shippuden_144.avi [176 MB]

Binary Tree Traverse Java Source Code

I Made Krisna — Fri, 22 Jan 2010 05:23:09 +0000

Traverse is a method for looking the elements of a tree. In this case, it will be Binary Search Tree traverse, it also can be implemented on ordinary binary tree because the concepts of traverse still same. You can use or just look the example of tree (Binary Search Tree) here [Binary Search Tree Java Source Code].

PreOrder Traversal. This kind of traverse use “Look, go Left, go Right” on each nodes or elements of a tree. And will be give result as [F B A D C E G I H] Let’s look at Java Programming Language implementation of this traverse…

    private void printPreOrder(BinaryTreeNode start){
        if (start == null) return;
        System.out.print(start.getInfo()+" ");
        printPreOrder(start.leftChild);
        printPreOrder(start.rightChild);
    }

InOrder Traversal. This kind of traverse use “go Left, Look, go Right” on each nodes or elements of a tree. This traverse can produce sorted result if used on Binary Search Tree. [A B C D E F G H I]

    private void printInOrder(BinaryTreeNode start){
        if (start == null) return;
        printInOrder(start.leftChild);
        System.out.print(start.getInfo()+" ");
        printInOrder(start.rightChild);
    }

PostOrder Traversal. This kind of traverse use “go Left, go Right, Look” on each nodes or elements of a tree. And the result is : [A C E D B H I G F]

    private void printPostOrder(BinaryTreeNode start){
        if (start == null) return;
        printPostOrder(start.leftChild);
        printPostOrder(start.rightChild);
        System.out.print(start.getInfo()+" ");
    }

LevelOrder Traversal. This is the last travesal, also known with “BFS” or “Breadth First Search”. It start from the root and expanding per level from left to right. so the result is : [F B G A D I C E H]. When implementing this kind of traverse, we need help from Queue Data Structure, in this case i will use Generic LinkedList from Java, because Queue from Java didn’t implemented yet (still interface class).

    private void printLevelOrder(){
        java.util.LinkedList queue = new java.util.LinkedList();
        queue.addLast(this.root);
        while (queue.size() > 0){
            BinaryTreeNode first = queue.removeFirst();
            System.out.print(first.getInfo()+" ");
            if (first.leftChild != null) queue.addLast(first.leftChild);
            if (first.rightChild != null) queue.addLast(first.rightChild);
        }
    }

I Got it!! $23 from PayPal WishList

I Made Krisna — Thu, 21 Jan 2010 09:56:10 +0000

$23 from PayPal wishlist….

This program from PayPal was already over. It’s ended at December, 31 2009. PayPal wishlist give us $1 for each friends who accepts our invitation to paypal wishlist application on facebook.

And today i received a mail in my inbox which said that my paypal account receiving $23 from paypal wishlist..

Thanks for PayPal and Facebook…

Video Classification :: CAM, TS, SCR, DVDRip, etc

I Made Krisna — Wed, 20 Jan 2010 14:03:12 +0000

Hi, when i’m going to choose some videos to download, there is some label that shown in various files, such as “CAM”, “TS”, “SCR”, and “DVDRip”. What is it? Does it mean something? I’m curious about that and start searching about this topic. Finally i found it! that’s the type of videos from what or how the videos created. Let me expain about those types with my own word from combining from many sources and references.

CAM
CAM is a rip from digital video camera. Usually the videos was recorded on movie theatres with tripod or something but because that’s recording on movie theatre, there is a very small chance the record is clean. It may come with camera shake, shouting people or laughing, and a someone’s shadow blocking the camera. The quality also very low the audio isn’t clear because of much other sounds and the video is dark because recorded on movie theatre which is on dark condition when the movie playing.
TS or TELESYNC
TELESYNC is slight better than CAM, TS also use digital camera for recording the video or movies but the TS video commonly use other audio source, it maybe directly taken from the original output so TS will be better at audio quality than CAM because there are smaller chance to get audio noise.
TC or TELECINE
TELECINE is a rare method. TC will copy directly from movie reels and make it to video format. This form of video is rarely found when we want to download some video.
SCR or SCREENER
SCREENER is generated from the movie which was sent to someone or somewhere in order to get review or promotional reason. On SCREENER videos, we may find a running text or some text that prohibit the copying of this video or showing the copyright of the video. SCREENER usually transferred to VCD form or SVCD for better result.
DVDscr or DVD-SCREENER
Same as SCREENER but DVDscr is transferred to DVD form.
DVDRip
DVDRip is getting from the original release of DVD so the quality of the result is quite good. The original release of DVD is ripped by some software and transferred to video form and stored to hard disk. DVDRip also can be found with DivX or XviD name.

Source and References :

Binary Search Tree Java Source Code

I Made Krisna — Wed, 20 Jan 2010 01:53:56 +0000

Binary Search Tree is a kind of Binary Tree. Let’s start with Tree. Tree is a data structure model which looks like a reversed tree, the root placed on top of the tree and the leaf placed on the bottom of the tree. The model will be looks like pyramid shape. Binary Tree is a tree which every leaves / nodes just have maximum two child leaves, that’s why we call it binary (base 2). Binary Search Tree… this kind of binary tree that have the position of leaves “sorted”. All of elements on the left of a leaf must be smaller than the leaf and all of elements on the right of a leaf must be bigger than the leaf. What about same value? that’s up to you to place it where.

Let’s look this example from wikipedia, “F” is the root of the tree. “B” is a left child of “F”. “G” is a right child of “F”. “B” is a parent of “A”. “B” also a parent of “D”.

Creating Binary Search Tree can’t use the Node which is used for Linked List, Stack, and Queue. Honestly, the Node can be used but the context will be different because the pointer to other Node we will named child. I also give additional pointer, “parent” for pointing the parent of the Node. Let’s see the implementation on Java Programming Language.

public class BinaryTreeNode {

    public BinaryTreeNode parent;
    public BinaryTreeNode leftChild;
    public BinaryTreeNode rightChild;

    private String info;

    public BinaryTreeNode(String info){
        this.parent = null;
        this.leftChild = null;
        this.rightChild = null;
        this.info = info;
    }

    public String getInfo(){
        return this.info;
    }

    public void setInfo(String info){
        this.info = info;
    }

}

Then after we have the Nodes we can construct the Binary Search Tree. Which the most important method is inserting Nodes. If the tree root is null (the tree is new) we just make the node as root. But if the tree is not empty, we must track or find the right place of that node. The concepts is to find an empty place that meet the rules of binary search tree.

If the value of the new node less than current node
1. If the left child of current node is not empty, move current node to left child
2. else, the left child of current node is new node
If the value of the new node equal or more than current node
1. If the right child of current node is not empty, move the current node to right child
2. else, the right child of current node is new node

public class BinarySearchTree {

    private BinaryTreeNode root;

    public BinarySearchTree(){
        this.root = null;
    }

    public void insertNode(BinaryTreeNode node){
        if (this.root == null){
            this.root = node;
        }
        else{
            trackPosition(node, this.root);
        }
    }

    private void trackPosition(BinaryTreeNode node, BinaryTreeNode start){
        String sInfo = start.getInfo();
        if (sInfo.compareTo(node.getInfo()) > 0){
            if (start.leftChild == null){
                start.leftChild = node;
                node.parent = start;
            }
            else{
                trackPosition(node, start.leftChild);
            }
        }
        else{
            if (start.rightChild == null){
                start.rightChild = node;
                node.parent = start;
            }
            else{
                trackPosition(node, start.rightChild);
            }
        }
    }

}

Naruto Shippuuden 143 Torrent Download

I Made Krisna — Tue, 19 Jan 2010 03:40:55 +0000

Download

Download via torrent here [[Narutoverse]_NARUTO_Shippuden_143.avi.torrent]
1. [Narutoverse]_NARUTO_Shippuden_143.avi [218 MB]

Naruto Shippuuden 142 Torrent Download

I Made Krisna — Tue, 19 Jan 2010 03:36:09 +0000

Download

Download via torrent here [[Narutoverse]_NARUTO_Shippuden_142.avi.torrent]
1. [Narutoverse]_NARUTO_Shippuden_142.avi [178 MB]

Naruto Shippuuden 141 Torrent Download

I Made Krisna — Tue, 19 Jan 2010 03:27:36 +0000

Download

Download via torrent here [[Narutoverse]_NARUTO_Shippuden_141.avi.torrent]
1. [Narutoverse]_NARUTO_Shippuden_141.avi [245 MB]

Naruto Shippuuden 140 Torrent Download

I Made Krisna — Tue, 19 Jan 2010 03:15:49 +0000

Naruto Shippuuden 140 – Fate

After win the battle with Uchiha Itachi, Sasuke was taken to Akatsuki hideout and told about the truth of Itachi, the killing of Uchiha clan, and the history of Hidden Leaf (Konoha)

Download

Download via torrent here : [[Narutoverse]_NARUTO_Shippuden_140.avi.torrent]
1. [Narutoverse]_NARUTO_Shippuden_140.avi [210 MB]

Creating Queue on Java

I Made Krisna — Sun, 17 Jan 2010 11:11:01 +0000

Queue, one of data structure which very important and implementable on real life. Like the name, queue, the newest element which want to enter the queue must be placed on the last of queue and the first element of the queue will be removed first. Or usually we call it FIFO “First In First Out”.

The queue implementation on Java is very simple. Like implementing the Stack on Java, we’ll use LinkedList as basic structure, not an array. Just change the PUSH with DE-QUEUE which inserting the element at the last of queue, and POP with EN-QUEUE with the same concepts.

Okay here’s the implementation on Java Programming Language….

public class Queue {

    private Node front;
    private Node rear;

    public Queue(){
        this.front = null;
        this.rear = null;
    }

    public int size(){
        Node temp = this.front;
        int counter = 0;
        while (temp != null){
            temp = temp.next;
            counter++;
        }
        return counter;
    }

    public boolean isEmpty(){
        return (this.size() == 0);
    }

    public void enQueue(Node node){
        if (this.isEmpty()){
            this.front = node;
            this.rear = node;
        }
        else{
            this.rear.next = node;
            node.prev = this.rear;
            this.rear = node;
        }
    }

    public Node deQueue(){
        if (this.isEmpty()){
            System.err.println("Trying to deQueue() at Empty Queue " +
                    "[Returning Null]");
            return null;
        }
        else{
            Node temp = this.front;
            this.front = this.front.next;
            return temp;
        }
    }

    public void removeAll(){
        this.front = null;
        this.rear = null;
    }

    public void printQueue(){
        Node temp = this.front;
        while (temp != null){
            System.out.println(temp.getInfo());
            temp = temp.next;
        }
    }

}

Hawaii Accident Lawyer

I Made Krisna — Sun, 17 Jan 2010 08:17:56 +0000

Have you ever travelling to Hawaii? hmm… seems to be great vacation i we can go there…

But the accident is always can be happened. Then how if that’s happened when we’re on vacation in Hawaii? I got a solution from my references. Just contact Hawaii Accident Lawyer at 808 – 375 – 7415 then consult your problems with them, Completely Free!

They can handle some problems such as :

Auto Accidents
Wrongful Death
Medical Malpractice
Personal Injury
Slip and Falls
Motorcycle &
Moped Accident
Bicycle Accidents
Pedestrian Injury
Insurance Claims
Dog Bites

Source and References :

Hawaii Accident Lawyer

Creating Stack from LinkedList on Java

I Made Krisna — Sat, 16 Jan 2010 02:58:11 +0000

This post will not explaining how to create and algorithms of stack from array. This post will explain about Stack which created from LinkedList concepts, if you haven’t know what is LinkedList and Node please read [Creating LinkedList on Java I]

Basicly, the Stack is more simple than LinkedList. So if you’re already can create a LinkedList you must be can create a Stack easily. The stack only can access the element which placed on the top of the stack so we can remove all LinkedList’s method which accessing or operating non-first element. Don’t forget the main method of Stack, PUSH is the method for inserting element on the top of stack, and POP to remove the first element of stack.

Directly to the source code of the stack :

public class Stack {

    private Node top;

    public Stack(){
        this.top = null;
    }

    public int size(){
        Node temp = this.top;
        int counter = 0;
        while (temp != null){
            temp = temp.next;
            counter++;
        }
        return counter;
    }

    public boolean isEmpty(){
        return (this.size() == 0);
    }

    public void push(Node node){
        if (this.isEmpty()){
            this.top = node;
        }
        else{
            node.next = this.top;
            this.top.prev = node;
            this.top = node;
        }
    }

    public Node pop(){
        if (this.isEmpty()){
            System.err.println("Trying to pop() at Empty Stack " +
                    "[Returning Null]");
            return null;
        }
        else{
            Node temp = this.top;
            this.top = this.top.next;
            return temp;
        }
    }

    public void removeAll(){
        this.top = null;
    }

    public void printStack(){
        Node temp = this.top;
        while (temp != null){
            System.out.println(temp.getInfo());
            temp = temp.next;
        }
    }

}

CodeIgniter Code Completion for NetBeans IDE

I Made Krisna — Fri, 15 Jan 2010 01:24:15 +0000

CodeIgniter, this is one of PHP Framework that can make our job to do PHP Programming easier. You can get that CodeIgniter framework here [Download CodeIgniter]. At this written, the latest version of CodeIgniter was 1.7.2

The problem is if we’re using CodeIgniter or other PHP Framework, the IDE like Dreamweaver or NetBeans cannot use their main features, Code Completion. What is Code Completion? That’s the feature which can help us to show the functions or variable that can be used. Example if we just use native PHP on Dreamweaver, we just write “mysql_” then there’s must be shown the functions which use “mysql_” prefix.

Thanks to Rakibul Hasan, my references of this post. We now can solve the problems, we can use code completion for CodeIgniter on NetBeans. How?

Download the CodeIgniter PHP Framework
Extract it on your Webserver so that you can run it a http://localhost/YOUR_CI
Open your CodeIgniter project with NetBeans
1. Click File >> New Project >> Choose PHP >> PHP Application with Existing Source
2. Choose your CodeIgniter folder, example [C:\xampp\htdocs\ci] >> Next
3. Choose your server type, leave it if you work locally
4. Finish
Check your CodeIgniter folder example [C:\xampp\htdocs\ci], there must be ‘nbproject’ folder
Download the files from here [CodeIgniter Code Completion for Netbeans]
Extract the .zip files anywhere
Copy that files to ‘nbproject’
Close your NetBeans and Open it again… Finish, check it out!

On my experience, that code completion only works at Controllers and Models, not working at Views. For more information and question you can go to my references site.

Source and References :

Creating Linked List on Java II

I Made Krisna — Wed, 13 Jan 2010 07:37:39 +0000

This is the continued post from [Creating Linked List on Java I]. This post will implementing the methods of previous post which still comment, also we can learn the logic of Linked List and using the Linked List for storing information then manipulate the Linked List (using the Linked List method).

size() :: how many Node stored on this Linked List. The concepts is grab the head (first) Node then traversing to the next Node and counting it until we reach the tail (last) Node which the next Node is null.

    public int size(){
        Node temp = this.head;
        int counter = 0;
        while (temp != null){
            counter++;
            temp = temp.next;
        }
        return counter;
    }

isEmpty() :: find the Linked List is at empty condition or not. We just call again the size() method, if the result is 0 (zero) then we can conclude that this Linked List is empty.

    public boolean isEmpty(){
        return (this.size() == 0);
    }

getFirst() :: get the Node object which is placed on head or some people use getHead(). This is very easy, just return the head of Linked List.

    public Node getFirst(){
        if (this.isEmpty()){
            System.err.println("Trying to getFirst() at Empty List " +
                    "[Not Executed]");
            return null;
        }
        else{
            return this.head;
        }
    }

getLast() :: get the Node object which is placed on tail or some people use getTail(). Same as getFirst(), just return the tail of Linked List.

    public Node getLast(){
        if (this.isEmpty()){
            System.err.println("Trying to getLast() at Empty List " +
                    "[Not Executed]");
            return null;
        }
        else{
            return this.tail;
        }
    }

getAt(int) :: get the Node object which placed on specified index. The concepts is same with size(), we just traversing but the move to the next Node with index times then returning the current Node.

    public Node getAt(int index){
        if (index <0 || index > this.size()-1){
            System.err.println("Trying to getAt("+index+") " +
                    "Index out of Bound [Not Executed]");
            return null;
        }
        else if (index == 0){
            return this.getFirst();
        }
        else if (index == this.size()-1){
            return this.getLast();
        }
        else{
            Node temp = this.head;
            for (int i=0;i
addFirst(Node) :: inserting the new Node to the first position. We just set the connection between the current head with the new node, previous of head is new node and next of new node is head. So, we’re have a new node in front of the head then the last step is assign the new node as the head of Linked List.
    public void addFirst(Node node){
        if (this.isEmpty()){
            this.head = node;
            this.tail = node;
        }
        else{
            this.head.prev = node;
            node.next = this.head;
            this.head = node;
        }
    }

addLast(Node) :: inserting the new Node to the last position. Same as addFirst(Node), we make the connection between the new node and the tail, but in this case, we placed the new node after the tail.
    public void addLast(Node node){
        if (this.isEmpty()){
            this.head = node;
            this.tail = node;
        }
        else{
            this.tail.next = node;
            node.prev = this.tail;
            this.tail = node;
        }
    }

insertAt(int, Node) :: inserting the new Node at specified index. this is easier than the other inserting, just redirect the connection of the previous Node next and next Node previous to the new Node.
    public void insertAt(int index, Node node){
        int size = this.size();
        if (index < 0 || index > size){
            System.err.println("Trying to insertAt("+index+") "+
                    "Index out of Bound [Not Executed]");
        }
        else if (index == 0){
            this.addFirst(node);
        }
        else if (index == size){
            this.addLast(node);
        }
        else{
            Node temp = this.head;
            for (int i=0;i



removeAll() :: removing all Node that was stored on Linked List, how? must we assign the null pointer on each Node? NO! just assign the head and tail to null then the bound of Linked List to Node object will completely destroyed. What about the memory? Of course there’s still Node objects assigned but after the Garbage Collection do the job, the memory will be freed.
    public void removeAll(){
        this.head = null;
        this.tail = null;
    }

removeFirst() :: removing the head Node. Same concepts, just break the connection by assigning the head with it’s next Node and remove the previous pointer to old head (with null).
    public void removeFirst(){
        if (this.isEmpty()){
            System.err.println("Trying to removeFirst() at Empty List " +
                    "[Not Executed]");
        }
        else if (this.size() == 1){
            this.removeAll();
        }
        else{
            this.head = this.head.next;
            this.head.prev = null;
        }
    }

removeLast() :: removing the tail Node. assign the tail with it’s previous Node and assign the next pointer to null.
    public void removeLast(){
        if (this.isEmpty()){
            System.err.println("Trying to removeLast() at Empty List " +
                    "[Not Executed]");
        }
        else if (this.size() == 1){
            this.removeAll();
        }
        else{
            this.tail = this.tail.prev;
            this.tail.next = null;
        }
    }

removeAt(int) :: removing the Node at specified index. It this case, we can solve with skipping the connection of the Node by connecting the previous Node and the next Node directly.
    public void removeAt(int index){
        if (index < 0 || index > this.size()-1){
            System.err.println("Trying to removeAt("+index+") "+
                    "Index out of Bound [Not Executed]");
        }
        else if (index == 0){
            this.removeFirst();
        }
        else if (index == this.size()-1){
            this.removeLast();
        }
        else{
            Node temp = this.head;
            for (int i=0;i
printList() :: printing the all Information of Linked List. Just traverse it and printing the information…
    public void printList(){
        Node temp = this.head;
        for (int i=0;i
         

Related posts:
Creating Linked List on Java I
Creating Stack from LinkedList on Java
Creating Queue on Java

Creating Linked List on Java I

I Made Krisna — Wed, 13 Jan 2010 06:47:10 +0000

On this part of post, we’re gonna discussing the concepts and not to detail about Linked List on Java Programming Language. Let’s start with what is Linked List? Linked List is a one of many data structure. We can comparing Linked List with conventional Array. If in Array, the data is continued placed on memory address, the data with index 2 must placed on left or right the data with index 3, and the data with index 3 must placed on left or right the data with index 4, and so on. But on Linked List concepts, the data can be placed any memory address where it’s empty.

Then how can the unordered data can be used? Yes, that’s why we call it Linked List. each data on Linked List, or later we’ll call with Node, have a pointer to other Node memory address which is the next or the previous Node on that Linked List. So, if in Array the data just have an information but in Linked List the data have a pointer to other data beside the information itself.

Now, let’s get started how to implementing the Linked List on Java. First, create the data container, Node

public class Node {

    private String info;
    public Node next;
    public Node prev;

    public Node(String info){
        this.info = info;
        this.next = null;
        this.prev = null;
    }

    public String getInfo(){
        return this.info;
    }

    public void setInfo(String info){
        this.info = info;
    }

}

Finally, here is the raw construction of Linked List using the Node above

public class LinkedList {

    private Node head;
    private Node tail;

    public LinkedList(){
        this.head = null;
        this.tail = null;
    }

    public boolean isEmpty(){
        // Find if the List is empty?
    }

    public int size(){
        // Get the number of Node stored
    }

    public Node getFirst(){
        // Get the First Node
    }

    public Node getLast(){
        // Get the Last Node
    }

    public Node getAt(int index){
        // Get the Node object at specified position
    }

    public void addFirst(Node node){
        // Inserting new Node at First position
    }

    public void addLast(Node node){
        // Inserting new Node at Last position
    }

    public void insertAt(int index, Node node){
        // Inserting new Node at specified index
    }

    public void removeAll(){
        // Removing all Nodes
    }

    public void removeFirst(){
        // Removing Node at First position
    }

    public void removeLast(){
        // Removing Node at Last position
    }

    public void removeAt(int index){
        // Removing Node at specified index
    }

    public void printList(){
        // Printing all information that was stored on List
    }

}

We’ll see above that Linked List class doesn’t have any information stored. Also there is no complete Node stored on Linked List, the Linked List only store the head Node and the tail Node then giving some method to access and operate the Node. It’s because the concepts of Linked Nodes provide the ability to not losing the information because each Node always pointing to other Nodes.

The source code above just the method without the implementation code, so there must be error if you just copy and paste that then compile it. The implementation code will provide on next post [Creating Linked List on Java II]. You can also adding some methods to improving the ability of Linked List such as find(String) or find(Node).

Inheritance VS Object Composition Java

I Made Krisna — Tue, 12 Jan 2010 13:10:53 +0000

Let’s start with what is Inheritance and what is Object Composition.

Inheritance is giving the characteristic of an object to the new object which inherited from the first object, as example is a man inherit eyes, hands, head, etc from human. In other way, we can say that inheritance is expanding or extending the parent object by the child object. Inheritance usually said “IS A“, man is a human. We see the implementation later…

Object Composition is inserting the whole object to the new object which created to contain the first object, as example is a computer contain of processor, RAM, Motherboard, etc. In other way, we can say that object composition is creating a new object from other objects. Object Composition usually said “HAVE A“, computer have a processor.

Then which is better, Inheritance or Object Composition? Both of them have some characteristic that give advantage to us. With inheritance, we can inserting the derived objects to their base object where Object composition cannot do that (this can be solve by Object class). But Object Composition can construct a new object from many objects where inheritance just allow one object to be inherited (this can be solve by interface).

Okay let’s see the implementation example. First we must define the base class…

public class RoboCore {

    private int coreID;

    public void setCoreID(int ID){
        this.coreID = ID;
    }

    public int getCoreID(){
        return this.coreID;
    }

    public void sayCoreID(){
        System.out.println(this.coreID);
    }

}

Then here is the code of inherit the base class

public class InheritedCoreRobo extends RoboCore{

    private String roboName;

    public InheritedCoreRobo(String Name, int CoreID){
        this.setCoreID(CoreID);
        this.roboName = Name;
    }

    @Override
    public void sayCoreID(){
        System.out.println("Core ID ["+getCoreID()+
                "] Inherited to "+this.roboName);
    }

    public void sayRoboName(){
        System.out.println("My Name is "+this.roboName);
    }

}

And here is the code for composing from base class

public class ComposedCoreRobo {

    private String roboName;
    RoboCore core;

    public ComposedCoreRobo(String Name, int ID){
        this.roboName = Name;
        this.core = new RoboCore();
        this.core.setCoreID(ID);
    }

    public void sayCoreID(){
        System.out.println("Core ID ["+this.core.getCoreID()+
                "] Composed to "+this.roboName);
    }

    public void sayRoboName(){
        System.out.println("My Name is "+this.roboName);
    }

}

I’ll also give you an example main source code for testing the code above.

    public static void main(String[] args) {

        InheritedCoreRobo ICRobo = new InheritedCoreRobo("ICRobo", 101);
        ComposedCoreRobo CCRobo = new ComposedCoreRobo("CCRobo", 777);

        System.out.println("Inheritance Robot");
        ICRobo.sayRoboName();
        ICRobo.sayCoreID();

        System.out.println("\nObject Composition Robot");
        CCRobo.sayRoboName();
        CCRobo.sayCoreID();

    }

The output result is….

Inheritance Robot
My Name is ICRobo
Core ID [101] Inherited to ICRobo

Object Composition Robot
My Name is CCRobo
Core ID [777] Composed to CCRobo

The example above is show that inheritance can construct the object without creating any base object first. So we can imagine the inheritance is the RoboCore is extended by other stuffs to build a InheriteCoreRobo, but on Object Composition, we can imagine the ComposedCoreRobo which has slot for RoboCore is inserted with RoboCore object.

Back to above, inheritance “is a”, InheritedCoreRobo is RoboCore because the original version of InheritedCoreRobo just a RoboCore but with some modification and adding some stuff, it become InheritedCoreRobo. object composition “has a” because the ComposedCoreRobo is a stand-alone object which has a place for inserting RoboCore so we can say ComposedCoreRobo have a RoboCore.

MySQL :: Counting number of word on each row

I Made Krisna — Mon, 11 Jan 2010 03:13:03 +0000

Hi, now i’m gonna share my problems and my solve for that problems. It’s welcome if you know about other solution of this problems and want to share it, just comment this post below.

The problem is how to count a word on each record. The example, there is an article table which i want to know how many word ‘MySQL’ on each row of that table. We cannot use COUNT() function because that function is counting the number of row which contain ‘MySQL’ if we use the query like :

SELECT COUNT(*) FROM article WHERE article_body LIKE '%MySQL%'

Okay, here is the article table :

article_id	article_body
1	Wordpress is the most popular Content Management System for blog engine. It just need webserver with PHP and MySQL and then just run it and the script for MySQL database will executed automatically
2	MySQL is one of database management system. MySQL community is free version of MySQL. This version of MySQL, already enough for developing application

We know that word ‘MySQL’ shown 2 times on article 1 and shown 4 times on article 2. If we use the COUNT() query above, we just get result : 2. So, how we can get that true result? On this solution, i use a simple mathematical formula to solve the problems.

WORD_COUNT = {LENGTH(WHOLE_ARTICLE) – LENGTH(WHOLE_ARTICLE WITHOUT WORD)} / LENGTH(WORD)

From the formula above, we can write it on SQL Query like :

SELECT
   article_body,
   @all := length(article_body) as whole_length,
   @word := length('MySQL') as word_length,
   @rep := length(replace(article_body,'MySQL','')) as wihout_word,
   @count := (@all - @rep)/@word as word_count
FROM article

Just see this type of query and feel confuse? I’ll try to explain about it.

@all, @word, etc is a variable that can be assigned by := operator
length() is a function that count the number of character || length(field or text)
replace() is a function that return replaced text || replace(field or text, text to find, replacement text)

And here is the result :

article_body	whole_length	word_length	wihout_word	word_count
Wordpress is the most popular Content Management S…	197	5	187	2
MySQL is one of database management system. MySQL …	150	5	130	4

Don’t Miss Your Favourite TV Show with HDD Recorder

I Made Krisna — Tue, 05 Jan 2010 05:30:57 +0000

Have you ever missed your favourite television programme? Actually, television programme cannot be rewinded or replayed so if we missed something or we want to see it again, we cannot do that.

Here is the solution, using hdd recorder, we can catch our favourite programme with a great quality because the format of storage is digital. What’s the advantage using this hdd recorder? Of course because it’s using HDD (Hard Disk Drive), we can store the programme more that other recorder that use DVD or Tape.

Next question! Where can i found it? That’s right the first answer is on electronic shop. The other one is on hdd recorder website, on this site we can found many brand of hdd recorder with various price and quality. This site also supported by Amazon.com so no need to worry about the products.

Source and References :

hdd recorder

Making a Cup of Coffee from Coffee Beans

I Made Krisna — Mon, 04 Jan 2010 11:47:43 +0000

Coffee, this is the most popular drink around the world. Every morning, noon, evening, there is must a coffee time. What’s more important from coffee? Yes, that’s the quality of coffee.

The next question is how to get the good quality of coffee. One of the answer is the quality of coffee beans. We can said that good quality of coffee beans can make good quality of coffee. To ensure the quality of coffee, we must buy our coffee beans by self and make the coffee by self too. And then the bean to cup coffee makers is going to do their works.

bean to cup is the solution of this problem. On this site, we can find the bean to cup makers with good quality and cheap price. Beside it, we also can find the bean to cup makers with based on our budget so don’t worry about the price that we cannot afford it.

Source and References :

bean to cup

Don’t Miss Your Favourite TV Show with HDD Recorder

Movies :: The Blind Side

I Made Krisna — Fri, 01 Jan 2010 11:49:49 +0000

Finally i found one more very inspiring movies, The Blind Side.

Why i am love this movie? I’m a person live in Indonesia which it’s very much movies which just sell the ghost, sex, and comedy movie without any moral message contained inside it. But, like the “Laskar Pelangi” and “Sang Pemimpi”, this movie (The Blind Side) have a lot of moral messages. It’s talk about someone who get his dream or “live” because of a family which didn’t know him anything. They give him home, they give him foods and clothes, they give him education, and the most important they give him family.

Based on Extraordinary Story, This sentence is written at the top of movie poster. Likely big say about this movie, but you can think it again after watch this movie. You’ll think how can a human do that things. You can see the true photograph of this family at the end of movie, I cannot belive this is true story until see that photo collection of the family. Very inspiring…

Plot from Internet Movie Database

A poor, oversized and under-educated teenager is recruited by a major college football program where he is groomed into an athletically and academically successful NFL prospect. Written by IMDb editor

“The Blind Side” depicts the story of Michael Oher, a homeless African-American youngster from a broken home, taken in by the Touhys, a well-to-do white family who help him fulfill his potential. At the same time, Oher’s presence in the Touhys’ lives leads them to some insightful self-discoveries of their own. Living in his new environment, the teen faces a completely different set of challenges to overcome. As a football player and student, Oher works hard and, with the help of his coaches and adopted family, becomes an All-American offensive left tackle. Written by Anonymous

Basicly, this movie can tell us to be kind with anyone and do extraordinary things which can change the live of someone. Everything we do, even it’s very small thing can make the big change for other people. You must see this movie!

Rate : 9/10 for this movie

Movie Trailer

Download

Download via torrent here : The.Blind.Side.DVDSCR.XviD.AC3-DEViSE.torrent
1. devise-tbs.avi [1.36 GB]
2. devise-tbs.nfo [19.1 kB]
3. Sample\devise-tbs.sample.avi [19.0 MB]
Download English Subtitle here : devise-tbs.srt

Source and References :

Internet Movie Database
Watch the movie

Branch and Bound Unbounded Knapsack Java

I Made Krisna — Thu, 31 Dec 2009 12:14:10 +0000

Branch and Bound, this is the another way to solve unbounded knapsack problem beside Dynamic Programming Solving like the previous post [Dynamic Programming Unbounded Knapsack]. This way is called Branch and Bound, i’m still confusing with the concepts of this algorithm and how can it solve the problem with optimal result. But for now just forget it and focus on implementating with Java Programming Language.

This algorithm consist of 4 (four) main parts.

Pre Processing :: Sort the items with ascending order by it’s ratio (value/weight)
Initializing :: Take a Greedy Choosing for item 1, then 2, and so on
Reduction Move :: Decrement the least significant digit (most right non-zero)
Expansion Move :: Take a Greedy Choosing for items on right of least significant digit

If you’re still confuse about my explaination, please go to my reference site [BB Unbounded Knapsack]

Okay let’s go to the implementing with source code. First of course declaring the variable…

    private static int   maxWeight = 0; //maximum weight of knapsack
    private static int[] w;             //weight of each item
    private static int[] v;             //value of each item
    private static int[] maxSet;        //set of optimum items
    private static int   maxValue;      //value of maximum set

Then we make the user input getter

    private static boolean getData()
    {
        System.out.print("Input Maximum Knapsack Weight : ");
            maxWeight = new Scanner(System.in).nextInt();

        System.out.print("Input the weight of each item (separate by space) : ");
            String[] temp = new Scanner(System.in).nextLine().split(" ");
            w = new int[temp.length];
            for (int i=0;i
Now, the first step of this algorithm. Pre-Processing
    private static void preProcessing()
    {
        /**
         * Sorting using Selection Sort to Arrange
         * the data by it's ratio (value/weight)
         */
        for (int i=0;i
Then, do the Initializing of item set combination
    private static void initialization()
    {
        /**
         * Make a greedy choosing
         * Take as much as first item, then second then continue...
         */
        int[] combination = new int[w.length];
        for (int i=0;i



And the final step of algorithm, Reduction and Expansion Move
    private static void reduceAndExpand()
    {
        /**
         * Make a copy of maximum set to be reduced and expanded
         */
        int[] set = new int[maxSet.length];
        copyAllArrayValueTo(maxSet, set);

        /**
         * Reduction and Expansion Step Loop Here
         * Loop until the all of the set is 0
         */
        boolean flag = true;
        while (flag)
        {
            /**
             * Reduction Move
             * Seek the least significant (not zero) digit
             */
            int leastSignificant = set.length-1;
            for (int i=leastSignificant;i>=0;i--)
            {
                if (set[i] != 0)
                {
                    leastSignificant = i;
                    break;
                }
            }

            /**
             * Reduction Move
             * Decrement the least significant digit or
             * set it to 0 (zero) if it's on last position
             */
            if (leastSignificant == set.length-1)
            {
                maxWeight = maxWeight + (set[leastSignificant]*w[leastSignificant]);
                set[leastSignificant] = 0;
            }
            else
            {
                maxWeight = maxWeight + w[leastSignificant];
                set[leastSignificant]--;

                /**
                 * Expansion Move
                 * Take a greedy choosing for items on right of
                 * least significant digit
                 */
                for (int i=leastSignificant+1;i maxValue)
                {
                    maxValue = currentValue;
                    copyAllArrayValueTo(set, maxSet);
                }

            }

            /**
             * Loop terminator
             * Check if the set is 0
             */
            int itemCount = 0;
            for (int i=0;i
Don’t forget the main method and other supporting methods….
    public static void main(String[] args)
    {
        if (!getData()) return;         //getting data from user
        preProcessing();                //ascending sort by ratio
        initialization();               //first greedy choosing
        reduceAndExpand();              //seek for more optimum set

        System.out.println(maxValue);
    }

    private static void copyAllArrayValueTo(int[] source, int[] dest)
    {
        for (int i=0;i
Source and References

University of Melbourne, Australia

         

Related posts:
Unbounded Knapsack Java Source Code
Greedy Activity Selector Java Source Code
Creating Queue on Java

Unbounded Knapsack Java Source Code

I Made Krisna — Wed, 30 Dec 2009 22:16:55 +0000

Hi there, now in this time i’ll try to explain about solving Unbounded Knapsack Problem (UKP) with Dynamic Programming (DP) Method. What is Knapsack Problem? The basic problem is how to choose combination of items from a set of items given to get the maximum value with the knapsack weight or volume restriction. For example, we want to go camping in the mountain, we must bring some stuff like clothes, foods, and drugs. But we just have the limited bag (knapsack) capacity so we must choose the combination of those items which can give us the most benefit.

What’s the different with bounded knapsack? We also call the bounded knapsack with 0-1 knapsack or binary knapsack. Unbounded knapsack is 0-1 knapsack too, but in the UKP we can take more than one items from the same kind. Example, we bring 2 clothes, 5 foods, and 3 drugs. Not in 0-1 knapsack problem, we just can bring 1 items of the same kind.

How the Dynamic Programming Works? The DP method work with the idea “the optimum value of if this item a put on this knapsack is the optimum value of knapsack weight without this item plus value of this item” little confusing? yes i think so. in other word we can say if i reach this weight with this item, then the maximum value is the previous items was added in knapsack plus the new items value. Example : If we want to reach knapsack weight 5 with adding items with weight 2 then the optimum value is : “the optimum value of knapsack with weight 3 plus the value of item with weight 2″.

f(s) = Value(i) + f(s – Weight(i))

So, we can arrange the dynamic table increasingly from most lightweight knapsack optimum value. from weight=0 which must be 0 (zero) valued because nothing can get in on that knapsack capacity, until knapsack weight=maximumweight. With this method we never calculate again the optimum value of previous knapsack before which needed to calculate the present optimum value.

Okay the implementation, first we need some variables and arrays to store the information

    private static int   maxWeight = 0; //maximum weight of knapsack
    private static int[] w;             //weight of each item
    private static int[] v;             //value of each item
    private static int[] a;             //maximum value each knapsack
    private static int[] l;             //last item added each knapsack

And of course getting the user input

    private static boolean getData(){
        System.out.print("Input Maximum Knapsack Weight : ");
            maxWeight = new Scanner(System.in).nextInt();

        System.out.print("Input the weight of each item (separate by space) : ");
            String[] temp = new Scanner(System.in).nextLine().split(" ");
            w = new int[temp.length];
            for (int i=0;i
Then we can get in to the method, the unbounded knapsack
    private static void fillUnboundedKnapsack()
    {
        int   n = w.length;         //number of items

        /**
         * Initializing table
         * table a with default value =  0
         * table l with default value = -1
         */
        a = new int[maxWeight+1];
        l = new int[maxWeight+1];

        setAllArrayValueTo(a,  0);
        setAllArrayValueTo(l, -1);

        /**
         * Unbounded Knapsack Step
         */
        for (int i=1;i a[i])
                {
                    a[i] = v[j] + a[i - w[j]];
                    l[i] = j;
                }
            }
        }
    }

How can we know the items combination from only the sequence code above? Check this out…
    private static int[] trackCombination()
    {
        int[] combination = new int[w.length];

        int postTracker = l.length-1;
        int itemTracker = l[postTracker];

        /**
         * Tracking back the combination
         */
        while (itemTracker != -1 && postTracker > 0)
        {
            combination[itemTracker]++;
            postTracker = postTracker - w[itemTracker];
            itemTracker = l[postTracker];
        }

        return combination;
    }

And finally the main method which cover it all….
    public static void main(String[] args)
    {
        if (!getData()) return;             //getting data from user
        fillUnboundedKnapsack();            //run the algorithm
        int[] optimal = trackCombination(); //seek for items combination

        /* Just an Output Step */
        System.out.println("Maximum Value : " + a[a.length-1]);
        System.out.print("Combination : ");
        for (int i=0;i
Almost forgot… maybe you ask about the setAllArrayValueTo() method, it just a complementary method to set all array values to the second parameter. The code just like..
    private static void setAllArrayValueTo(int[] array, int value){
        for (int i=0;i
         

Related posts:
Branch and Bound Unbounded Knapsack Java
Greedy Activity Selector Java Source Code
Pigeon Hole Sort Java Source Code

2009 Favourite :: Operating Systems, Browsers, Spiders

I Made Krisna — Fri, 25 Dec 2009 05:26:36 +0000

Windows XP, still the most used operating system in the world. Almost 2/3 of internet users in this earth use Windows XP. The stability and easy to use make this OS go through on the Top OS of 2009. Then followed by Windows Vista and Windows NT 4 (Windows 7 and Server 2008). Where’s the UNIX? Mac OS X still above the Ubuntu Linux as the most popular UNIX Operating System. And the last, Mobile OS, Suprisingly BlackBerry OS which haven’t too long in this war beat Symbian.

Guess? Of course my favourite Browser is the Winner!! Mozilla Firefox 3. Half of internet users use this web browser. Simple, fast and Free for all users plus there are much plug-ins which can make this browser show who you’re. Internet Explorer 6 still dominated the IE family, maybe just because Windows XP bring this browser for it’s original web browser. What about Opera?, The other popular free web browser? Hmm…. It was beaten down by IE family and still racing with Google Chrome, the new browser from Google.

Which’s search engine is the best? The answer commonly “Google”. Few times before, Google is the most powerful search engine, The bots / spiders can visit a same web more than once a day. How about now? “MSN” bot or we can call it “Bing” now, surpass the Google spiders for the times of crawling a website. Those two spiders are racing far away from others spiders, 9107 and 7075. At the third position just have 1432 points… How about Yahoo? I think the bot is getting old with just 709 points.

Okay that’s all the best or favourite OS, Web Browsers, and Spiders by imkrisna…..

Data From : http://imkrisna.webatu.com Powered by : StatPress

Merry Christmas 2009

I Made Krisna — Thu, 24 Dec 2009 17:01:19 +0000

from I Made Krisna’s Times

“Merry Christmas for You All”

Christmas isn’t about you, Christmas isn’t about me.
Christmas isn’t about him, Christmas isn’t about her
Christmas is about us!

Christmas is the time for share
Sharing everything we have
Even it’s little for us, it may be huge for the others

Share our feel
Share our mind
Share our spirit
Share our happiness
Share our sadness
Share our knowledge

AND
just share “ours”
Merry Christmas 2009 and Happy New Year 2010

Regards, I Made Krisna Widhiastra

2009 Favourite :: Operating Systems, Browsers, Spiders

Pigeon Hole Sort Java Source Code

I Made Krisna — Sun, 20 Dec 2009 15:38:32 +0000

Pigeon Hole, kind of sort which have same concepts with bucket sort. Classify the items, in pigeon hole we use “key” for classifying the items. The items which have same “key” will be placed on the same “pigeon hole”. Then just move back the sorted items on the “pigeon hole” to the original items container such as array or list. And the result is sorted items by key

Based on text above, pigeon hole sort need a data structure which has “key” and “value” so we can’t use primitive data such as String or Integer data. So, in this post i will create a new data structure named “KeyValue” which contain two attributes (int Key, string Value).

public class KeyValue {

    private int key;
    private String value;

    public KeyValue(int key, String value){
        this.key    = key;
        this.value  = value;
    }

    public final int getKey(){
        return this.key;
    }

    public final String getValue(){
        return this.value;
    }

}

After we have the data structure needed, we can do the pigeon hole sort on Java Programming Language like this.

public class PigeonSort {

    public static void doSort(KeyValue[] unsorted)
    {
        /**
         * number of element
         */
        int n = unsorted.length;

        /**
         * lowest  "key" value, default : first key
         */
        int lKey = unsorted[0].getKey();

        /**
         * highest "key" value, default : first key
         */
        int uKey = unsorted[0].getKey();

        /**
         * Search the lowest and highest key value
         */
        for (int i = 1; i < n; i++){
            int presentKey = unsorted[i].getKey();

            if (presentKey < lKey)
                lKey = presentKey;
            if (presentKey > uKey)
                uKey = presentKey;
        }

        /**
         * Total possible pigeon hole key
         */
        int possibleKey = uKey - lKey + 1;

        /**
         * Preparing pigeon hole structure
         */
        LinkedList[] pigeonHole = new LinkedList[possibleKey];
        for (int i = 0; i < possibleKey; i++)
            pigeonHole[i] = new LinkedList();

        /**
         * Adding each element to pigeon hole
         * based on key value
         */
        for (int i = 0; i < n; i++)
        {
            int key = unsorted[i].getKey()-lKey;
            pigeonHole[key].add(unsorted[i]);
        }

        /**
         * Moving sorted elements from pigeon hole
         * back to array
         */
        int counter = 0;
        for (int i = 0; i < possibleKey; i++)
        {
            int size = pigeonHole[i].size();
            for (int j = 0; j < size; j++)
            {
                unsorted[counter] = pigeonHole[i].get(j);
                counter++;
            }
        }

    }

}

For testing we can use main method, just make an array of “KeyValue” and pass it to pigeon hole.

    public static void main(String[] args) {

        KeyValue[] data5 = {
            new KeyValue(5, "hello"),
            new KeyValue(3, "pie"),
            new KeyValue(8, "apple"),
            new KeyValue(8, "cheese"),
            new KeyValue(5, "king")
        };

        long start = System.nanoTime();
        PigeonSort.doSort(data5);
        long end = System.nanoTime();

        for (int i=0;i
UPDATE [21 December 2009 12:58]
Now you can see the simple animaton of Pigeon Hole with click Launch button below
 
         

Related posts:
Binary Search Tree Java Source Code
Unbounded Knapsack Java Source Code
Greedy Activity Selector Java Source Code

Indonesia, 3rd Winner of Laos – Sea Games 2009

I Made Krisna — Sat, 19 Dec 2009 05:31:07 +0000

Congratulations for Indonesia, my beloved country. You’re the 3rd winner of Sea Games 2009 and surpass the Malaysia which always try to steal something from our country. And here’s the final medal result :

Country				TOTAL MEDAL
Thailand	86	83	97	266
Vietnam	83	75	57	215
Indonesia	43	53	74	170
Malaysia	40	40	59	139
Philippines	38	35	51	124
Singapore	33	30	35	98
Laos	33	25	52	110
Myanmar	12	22	37	71
Cambodia	3	10	27	40
Brunei	1	1	8	10
Timor Leste	0	0	3	3
Grand Total	372	374	500	1246

Once again, Congratulations for Indonesia and for The first and second winner, Thailand and Vietnam. And not forget to appreciate the althlete of Indonesia which give the most number of medal for Indonesia in Sea Games 2009.

Suryo Agung Wibowo from Athletics for giving 2 gold medals and 1 bronze medal.
Tryaningsih from Athletics for giving 2 gold medals.

See ya next time, show that Indonesia can beat and compete in this South East Asia Region and in the world.

Source and References

Indonesian Movies :: Sang Pemimpi

I Made Krisna — Thu, 17 Dec 2009 03:35:44 +0000

“Sang Pemimpi” or “The Dreamer” in English, the title of the last movie i’ve seen. The story by Andrea Hirata and Directed by Riri Riza, well-known Indonesia movie director.

The story of “Sang Pemimpi” still telling about Ikal’s life, the main figure of “Laskar Pelangi”, previous sequel of this story which played by Vikri Setiawan. But, now telling about his teenage life story. On this movie, we can see the new friendship of Ikal. He found new bestfriends whose will support him until he get his dream, got a scholarship on Paris, France. Those are Arai, the cousin of Ikal, played by Rendy Ahmad and Jimbron, the orphan boy played by Azwir Fitrianto.

I’m very like this movie, I think this movie has more moral message than “Laskar Pelangi”. Not just about friendship and the will to chase the dream, but with this movie we can find the truly Indonesia at that moment. How an Indonesian teenagers must leave their village because there are no schools there. How the teachers has some strict rules to make their students discipline. And not forget how the life of Indonesian teenager itself, Friendship, Love, Delinuency, School problems, and Conflict about their will itself.

What’s the different with “Laskar Pelangi”? I think the main difference is the main figure. I didn’t think the main figure in this movie is still Ikal, but the main figure is Arai. Arai is a magical demon’s like angel boy, He keep close with the troubles but deep inside his heart he have a angel’s heart to help another person especially his bestfriends, Ikal and Jimbron. Arai also has unexpected thought and idea to get the bad things or trouble become the fun things and not forget always encourage their bestfriends to reach their dream. From Gantong, Manggar, Jakarta and Finally Europe.

Jimbron, not as smart as his bestfriends but he always get the spirit to study and study more. Have an interest about horses. He also have the important position to make Ikal and Arai get their Dream, Scholarship to Europe. He give his twin horse piggybanks with same amount with each other.

There are many more message i’ve got after seen this movie. I suggest you to watch this and not to just enjoy the film but also think about the message of this movie.

Rate : 9/10 for this movie.

Quote

This movie is three times better than laskar pelangi (Andrea Hirata)

Trailer

Paid to Review :: PayPerPost.com

I Made Krisna — Wed, 16 Dec 2009 19:43:41 +0000

Hi, now i’m trying to get income from PTR (Paid to Review) and this site looks like verified

I’ll begin to try now and wait for the next news about this PTR. On login method i must including some words like “A revised sample coordinates the mod wallet.” to get verified as blogger.

MySQL 5 :: Natural Language / FULLTEXT Search

I Made Krisna — Mon, 14 Dec 2009 12:07:47 +0000

What is Natural Language Searching?

I’m also a newbie on this topic and just post about my experience and my thought about this topic. Well, i guess Natural Language Searching is the method for us which given by MySQL to preform advanced fast-search. Let say there is a string on a record : “Hello there, My name is I Made Krisna Widhiastra”. If we just use the ordinary query for searching with keyword : “Hello Krisna”

SELECT * FROM table WHERE field LIKE "%Hello Krisna%"

We can’t found it because the “Hello Krisna” isn’t the match String sequence then if we use the Natural Language Search, we MAYBE found the result. Why i said maybe? we will discuss it below.

Well, the requirement of using Natural Language Search we must using MyISAM Database Engine. This is the first requirement. And the second, we must create an FULLTEXT index which including the fields which will be searched on just one index. Okay let’s see the example.

This is the table structure of article. And we will search based on the title, body, and tag of the article.

What about creating the index for fulltext search? Just run the query like this (based on example)

ALTER TABLE article
ADD FULLTEXT(article_title, article_body, article_tag)

Okay, let’s work with the query example

SELECT *
FROM article
WHERE MATCH (article_title, article_body, article_tag)
AGAINST ('Blog Open Source Wordpress')

And the result is :

00003	WordPress Blog Engine	Wordpress is the most popular open source blog eng…	Wordpress, Blog	I Made Krisna Widhiastra

00003

WordPress Blog Engine

Wordpress is the most popular open source blog eng…

Wordpress, Blog

I Made Krisna Widhiastra

We can found the record even the sequence of string with our search query isn’t same. Yes, that’s the power of Natural Language / FULLTEXT Search. Now, i’m going to try explain about another feature of Natural Language Search.

SELECT *,
MATCH (article_title, article_body, article_tag)
AGAINST ('Blog Open Source Wordpress') AS SCORE
FROM article
WHERE MATCH (article_title, article_body, article_tag)
AGAINST ('Blog Open Source Wordpress')

The Query above give result :

00003	WordPress Blog Engine	Wordpress is the most popular open source blog eng…	Wordpress, Blog	I Made Krisna Widhiastra	3.20612597465515

00003

WordPress Blog Engine

Wordpress is the most popular open source blog eng…

Wordpress, Blog

I Made Krisna Widhiastra

3.20612597465515

And the meaning of SCORE (3.206…) is the value of relevance with the search query so we can sort our query result based on the revelance with the keyword.

Now, the bad side of this search method. We can’t search with keyword which it’s included on most data on our database. The example is keyword : “MySQL” is shown in all of my example data.

SELECT *
FROM article
WHERE MATCH (article_title, article_body, article_tag)
AGAINST ('MySQL')

Then Make the result of search like this :

MySQL returned an empty result set (i.e. zero rows). ( Query took 0.0013 sec )

Grammar Suroboyo 3.5 featuring VOX Band

I Made Krisna — Sun, 13 Dec 2009 00:14:53 +0000

Hi there, here’s come the new animation video from “si ikin”, Grammar Suroboyo 3.5 “Mantab Jaya”.

This video is a bonus from previous video, Grammar Suroboyo 3. And still telling about friendship of Suro and Boyo with a background music from VOX Band.

Enjoy It!

Indonesian Movies :: Sang Pemimpi

Informatics ITS on Coin for Prita

I Made Krisna — Thu, 10 Dec 2009 10:27:42 +0000

Thanks to all of my friends on Informatics Engineering ITS who participate to help Prita Mulyasari with giving your coin to support her. This isn’t about the amount of money but this is about the spirit of all of Indonesian people to offend injustice of law in this country.

Now, those coin is at Jemursari Regency, TvOne Surabaya and waiting the time to delivered to Jakarta…

Anyway thanks to all…. and Go Ms.Prita we’re always support you..

Bali Vacation :: Kuta, Centro – Discovery Mall

I Made Krisna — Mon, 07 Dec 2009 01:11:31 +0000

Last day on Vacation. I’m staying at Kuta Santika Hotel. Quite good hotel with great location, strategic from frontside directly to main road and the backside directly to beach. The Hotel itself? nice and good place for rest.

Not to far from the hotel, there are two main objects. Centro – Discovery Shopping Mall and Waterboom. and still many more cafe with it’s own attraction.

* All photos Originally are on large size, Maybe take some times and need to refresh page to load all photos

Lenka – The Show

I Made Krisna — Fri, 04 Dec 2009 08:08:39 +0000

What an amazing song, simple and easy listening with a cheerful melody. Nice!

Keep the good work Lenka..

Video Clip

Lyrics

I’m just a little bit caught in the middle
Life is a maze and love is a riddle
I don’t know where to go
I can’t do it alone (I’ve tried)
and I don’t know why

Slow it down, make it stop
or else my heart is going to pop
‘cuz it’s too much
Yeah, it’s a lot
to be something I’m not

I’m a fool out of love
‘cuz I just can’t get enough

I’m just a little bit caught in the middle
Life is a maze and love is a riddle
I don’t know where to go
I can’t do it alone (I’ve tried)
and I don’t know why

I am just a little girl lost in the moment
I’m so scared but don’t show it
I can’t figure it out
it’s bringing me down I know
I’ve got to let it go
and just enjoy the show

The sun is hot
in the sky
just like a giant spotlight
The people follow the sign
and synchronize in time
It’s a joke Nobody knows
they’ve got a ticket to that show
Yeah

I’m just a little bit caught in the middle
Life is a maze and love is a riddle
I dont know where to go
I can’t do it alone (I’ve tried)
and I don’t know why

I am just a little girl lost in the moment
I’m so scared but don’t show it
I can’t figure it out
it’s bringing me down
I know
I’ve got to let it go
and just enjoy the show

oh
Just enjoy the show
oh oh

I’m just a little bit caught in the middle
life is a maze and love is a riddle
I dont know where to go
I can’t do it alone (I’ve tried)
and I don’t know why

I am just a little girl lost in the moment
I’m so scared but I don’t show it
I can’t figure it out
it’s bringing me down
I know
I’ve got to let it go
and just enjoy the show

dum de dum
dudum de dum

Just enjoy the show

dadum de dum
dadum de dum

Just enjoy the show

I want my money back
I want my money back
I want my money back
Just enjoy the show

Listen to the Song

Download Song

No related posts.

Missing patches.h and vertices.h for bteapot.c

I Made Krisna — Wed, 02 Dec 2009 20:00:51 +0000

Hi there, for you’re who seeking the two header files for OpenGL in C/C++ missing (patches.h) and (vertices.h) for bteapot.c

You can get those files officially at this website for complete source code from books : Interactive Computer Graphics : Modern Approach Second Edition. VISIT The Website

Or get it Directly DOWNLOAD the patches.h here!

int indices[32][4][4]={{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16},
{4, 17, 18, 19, 8, 20, 21, 22, 12, 23, 24, 25, 16, 26, 27, 28},
{19, 29, 30, 31, 22, 32, 33, 34, 25, 35, 36, 37, 28, 38, 39, 40},
{31, 41, 42, 1, 34, 43, 44, 5, 37, 45, 46, 9, 40, 47, 48, 13},
{13, 14, 15, 16, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60},
{16, 26, 27, 28, 52, 61, 62, 63, 56, 64, 65, 66, 60, 67, 68, 69},
{28, 38, 39, 40, 63, 70, 71, 72, 66, 73, 74, 75, 69, 76, 77, 78},
{40, 47, 48, 13, 72, 79, 80, 49, 75, 81, 82, 53, 78, 83, 84, 57},
{57, 58, 59, 60, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96},
{60, 67, 68, 69, 88, 97, 98, 99, 92, 100, 101, 102, 96, 103, 104, 105},
{69, 76, 77, 78, 99, 106, 107, 108, 102, 109, 110, 111, 105, 112, 113, 114},
{78, 83, 84, 57, 108, 115, 116, 85, 111, 117, 118, 89, 114, 119, 120, 93},
{121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136},
{124, 137, 138, 121, 128, 139, 140, 125, 132, 141, 142, 129, 136, 143, 144, 133},
{133, 134, 135, 136, 145, 146, 147, 148, 149, 150, 151, 152, 69, 153, 154, 155},
{136, 143, 144, 133, 148, 156, 157, 145, 152, 158, 159, 149, 155, 160, 161, 69},
{162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177},
{165, 178, 179, 162, 169, 180, 181, 166, 173, 182, 183, 170, 177, 184, 185, 174},
{174, 175, 176, 177, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197},
{177, 184, 185, 174, 189, 198, 199, 186, 193, 200, 201, 190, 197, 202, 203, 194},
{204, 204, 204, 204, 207, 208, 209, 210, 211, 211, 211, 211, 212, 213, 214, 215},
{204, 204, 204, 204, 210, 217, 218, 219, 211, 211, 211, 211, 215, 220, 221, 222},
{204, 204, 204, 204, 219, 224, 225, 226, 211, 211, 211, 211, 222, 227, 228, 229},
{204, 204, 204, 204, 226, 230, 231, 207, 211, 211, 211, 211, 229, 232, 233, 212},
{212, 213, 214, 215, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245},
{215, 220, 221, 222, 237, 246, 247, 248, 241, 249, 250, 251, 245, 252, 253, 254},
{222, 227, 228, 229, 248, 255, 256, 257, 251, 258, 259, 260, 254, 261, 262, 263},
{229, 232, 233, 212, 257, 264, 265, 234, 260, 266, 267, 238, 263, 268, 269, 242},
{270, 270, 270, 270, 279, 280, 281, 282, 275, 276, 277, 278, 271, 272, 273, 274},
{270, 270, 270, 270, 282, 289, 290, 291, 278, 286, 287, 288, 274, 283, 284, 285},
{270, 270, 270, 270, 291, 298, 299, 300, 288, 295, 296, 297, 285, 292, 293, 294},
{270, 270, 270, 270, 300, 305, 306, 279, 297, 303, 304, 275, 294, 301, 302, 271}};

And DOWNLOAD vertices.h here!

point vertices[306]={{1.4 , 0.0 , 2.4}, {1.4 , -0.784 , 2.4},
{0.784 , -1.4 , 2.4}, {0.0 , -1.4 , 2.4}, {1.3375 , 0.0 , 2.53125},
{1.3375 , -0.749 , 2.53125}, {0.749 , -1.3375 , 2.53125}, {0.0 , -1.3375 , 2.53125},
{1.4375 , 0.0 , 2.53125}, {1.4375 , -0.805 , 2.53125}, {0.805 , -1.4375 , 2.53125},
{0.0 , -1.4375 , 2.53125}, {1.5 , 0.0 , 2.4}, {1.5 , -0.84 , 2.4},
{0.84 , -1.5 , 2.4}, {0.0 , -1.5 , 2.4}, {-0.784 , -1.4 , 2.4},
{-1.4 , -0.784 , 2.4}, {-1.4 , 0.0 , 2.4}, {-0.749 , -1.3375 , 2.53125},
{-1.3375 , -0.749 , 2.53125}, {-1.3375 , 0.0 , 2.53125}, {-0.805 , -1.4375 , 2.53125},
{-1.4375 , -0.805 , 2.53125}, {-1.4375 , 0.0 , 2.53125}, {-0.84 , -1.5 , 2.4},
{-1.5 , -0.84 , 2.4}, {-1.5 , 0.0 , 2.4}, {-1.4 , 0.784 , 2.4},
{-0.784 , 1.4 , 2.4}, {0.0 , 1.4 , 2.4}, {-1.3375 , 0.749 , 2.53125},
{-0.749 , 1.3375 , 2.53125}, {0.0 , 1.3375 , 2.53125}, {-1.4375 , 0.805 , 2.53125},
{-0.805 , 1.4375 , 2.53125}, {0.0 , 1.4375 , 2.53125}, {-1.5 , 0.84 , 2.4},
{-0.84 , 1.5 , 2.4}, {0.0 , 1.5 , 2.4}, {0.784 , 1.4 , 2.4},
{1.4 , 0.784 , 2.4}, {0.749 , 1.3375 , 2.53125}, {1.3375 , 0.749 , 2.53125},
{0.805 , 1.4375 , 2.53125}, {1.4375 , 0.805 , 2.53125}, {0.84 , 1.5 , 2.4},
{1.5 , 0.84 , 2.4}, {1.75 , 0.0 , 1.875}, {1.75 , -0.98 , 1.875},
{0.98 , -1.75 , 1.875}, {0.0 , -1.75 , 1.875}, {2.0 , 0.0 , 1.35},
{2.0 , -1.12 , 1.35}, {1.12 , -2.0 , 1.35}, {0.0 , -2.0 , 1.35},
{2.0 , 0.0 , 0.9}, {2.0 , -1.12 , 0.9}, {1.12 , -2.0 , 0.9},
{0.0 , -2.0 , 0.9}, {-0.98 , -1.75 , 1.875}, {-1.75 , -0.98 , 1.875},
{-1.75 , 0.0 , 1.875}, {-1.12 , -2.0 , 1.35}, {-2.0 , -1.12 , 1.35},
{-2.0 , 0.0 , 1.35}, {-1.12 , -2.0 , 0.9}, {-2.0 , -1.12 , 0.9},
{-2.0 , 0.0 , 0.9}, {-1.75 , 0.98 , 1.875}, {-0.98 , 1.75 , 1.875},
{0.0 , 1.75 , 1.875}, {-2.0 , 1.12 , 1.35}, {-1.12 , 2.0 , 1.35},
{0.0 , 2.0 , 1.35}, {-2.0 , 1.12 , 0.9}, {-1.12 , 2.0 , 0.9},
{0.0 , 2.0 , 0.9}, {0.98 , 1.75 , 1.875}, {1.75 , 0.98 , 1.875},
{1.12 , 2.0 , 1.35}, {2.0 , 1.12 , 1.35}, {1.12 , 2.0 , 0.9},
{2.0 , 1.12 , 0.9}, {2.0 , 0.0 , 0.45}, {2.0 , -1.12 , 0.45},
{1.12 , -2.0 , 0.45}, {0.0 , -2.0 , 0.45}, {1.5 , 0.0 , 0.225},
{1.5 , -0.84 , 0.225}, {0.84 , -1.5 , 0.225}, {0.0 , -1.5 , 0.225},
{1.5 , 0.0 , 0.15}, {1.5 , -0.84 , 0.15}, {0.84 , -1.5 , 0.15},
{0.0 , -1.5 , 0.15}, {-1.12 , -2.0 , 0.45}, {-2.0 , -1.12 , 0.45},
{-2.0 , 0.0 , 0.45}, {-0.84 , -1.5 , 0.225}, {-1.5 , -0.84 , 0.225},
{-1.5 , 0.0 , 0.225}, {-0.84 , -1.5 , 0.15}, {-1.5 , -0.84 , 0.15},
{-1.5 , 0.0 , 0.15}, {-2.0 , 1.12 , 0.45}, {-1.12 , 2.0 , 0.45},
{0.0 , 2.0 , 0.45}, {-1.5 , 0.84 , 0.225}, {-0.84 , 1.5 , 0.225},
{0.0 , 1.5 , 0.225}, {-1.5 , 0.84 , 0.15}, {-0.84 , 1.5 , 0.15},
{0.0 , 1.5 , 0.15}, {1.12 , 2.0 , 0.45}, {2.0 , 1.12 , 0.45},
{0.84 , 1.5 , 0.225}, {1.5 , 0.84 , 0.225}, {0.84 , 1.5 , 0.15},
{1.5 , 0.84 , 0.15}, {-1.6 , 0.0 , 2.025}, {-1.6 , -0.3 , 2.025},
{-1.5 , -0.3 , 2.25}, {-1.5 , 0.0 , 2.25}, {-2.3 , 0.0 , 2.025},
{-2.3 , -0.3 , 2.025}, {-2.5 , -0.3 , 2.25}, {-2.5 , 0.0 , 2.25},
{-2.7 , 0.0 , 2.025}, {-2.7 , -0.3 , 2.025}, {-3.0 , -0.3 , 2.25},
{-3.0 , 0.0 , 2.25}, {-2.7 , 0.0 , 1.8}, {-2.7 , -0.3 , 1.8},
{-3.0 , -0.3 , 1.8}, {-3.0 , 0.0 , 1.8}, {-1.5 , 0.3 , 2.25},
{-1.6 , 0.3 , 2.025}, {-2.5 , 0.3 , 2.25}, {-2.3 , 0.3 , 2.025},
{-3.0 , 0.3 , 2.25}, {-2.7 , 0.3 , 2.025}, {-3.0 , 0.3 , 1.8},
{-2.7 , 0.3 , 1.8}, {-2.7 , 0.0 , 1.575}, {-2.7 , -0.3 , 1.575},
{-3.0 , -0.3 , 1.35}, {-3.0 , 0.0 , 1.35}, {-2.5 , 0.0 , 1.125},
{-2.5 , -0.3 , 1.125}, {-2.65 , -0.3 , 0.9375}, {-2.65 , 0.0 , 0.9375},
{-2.0 , -0.3 , 0.9}, {-1.9 , -0.3 , 0.6}, {-1.9 , 0.0 , 0.6},
{-3.0 , 0.3 , 1.35}, {-2.7 , 0.3 , 1.575}, {-2.65 , 0.3 , 0.9375},
{-2.5 , 0.3 , 1.125}, {-1.9 , 0.3 , 0.6}, {-2.0 , 0.3 , 0.9},
{1.7 , 0.0 , 1.425}, {1.7 , -0.66 , 1.425}, {1.7 , -0.66 , 0.6},
{1.7 , 0.0 , 0.6}, {2.6 , 0.0 , 1.425}, {2.6 , -0.66 , 1.425},
{3.1 , -0.66 , 0.825}, {3.1 , 0.0 , 0.825}, {2.3 , 0.0 , 2.1},
{2.3 , -0.25 , 2.1}, {2.4 , -0.25 , 2.025}, {2.4 , 0.0 , 2.025},
{2.7 , 0.0 , 2.4}, {2.7 , -0.25 , 2.4}, {3.3 , -0.25 , 2.4},
{3.3 , 0.0 , 2.4}, {1.7 , 0.66 , 0.6}, {1.7 , 0.66 , 1.425},
{3.1 , 0.66 , 0.825}, {2.6 , 0.66 , 1.425}, {2.4 , 0.25 , 2.025},
{2.3 , 0.25 , 2.1}, {3.3 , 0.25 , 2.4}, {2.7 , 0.25 , 2.4},
{2.8 , 0.0 , 2.475}, {2.8 , -0.25 , 2.475}, {3.525 , -0.25 , 2.49375},
{3.525 , 0.0 , 2.49375}, {2.9 , 0.0 , 2.475}, {2.9 , -0.15 , 2.475},
{3.45 , -0.15 , 2.5125}, {3.45 , 0.0 , 2.5125}, {2.8 , 0.0 , 2.4},
{2.8 , -0.15 , 2.4}, {3.2 , -0.15 , 2.4}, {3.2 , 0.0 , 2.4},
{3.525 , 0.25 , 2.49375}, {2.8 , 0.25 , 2.475}, {3.45 , 0.15 , 2.5125},
{2.9 , 0.15 , 2.475}, {3.2 , 0.15 , 2.4}, {2.8 , 0.15 , 2.4},
{0.0 , 0.0 , 3.15}, {0.0 , -0.002 , 3.15}, {0.002 , 0.0 , 3.15},
{0.8 , 0.0 , 3.15}, {0.8 , -0.45 , 3.15}, {0.45 , -0.8 , 3.15},
{0.0 , -0.8 , 3.15}, {0.0 , 0.0 , 2.85}, {0.2 , 0.0 , 2.7},
{0.2 , -0.112 , 2.7}, {0.112 , -0.2 , 2.7}, {0.0 , -0.2 , 2.7},
{-0.002 , 0.0 , 3.15}, {-0.45 , -0.8 , 3.15}, {-0.8 , -0.45 , 3.15},
{-0.8 , 0.0 , 3.15}, {-0.112 , -0.2 , 2.7}, {-0.2 , -0.112 , 2.7},
{-0.2 , 0.0 , 2.7}, {0.0 , 0.002 , 3.15}, {-0.8 , 0.45 , 3.15},
{-0.45 , 0.8 , 3.15}, {0.0 , 0.8 , 3.15}, {-0.2 , 0.112 , 2.7},
{-0.112 , 0.2 , 2.7}, {0.0 , 0.2 , 2.7}, {0.45 , 0.8 , 3.15},
{0.8 , 0.45 , 3.15}, {0.112 , 0.2 , 2.7}, {0.2 , 0.112 , 2.7},
{0.4 , 0.0 , 2.55}, {0.4 , -0.224 , 2.55}, {0.224 , -0.4 , 2.55},
{0.0 , -0.4 , 2.55}, {1.3 , 0.0 , 2.55}, {1.3 , -0.728 , 2.55},
{0.728 , -1.3 , 2.55}, {0.0 , -1.3 , 2.55}, {1.3 , 0.0 , 2.4},
{1.3 , -0.728 , 2.4}, {0.728 , -1.3 , 2.4}, {0.0 , -1.3 , 2.4},
{-0.224 , -0.4 , 2.55}, {-0.4 , -0.224 , 2.55}, {-0.4 , 0.0 , 2.55},
{-0.728 , -1.3 , 2.55}, {-1.3 , -0.728 , 2.55}, {-1.3 , 0.0 , 2.55},
{-0.728 , -1.3 , 2.4}, {-1.3 , -0.728 , 2.4}, {-1.3 , 0.0 , 2.4},
{-0.4 , 0.224 , 2.55}, {-0.224 , 0.4 , 2.55}, {0.0 , 0.4 , 2.55},
{-1.3 , 0.728 , 2.55}, {-0.728 , 1.3 , 2.55}, {0.0 , 1.3 , 2.55},
{-1.3 , 0.728 , 2.4}, {-0.728 , 1.3 , 2.4}, {0.0 , 1.3 , 2.4},
{0.224 , 0.4 , 2.55}, {0.4 , 0.224 , 2.55}, {0.728 , 1.3 , 2.55},
{1.3 , 0.728 , 2.55}, {0.728 , 1.3 , 2.4}, {1.3 , 0.728 , 2.4},
{0.0 , 0.0 , 0.0}, {1.5 , 0.0 , 0.15}, {1.5 , 0.84 , 0.15},
{0.84 , 1.5 , 0.15}, {0.0 , 1.5 , 0.15}, {1.5 , 0.0 , 0.075},
{1.5 , 0.84 , 0.075}, {0.84 , 1.5 , 0.075}, {0.0 , 1.5 , 0.075},
{1.425 , 0.0 , 0.0}, {1.425 , 0.798 , 0.0}, {0.798 , 1.425 , 0.0},
{0.0 , 1.425 , 0.0}, {-0.84 , 1.5 , 0.15}, {-1.5 , 0.84 , 0.15},
{-1.5 , 0.0 , 0.15}, {-0.84 , 1.5 , 0.075}, {-1.5 , 0.84 , 0.075},
{-1.5 , 0.0 , 0.075}, {-0.798 , 1.425 , 0.0}, {-1.425 , 0.798 , 0.0},
{-1.425 , 0.0 , 0.0}, {-1.5 , -0.84 , 0.15}, {-0.84 , -1.5 , 0.15},
{0.0 , -1.5 , 0.15}, {-1.5 , -0.84 , 0.075}, {-0.84 , -1.5 , 0.075},
{0.0 , -1.5 , 0.075}, {-1.425 , -0.798 , 0.0}, {-0.798 , -1.425 , 0.0},
{0.0 , -1.425 , 0.0}, {0.84 , -1.5 , 0.15}, {1.5 , -0.84 , 0.15},
{0.84 , -1.5 , 0.075}, {1.5 , -0.84 , 0.075}, {0.798 , -1.425 , 0.0},
{1.425 , -0.798 , 0.0}};

Copy this two files on your project folder (as same as bteapot.c)

No related posts.