Practically doin anything with my new box

I can practically do everythin i want in this new box. I can Listen to my favorite mp3's (The little red box on the upper right corner called xmms). Download free mp3s from irc people using irssi; the box with colorful text. Most of all, chat with friends from ym (this is what i like most). I was really amazed with the developers of bitlbee. Anyway bitlbee is an irc server which connects irc people to messenger servers like Yahoo , Msn and ICQ. This is really amazing. Now using just my irc client, irrsi, i can practically do more tasks at the same time-download and chat with yahoo peeps.

messaging using my Linux Box

In Conference with meemai and noli... using irssi(of course) and bitlbee(an irc server which connects to yahoooooo)
kaulay ko c meemai(on irc pa rin)chattin with mel, a schoolmate of mine while listening to my fave mp3s

sudden thoughts

will the sun really loose it's energy? and take us all down along with it? nah!, whatever, i don't care!.. I'll be long dead if that was to happen.

For now i'll be ejoying this feeling of being alone. No ones at home(just me of course). I can enjoy smashing the sticked ctrl key on my keyboard, which by the way is making my typing job a lot less fun. I am enjoying typing this -> "Fuckin damn yahoo messenger, what the hell happened to your servers, I can't log in". Is it just my Internet Connection or yahoo is just so fucked up, I can't log in on my account anymore.

What was the title again? Do I really have to think of that.. No one's reading.. This blog doesn't even cost a penny so why should anyone bother reading these stuff I write.

dying to get out!!!

What date is it? Its already september 4 in jasons' windows calendar! And I know it goes the same for people in the same timeline(GMT +08:00) as me... This means I have less than two months left in my college life!(I WISH). Another part of my life's journey is about to end (sana)... I'm really dying(and i mean really dying) to get out of college.. Now I know what "pagsisisi means" (actually i do already).. If only I had behaved.. maybe.. just maybe... my university years would have ended 6 months earlier...and if it weren't for that f*@k%n Mr. GONZALES (who actually believed in himself as being sympathetic), maybe..and another maybe, I would have been living another theme in life...............

dying to download vids from youtube??

everyone! listen (read actually) . . recently i found this nice little website which allows you to download videos from youtube or google videos and many more. try it.. If you can't find your way just comment to this post.

Yet Another Migration

Who sez I can't live without windows(winblows i mean)?

Just two weeks ago I have installed Ubuntu on my box. I hav'nt had much of a problem regarding my new OS. No problem I have encountered remained unsolved after a little bit of reading and experimenting. In fact, If It weren't for my brother and sister and a cousin. I will be completely deleting windows from my HDD. I have everything I need here. There is an abundant source of free applications(piracy is no more an issue), and almost every windows applications has a counterpart in linux. I have an image editor, an MP3 player, an Movie app, a document editor, a browser, and an abundant source of programming tools!. Here's a snapshot of my desktop using Fluxbox as Window Manager,, and I'll tell you. It's pretty fast.

turned Insomiac

Whew! The Project is doing good. After several days of sleeping for only 3 to 5 hours, I can finally(I think) sleep early tonight. I can now finally breath!

Last night was the worst of my coding nights. I started programming early yesterday morning and went straight, stopping only for meals, up to early this morning. It was a 24 hour, non stop coding. I had to do it or else I wont be having anything to present to my panels for the
preliminary defense of my project.

I finished several modules last during the course of the work. I have implemented an almost brute force algorithm to detect/compute the vertex connectivity of Graphs. Which I was able to finish at 3 in the morning.

I was also able to rewrite a sample SAX2 implementation code for parsing a GraphXML file and use it as an Input module for my application. Although this module needs a bit of improvement i know my panelists will honor this for now. I just have to make improvements to this module before the final defense. so. gudluck(to me)

I also found a good graph viewer(Royere) to use for my application(I am totally lazy). I had to find one so that I will not be creating a graph viewer for my application, computing the vertex connectivity is enough work already, i don't need to add another problem.

BRUTE FORCE

For comparison purposes, I have developed a brute force implementation of solving the vertex connectivity problem.

First of all here are some of the definitions of the notations i used:

G – The Graph
n – Total number of vertices
N – Set of all vertices in G
C – Subset of N

