參考 http://datomatic.no-intro.org/index.php?page=show_record&s=62&n=1513
測試環境:Win7, x64 ppsspp0.9.8 x64
2014年4月21日 星期一
2014年4月20日 星期日
流星洛克人1 金手指好友
金手指好友(slot 4~6)
三版本各一隻,可用所有變身+Link ability, 不能用他們的卡片(沒放資料進去)
brother等級跟玩家等級同步 應該吧
2214150F 00000002
0213E10C 00000100
2213E10F 00000001
22141517 00000002
0213E89C 00000100
2213E89F 00000002
2214151F 00000002
0213F02C 00000100
2213F02F 00000003
8213C2C9 00000000
D3000000 0213C2C9
F213E109 00000001
F213E899 00000001
F213F029 00000001
D2000000 00000000
三版本各一隻,可用所有變身+Link ability, 不能用他們的卡片(沒放資料進去)
brother等級跟玩家等級同步 應該吧
2214150F 00000002
0213E10C 00000100
2213E10F 00000001
22141517 00000002
0213E89C 00000100
2213E89F 00000002
2214151F 00000002
0213F02C 00000100
2213F02F 00000003
8213C2C9 00000000
D3000000 0213C2C9
F213E109 00000001
F213E899 00000001
F213F029 00000001
D2000000 00000000
2014年1月23日 星期四
[note] Lenovo T420s - recover MBR (remove Linux and grub2)
So I've tried Linux Mint for a couple of days and decide to remove it, mainly because it lacks hardware driver supports.
2014年1月20日 星期一
[note] Dual boot on Lenovo T420s
This is just a note on what I've tried and worked.
Operating System: Win 7 X64 Professional (pre-installed), wanted to install Linux Mint 16 Cinnamon x64
Operating System: Win 7 X64 Professional (pre-installed), wanted to install Linux Mint 16 Cinnamon x64
2013年11月19日 星期二
What I learned from this team project
So, we officially screwed up this team project and I assume I'm gonna lose all 15 points of total grades, but this is what I learned:
1. Never, ever, trust anyone's progress until you see his/her code and execution result.
2. Apply software layering (use object-oriented) as much as possible so that it will be easier to divide work and less pain when we try to merge everyone's work, and may be easier to find out who's responsible for the bug.
3. Set up schedule (mile stones) as early as possible and make it into a document and require everyone to follow it, and don't expect everyone meets the schedule, be flexible and ready for behind the schedule.
4. List all the requirements and make sure each requirement has at least one member response to it, better make it into a document
5. If this is a network application, it's better to just have one member implement network layer and focus on setup connection on the network environment.
6. Strictly define interfaces between software layers and network protocols, write them down into a document (as detail as possible) so that everyone has a standard to follow, again, don't expect everyone will follow it, but it will make the progress less pain.
7. Leave enough time (at least one week I think) for merging everyone's work, because that's the time when everything goes wrong.
Finally, if your team member just don't do anything, it's better to do the project by yourself than trying to ask him/her to work.
Hopefully the other team project won't be screwed up, and I wish I'll never do team project again....
1. Never, ever, trust anyone's progress until you see his/her code and execution result.
2. Apply software layering (use object-oriented) as much as possible so that it will be easier to divide work and less pain when we try to merge everyone's work, and may be easier to find out who's responsible for the bug.
3. Set up schedule (mile stones) as early as possible and make it into a document and require everyone to follow it, and don't expect everyone meets the schedule, be flexible and ready for behind the schedule.
4. List all the requirements and make sure each requirement has at least one member response to it, better make it into a document
5. If this is a network application, it's better to just have one member implement network layer and focus on setup connection on the network environment.
6. Strictly define interfaces between software layers and network protocols, write them down into a document (as detail as possible) so that everyone has a standard to follow, again, don't expect everyone will follow it, but it will make the progress less pain.
7. Leave enough time (at least one week I think) for merging everyone's work, because that's the time when everything goes wrong.
Finally, if your team member just don't do anything, it's better to do the project by yourself than trying to ask him/her to work.
Hopefully the other team project won't be screwed up, and I wish I'll never do team project again....
2013年10月27日 星期日
廢文
這是一篇廢文
這個網誌又進入放置狀態
一方面是現在即時通訊、社交網站等等分掉了寫網誌的能量
還有就是學得東西越來越難 也沒什麼時間好好整理並寫成一篇文章
這個blog本來目的是要放一些程式的心得
不過現在很多東西其實Google就能找到一堆寫得比我好的主題了
所以我常常也不知道要發什麼文
另外blog貼程式碼實在是很不方便 (HTML的原罪)
前一陣子聽說有台灣人創立了Logdown網站
就是讓張貼程式碼這件事變簡單的一個平台
也許有機會會去試看看
最後
很久沒寫C++,都被Java和python寵壞了
C跟C++有太多細節必須去查去注意 寫起來實在很煩
不過熟悉C++的同時也會熟悉實際上電腦硬體是怎麼處理這些問題的
算有好有壞吧
我是覺得我可能還是需要一本進階的C++ guide來加強底子
網路上的範例和教學都太雜亂了
這個網誌又進入放置狀態
一方面是現在即時通訊、社交網站等等分掉了寫網誌的能量
還有就是學得東西越來越難 也沒什麼時間好好整理並寫成一篇文章
這個blog本來目的是要放一些程式的心得
不過現在很多東西其實Google就能找到一堆寫得比我好的主題了
所以我常常也不知道要發什麼文
另外blog貼程式碼實在是很不方便 (HTML的原罪)
前一陣子聽說有台灣人創立了Logdown網站
就是讓張貼程式碼這件事變簡單的一個平台
也許有機會會去試看看
最後
很久沒寫C++,都被Java和python寵壞了
C跟C++有太多細節必須去查去注意 寫起來實在很煩
不過熟悉C++的同時也會熟悉實際上電腦硬體是怎麼處理這些問題的
算有好有壞吧
我是覺得我可能還是需要一本進階的C++ guide來加強底子
網路上的範例和教學都太雜亂了
2013年8月28日 星期三
JTChat 2013.09.08
有任何bug請回報
但請勿要求新功能
請用留言進行bug回報,或者有功能不會使用的話也可以問
我向來不擅長UI設計和操作說明 需要你們的feedback才能改進 謝謝
JTChat
===========
自製IRC Client, 設計給Jtv/Twitch實況主抓取聊天室畫面使用
目前還沒有欄位防呆設計,請不要回報因設定欄位格式不合(ex. Port填英文)所產生的錯誤 謝謝
但請勿要求新功能
請用留言進行bug回報,或者有功能不會使用的話也可以問
我向來不擅長UI設計和操作說明 需要你們的feedback才能改進 謝謝
JTChat
===========
自製IRC Client, 設計給Jtv/Twitch實況主抓取聊天室畫面使用
目前還沒有欄位防呆設計,請不要回報因設定欄位格式不合(ex. Port填英文)所產生的錯誤 謝謝
2013年7月18日 星期四
Jarexe
寫了個小工具 Jarexe
主要是有些人在Windows下沒辦法點兩下打開jar檔
(檔案關聯被蓋掉的關係,其實通常解安裝再重安裝一次java都會重設好)
以後也許還會再擴充功能讓它更方便使用
現在先寫個粗糙的教學
使用方法就是把檔案解壓縮後編輯jarexe.ini檔
在第一行指定javaw.exe的位置
第二行指定jar檔的位置
檔案位置用絕對或相對路徑都可以
編輯好後點開jarexe.exe就行了
注意java是不支援開啟路徑包含Unicode的jar檔的
GitHub
https://github.com/fuunkaosekai/Jarexe
下載點
https://mega.co.nz/#F!eM8zDDrI!K0B1zTthA-dRFmvlQubOEQ
主要是有些人在Windows下沒辦法點兩下打開jar檔
(檔案關聯被蓋掉的關係,其實通常解安裝再重安裝一次java都會重設好)
以後也許還會再擴充功能讓它更方便使用
現在先寫個粗糙的教學
使用方法就是把檔案解壓縮後編輯jarexe.ini檔
在第一行指定javaw.exe的位置
第二行指定jar檔的位置
檔案位置用絕對或相對路徑都可以
編輯好後點開jarexe.exe就行了
注意java是不支援開啟路徑包含Unicode的jar檔的
GitHub
https://github.com/fuunkaosekai/Jarexe
下載點
https://mega.co.nz/#F!eM8zDDrI!K0B1zTthA-dRFmvlQubOEQ
2013年6月13日 星期四
put motorola SBG6580 into bridge mode (TWC)
It seems that some options have changed for the firmware version SBG6580-3.5.8.2-GA-00-488-NOSH
Rg passthrough is no longer available
after some googling and try outs I managed to make it work again
Rg passthrough is no longer available
after some googling and try outs I managed to make it work again
2013年6月12日 星期三
2013年6月6日 星期四
[自製小遊戲]Block Attack
最近這幾天在弄的小遊戲
有點類似特訓99
因為是用python寫成再轉exe的 不確定在其他電腦上能不能執行
如果無法執行請告訴我 謝謝
下載點:
https://mega.co.nz/#F!ecc0WC7R!G-tLKVXBPiIYk4HdMIKPdQ
下載後打開BlockAttack.exe就可以玩
操作: ENTER鍵開始 方向鍵移動
被方塊夾死就輸了
遊戲沒有破關,純粹看你能撐多久
有點類似特訓99
因為是用python寫成再轉exe的 不確定在其他電腦上能不能執行
如果無法執行請告訴我 謝謝
下載點:
https://mega.co.nz/#F!ecc0WC7R!G-tLKVXBPiIYk4HdMIKPdQ
下載後打開BlockAttack.exe就可以玩
操作: ENTER鍵開始 方向鍵移動
被方塊夾死就輸了
遊戲沒有破關,純粹看你能撐多久
2013年5月20日 星期一
2013年4月3日 星期三
2012年12月2日 星期日
[Algorithm] NP
P:
decision problem that can be solved by a deterministic turning machine
NP:
decision problem that can be solved by a non-deterministic turning machine
it is still unknown that P=NP or P != NP
NP-Hard
NP-hard is at least as hard as NP-Complete
至少和NP-Complete一樣難
NP-hard不一定要是decision problem
prove a problem is in NP
1. you can guess a solution in polynomial time
2. you can check the solution in polynomial time
prove a problem is NP-hard
for all NP-Complete problem, if those problems can reduce to this problem, then this problem is NP-Hard
(in practice, 只要找到一個NP-Complete reduce就好)
prove a problem belongs to NP-Complete:
證明該問題
(1)屬於NP
(2)屬於NP-Hard
因為NP-Complete有包含NP-Hard 代表他們彼此都可互相reduce
所以其實只要找到一個NP-Complete problem reduce就可以證明該問題屬於NP-Hard
又
NP-Complete is unlikely to have a polynomial-time solution (still unknown)
只要找到任一個NP-Complete problem的polynomial time solution
因為可以互相reduce的關係,我們即證明所有NP-Complete的問題都可以在
polynomial-time 解出來 ,因此證明P=NP
the first NP-Complete problem: SAT
(SATISFIABILITY: the boolean satisfiability problem for formulas in conjunctive normal form)
decision problem that can be solved by a deterministic turning machine
NP:
decision problem that can be solved by a non-deterministic turning machine
it is still unknown that P=NP or P != NP
NP-Hard
NP-hard is at least as hard as NP-Complete
至少和NP-Complete一樣難
NP-hard不一定要是decision problem
prove a problem is in NP
1. you can guess a solution in polynomial time
2. you can check the solution in polynomial time
prove a problem is NP-hard
for all NP-Complete problem, if those problems can reduce to this problem, then this problem is NP-Hard
(in practice, 只要找到一個NP-Complete reduce就好)
prove a problem belongs to NP-Complete:
證明該問題
(1)屬於NP
(2)屬於NP-Hard
因為NP-Complete有包含NP-Hard 代表他們彼此都可互相reduce
所以其實只要找到一個NP-Complete problem reduce就可以證明該問題屬於NP-Hard
又
NP-Complete is unlikely to have a polynomial-time solution (still unknown)
只要找到任一個NP-Complete problem的polynomial time solution
因為可以互相reduce的關係,我們即證明所有NP-Complete的問題都可以在
polynomial-time 解出來 ,因此證明P=NP
the first NP-Complete problem: SAT
(SATISFIABILITY: the boolean satisfiability problem for formulas in conjunctive normal form)
訂閱:
文章 (Atom)