Serving your first cup

Posted by Edison Macabebe on 09 Mar 2007 | Tagged as: Java

Edison’s Cup of Java (3/7/07) - series 2 of 999

 copyright

Simple does it, but it gets no simpler—do brace for more sophistication though—I must forewarn. Be careful of what you wish for, you might just get it, so the saying goes.

With our freshly brewed (installed) Java, let us begin this session by testing it. Go to your command line or classic console. In MS Windows, this will be your Start/run, type cmd then press enter. For Linux users, I will assume you know better and are sharper when it comes to OS skills, so I will not compound this article by covering that field for now.

Continue Reading »

Let’s get this party started

Posted by Edison Macabebe on 08 Mar 2007 | Tagged as: Java

Edison’s Cup of Java (2/22/2007) - series 1 of 999 

copyright

System.out.println(”Hi, World”);

What on Earth, err, rather, digital world am I doing in this space? Perhaps it is the Dilbert principle, or maybe it is because I lack attention, or is it because I needed an outlet to channel some excess energy or even angst, the bottom-line is, it is more so because writing something technical but practical like my favorite MP3 have always been playing in my mind.

Continue Reading »

Data Mining Models Part 2

Posted by Edison Macabebe on 17 Feb 2007 | Tagged as: Data Mining

Evaluating the Learners’performance

When it comes to finding out which among the learners will be best on certain occasions, several tests and measures can be made. For this experiment, we chose in particular the k-fold cross-validator.

My k-fold cross-validator program got implemented under the package validators and its object name is CrossValidator.java.

Continue Reading »

Performance of Shortest Queue Discipline

Posted by Bobby Corpus on 04 Feb 2007 | Tagged as: Performance

We computed the performance of random line queuing discipline in the previous article. However, in real life, we don’t really throw a coin in order to pick which of the two lines we take. Most of the time, we go to the shortest line for service. Using the techniques we have learned in modeling, we will compute the performance of this queue and compare the performance to the other queueing discplines we have computed so far.

Markov Diagram

markov_shortest_line.png

As usual, the arrival rate of customers is 2 customers per minute. Each customer is given a service at an average of 20 secs, which means that an average of 3 customers are being serviced per minute.

Continue Reading »

Data Mining Models

Posted by Edison Macabebe on 22 Jan 2007 | Tagged as: Data Mining

Intoducing the DM Learners

This article details how basic data-mining machine learners are built. These learners are the One Rule, Decision Tree, Naïve Bayes and Prism. Additional tips are also provided in how to process the training and test data.

All codes were written using the Java language utilizing Sun’s latest tool as of this writing, under the brand name of JDK 5.0. To author the codes more efficiently, conveniently and professionally, I chose to use Netbeans latest IDE version 4.0.

Continue Reading »

« Prev - Next »