2008年12月8日 星期一

富士一日本料理

算是三峽這邊少數好吃的店家吧
這周末回去前做了突破去吃了他的饅魚定食
嗯 >///< 鰻魚入口即化 不過我覺得醬汁甜了一點 ^^" 但還是很優啦 小塊的豬排也不錯 茶碗蒸裡面的廖也很實在不會偷工減料 吃的超飽的 滿足 XDDD 從前只吃過天丼、牛丼、親子丼、勝丼跟海苔蛋麵 這次終於做了新突破 XDDD 也沒讓我失望 推薦大家可以去吃 yahoo 生活+ 查的到地址唷 在過小橋直直走過全聯到底右轉的左手邊~~~ ^^

2008年12月6日 星期六

Wishmaster - Nightwish

正常版:


錯誤歌詞搞笑版:


Master!
Apprentice!
Heartborne, 7th Seeker
Warrior!
Disciple!
In me the Wishmaster


Master!
Apprentice!
Heartborne, 7th Seeker
Warrior!
Disciple!
In me the Wishmaster


Elbereth
Lorien


A dreamy-eyed child staring into night
On a journey to storyteller`s mind
Whispers a wish speaks with the stars the words are silent in Him
Distant sigh from a lonely heart
"I`ll be with you soon, my Shalafi"
Grey Havens my destiny


Silvara
Starbreeze


Sla-Mori the one known only by Him
To august realms, the sorcery within
If you hear the call of arcane lore,
Your world shall rest on Earth no more
A maiden elf calling with her cunning song
"Meet me at the Inn of Last Home"
Heartborne will find the way!


Wishmaster
Crusade for Your will
A child, dreamfinder
The Apprentice becoming...

End Of All Hope - Nightwish



It is the end of all hope
To lose the child, the faith
To end all the innocence
To be someone like me
This is the birth of all hope
To have what I once had
This life unforgiven
It will end with a birth

No will to wake for this morn
To see another black rose born
Deathbed is slowly covered with snow
Angels, they fell first but I'm still here
Alone as they are drawing near
In heaven my masterpiece will finally be sung
It is the end of all hope
To lose the child, the faith
To end all the innocence
To be someone like me

Wounded is the deer that leaps highest
And my wound it cuts so deep
Turn off the light and let me pull the plug
It is the end of all hope
To lose the child, the faith
To end all the innocence
To be someone like me
This is the birth of all hope
To have what I once had
This life unforgiven
It will end with a birth

Mandylion without a face
Deathwish without a prayer
End of hope
End of love
End of time
The rest is silence

Mandylion without a face
Deathwish without a prayer
End of hope
End of love
End of time
The rest is silence

It is the end of all hope
To lose the child, the faith
To end all the innocence
To be someone like me
This is the birth of all hope
To have what I once had
It is the end of all hope
To lose the child, the faith
To end all the innocence
To be someone like me
It is the end of all hope
To lose the child, the faith
Oh,end of all hope

Walking In The Air - Nightwish



We're walking in the air
We're floating in the moonlit sky
The people far below are sleeping as we fly

I'm holding very tight
I'm riding in the midnight blue
I'm finding I can fly so high above with you

Far across the world
The villages go by like trees
The rivers and the hills
The forests and the streams
Children gaze open mouth
Taken by surprise
Nobody down below believes their eyes
We're surfing in the air
We're swimming in the frozen sky
We're drifting over icy
Mountains floating by

Suddenly swooping low on an ocean deep
Arousing of a mighty monster from its sleep

We're walking in the air
We're floating in the midnight sky
And everyone who sees us greets us as we fly
I'm holding very tight
I'm riding in the midnight blue
I'm finding I can fly so high above with you

回家

把拔寫了一張單子

1.星期六需倒垃圾。

2.晚上六點燒香、餵魚。

3.星期日中午在家吃火鍋。

4.星期日上午媽媽要帶你到環球買衣服。

5.帶妹妹時多帶一頂安全帽,後附地圖一張。

嗯...很酷,真的在memo後面畫了一張地圖 = =b

啼笑皆非的感覺 XD"... 好像被當成路癡了 呵呵

不過今天太晚回家了

讓奶奶等了一下午,唉,兩邊難做人。