And Now Heres the Brute Force algorithm:
1. Test G for connectivity
2. Find articulation points if G is connected
3. Vertex Connectivity is 1 when an articulation point is preset
4. Otherwise generate all combination C of subset N taken k at a time where k = 2 to n-1.
5. For all C…Delete C from N and test for connectivity
6. Stop when G is disconnected or k = n – 1
7. Vertex Connectivity = k when G is disconnected or n – 1 when k reaches n - 1

Project Requirements

Before I forget here's a list of the requirements i have to finish before the final defense of the project:


1. Use graphXML as format ot the graph input and graph output.

2. Use an open source viewer of a graph in graphXML format.
3. Use a Java XML parser to parse the graph input.
4. The maximum number of nodes and edges should no be hardcoded.
5. Before the preliminary defense, implement a brute force algorithm to solve the vertex connectivity degree problem.
6. prepare a substantial number (say 50 or more) of inpout graphs (more sparse graphs than dense graphs) to test the brute force algorithm performance.
7. Prepare a short analysis of the brute force algorithm performance (speed and memory requirements) for each of the following cases:
a. 5 to 10 nodes (sparse and dense graphs)
b. 11 to 20 nodes (sparse and dense graphs)
c. 21 to 30 nodes (sparse and dense graphs)
d. 31 to 40 nodes (sparse and dense graphs)
e. 41 to 50 nodes (sparse and dense graphs)
Produce a summary table showing memory usage of data structures used and actual recorded speed of the algorithm in a specific computer.

An Update..

God this is giving me a real headache!

Its already past 5 o'clock in the morning and im still in front of this computer. I'm still workin on my project. I think i finished about 20 % of it this morning. I really need some sleep.
anyway here's a recap of what i was able to finish within the past 2 weeks of workin on the Vertex connectivity problem.
Anyway since I am not obliged to create my own algorithm, I try to find algorithms and code pieces which I could incorporate/use to finish this project. Well i do have an algorithm(i think). Anyway it's a bruteforce approach to solving this problem. Here are the stages, I think i have researched enough so I can now explain the process i'll have to take to solve this problem.
the first few steps have been finished already:

1. Find the edge connectivity: How do I do this?

Not so simple but (thank you!) I was able to implement it already.
this is based on Menger's theorem. The maximum-flow-minimum-cut theorem. I will not be discussing the details of theorem. Here's an application. But first, here's what we will need to know.
what is a maximum flow? It is simply described as the maximum flow one can send from a source vertex s to a sink vertex t. What is it's connection to edge connectivity? simple... based on Menger's theorem..(in lay man's term) When you set all the edges' capacity to 1 and find the Maximum flow from source s to t, the Maximum flow is also the edge connectivity of s and t or the minimum no. of edges you need to remove for s and t to be disconnected.

2. Now I have the edge connectivity, what will i need this for?

I already thought of that. Actually the edge connectivity algorithm can be reduced/altered to be a vertex connectivity algorithm.

3. Now what?

We can now use this algorithm to find the global vertex connectivity of the graph! how you ask? simple! Get the vertex connectivity for all s and t. The result with the minimum vertex connectivity value will be the global vertex connectivity..
For now I was only able to Implement the edge connectivity algorithm. Tonight I will be working on the vertex connectivity algorithm, Ive already finished the combination algorithm so finding all combinations of s and t is already considered finished. After finishing i will be adding some optimization for the algorithms. I have already thought of one. You wanna hear? I wouldn't have to test all combinations of vertices for connectivity... only those vertices which are non djacent! yeba! Thats all for now. I feel kinda sleepy already!
a

This one is free!! try it!

Still using your rotten Internet Explorer?
Still feeling fucked up after surfing the net because of too much pop-ups?
Take it from Me.... Use Firefox! I've Been using it since nung wala pa akong internet
connection. I really dont like using Internet Explorer for web browsing.. Its too vulnerable.
Maghahang na lang bigla ang pc mo dahil sa dami ng pop-ups. But with firefox,
I feel truly safe. If I were you, migrate now..

Wondering what RSS are?

Does anybody here knows about RSS readers?

Recently I've been Intrigued with what RSS feeds are...

Most websites, specially blog sites and News sites offer RSS feeds. They are usually linked with small buttons like this or or . However, if you click one of these links, you will most likely get a page full of code in your browser which most of us will not be able to understand. I needed to satisfy my curiousity so i tried reading about this RSS thingy.

Here's what ive found out.What Do RSS feeds offer?

RSS feeds bring automatically updated information straight to your desktop. You can monitor news, blogs, job listings, personals, and classifieds.

Beautiful! how do I use RSS feeds?

first off we need an RSS feed Reader. There are may applications like this offered on the internet. Try searching for RSS readers in downloads.com. You can even find free readers!. Or you can use the one I'm using FeedReader3. Its also free and very easy to use. Just consult the user manual and start reading and updating feeds!

Where do I personally use feed?

Downloads! hehehe :)

