GTD Tiddly Wiki is a GettingThingsDone adaptation by NathanBowers of JeremyRuston's Open Source TiddlyWiki

The purpose of GTD Tiddly Wiki is to give users a single repository for their GTD lists and support materials so they can create/edit lists, and then print directly to 3x5 cards for use with the HipsterPDA.

You can specify your own styles -- that will persist even if you upgrade GTDTW -- in the new special tiddler, StyleSheet.\n\nStyleSheet is pre-populated so you can see how it works. If you want to print to different sizes of paper, or resize the base fonts, or use different fonts, the body style rules are where you'd start. If you are upgrading your version of GTDTW, you'll need to create and populate the StyleSheet for yourself.\n\nStyleSheet suffers from a bug that truncates long entries with many non-alphanumeric characters, so if you try to put the entire set off styles in there, it probably won't work.
@media screen\n{\n\nbody {\nfont: 13px/125% "Lucida Grande", "Bitstream Vera Sans", Helvetica, Verdana, Arial, sans-serif;\n}\n\n}\n\n@media print\n{\n\nbody {\n font-size: 6.2pt;\n font-family: "Lucida Grande", "Bitstream Vera Sans", Helvetica, Verdana, Arial, sans-serif;\n}\n\n}
TBC
Duc T. Ha
Personal Page
<<option chkOpenInNewWindow>> OpenLinksInNewWindow\n<<option chkSaveEmptyTemplate>> SaveEmptyTemplate\n<<option chkToggleLinks>> Clicking on links to tiddlers that are already open causes them to close\n^^(override with Control or other modifier key)^^\n<<option chkHttpReadOnly>> HideEditingFeatures when viewed over HTTP
config.options.chkHttpReadOnly = true;
[[Home]] [[Research]] [[Contact Information]]
|!Conference & Date|!Due Date|!Notification Date|\n| Usenix-ATC(May 30-June3) | Jan 9 | March 19 |\n| SIGCOMM (Aug 27-31) | Jan 31 | May 4 |\n| Poster session | April 24 | |\n| Usenix- Security(July 31- Aug) | Feb 3 | April 4 |\n| Usenix-HotDep(June 25-28) | Feb 15 | March 31 |\n| Globecom (November/December) | Mar 17 | | \n| ICCCN (Aug 11 - 16) | Mar 18 | May 11 |\n| ESORICS(Sep18-20) | March 30 | June 1 |\n| RAIDS(Sep 20-22) | March 31 | June 1 |\n| Usenix-HotBot(April 10) | Feb 26 | March 19 |\n| Usenix SRUTI(Jul 6-7) | April 20 | |\n| SRDS (Int. Symposium on Reliable Distributed Systems (Oct2-4) | April 24 | June 25 |\n| LSAD- SIGCOMM Workshop on Large Scale Attack Defense (Aug 27) | Apr 21 | Jun 01 |\n| CCS: Main conference track (Aug 26) | May 8 | Jul 29 |\n| ACSAC(Dec10-14) | June 1 |\n| CCS: WORM(Workshop on Recurring Malcode) (Nov 3rd) | June 16th | Aug 8 |\n| INFOCOM (May 6-12) | July 2(reg) | Nov 20 |\n| GLOBECOM Workshops (Nov 26-30) | Around Sep 7 | Oct 5 |\n| NDSS(28th Feb - 2nd March) | Sep 10 |\n| ICC (11-15 June) | Sep 15 |\n| Usenix-NSDI (Apr 11) | Oct 2 |\n| DSN(June 25- June 28) Workshop | Oct 18 | \n| DSN Paper | Dec 03 (abstract) - Dec 10 (full paper) |\n| IEEE PADS (May/June/Jul) | Oct 1 |\n| Oakland(Sec&Privacy)(May 20-23) | Nov 10 |\n| ICDCS:Int. Conf. on Distributed Computing Systems (June 25-29) | Nov 20 | March 1 |\n|Conferences|c
''Duc T. Ha''\n\n''Emai1:'' ducha ({at}) cse ({dot}) buffalo ({dot}) edu\n\nDepartment of Computer Science and Engineering,\nUniversity at Buffalo, the State University of New York\n201 Bell Hall Box 602000\nBuffalo, NY, 14260-2000\nUSA\n\nMobile: (716) 541-8748\nFAX: (716) 645-3464
[[CV|http://www.cse.buffalo.edu/~ducha/DucCV.pdf]]
I have been involved in the following projects:\n\n* Efficient Propagation and Routing Mechanisms for Overlay Malicious Systems. We also study potential detection and disruption methods against this threat. \n\n* Network Traffic Classification and Adaptive Filter Evasion Techniques. \n\n* (A bit of time on) the Insider Threat Mitigation problem. I developed a GUI Java tool called ICMAP to model and analyze insider threats. ICMAP is connected to a MySQL database of vulnerabilities, supports flexible input/output files in XML format. \n
Type the text for 'Work and Research Experience'
! Beautiful Essays and Articles\n* [[Structured Procrastination| http://www.structuredprocrastination.com/light.php]]\n
! Computer Network\n* In-depth knowledge of computer networking concepts (both OSI model and TCP/IP stack) and familiar with common protocols (SMTP, HTTP, OSPF, RIP, BGP, IGMP, VLAN etc.).\n* Experienced in traffic analysis and monitoring. Worked with several software suites and libraries for traffic monitoring and analysis (CoralReef, LibTrace).\n\n! Computer Security\n* Familiar with most aspects of computer security (authentication, encryption, software exploit and vulnerabilities)\n*Expert knowledge of propagating code (worm, bot) modeling and detection techniques.\n*In-depth knowledge of Peer-to-Peer technologies. Expert knowledge of Kademlia and Gnutella.\n*Worked with network sniffers (Ethereal/Wireshark), IDS (Snort, Bro), port scanners (NMap)\n\n! Programming\n* Strong problem solving and software development/troubleshooting skills.\n* Proficient in C/C++, Java, Awk, Perl, and Unix shell scripting languages (-csh, bash, korn). Familiar with Visual C++, MFC and J2SDK.\n* Familiar with x86 Assembly, ARM32 Assembly, Javascript, XML, SQL, XQuery, Tcl/Tk.\n* Experienced in socket and multi-threaded programming.\n* Experienced in object oriented programming (OOP) and familiar with various design patterns.\n* Familiar with kernel programming (FreeBSD).\n\n! Database & Systems:\n* Experienced in database design, worked with MySQL, PostgreSQL, MS Access, ODBC,JDBC, DAO\n* Worked on Windows (3.1/9X/Millenium/2x/XP), Unix (Solaris, BSD) and Linux (Debian, Mandrake, Ubuntu, RedHat).\n\n! Machine Learning: \n\n* Familiar with standard machine learning concepts and models (EM,Baysian, Neuron Networks, graphical, etc.), worked with WEKA - an ML software suite.
''Welcome to my personal page!''\n\nI am in my final year as a Ph.D student at the State University of New York at Buffalo under the supervision of Dr. [[HungNgo|http://www.cse.buffalo.edu/~hungngo]]. I do research on malicious propagating codes with emphasis on their propagating structures, schedules and of course, defense schemes against them. Previously, worm was the most prominent self-propagating codes, but recently, bot has replaced them as the new prom queen. I am thus focusing on botnet structures and their performance on traditional and peer to peer (P2P) networks. I spent the second half of 2008 at the Los Alamos National Laboratory investigating botnet performances on eMule, one popular P2P network.\n\nMy topic is not restricted to the security domain, but also relevant to the network community. Naturally, I share my time and effort on some other networking topics. Specifically, I had some recent work in efficiently sharing files among a network of vehicles.\n\nI also venture to work on (and manage to have some results) Insider Threat and Switching networks. In general, I am most interested in topics where I can find a good balance of theory and practice. \n\nI came here in 2003 after working for 1 year as a telecommunication engineer in Hanoi, Vietnam. I got my B.E from [[Hanoi University of Technology|http://www.hut.edu.vn]] in May 2002.\n\n
My current interest is on malicious propagating codes. I am focusing my energy on the performance of P2P-based botnets and potential disruption techniques against these networks. \n\n! Publications\n\n!! In preparation\n* Hung Ngo, Anh Le, Duc Ha, "Performances of traffic classification under practical conditions"\n* "User Profiling Techniques based on Database Activities", in collaboration with the Database and Security Group.\n\n!! Conferences\n* Duc T. Ha, Guanhua Yan, Stephan Eidenbenz, Hung Q. Ngo, "On the Effectiveness of Structural Detection and Defense against P2P-based Botnets", to appear at the 39th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2009), June 29 -- July 02, Estoril, Lisbon, Portugal.\n* Duc Ha, Hung Q. Ngo, Madhusudhanan Chandrasekaran, "CRESTBOT: A New Family of Resilient Botnets," in Proceedings of the 2008 IEEE Global Communications Conference (GLOBECOM 2008), Nov 30--Dec 04, 2008. New Orleans, LA, U.S.A.\n* Hung Q. Ngo, Thanh Nhan Nguyen, Duc Ha, "Strictly Nonblocking $f$-cast Photonic Switching Networks under General Crosstalk Constraints," in Proceedings of the 2008 IEEE Global Communications Conference (GLOBECOM 2008), Nov 30--Dec 04, 2008. New Orleans, LA, U.S.A.\n* Sunu Matthew, Shambhu Upadhyaya, Duc Ha, Hung Q. Ngo, Insider Abuse Comprehension through Capability Acquisition Graphs, in Proceedings of the The 11th International Conference on Information Fusion (FUSION 2008), June 30--July 03, 2008. Cologne, Germany.\n\n!! Workshops\n* Duc Ha, Hung Ngo, "On the trade-off between the expected number of infected nodes and expected propagation time of malcodes", to appear in the 5th ACM Workshop on Rapid Malcode (WORM) 2007, in association with the ACM CCS. Acceptance Rate 30%. \n\n!! Book Chapters\n* Ha D., S. Upadhyaya, H.Q. Ngo, S. Pramanik, R. Chinchani and S. Mathew, “Insider Threat Analysis Using ~Information-Centric Modeling”, in P. Craiger and S. Shenoi, Eds., Advances in Digital Forensics III, Springer, Boston, 2007.\n* Ramkumar Chinchani, Duc T. Ha, Anusha R. Iyer, Hung Q. Ngo, and Shambhu J Upadhyaya, "Insider threat assessment: model, analysis, and tool", in Network Security, S. Huang, D. ~MacCallum, D.-Z. Du (editors), Kluwer Academic Publisher, 2005.\n\n!! Journals\n* Hung Q. Ngo, Thanh-Nhan Nguyen, Duc T. Ha, "Analyzing non-blocking multilog networks with the Koenig-Egevary Theorem", Journal of Discrete Mathematics, to appear 2009.\n* Duc T. Ha, Hung Q. Ngo, "On the trade-off between the expected number of infected nodes and expected propagation time of malcodes" (extended version), Journal of Computer Virology, to appear 2009.\n* Seokhoon Yoon, Duc T. Ha, Hung Q. Ngo, Chunming Qiao, "MOPADS:A Mobility Profile Aided File Downloading Service in Vehicular Networks", to appear in the IEEE Transactions on Vehicular Technology, 2009.\n* Chinchani R., Duc Ha, Anusha Iyer, Hung Q. Ngo, and Shambhu Upadhyaya, "On the Hardness of Approximating the ~MIN-HACK Problem", Journal of Combinatorial Optimization, Springer, Vol. 9, No. 3, pp. 295-311, May 2005.\n\n\n!! Reports\n* Duc Ha, Hung Ngo, "On the trade-off between the expected number of infected nodes and expected propagation time of malcodes", UB CSE Technical Report,No. [[TR-2007-05 |http://www.cse.buffalo.edu/tech-reports/2007-05.pdf]]\n* Duc Ha, Thanh Nguyen, Dzung Tran, "Worm Propagation Modeling",Sep 2006 ([[ps| Report.ps]])\n
[[Home]] [[Skill Sets]] [[Research]] [[Contact Information]] [[Projects]] [[Resume]] [[Upcoming Conferences]] [[Miscellaneous]]\n----\n\n