美津濃

剛剛才發現...

原來我家附近的"同鞋會"跟"新運動家"

還有不遠處的"萬岳"都有賣桌球鞋耶!!

要不要衝一個呢 XD"... 科科 還是要拉蔻死呢...

練球


1.左腳站的位置在右腳後面

2.左手抽球引拍靠腳跟腰帶

3.反手切球要多練

4.左手抽球擊球點抓不準

5.練球時要想著自己是左撇子

6.發球要練

7.左手手腕、左腳膝蓋、左腳腳踝痛,修養一天

8.周日晚上練球加油

感謝今天小魚幫忙做專業指導

也凸顯我的教導很差勁

真的會打不會教 不知道該怎麼辦 唉

自己也好久沒專注練球了... 悶悶

加上感冒 今天打球四肢都沒什麼力氣

不開心 = 無言+無奈 ;

return 不開心 ;

2008年12月5日 星期五

魔獸世界: 巫妖電視王 [中文版] Wrath of A Couch Potato

資訊展


成員就跟昨天一樣:Angie、丁、我,
中午在板橋匆匆吃了博多拉麵就火速前往市政府站,( 順帶一提,
味道好重喔吃不習慣 )急到某A連吃藥都忘記了 = =
還好是周四去的,否則若在周末應該完全擠到無法動彈吧!

幫小魚拿了幾家日系相機的DM,可惜沒看到富士的相機,
不懂為啥他只擺了筆電呢,更扯的是沒有國際牌的攤位,超怪!

主打為Angie的筆電,不過應該都大同小異吧,不玩遊戲就用不到獨立顯卡,
也不常看avi等高畫質影片,3D也只是用OpenGL做coding,果然如猜測是依照外觀決定,
反正功能都大同小異,買了日後看了順眼最重要,TOSHIBA M300果然很唯美風,
不適合男人,哈哈,不過配的是獨立顯卡,看來妳要學著打魔獸了 XD?

TOSHIBA熱血的sells還跑進跑出的給我們領貨的地圖,真是太敬業了 m(_ _)m
順便買了一條DDR2-800 2GB的RAM800元,還有一個8GB隨身碟跟外接硬碟的防震包830元,
總共花了1,630元,還有相機的電池跟SD卡要買,繼續使用老相機 XD"...撐住阿
雖然你是四年多前的水貨 哈哈!

可惜的是沒幫詠寧拿到包子槌,實在太多人排隊了,去了第一次是暫停排隊,
第二次再去就變成本日排隊已結束,太扯,比扯鈴還扯,
還好有拿到TOSHIBA的PaLa Chan娃娃,超可愛的啦 >///<
沒拿到包子槌也沒有即時趕回去開店,感謝詠寧幫我顧了一晚,獻上Mister Donuts表達感激,
吃胖一點吧 哈哈哈!

資訊展撈到不錯的東西,明天希望小魚去也有收穫,
買了筆電專題加油,難得為妳做些什麼,好好努力,
雖然我今天那份papper看起來就跟天書一樣 唉 ~"~... 無奈阿
明天計組... 想把極地長征看完 XDDDDDDDDDDDDD

2008年12月4日 星期四

忙裡偷閒


非法警戒 ( PRIDE AND GLORY )

預告片 電影介紹

跟一般的警匪片不同,看完覺得是值得深思的一部片,除了開頭有點鬆散,以及 typical American movie 裡面很"fucking"出現之外,大致上都很棒,沒有過多的動作也沒有過多的華麗畫面麻痺觀眾視覺,就是能讓人看了感觸很深,不禁思索,面對名利、財富,良知還剩下多少?是否在追逐這一切的時候,反而忽略了當初的動機?幾個簡單的問題,卻難以肯定的回答。是一部值得一看的電影。




忙裡偷閒,考完試都沒有鬆一口氣的感覺,放下一切喘口氣去偷偷看了場電影,
也去吃了很久沒吃的古拉爵,或許是我口味重,覺得很好吃啦,尤其是最後的飲料超優,
不過今天是個特別的日子吧,站在固定某個位置的服務生都會打翻或打破東西,
天阿!有神快拜!