Downloads.com offers many usefull feeds. like Editor's picks, Top rated Downloads and Most popular download. Follow this link to see all the feeds offered. You see, with RSS feeds I can easily get myself updated with the most popular downloads. I also like reading blogs so I easily get updated with new articles.

That's all. I hope someone learned something. for more info read this.

Giving you a glimpse of my Code

public void generate() {
show();//show the first combination
while(this.hasMore()) {
int i = r - 1;

while(arr[i] == n - r + i) { //continue moving to the left
i--;
}
arr[i] = arr[i] + 1; //start incrementing

for (int j = i + 1; j < r; j++) {
arr[j] = arr[i] + j - i; // increment everything else to the right by 1;
}
show();//show the rest of the combinatio
}
}

This a code to generate combinations. It is based on Rose's algorithm of generating combinations. Its a very fast algorithm.... I guess It makes no sense posting this because its just a fragment of the whole class. But if you have questions, You can just mail me.. hehe

Been using Eclipse

Good thing I have a 256mb of memory! or else I will not be

able to use eclipse.

What is eclipse?

Hell.. just visit the site.. Been

using this for several days already..

Am I satisfied with the features?

Yes I am! Although it runs a little bit slow on my machine, I'd still prefer using eclipse to develop my Java apps. :} It’s very easy to detect code errors in eclipse. I guess it’s the main feature which attracted me to use Eclipse Coders out there try it! There is even a C++ plug-in for Eclipse although I haven’t tried it yet.. So really eclipse isnt just for Java developers. As long as a plug-in exists for your programming language, you can develop your application with eclipse.

Im Going to use Java!!!

I have made my decision:

I will be using JAVA™ for this project??

Why JAVA™?
Why not Java™? :) simple,,, I really need a rapid development of the application. I have thought of using C++ because this project will be a test of an algorithm. We know that applications developed using C++ runs far much faster than applications made in Java, But for some reasons(i will be enumerating later), I opt to use JAVA™ for this project..

1. I need to develop this

project fast! - Using Java classes will definitely make my life easier. With c++ will need to craft all if not most of my needs from scratch. I wouldn't prefer that..

2. Personal training - I want to learn more about JAVA™. Why? nothin really important..
3. Portability - (This one's just for the sake of blogging..hehehe) I can compile and run my code in most operating systems... I would like to see results of my project both in my Windows
and Linux box.

I'm Startin out a blog!

Ei guyz...

Im gonna start out a blog.... :) I guess i have to keep track of my project's development.. First off.. .what the hell is this project????? is it realy important?

Well, In connection with my course requirements (which means i couldnt graduate without doing this project), .. I have to develop a software...this will be the last project which I will be developing for the sake of studies/grades hehe... I hope this one will really be the last!! I am really dying to get out of college...
The Title of the project is ….!

"Vertex Connectivity Watch"

what's that??? My Friends always ask that question whenever I tell them the
title of my project...

Well here's an overview of the project....

The main goal is to make a working software which will compute for the vertex
connectivity of a graph.
Vertex Connectivity?? - It is the minimum number of vertices which you have to delete from a graph in order to render the same graph disconnected.

If there is a disconnected graph, what is a connected graph? - Well a connected graph is simply defined as An undirected graph which has a path between every pair of vertices.

What's the sense of this project?

