Résumé

• Résumé

  Academic

  • Bachelor’s Degree of Science (2006-2008)
    • Double major in Computer Science and Management Mathematics
    • from Campbell University, Buies Creek, North Carolina, USA
    • CGPA: 3.73/4.0
  • Advanced Diploma in Science (2006-2008)
    • Double major in Computer Science and Management Mathematics
    • from Tunku Abdul Rahman College, Setapak, Kuala Lumpur, Malaysia
    • CGPA: 3.81/4.0
  • Diploma in Science (2004-2006)
    • Double major in Computer Science and Management Mathematics
    • from Tunku Abdul Rahman College, Setapak, Kuala Lumpur, Malaysia
    • CGPA: 3.83/4.0

  Work Experience

  • Software Engineer in Bytecraft Sdn. Bhd. (April 2008 to March 2010)
    • Created calendaring application.
    • Implemented a workflow library based on FSM.
    • Deployed Google Search Appliances and developed some front-end scripts.
    • Creates scripts to import data of different formats from various sources.
  • Internship in Abamon Technology Sdn. Bhd. (March to May 2007)
    • Held position as an Intern
    • Helped in setting up and customize a CRM system using an open-sourced CRM-CTT script.
    • Documented the operation manual of CRM-CTT
    • Initiated the development of the Intranet.

  Technical Skills

  According to level of proficiency familiarity in decending order

  Known Programming Language

  1. PHP5 (Both Procedural and Object Oriented)
  2. Javascript (and jQuery library)
  3. SQL
  4. Python
  5. Perl
  6. VB.NET*
  7. Classic VB 6.0*
  8. PL/SQL and T-SQL*
  9. VC 6.0*
  10. SWI-Prolog*
  11. C# (Only procedural)*
  12. JAVA*

  Others

  1. HTML & XHTML
  2. CSS
  3. Administering and Maintaining Microsoft^® Windows^TM 2003

  * learned while was studying in college but have not doing much with it lately.

Random Posts

• Selecting Node with XPath

  To do node selection for DOM operations, one typically uses CSS selectors as (probably) popularized by jQuery. However, there is another alternative that is as powerful if not better known as XPath. XPath may be able to do a lot more than just selecting node (which I have no time to find out for now) but I will just focus on how to do node selection in this blog post.

  (more…)

• Revisiting semantic web (plus wheel building with Poetry)

  Back then, when I was still working on my postgraduate degree research, I used RDF, which was the preferred format in the world of Semantic Web to represent data. I eventually dropped the degree, and stopped following the development of the related technology and standards. Until I volunteered to update the import script for popit when I was looking for the next job/project.

  (more…)

• Re-implementing Approximate Nearest Neighbour Search

  Recently I switched my search code to Annoy because the input dataset is huge (7.5mil records with 20k dictionary count). It wasn’t without issues though, however I would probably talk about it next time. In order to figure out what each parameters meant, I spent some time watching through the talk given by the author @fulhack.

  (more…)

• Sorting Multilingual Data

  Been trying my best to stick to the well-known UNIX Philosophy – “Do one thing and do it well”, so I have been breaking down my projects into numerous pieces of small tasks and rely on existing tools whenever possible. One of the existing tool that I use a lot is the GNU sort tool. Generally sort utility is really doing fine and dandy without having to configure anything, at least not until I realize the problem that leads to this post.

  (more…)

• Extending Zend Framework

  I like how Kohana 3 organizes the classes, and I thought the same thing may be applied to my Zend Framework experimental project. Basically what this means is that I can name the controller class according to PEAR naming convention, and deduce the location of the file by just parsing the class name.

  (more…)