另外有兩部預告片也不錯"畫皮",經典對白:原來我們都是妖精!
XDDD  不知道為啥看到這句覺得很好笑!
"雷霆戰狗",狗狗超可愛的啦,尤其是最後花栗鼠說要去擰斷警衛脖子,
實在是太可愛了 >"<  好想看喔  呵呵  有機會再揪團去看。

2008年12月2日 星期二

Simulation: The Tortoise and the Hare

1.格子 1 ~ 70
2.起始位置為 1
3.每秒動一回合,先到達或超過 70 者算贏。
4.若是位置在 1 仍往後則為 1
5.烏龜位置用"T"表示;兔子位置用"H"表示;重疊則用"OUCH!!!"表示
6.一開始要印出 "BANG !!!!!"
"AND THEY'RE OFF !!!!!"
7.烏龜贏印出"TORTOISE WINS!!! YAY!!!";兔子贏印出"HARE WINS!!! YAY!!!"
8.若是同時到達終點則算是烏龜贏
9.烏龜跟兔子的步伐如下:






/* Simulation: The Tortoise and the Hare */
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

/* function prototypes */
void moveTortoise( int *turtlePtr );
void moveHare( int *rabbitPtr );
void printCurrentPositions( int *snapperPtr, int *bunnyPtr );

/* tutle and rabbit movements */
int T_move[10]={3,3,3,3,3,-6,-6,1,1,1};
int H_move[10]={0,0,9,9,-12,1,1,1,2,2};

int main()
{
srand((unsigned)time(NULL));

/* set up the initial position */
int T_square=1,H_square=1,i;

for( ; T_square<70&&H_square<70 ; )
{
/* delay 1 second per round */
clock_t start_time;
start_time = clock();
while((clock() - start_time) < 1 * CLOCKS_PER_SEC){}

  /* move and show real-time condition */
moveTortoise(&T_square);
moveHare(&H_square);
printCurrentPositions(&T_square,&H_square);
}

 /* determine who's winner */
(T_square>=70)?printf("TORTOISE WINS!!! YAY!!!\n"):printf("HARE WINS!!! YAY!!!\n");

system("PAUSE");
return 0;
}

void moveTortoise( int *turtlePtr )
{
*turtlePtr+=T_move[rand()%10];
if(*turtlePtr<=0)
*turtlePtr=1;
}

void moveHare( int *rabbitPtr )
{
*rabbitPtr+=H_move[rand()%10];
if(*rabbitPtr<=0)
*rabbitPtr=1;
}

void printCurrentPositions( int *snapperPtr, int *bunnyPtr )
{
/* redraw thw competition */
system("CLS");
printf("BANG !!!!!\n");
printf("AND THEY'RE OFF !!!!!\n");
int i;
printf(" - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n");
for(i=1;i<=80;i++)
{
if(i==*snapperPtr&&i==*bunnyPtr)
{
printf("OUCH!!!");
i+=6;
}
else if(i==*snapperPtr)
printf("T");
else if(i==*bunnyPtr)
printf("H");
else
printf(" ");
}
printf(" - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n");
}

延遲 1 秒的迴圈

// CLOCKS_PER_SEC 常為 1000 (ms)
clock_t start_time;
start_time = clock();
while((clock() - start_time) < 1 * CLOCKS_PER_SEC){}

2008年12月1日 星期一

Knight's Tour using non-recursive programing


解法:

騎士的走法,基本上可以使用遞迴來解決,但是純綷的遞迴在維度大時相當沒有效率,一個聰明的解法由J.C. Warnsdorff在1823年提出,簡單的說,先將最難的位置走完,接下來的路就寬廣了,騎士所要走的下一步,「為下一步再選擇時,所能走的步數最少 的一步。」,使用這個方法,在不使用遞迴的情況下,可以有較高的機率找出走法(找不到走法的機會也是有的)。

演算法:

for (step = 1; step < 總格數 ; step++)
{
測試下一步可以走的八個方向,並記錄下步可走的格數。

if ( 下步可走格數 == 0 )
{
return 0;
}
else if ( 可走格數 == 1 )
{
下一步只有一種可能
}
else
{
重複 if 內容找出下一步的下一步可走的最少格來走,藉此提升行走效率,
如果計算到最少格有相同者,則選第一順位來走。
}
檢查stack,找出最少出路的那一步,並replace騎士的位置,
再下一個for loop則由此新位置來走。
}

