During Investigating an Interaction, I Monitor a Motion;
While I Monitor a Motion, I try to Deduct a Direction;
After I Deduct a Direction, I may Conclude a Connection;
From the Concluded Connection, I can Accumulate a series of Actions;
for most updated version visit:
Diablo
Forum |
|
![]() My Sky (lyric)
3. my roommates 4. grand church 6. Dean and me.
Assignment 1. English translation of Chinese poem 4. Exam Program {You are not fish, how can you know the joy of fish} A. Knight's Tour★ B. zebra puzzle★ C. Maze(1)★ D. Maze(2)★ E. Maze(3)★ F. 24game★ G. Morse★ H. Quicksort (template)★★ I. Dynamic List★★ Download
My days in Concordia Program (You are not fish, how can you know the joy of fish) 1. Dictionary★ 3. Logic★ 4. Matrix(1)★ 5 Matrix(2)★ 6. Stack 7. Detective★ 8. ArrayTest 9. WordReader 10.PowerDictionary★★ 11.Logic(improved)★★ 12.SuperDictionary★★ 13.Sentence 14.PowerLogic★★ 15.CodeCompetition1★ 16.CodeCompetition2★ 17.CodeCompetition3★ 18.CodeCompetition4★ 20. C++ little game(assignment) 21. Square root (MASM version)★★ 22. Square root (improved version)★★ 24.C++ assignment (simplified Monopoly) 25. Matrix(3)★ 26. MyLib(MASM)★★ 27. LogicSets(1) 29. Prove by contradiction (application of Logic)★★ 30. Relation(1) 32. Relation(2) 33. Generator(1)★ 34. WhoAmI★ 35. RSA(1) encryption★★ 36.RSA(2) encryption★★ 37.RSA(2.5) encryption★★ 38. Generator(2)★ 39. Counting★ 40. SpaceWalker★ 41. Depth-First-Search★★ 42. Container 43. Partition★ 44. Matrix3★ 45. NumberDivider★ 46. CountNumber★ 47. Dijkstra★ 48. Consecutive★ 49. Prim★ 50. Kruskal 51. Queue 52. SortMachine★ 53. Cartesian 54.Fraction 55. DFS--Standardized★★ 56. Zebra--DFS★★ 57. Polynomial★ 58. StackArray 59. DFSArray★★ 60. Missionary★★ 61. Message 62. NewKnights★★ 63. NewWordReader★★ 64. ArrayException★ 65. StringSearch★★ 66. Poke 67. Sequence 68. Haskell★ 69. Reduce1★ 70. Shuffle 71. Reduce2★ 72. SimpleShuffle 73. Reduce3★ 74. Crap 75. Haskell2 76. DirViewer★★ 77. Login★★ 78. SimpleLogin 79. Reduce4★ 80. LevelPrint 81. Dynamic-Static 82. Double-Library 83. withoutDynamic 84. SortComp 85. Radix 86. Schedule 87. TemplateArray★ 88. makefile 90. shortest★ 92. practice(1) 93.simpleScanner★★ 94.practice(2) 95. depend 96. depend(improved) 97. memoryManagement 98. Practice(3) 99. AVLTree★★ 100. MinMaxHeap(1) 101. MinMaxHeap(2) 102. Helloworld 103. MinMaxHeap(3) 104. MinMaxHeap(4)★ 105. RealScanner★ 106. CFGReader★ 107. Table-Driven-Scanner★★ 109. StrangeDictionary★ 110. LayoutManager 111. WhyJava? 113. CFGReader-RLR1★ 114. CFGReader-RLR2★ 116. CFGReader-Follow★ 117. CFGReader-Table★ 118. CFGReade-Parser★★ 119. CFGReade-LookAhead★★ 120. practice(4) 121. PrefixSum 122. Philosopher 123. SleepingBarber 124. ConsoleDisplay 125. ConsoleBoard 127. Console-rummy 128. AVLTree-Remove★★ 129. CFGReade-LR(0)★★ 130. CFGReade-LR(1)DFA★★ 131. Console-Rack 132. Hash-Table★ 133. PrefixSum-Multi 134. PrefixSum-final 135. Console-Player 136. CFGReade-LL(1)Symtab★★ 137. Platform&Bridge 138. LL(1)Symtab-debug★★ 139. WordRover(1) 140. WordRover(2) 141. LL(1)-3-add-code★★5/4 142. WordRover-ultimate★★7/4 143. Parallel-Rank-List8/4 144. WordRover-perfect★★9/4 145. Transaction 146. CFGReader-moon1★ 147. CFGReader-moon2★20/4 147. CFGReader-moon3★★21/4 148. Multiple-Reader28/4 149. 24Revisited2/5 150. Vigenere3/5 151. JapanCode 10/5 152. Polynomial-revised 25/5 153. Dependency-Reader 28/5 154. Dependency-Set 29/5 155. Dependency-Key 1/6 156. Dependency-Canonical 3/6 157. CallBack-Template 4/6 158. Dependency-Application★★ 5/6 159. Random-Data-Generator 13/6 160. QAR-Project ★17/6 161. Enigma-failure 27/6 162. Enigma-Success★ 29/6 163. SQLServer-Connector 5/7 164. Replace 7/7 165. 15Puzzle-Failure 8/7 166. SequenceDFA ★★?/?(a year ago?) 167. 15Puzzle-AnotherFailure 12/7 168 water-allocation 14/7 169. BloodTest★ 18/7 170. BloodTest2 19/7 171. Labyrinth 23/7 172。Snake 25/7 173. MySet★★ 27/7 174. MySet-PowerSet★★ 29/7 175. Huffman 10/8 176. NaughtyBoys 16/8 177. Elevator1 21/8 179. repeatFinding 25/8 180. tracker 29/8 181. file-transfer 13/9 182. SimpleVector 15/9 183. FTPServer 17/9 184. FileTransfer★★ 21/9 185. Lempel-Ziv-1 3/10 186. UDP★★ 11/10 187. LCS 19/10 188. LCS-experiment 8/11 189. monotone 10/11 190. monotone-analysis 12/11 191. goback-N★★ 14/10 192. Dynamic-Programming★ 17/11 193. LCS_counting 17/11 194. goback-N(largeSequence) 20/11 195. PocketRuler 26/11 196. Bellman-Ford 29/11 197. Scheduler-I★ 02/12 198. Scheduler-II★★ 04/12 199. Template-Vector(failure) 12/12 200. extensible-hashing★ 27/12 201. bitmatrix(trivial) 07/01 202. unix (practice)14/01 203. searchString-Linux 22/01 204. dynamicArray-Linux 24/01 205. SRC-Linux 30/01 206. TicTacToe 26/02★at nick of time 207. File-Server1 26/03 208. 3-CNF(naive) 27/03 209. 3-CNF(slight-improved) 28/03 210. minishell ★ 30/03 211. file-server2 ★ 05/04 212. quantum-collision ★ 09/04 213. quantum-scheduler ★ 22/04 214. inexactmatch 04/05 215. bigNumber(trivial) 14/05 216. inexactmatch-DFS 10/05 217. inexactmatch-pureC 30/05 218. GlutObject 12/10 219. CNF-Converstion 12/10 220. Transformation(trivial) 15/10 221. helicopter 16/10 222. cnf-sat 21/10 223. 15puzzle-revisited 28/10 224. GlutObject-face 28/10 225. GlutObject-Success30/10-11/05★ 226. helicopter-camera 31/10 227. alpha-beta-prune ★ 04/11 228. zebra-tester 08/11 229. zebra-brute-force 13/11 230. shortest-path(scheme) 28/11 231. HEX-game-human-AI 01/12 232. ID3 03/12 233. LatinSquare(trivial) 15/01 234. FirstJava(RMI) ★ 30/01 235. gifPartition (first MPI) 04/02 236. BankServer(CORBA) ★★ 22/02 237. Quantity(template)★ 26/02 238. MinimalWeight★ 03/03 239. MinimalWeighy(MPI-Imp)04/03 240. Comb-Algo-Prog 05/03 241. BankServer(Web)★ 07/03 242. MinimalWeighy(Final)★10/03 243. Trotter-Johnson 15/03 244. max-clique 24/03 245. sudoku(trivial) 28/03 246. Primary-Back(huge)★★ 13/04 247. Danckinglink★ 14/04 249. Comb-Algo-Final★ 09/04 250. HowEasy 29/08 251. RemoteWakeup(fake) 30/10 252. Reg-Sample-Sort 08/11 253. ConvexHull 04/01 254. ConvexHull-display 06/01 255. rootReader(trivial?)19/01 256. simplePolygon(trivial?)01/02 257. hibernate(practice)09/02 258. ply-reading(practice)12/03 259. outOfCore(preprocess)18/03 260. RenderEngine(NoWorking)22/03 261. trianGO(game of GO)04/04 262. LinuxDeviceDriver 06/04 263. OutOfCoreRendering 09/04 264. GPU-Programming 09/04 265. chopper2005(forgotten) 09/04 266. OutOfCoreRenderingfinal)15/04 267. zebra-again ★ 01/05 268. bmpReader(temporary)15/08 269. jpegEditor ★ 20/08 270. jpegEditor(Intel-IJL)10/09★ 271. MAPI-readMail(joke) 25/09 272. multi-pro-con ★27/09 273. threadTest(test)09/10 274. renderBox(huge)★★★16/10 275. matching 18/10 276. basicMessage(practice) 30/10 277. prerequisites 20/02 278. TopCoder(2001-semi)25/02 279. TopCoder(2002-semi)13/03 230. My-GDI-SDK(link-only)13/03 231. MySQL(link-only)13/03 232. HttpServer(link-only)13/03 233. HttpServer(multi-thread)25/03 Legend: 1. ★ average 2. ★★ good 3. ★★★ no such stuff! Code competition Record {So it is said. So it is written.} 1. Probability 2. Hardware 4. Misc 6. Newcomer 7. Java 8. database 10. memorandum 11. scheme 12. graphic Footstep (Assignments) 1. Comp229 2. Comp335 3. Comp352 4. Comp348 5. MyView 6. MyReview 7. MyIdea Tutorials Download 1. MyTree 3.Square root by MASM (improved) 7. chessboard 8. source code of chessboard(cheating) 12.Assembly assignment (final verstion) (win98 OK, XP cannot see mouse) 13.input matrix of shortest path (Dijkstra). 16. input of Scanner 18. input for strange dictionary 19. input for testing strange dictionary 22. Moon-Machine 27. Dependency
My future??? |
when pictures in brain become blurred, we can only seek answer in digital stored solution. (Came here before? This might be what you are looking for.) The dirt and dust from my pilgrimage form the oceans of stars... (my main page which is in Chinese)
It all starts like this... (Do you know why you can see these garbage?) The day-dreaming-gossip is so long that I save them here and here you will only see the latest ones. 08/11/06 When I looked at it, I didn't see it; When it was removed, I felt its existence; When it was brought in, I realized its significance; Finally I carve its figure in my heart and then I get a visual; This is called recognition. From time to time, I was bothered by a simple question. Which way is easier for us to notify? To add a small tree into a forest or to remove a small tree from a forest? If this is considered as a meaningless question, then how about this one? To add a tree in a grassland where no tree is there at all or to remove the single tree from grassland so there is no tree in grassland. Which way is easier to notice? Probably same and most people would say that. If the above questions are all nonsense, then how about this question. In a structured system, say an AVL tree which means a balanced binary search tree. Does it cost same when you either add one element into the tree or remove one element from the tree? Not exactly same because it depends how we implement the structure of AVL tree. In some data structure, maybe removing is easier. So, back the above question, it depends. It depends on how you construct your knowledge system to represent what you see and how you implement a "fast-recognition" algorithm. Of course the above comments are all garbage which I don't believe myself. I finished the "regular-sampling-quick-sorting" of MPI. 14/11/06 Yesterday Dr. Hopcroft came to make a lecture and here is some inspiration from his lecture. Or precisely it is simply what I remembered. 24/12/06 I guess the origin of AI is from vision because it is the most intuitive method to observe and recognize pattern. Maybe all high-level concepts need to be first transferred into visual image before comparison and recognition are done. 4/01/07 Convex Hull is a typical algorithm that the definition gives out the clue of construction itself! See, the definition says that any edge of the two vertices in the convex polygon will leave all other vertices in its right-hand-side. And the algorithm takes advantage of this. After the lecture I spent about one and half hour to finish a simple implementation of this algorithm. When I finished, I noticed the name of algorithm is "Graham's Scan-type". I am happy because it proves I am still capable of coding after so many months. Even though I am doing the MPI programming which is far more hard than these kind of single-machine programming. 14/01/07 99% of Chinese ancient philosophy is purely mysticism which is practically useless except for fortune-telling. Their dirty trick is to use as many as ambiguous terms, words, concepts, expressions etc. to express something so ambiguous such that they can always explain themselves if you are foolish enough to give the truth before asking for prediction. Most defenders of so-called Chinese traditions feel so blindly proud for this kind of useless philosophy and claim it to be unique. Let me quote President Bush to comment on this: Shame on you and a fool cannot be fooled again. (These are so popular in "youtube" and surely you will find it by searching "Bush") However, there is something I also feel like to note down and it is one of my favorite. For those who consider themselves as guru of programming and experts of AI, this might be interesting. "Expressions themselves cannot be expressed; Names themselves cannot be named." This is the very first sentence from <DaoDeJing> which is one of most famous ancient Chinese philosophy. And maybe it touches the most profound and most basic topics of language and origin of intelligence. 01/02/07 It is said that I think, so I live. In order to prove I am alive, I write a simple algorithm to generate simple polygon from a set of points because I only think when I do coding. Thus I live when I am programming. The trivial algorithm is inspired by assignment from comp6711. 0 |