At first glance it may seem that this project makes no sense... but it does have an application. Specifically it applies to Networking and Routing..... lets use Smart for example. Smart is a telecommunication network... Now this network can be illustrated as Nodes and paths/edges in a graph... Just think of the towers as nodes in the graph... when you send a message from naga to a friend in manila the message does not go directly from a tower in naga to a tower in manila and then to the mobile phone of your friend. The fact is the message is passed from a tower to another. This we can visualize as paths.

Now think of me as a terrorist trying to sabotage Smart.... In order to disable Smart's services, I have to blow towers to disable routing of messages. Now here's a good question. How can I cause a bigger distruction with lesser number bombings?? Simple i just have to input the architecture of smart's network into my software and WALAA! The software will easily tell me which towers I have to blow... Devilish!!!! But this is not the purpose of the project.. The main significance of this project is to be able to detect weaknesses in a network, so that network engineers could come up with better designs.

Anal sex

Anal sex
Originally uploaded by Bucky Four-Eyes.

Well, they're both assholes and they're having sex, so isn't it anal sex?

Adding a search engine to your website

Its been a month since ive started with my website:
just yesterday ive came up with a big problem!!! I can't find a free search engine
to put into my project..

What's nice is that there are so many offer for search engines,,, but they all come with
a price.. I dont have the money to pay,, so I really had to search for free engines, which will only search my website..

I came across many free engines like:
asp-spider and asp simple search and zoom..

I really can't use these search engines because of their requirements

asp-spider needs an MYSQL databases which i dont have the time to set-up
asp-simple search does not need a database but it wont work on my server
zoom has a free version... but unless you have less than 75 pages,, youl have to opt for another:::

the solution::::::::
A great search engine by ATOMZ = The engine is very easy to set-up, it has its own server so i just have to link to it... its very customizable, it can easily blend with your template.. and it works great

shiiitttt .... ive just deleted my flash drive's partition!!!! now how do i recover my files???

last tuesday, i was given the task to reformat a friends pc... and install an os... she was complaining coz her pc is almost crawlin because of viruses and the instability of the os(i think).....

PROBLEM: When I booted the os' cd and the instruction asked to repartition the hard drive i immediately deleted all the partition to create another partition... not knowing that my flashdisk was connected to the pc, and to top it all: this flashdisk contains backup of the pc's data!!!!!

foolish me... now the flashdisk's partition is corrupted..... and there's no way windows can browse the files in the disk.... i have to look for softwares that can recover the datas for me

SOLUTION: I've searched serveral forums for solutions and found 2 softwares that did the job...




1. Ontrack's easy recovery - this software is free...





2. Runtime Software's GetDataBack- This has two versions . one for FAT(this was the one i used...and the next one is for NTFS file systems

sa wakas... mejo at ease na ko.... nakaka adjust nmn daa sa oras.. yung website na
pinapaayos sakin ni boss mejo ok na rin.. nagkakahugis na rin cya... di ko totally gusto
yung design ko pero ayus ni rin yun... hindi namn kasi tlaga ako sanay mg design... buti na
lang nagustuhan ni bosing yung layout ko..... at least proud na ko na nagustuhan yung work ko....

Alam nyo ba na hindi madali magdesign ng website... ito ang mga naging problema ko sa
design:

first and foremost:
/* yung pagiging artistic... parang wala ata ako nun eh.....
yung mga icons! ang hirap gawin...
yung banner mas mahirap gawin....
tapos may mas maliliit pang banner.....

yung layout.... una, I was thinking of using tables for the layout,,,,,
kaya lang sa totoo lang hindi ko tlga 3p and tables........ masyadong pangit tingnan
ang codes...
then naicp ko since may idea and xperience nmn ako sa CSS then y dont i
use CSS blocks... kaya ayun... CSS na lang ang ginamit ko....

it turned out ok din ang layout ko.... post ko na lang di2 yung pic ng layout ko pag may time......
for now ang problema ko namn... ay kung magmumukha bang pare pareho ang kalalabasan ng website ko
sa ibat-ibang type ng browser... kasi ngayon... it looks good namn sa Internet Explorer ko.. pero di ko alam kung
pareho ang kalalabasan sa firefox... sa opera...sa netscape... at sa marami pang iba....
anyway.... saka ko na lang yan poproblemahinnnn......

First Post

I just wanna welcome you first..
chow!