//----------------------------------------------------------------------------------------------
//若是8*8的棋盤,其中 (5,4) 這點無解
程式碼:

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

#define col_size 8
#define row_size 8

typedef struct NextMove
{
int i;
int j;
}NextMove;

void clear();
int knight(int,int);

int checker[row_size+4][col_size+4];
int step=0;
int ans=0;

// Knight's directions in X-axis and Y-axis.
const int horizontal[8]={ 2, 1,-1,-2,-2,-1, 1, 2};
const int vertical[8]={-1,-2,-2,-1, 1, 2, 2, 1};

NextMove next[row_size];

int main()
{
time_t ticks1,ticks2;
int i,j,p,t;
clear();

ticks1 = time(NULL);

for(p=2;p<row_size+2;p++)
for(t=2;t<col_size+2;t++)
{
clear();
if(knight(p,t)!=0)
{
printf("\nAns : %d\tStep : %d\n",++ans,step);
for(i=2;i<row_size+2;i++)
{
for(j=2;j<col_size+2;j++)
printf("%3d",checker[i][j]);
printf("\n");
}
}
}

ticks2 = time(NULL);

printf("\nStart time : %.24s\r\n",ctime(&ticks1));
printf(" End time : %.24s\r\n",ctime(&ticks2));

system("PAUSE");
return 0;
}

// To avoid that the knight goes out of range.
void clear()
{
int i,j;
for(i=0;i<row_size+4;i++)
for(j=0;j<col_size+4;j++)
if(i<2||i>row_size+1||j<2||j>col_size+1)
checker[i][j]=-1;
else
checker[i][j]=0;
step=0;
}

// Find the path.
int knight(int i,int j)
{
int p,t,k,temp,count;
int temp_i,temp_j,min_way,second_way[row_size];

 // Clear the next step stack
for(p=0;p<8;p++)
{
next[p].i=0;
next[p].j=0;
}

checker[i][j]=1;

for(p=1;p<row_size*col_size;p++)
{
// Clear the number of ways of each next step
for(t=0;t<8;t++)
second_way[t]=0;

  // Reset index "count"
count=0;

  // Try the eight directions
for(k=0;k<8;k++)
{
temp_i=i+vertical[k];
temp_j=j+horizontal[k];

// If the direction is passable then set up the knight,
   // and ways counting++
if(checker[temp_i][temp_j]==0)
{
next[count].i=temp_i;
next[count++].j=temp_j;
}
}

 // After trying the eight directions
  // If no ways can move
if(count==0)
return 0;
// If just one way can move then thw way is the smallest-step way
else if(count==1)
// Thw direction was pushed in next[0]
min_way=0;
// Otherwise find the smallest ways of the next ways,
  // if we got the same ways then choose the first one.
else
{
// Find the ways of each next-step way
for(t=0;t<count;t++)
// Try the eight directions like before
for(k=0;k<8;k++)
{
temp_i=next[t].i+vertical[k];
temp_j=next[t].j+horizontal[k];

if(checker[temp_i][temp_j]==0)
second_way[t]++;
}

temp=second_way[0];
min_way=0;

   // Search for the smallest ways of each next-step way
for(t=1;t<count;t++)
if(second_way[t]<temp)
{
temp=second_way[t];
min_way=t;
}
}

  // Find out the smallest ways of the next step
i=next[min_way].i;
j=next[min_way].j;
checker[i][j]=p+1;
}

step=p;
return 1;
}

OpenCV on VC 2005 Express

What Is OpenCV?
OpenCV [OpenCV] is an open source (see http://opensource.org) computer vision library available from http://SourceForge.net/projects/opencvlibrary. The library is written in C and C++ and runs under Linux, Windows and Mac OS X. There is active development on interfaces for Python, Ruby, Matlab, and other languages.

OpenCV Source 下載

因為我裝的是 Visual Studio 2005 Express

其中的 Platform SDK 要另外載 通常搜尋到的是 2003 及 2008

SDK for 2005 版本下載

VC 2005 下安裝與配置

不過想從 Borland C 入手... 還在找Crack