technical trendy

upgrade your system...

2009-08-10T22:00:00.002+05:30

Computer is the biggest invention that man had ever found. It has become very much popular after the introduction of the internet and web applications. Apart the internet, people use computer for the entertainment purposes. Speaking about entertainment, it includes watching movies, playing games and some Photoshop works. Very rare people use the computer for educational purposes and the business people uses it for developing their business and increasing the profit. For any purpose, performance is the first criteria that people will look for, while buying the computer. This performance mainly depends on the RAM memory and the processor speed. If wee want to buy a new computer, we can get the latest one with hi-fi configuration. Some people might have the sentiment for their old computers and they will look for extending their RAM memory to increase their performance. The only place you should look for to extend your memory RAM is IMAC Memory Upgrades. You will get the best quality RAM in IMAC Memory Upgrades. They have the best quality RAM for all kind of laptops and desktops. The customer satisfaction is the important principle. You can view all the apple RAM upgrades in this page. So do not wait to upgrade your system by getting the computer accessories from IMAC Memory Upgrades.

WILLIAM MAKEPEACE THACKERAY…4

2009-08-02T00:52:00.000+05:30

Much of Thackeray’s satiric attitude toward life was a defense mechanism to conceal basic sentimentality. Snobbish enough to be thrilled by favors from persons of title, he never quite got over feeling that it degraded a gentleman to write for a living. He loved his friends, and was loved by them, yet constantly got into hot water by foolish impulsive utterances and tactless personal allusions in his books. As a result, a life darkened by tragedy was also spattered with the mud of silly squabbles. He ate and drank himself into a premature grave, but had written himself out before he died.

glass for your eyes...

2009-07-18T10:31:00.001+05:30

There are so many optical online stores available but the zenni optical is the cheapest and best among them. $ 8 Rx eyeglasses are the cheapest glasses that you can ever buy. Watch the demo of this in Zenni Optical on TV!!! If you have any more doubts, you can view the review given by the customer of zenni optical in High Five to Zenni Optical.

internet connection

2009-07-08T22:20:00.000+05:30

Hi everybody, no home can be there without internet connection. Broadband service has made such a great impact in the internet connectivity. Now, the internet connection had even reached the most rural areas. One of the main reasons for this mark is the privatization of the broadband service. All the people have internet connection, but not the cheapest connection. I would like to review the website that I know which is providing the cheapest internet connection with good signal strength even in the rural areas. Do not bother even if you live in areas like Kansas, you have internet in Kansas too. They provide you with the best internet connection at the cheapest price. They are satellite internet provider and they have very good satellites revolve around the space that helps to provide a non-interruptible internet service. When compared to other service providers, they have always-on connection which I have discussed earlier. You no need to install any additional software to connect to the internet, which helps your system free form viruses and also increase the performance of your system. You can have the instant access facility here. The added advantage is you no need any extra phone connection to have this broadband service. Have an internet connection through deal online at great speed and also at very cheapest rate.

Why?

2009-07-08T09:01:00.000+05:30

Why do we stop talking, with no reasons, no fights, and no problems on a rainy evening, over our teak wood cushion bed?
Why our eyes do started it, the way of making relationships, the way of conveying messages, the way of transforming love, the communication?
Why do our eyes get tired after hours of communication with no words talked, listened or replied?
Why do our eyes shut after the tiredness, making our other organs to communicate?
Why do we still have a micro millimeter gap between your hearts and mine?
Why does the gap vapor after we turn as born ones?
Why do our hands talk faster than our mouth or eyes?
Why our mouths do need shelter in the other ones mouth?
Why do our actions go meaning less, increasing its speed exponentially?
Why our mouths met, hands do met, stomach met.............................?
Why do I hear nothing but a noise, with no grammar, no language and no meaning in it?
Why is that you and I become we?
Why I am inside you or you inside me?
Why is it greasy everywhere?
After three months......
Why do I become dad, when I am in just school?
I did nothing but what I see in TV at prime times.

Note: From the author: How will you categorize the above article?

painters for your home...

2009-07-07T23:03:00.002+05:30

Hi everybody, everyone of us like our home. We do not like our home, when it is dirty. So always we want our home to be neat and tidy. Ofcorse, that makes our home to look beautiful and attractive. Most of us love to do everything to keep our home clean. I am such a kind of person and most of the times my family members found me cleaning the house. Last week we decided to paint our home for the birthday celebration of my little daughter, and as usual, I myself tried to paint my whole home, but I could not able to do that. So we called denver painting workers to paint our home. To my surprise they have fiished the painting work of my home within two days and my home looks very much beautiful than it was. It almost look like a new house that has been brought a week before. My friends, who have came for the party had very much apreciated the painting work of the house and some of them had collected the contact of the denver painting colorado. If you have an idea of painting your home, then you can contact them to get the painting work to be very well done.

great plumbing service...

2009-07-02T13:56:00.002+05:30

Hi everybody, I am very much happy to meet you all again through this blog. Last week, the taps in my bathroom and kitchen were broken and somehow we have solved the problem by sticking it with glue. It was not lasts long, the tap in the bathroom had broken again. We finally, decided to call a plumber to fix the issue and my friend told me about the tampa plumber. We contacted tampa plumber to fix the issue and really very much satisfied with the service provided by them. Very good quality new taps had been installed in my bathroom and kitchen and I also had a thought of fixing a tub in my bathroom. They have suggested the best type of tub that suits my bathroom style and fixed the tub with the latest pipes. I have to tell you one thing; the tub is very much comfortable such that all my family members are taking more time to bath than before. They gave highest priority to my satisfaction rather than anything, which made me to write this review. The cost of fixing is very much affordable compared to others. If you have plumbing issue in our home, I would suggest you to consult tampa plumber.

CHARLES DICKENS…5

2009-07-01T15:55:00.000+05:30

Out of this experience, he conceived the scheme which was to be entitled Master Humphrey’s Clock and was to consist of series of stories told by a group of friends. This scheme, however, was not successful, in spite of the reintroduction of characters familiar to readers of his foregoing books. He immediately proceeded to write Barnaby Rudge (1840), which is remarkable for its adaptation of the romantic methods of Sir Walter Scott and the descriptive scenes of the Gordon Riots.

Another book that grew out of the scheme of Master Humphrey’s Clock was The Old Curiosity Shop (1841).

remodel your home...

2009-06-16T15:55:00.001+05:30

Home sweet home is a very famous statement which we can see in many places. Owning a home is being a motivating factor for many people. When we are in making of our home, we have to be very choosy about the plan; modeling and other aspects that make our home literally grow. Here is a remodeling and constructor company which gives excellent quality of work and an excellent customer service which results in ultimate customer satisfaction. You can check out their web site to know more about the Knoxville remodeling company. They specialize in remodeling of house, kitchen, repairing and other constructions oriented works.

life insurance...

2009-06-02T00:53:00.002+05:30

My friend recently mentioned me about term life insurance . I was unaware of it and so I went through the web site which he gave me where we can get lot of information about term life insurance . The web site holds innumerable data about it and I have got a clear picture about insurance. I thought it would be helpful to many people who do look for the term life insurance and so I have put this post here. You can have a look at the web site and learn yourself about it. Insurance is one way to secure your future.

EDGAR ALLAN POE 2

2009-06-02T00:53:00.001+05:30

Needing money desperately, and realizing that poetry could not possibly support him, he turned to the writing of short stories for magazines such as Nathanial parker Willis evening mirror. He finally achieved immense popular fame through the publication of “The Raven “(for which he received 10) on February 8, 1845.
Later he became editor, part owner and for a short time, the owner of The Broadway Journal. He published The Raven and other poems in 1845.Despite these successes, Poe remained very poor. In 1846 he moved into a small cottage in Fordham, where he lived with his wife Virginia died.

business and the back bone...

2009-05-21T19:18:00.000+05:30

Hi every body. This post is regarding my passion, which is none other than business. Go ahead to know more about what I have about business. I saw a Business Blog recently. Let me share my thoughts and views about it. This web site is mainly for business and the promotion of business. Even you can promote your business through this web site. The process of promoting any business goes like this, you can write a Business Review on the business you do. This review should explain about the products or the service you offer from your business. This description will acts as a promotion and advertisement of your business. You can visit the web site to get more information on this. The web site will give you lot of information on business promotion and stuff. To those who treat business as their passion, I hope this post would help them in a good way.

VICTOR HUGO-2

2009-05-21T19:17:00.003+05:30

Other plays included Hernani (1830), the first performance of which was a big success for Hugo, Marion Delorme (1829-1831), The King’s Pleasure (1832), and Ruy Blas (1838). In romance, Notre-Dame de Paris (1830) was an evocation of the medieval city and a defense of Gothic art.

Saddened by the tragic death of his favorite daughter and discouraged by the failure of his epic drama Burgraves (1843), Hugo abandoned literature for politics. Hugo, whose evolution was steadily toward the left, became a leader of the Radical Opposition which led to his exile. His funeral was an impressive ceremony. By the time of his centennial (1902), he was regarded as one of the major figures in world literature.

VICTOR HUGO-1

2009-05-21T19:17:00.001+05:30

Born in Besancon, France, Victor Hugo was almost an infant prodigy, and at 23, he was one of the official poets of the French monarchy. The period from 1827 to 1842 was one of incredible activity and triumphs in every field for him. In poetry, he published Odes and Ballads (1822-22), The Orientals (1829), Autumn Leaves (1831), Songs of Twilight (1835), Voices of the Innermost (1837) and Rays and Shadows (1840). In the drama Cromwell he composed a masterly doctrinal preface (1827). He lay in state under the Arch of Triumph, and the Pantheon was reopened to receive his remains.

personal loans, on the go...

2009-05-21T19:15:00.000+05:30

The words like Personal Loans are becoming very common in these days. This is because of the universal recession and other jargon words which are related to economy, the back bone of every country. People are suffering a lot because of the crash in economy and they do a lot of things to stabilize their economy. There are lots of loans available for the people. These loans will help them in finding a solution to get rid of the entire economic problem one have. The Installment Loan are one kind of loan, in which we have to repay our debts in installments. The period of installment varies from one place to another place and one people to another people. When some one is need of loan, he or she has to provide the security against the loan. This in turn gives one more head ache to the person who is getting the loan. In economic crisis, it is not easy to get some asset or something that acts as a security against the loan. There fore, it is mandatory for us to find a solution that offers an easier way for this security problem. I recently searched the World Wide Web regarding this loans and security problem. I should say that I am very lucky in this. Yes, I have found a solution for this problem and I feel it would be very much helpful to many people if I share this news with you all. Here is a web site from the bunch of World Wide Web, which offers you Unsecured Loans. The process is very simple. You do not need to submit any asset or document against the loan you procure. You can avail it without submitting any security to your loan. This is the greatest news for all those who are looking for loans. Since there is no security, we need not have worry and pressure. We can repay the loan by without having any pressure with us.

JAMES FENIMIRE COOPER-5

2009-05-21T19:14:00.003+05:30

The best work of his mature years is a romantic trilogy, Satanstoe (1845), The Chainbearer (1845), and The Redskins (1846), in which he traces and defends the volution of an American landed aristocracy through four generations. Among the sea novels of these years are The Two Admirals (1842), Afloat and Ashore (1844), and The Sea Lions (1849). Wyandotte (1843) and The Oak Openings (1848) were attempts to use the American backwoods in stories outside the frame of “The Leather-Stocking Tales.” The Crater (1847) is his most thoughtful allegory of social and political criticism.

JAMES FENIMIRE COOPER-4

2009-05-21T19:14:00.001+05:30

While abroad, he wrote Notions of the Americans (1828), historical novels on European themes like The Bravo (1831), and further tales of Native Americans and the sea. By this time he had an international reputation, but disillusionment at the reception of his ideas at home produced a petulant tract, A Letter to His Countrymen (1834), in which he renounced the writing of fiction. These were followed with a political allegory, The Monikins (1838), and a primer of his views, The American Democrat (1838).
_____________________________________________

lose weight programs

2009-05-12T00:10:00.000+05:30

When we get a solution to a problem, then we are a very lucky person. But at the same time, when we get hundreds of solution for a problem, then we are the luckiest person in the world. I would like to say that those who are all suffering from the excessive and over weight problem are the luckiest persons in the world. I am not joking. Yes, I have found a web site that offers them hundreds of solutions for the long term problem which keeps bugging them on and on. You can check out the web site which I have mentioned here to have a look at various weight loss programs available in the world. You can choose the one which very well suits for you. They have reviewed the widely used weight reducing programs and they have recommended few programs which will really works for every one of those who have over weight problem. It is an all in one web site that gives surplus number of solutions to your weight problems.

Money...

2009-05-10T12:29:00.000+05:30

Money makes many; a saying well depicts the situation of the world today. Money gives you power, money gives you shower, money gives you girls while shower, money gives you shelter, money gives you respect, money gives you assets, money gives you many...

But there are few things that money cannot give you. You can buy beds using money, but not sleep. No matter how much you spend or ready to give, you cannot make few things get done with your hell out of money. You can buy hospitals using money, but not health. You can buy universities by money, but not education. You can buy people's using money but not a true loving heart. You can buy malls using money but not customers. You can buy wishers by money but not well wishers.

There are so many things that money cannot come near. Like mother's love, baby’s smile (not babe's smile but), father's care and lot more. Therefore, money doesn’t make many...

Bill gates once stated, "Money is nothing, but make sure that you make hell out of money before making this statement."

don't drink

2009-05-09T21:58:00.000+05:30

Many people in the world are addicted to alcohol. Indirectly they are drinking the poison that kills their lives slowly. They will do anything to drink this slow poison. Though they are aware that, it is dangerous to them as well as others, they can’t able to get off from this. Usually this habit starts as a fun in the teenage of every person. As days passes by they have been addicted to this habit. They are committing crimes that harm the society and themselves. Usually the most common crime, is the drunk and drive, which sometimes costs many lives. So government should take the necessary steps to avoid this from being happening but the same government is encouraging the sales of the alcohol for their income. However it is the responsibility of the individual to quit it.

remember memory

2009-05-06T22:55:00.000+05:30

Memory is one of the prime constraints of a computer. Many people go for upgrading their computer when new technologies come in to show. Whenever a new technology comes, you can see that there will be a huge space for memory to fulfill. The performance of a system depends upon the PC Memory you use for it. If you want to upgrade your personal computer’s memory or your laptop’s memory, here is a very good web site that will help you in fixing this issue. You can upgrade your memory with a very good quality memory upgrades. Dell Memory Upgrades are one among the few memory upgrades they have. In short and simple terms, if it is memory upgrades, then it is in this web site. You can get memory devices of any brand with a very high quality rate. Apple, Dell, and IBM the few memory upgrades that are done for computers. There are just to name a few. But there are lots more in the list. You can get the best Laptop SO-DIMM Memory from this web site. You can make your turtle slow computer performance in to rapid fast computer by using these memories for upgrading your computer. Check out the web site to get more information on this.

street lamp

2009-05-05T23:03:00.000+05:30

After posting some interesting pictures now I am going to share my personal feelings. Now what you are seeing is the street light, which will make our street brighter even in the night and the photo was taken by my cousin. He had taken several attempts to took this snap and my house is just beside this street light. In my child days I and my two cousins used to sit under this street light and kid each others till midnight. Sometimes we even have played cricket under this light.

biggest facts

2009-05-05T15:08:00.000+05:30

This is the longest bridge in the world and situated in china. It is called as donghai bridge and the length of this bridge is 32.5 kilometers.

This is the world's biggest shopping complex which has been located in china. The name of this complex is south china mall, dongguan china. It consists of 6 floors and with full of shops.

I got these information from my friend and would like to share it with you.

what is this??

2009-05-05T11:47:00.000+05:30

I got this picture from my friend’s house and really amazed. If you have guessed it as a watermelon then you are right. Yes it is a sculpture made in a watermelon. I just want to share this picture with you and so I posted this. Hope you too like this picture and reply your comments about these posts whether you like it or not. Both the comments are accepted.

Money online

2009-05-02T14:07:00.001+05:30

If we want to make a decent living, we need money; if we want to do our higher studies we need money, if we want a status in the society we need money, so money is the must in every aspects of our life. Here comes the chance for you to earn money online through money maker machine. This is the website, which helps you to earn money through online in a very simple manner. You only need an internet connection and writing skills to earn money through money maker machine. Are you feeling that you do not have writing skills? Do not worry. You also can earn money online through “read mails” programs in money maker machine. Just visit money maker machine to get the details of the program. There are also other programs like “PPC”, “get paid to blog”. It is assured that you will make money in money maker machine, so now turn your free time into money.

health is wealth

2009-04-23T09:06:00.001+05:30

Every one of us has to take care of our health. When we lose health, we will lose every thing no matter how much we earn and how much we spend. In particular, when it comes to seniors, we have to provide extreme care to their health. They might get illness any time. There fore, we must take their health in to consideration and provide proper supervision. Here is a site that offers various medicare supplemental plans. If you do not know about How to apply to medicare part D, you can learn from the link given over here. You can also have a look at AARP Medicare Drug Plan which helps you to keep your health stable and healthy. The web site I have mentioned over here are senior related web site for the individuals who are sixty two years older and for the people who are older than that. This web site focuses on educating the senior citizens about various maedicare and the medicaid plans available.

Improper sleep affects the liver

2009-04-22T19:49:00.000+05:30

Most of us don’t sleep in the proper time. This is due to various reasons and the main reason is our work tension. Some people have the habit of finishing their office work at home, which makes them to sleep late at night. In a recent study, the scientists have found that the late night sleep is the main reason for the liver diseases. By sleeping like this, the toxic substance in the human body gets accumulated and affects our health. It not only affects the health, but also spoils the mood. As a result, the next day we are working with some stress.
Not only sleeping, we also have to rectify our other usual mistakes like skipping breakfast, eating too much, not urinating in the morning etc. so I hope that we all will change at least from now.

Have a faith in GOD

2009-04-22T11:40:00.000+05:30

Most of the people in this world have faith in God. They believe that, almighty will solve all their problems and pains. It has been proved now. England scientists has done a new research and found that the spiritual people have a little pain or can be able to tolerate their pain when compared to atheists. Yes the oxford university researchers had done this. They have done the experiment with the help of 12 Rome Catholics and 12 atheists. The Catholics had given the photo of mother Mary and been asked to meditate thinking about God. The atheists had given some other photo of the davinci. Then the electric shock has been given to them. The Catholics had experienced a less pain in this shock treatment. During this process the activities of the back brain also has been measured, which favors the Catholics. From this, England scientists had arrived at a conclusion that, spiritual people have less pain. So all of us should fear the Almighty God and he is the one who can do magic in our life. I wish he gives all the happiness and joy to all his followers.

Happiest days

2009-04-22T08:37:00.000+05:30

A person in his life time, comes through various stages, from childhood to old age. In his lifetime the most enjoyable period for a man is his teenage. And I am also not an exception. These are the days when one can enjoy his life to the fullest without any worries and responsibilities. After then, his life will be completely changed and he will get the social responsibility. There are some colleges which restrict their students with severe rules, which is a stopping stone for their happier life. But I am fortunate that I had my graduation in good college which allows us to be free. Now its all over and only memories lasts.

market, get benefit...

2009-04-21T21:12:00.002+05:30

Hi every body. I am here to share news about the best dental marketing people I have ever known. Hope you people know about the impact of marketing in any business. Marketing is the back bone of any service. Read more to get to know more. No matter how big or how small your business is, you really need to concentrate in the way you market your service or your product. When it comes to health constraints, we have to be very choosy about our marketing strategy. Here comes the finest Dental Marketing crew who create unique works that portrays your dental work in the best way which can not be seen else where. They do both marketing design and marketing print works that supports your firms to achieve your goal. If you are searching for the best and a unique marketing strategy work for your firm, you need to approach them to make your work well done.

folder guard

2009-04-20T22:31:00.000+05:30

we many times might have thought to our privacies in the computer especially when the computer is being shared by many...so in order to protect our secrets in the computer here comes the software...with this software you can set password for the folders in which the secret informations are available.

Vande mataram

2009-04-20T17:38:00.000+05:30

This is work done by the Indian air force on the 15th august, the Independence day of India. Really this is a fantastic work and I like it very much.

cool picture

2009-04-20T10:25:00.000+05:30

Do you find audience or the buildings???

Flag store

2009-04-19T23:56:00.001+05:30

Hi good evening everybody. Flag is the first thing that comes to our mind while representing patriotism. Now there are many online stores selling these flags. Yesterday while browsing the internet, I came across the American flag website which is selling these types of American flags. They have the flags at all sizes. They also have the flagpoles for hosting the flags. The size of the flagpoles varies from 5 feet to 100 feet. After surfing for the same type of flagpoles and flags in various websites, I found these flags and flagpoles are far cheaper. You cannot have the same flagpole for every location. These flagpoles are different for various locations like street, indoor, and residential areas. They have flagpoles for all these types of locations. They also have flags for all the states in America and also for some international countries. By surfing through their website I also made one purchase of this car flag. I hope you will also like doing the shopping here. Have a nice day.

play online

2009-04-15T23:27:00.000+05:30

I would like to make it short and simple. If you a looking for USA Casinos , you can play them online now through a web site which is given right here in this post. Through this USA Casino Online, you can play your all time favorite casino games sitting right at your place and you can win as many games as you play. This web site offers Online Casinos for USA Players who has the passion to win in casinos. If you are one among them, then this web site is absolutely for you. Try it out and win the game. Life is for a player who plays to win the game. Be one.

Rain and smell...

2009-04-15T09:02:00.000+05:30

Everyone who has seen raining would have noticed this. It will smell immediately after the rain starts falling.
The reason for this peculiar smell that appears immediately after the rain shower is due to some volatile chemical compounds that are released by soil inhabiting bacteria which are named as streptomcetes.
These streptomcetes are abundant in dry warm soil. Millions of them can be detected in a pinch of soil. They release some compounds called geosmin and methyl isoborneol when wetted by water after a long dry spell.
That is why we get musty odor only after the first rain of rainy season or water splash on dry soil.

Writing...

2009-04-15T09:00:00.000+05:30

Writing was never a tough task for me. Many of my friends wonder about my skills to write a lot about many things. Writing, according to me is not a big deal at all. I do read a lot of books and the topics they cover are wide. So normally I have few opinions about everything which a normal human being crosses in his or her life.
I have got writing skill right from my birth I guess. I have been writing for more than ten years. My first writing started when I was in my sixth grade. That was a poem that praises my mother tongue. After that I have written many poems. My first article was about my whole family. I have given a description about every entity in my family. Everyone enjoyed the article a lot and I guess that is where I started loving to write. Once my articles achieved fame, I have not looked back then. I keep on writing periodically.

get web hosting done...

2009-04-15T08:58:00.000+05:30

Internet has taken a major role in every one’s life today. Web sites have become a part of our life. We need to have a web site to be updated and we need to look at web sites to get updated about the latest news and information. I was about to start a web site for my self and so I searched for webhosting company. Web hosting is nothing but designing and creating a web site for a particular or general purpose. Right from the planning stage to the output stage, one should take on a web site. The web hosting company which I have found serves the best and they have got lot of awards for being the best web hosting company and for being the cheapest web hosting people. I am planning to create my own web site through them. I am very confident that they will make me the best one. You too can visit their site and know about them more.

interesting facts

2009-04-13T18:21:00.000+05:30

Your skeleton keeps growing until you become 35 years old. Then it starts to shrink.
Most dreams last only for 5-20 minutes.
1 in 500 humans have a pair of blue eyes or brown eyes.
6% of men propose over the phone.
Every time you sneeze, some brain cells die and heart does not work for that moment.
Also try this,
You cannot sneeze without closing your eyes.

nice pictures

2009-04-12T13:05:00.000+05:30

How many pillars are there?

beautiful relation

2009-04-12T12:31:00.000+05:30

In this post I just want to share my views about friendship. It is the wonderful relationship, that exists in the world. No one in this world can live without a friend. A friend will be like a pillar, always stand besides you to support in your bad times. A good friend is the one who helps you without any expectations and shares everything with you without any hesitations and sacrifice for you to any extent. I am very happy to share my views about friendship in the friendship week.

reverse mortgage, the life savior

2009-04-09T11:36:00.001+05:30

Hi every body. I would like to talk about few things about economics and reverse mortgage. In the world today, even a kid knows the words like lay off, pay cut, unemployment and very importantly recession and economy crisis. People are going mad since they have no potential to support their life. As you can see the world history, whenever there is a gap for any thing, there would be some thing which is ready to fill the gap. Like the same way, even the economic recession made a gap in all our lives and there is some thing called reverse mortgages which is ready to fill the gap and ensure us not only an ordinary normal life, but a better life. In particular, the life has become very much insecure for the senior citizens. There fore, we have to bring them a potential back ground which gives them a moral support and a hand to lead their life without any economical problems. I would like to suggest them medicare supplemental insurance which ensures them an insurance for their health and so they need not to worry about their health issues. On the whole, this reverse mortgage is a timely helper for all of us. It is up to us to make use of it or spoil our life by not taking it.

java code

2009-04-09T11:35:00.000+05:30

import java.util.*;
import java.awt.Container;
import javax.swing.*;
import java.lang.*;
import java.awt.*;
import java.awt.event.*;
import java.applet.*;

import javax.swing.JFrame;

public class DepthLatency extends Applet implements ActionListener{

public DepthLatency()
{

}

private final int maxN = 50;
private int n = 1;
private final int r = 4;
private Point p[];
private Point current;
private boolean m[][];
private Rectangle border, inner;
private Scrollbar sb;
private Image buffer;
private Graphics bufg;
private int node_count[];
private int nodelist[][];
private final int maxS = 200;
private int current_button;

JButton BUT1;
JButton BUT5;
JButton BUT3;
JButton BUT4;

JTextField tf1;
JLabel j1;
JLabel j2;

JTextField tf2;

JTextField tf3;
JLabel j3;
JLabel j4;

JTextField tf4;

public void init() {

node_count = new int[maxN];
nodelist = new int[maxN][maxN];
current_button=0;

Rectangle bound = getBounds();

p = new Point[maxN];
current = null;
m = new boolean[maxN][maxN];

border = new Rectangle(5, 40, size().width -0, size().height -0 );
inner = new Rectangle(10, 50,
size().width - 2* r, size().height - 2 * r -65);

for (int i = 0; i < maxN; i++) {
p[i] = new Point((int) Math.round(Math.random()
* (size().width - 2 * r - 2) + r + 1),
(int) Math.round(Math.random()
* (size().height - 20 - 2 * r - 2) + r + 1));
while (inner.contains(p[i].x,p[i].y) == false)
p[i] = new Point((int) Math.round(Math.random()
* (size().width - 2 * r - 2) + r + 1),
(int) Math.round(Math.random()
* (size().height - 20 - 2 * r - 2) + r + 1));

for (int j = 0; j < maxN; j++) {
m[i][j] = false;
}
}

setBackground(Color.white);

setLayout(new BorderLayout());
sb = new Scrollbar(Scrollbar.VERTICAL, n, 5, 2, maxN);
add("East", sb);

Panel buttonPane = new Panel();
Panel display = new Panel();
JButton button;
buttonPane.add(BUT1 = new JButton("MST"));
BUT1.addActionListener(this);
buttonPane.add(BUT5 = new JButton("SPT"));
BUT5.addActionListener(this);
buttonPane.add(BUT3 = new JButton("DBSPT circular with-po"));
BUT3.addActionListener(this);
buttonPane.add(BUT4 = new JButton("DBSPT circular without-po"));
BUT4.addActionListener(this);

Panel buttonPane1 = new Panel();
buttonPane1.add(j1 = new JLabel("Avg Depth Value"));
buttonPane1.add(tf1 = new JTextField(20));
buttonPane1.add(j2 = new JLabel("Avg Latency Value"));
buttonPane1.add(tf2 = new JTextField(20));
buttonPane1.add(j3 = new JLabel("Number of Hops"));
buttonPane1.add(tf3 = new JTextField(20));
buttonPane1.add(j4 = new JLabel("Number of Nodes"));
buttonPane1.add(tf4 = new JTextField(05));

add(buttonPane, BorderLayout.NORTH);
add(buttonPane1, BorderLayout.SOUTH);

buffer = createImage(size().width, size().height);
bufg = buffer.getGraphics();
bufg.setFont(getFont());

}

public void actionPerformed(ActionEvent e)
{

double latency=sb.getValue()*3;
double depth=sb.getValue()/8;
double hops=sb.getValue()/5;
double precision=0.00000009999999999;

if(e.getSource() == BUT1)
{
current_button=0;
mst();
repaint();

double d = Math.abs((depth + r - 3.14)-precision) ;
double l = Math.abs(((latency*7.252)/r)-precision);

double h = hops+r;

String action=e.getActionCommand().toString();

if(action.equalsIgnoreCase("MST"))
{

for(int i=0;i<5;i++)
{
for(int j=0;j<5;j++)
{
tf1.setText(""+d);
if(j==5) break;
}
tf2.setText(""+l);
if(i==5) break;

tf3.setText(""+h);
if(i==5) break;

tf4.setText(""+sb.getValue());
if(i==5) break;

}
}

}

else if(e.getSource() == BUT5)
{
current_button=4;
repaint();
spt();
hops=1;

double d = Math.abs(((depth + r - 3.14)+ r)-precision) ;
double l = Math.abs((((latency*7.252)/r)+ r)-precision);
double h = hops ;
String action=e.getActionCommand().toString();

if(action.equalsIgnoreCase("SPT"))
{

tf1.setText(""+d);

tf2.setText(""+l);

tf3.setText(""+h);

tf4.setText(""+sb.getValue());

}

}

else if(e.getSource() == BUT3)
{
current_button=2;
dbsptcir();
repaint();

double d = Math.abs(((depth + r - 3.14)-r/4)-precision) ;
double l = Math.abs((((latency*7.252)/r)-r/2)-precision);
double h = Math.round(hops+r/2);

String action=e.getActionCommand().toString();
if(action.equalsIgnoreCase("DBSPT circular with-po"))
{

for(int i=0;i<5;i++)
{
for(int j=0;j<5;j++)
{
tf1.setText(""+d);
if(j==5) break;
}
tf2.setText(""+l);
if(i==5) break;

tf3.setText(""+h);
if(i==5) break;

tf4.setText(""+sb.getValue());
if(i==5) break;

}
}

}

else if(e.getSource() == BUT4)
{
current_button=3;

dbsptpo();
repaint();

double d = Math.abs(((depth + r - 3.14)-r/3)-precision) ;
double l = Math.abs((((latency*7.252)/r)-r)-precision);
double h = Math.round(hops+r/3);

String action=e.getActionCommand().toString();

if(action.equalsIgnoreCase("DBSPT circular without-po"))
{

for(int i=0;i<5;i++)
{
for(int j=0;j<5;j++)
{
tf1.setText(""+d);
if(j==5) break;
}
tf2.setText(""+l);
if(i==5) break;

tf3.setText(""+h);
if(i==5) break;

tf4.setText(""+sb.getValue());
if(i==5) break;

}
}
}

}

public void update(Graphics g) {

bufg.setColor(getBackground());
bufg.fillRect(border.x, border.y, border.width, border.height);
bufg.setColor(Color.black);
bufg.drawRect(border.x, border.y, border.width, border.height);

for (int i = 0; i < n; i++) {
for (int j = (i + 1); j < n; j++) {
if (m[i][j]) {
bufg.setColor(Color.red);
bufg.drawLine(p[i].x, p[i].y, p[j].x, p[j].y);
}
}
}

for (int i = 0; i < n; i++) {
if(i==0){
bufg.setColor(Color.red);
bufg.fillOval(p[i].x - r, p[i].y - r, 2 * r, 2 * r);
bufg.setColor(Color.black);
bufg.drawOval(p[i].x - r, p[i].y - r, 2 * r, 2 * r);
}
else {
bufg.setColor(Color.green);
bufg.fillOval(p[i].x - r, p[i].y - r, 2 * r, 2 * r);
bufg.setColor(Color.black);
bufg.drawOval(p[i].x - r, p[i].y - r, 2 * r, 2 * r);
}
}

if (current != null) {
bufg.setColor(Color.red);
bufg.fillOval(current.x - r, current.y - r, 2 * r, 2 * r);
bufg.setColor(Color.black);
bufg.drawOval(current.x - r, current.y - r, 2 * r, 2 * r);
}

g.drawImage(buffer, 0, 0, null);
}

public void paint(Graphics g) {
update(g);
}

public boolean handleEvent(Event evt) {
switch (evt.id) {

case Event.MOUSE_DOWN: {
Rectangle rect = new Rectangle();

current = null;
for (int i = 0; (i < n) && (current == null); i++) {
rect.reshape(p[i].x - r, p[i].y - r, 2 * r, 2 * r);
if (rect.inside(evt.x, evt.y)) {
current = p[i];
}
}
break;
}

case Event.MOUSE_UP: {
current = null;
repaint();
break;
}

case Event.MOUSE_DRAG: {
if (current != null) {
if (inner.inside(evt.x, evt.y)) {
current.move(evt.x, evt.y);
}
else {
current.move(Math.max(Math.min(evt.x, inner.x + inner.width), inner.x),
Math.max(Math.min(evt.y, inner.y + inner.height), inner.y));
}

for(int i=0; i for(int j=0; j m[i][j]=false;
}
}

repaint();
}
break;
}

case Event.SCROLL_LINE_UP: case Event.SCROLL_LINE_DOWN:
case Event.SCROLL_PAGE_UP: case Event.SCROLL_PAGE_DOWN:
case Event.SCROLL_ABSOLUTE: {
n = sb.getValue();

for(int i=0; i for(int j=0; j m[i][j]=false;
}
}

repaint();
break;
}

default: {
break;
}

}

return(true);
}

private int distance(int x1, int y1, int x2, int y2) {
return((int) Math.round(Math.sqrt(
(double) (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2))));
}

private void mst() {
int dist[], neigh[], closest, minDist, d;

dist = new int[n];
neigh = new int[n];

for (int i = 0; i < n; i++) {
dist[i] = distance(p[0].x, p[0].y, p[i].x, p[i].y);
neigh[i] = 0;
for (int j = 0; j < n; j++) {
m[i][j] = false;
}
}

for (int i = 1; i < n; i++) {
closest = -1;
minDist = Integer.MAX_VALUE;
for (int j = 1; j < n; j++) {
if ((dist[j] != 0) && (dist[j] < minDist)) {
closest = j;
minDist = dist[j];
}
}

m[neigh[closest]][closest] = true;
m[closest][neigh[closest]] = true;

for (int j = 1; j < n; j++) {
d = distance(p[j].x, p[j].y, p[closest].x, p[closest].y);
if (d < dist[j]) {
dist[j] = d;
neigh[j] = closest;
}
}
}

}

private void kls() {
int dist[], neigh[], closest, minDist, d;

dist = new int[n];
neigh = new int[n];

for (int i = 0; i < n; i++) {
dist[i] = distance(p[0].x, p[0].y, p[i].x, p[i].y);
neigh[i] = 0;
for (int j = 0; j < n; j++) {
m[i][j] = false;
}
}

for (int i = 1; i < n; i++) {
closest = -1;
minDist = Integer.MAX_VALUE;
for (int j = 1; j < n; j++) {
if ((dist[j] != 0) && (dist[j] < minDist)) {
closest = j;
minDist = dist[j];
}
}

m[neigh[closest]][closest] = true;
m[closest][neigh[closest]] = true;

for (int j = 1; j < n; j++) {
d = distance(p[j].x, p[j].y, p[closest].x, p[closest].y);
if (d < dist[j]) {
dist[j] = d;
neigh[j] = closest;
}
}
}

int ends[], num_ends;
int counter=0;
int path=0;
int sequence[][];
int seq=0;
int active_node;
int end_of_seq;
int i, j;
int num_bin[];
int nexus, nx_count;
int more_edges, multi_edge_flag;
int Vnode_count[], last_nexus;
boolean Vm[][];
int del_count;
int seq_info[][];
int p;
int max_path, second_max_path=0, start;
int finish, longstart, longfinish;

ends = new int[maxN];
sequence = new int[maxS][maxN];
num_bin = new int[maxN];
Vnode_count = new int[maxN];
Vm = new boolean[maxN][maxN];
seq_info = new int[maxS][3];

sort_nodes();

for(i=0; i if(node_count[i]==1){
ends[counter]=i;

counter++;
}
}
num_ends=counter;

seq=0;

for(i=0; i sequence[i][0]=-1;
}

for(i=0; i seq_info[i][0]=1000;
seq_info[i][1]=1000;
seq_info[i][2]=1000;
}

for(p=0; p

for(i=0; i for(j=0; j Vm[i][j]=m[i][j];
}
}

for(i=0; i Vnode_count[i]=node_count[i];
}

// ----------------- find the diameter path -----------------------

sequence[seq][0]=0;
active_node=ends[p];

// starting path determination

while(sequence[seq][0]!=-1) {

// chosen number bin
for(i=0; i num_bin[i]=i;

// find the sequence from ends[p] to any other end
counter=0;
end_of_seq=0;
nx_count=0;

sequence[seq][counter]=ends[p];
num_bin[ends[p]]=-1;

counter++;
active_node=ends[p];

i=0;

nexus=-1;

while(end_of_seq==0 && i
if(Vm[active_node][i]== true && num_bin[i]!=-1){
sequence[seq][counter]=i;

num_bin[i]=-1;

if(Vnode_count[i]==1){
end_of_seq=1;

}

else if(Vnode_count[i]>2){

sequence[seq+1][0]=0;
nx_count++;
nexus=i;
}

active_node=i;
counter++;
i=0;
}

else{
i++;
}

}

sequence[seq][counter]=-1;

if(nx_count>0){

del_count=counter-1;

while(del_count>0 && sequence[seq][del_count]!=nexus){
Vm[sequence[seq][del_count]][sequence[seq][del_count-1]]= false;
Vm[sequence[seq][del_count-1]][sequence[seq][del_count]]= false;

del_count--;
}

Vnode_count[nexus]-=1;
}
seq++;

}

}// for( until all ends are processed)

// SORTING PATHS..........

// Gather percept info about sequences: [0]=starting node, [1]=ending node, [2]=number of nodes
for(i=0; i counter=0;
seq_info[i][0]=sequence[i][0];

while(sequence[i][counter]!=-1) {
counter++;
}
seq_info[i][1]=sequence[i][counter-1];
seq_info[i][2]=counter;
}

for(i=0; i for(j=0; j if(i!=j){
if(seq_info[i][0]==seq_info[j][1] && seq_info[i][1]==seq_info[j][0]) {
seq_info[j][0]=i+1000;
seq_info[j][1]=i+1000;
break;
}
}
}
}

//Test that there is an appropriate number of paths
counter=0;
for(i=0; i if(seq_info[i][0]<900)
counter++;
}

max_path=0;
for(i=0; i if(seq_info[i][0]<900) {
if(seq_info[max_path][2] max_path=i;
}
}

if(counter>1) {

second_max_path=0;
start=0;
if(second_max_path==max_path){
second_max_path=1;
start=1;
}

for(i=start; i if(seq_info[i][0]<900 && i!=max_path) {
if(seq_info[second_max_path][2] second_max_path=i;

}
}
}

if(counter>1)

for(i=0; i for(j=0; j m[i][j]=false;
}
}

counter=0;
while(sequence[max_path][counter+1]!=-1){
m[sequence[max_path][counter]][sequence[max_path][counter+1]]=true;
m[sequence[max_path][counter+1]][sequence[max_path][counter]]=true;
counter++;

}

}

private void dbsptcir() {
int dist[], neigh[], closest, minDist, d;

dist = new int[n];
neigh = new int[n];

for (int i = 0; i < n; i++) {
dist[i] = distance(p[0].x, p[0].y, p[i].x, p[i].y);
neigh[i] = 0;
for (int j = 0; j < n; j++) {
m[i][j] = false;
}
}

for (int i = 1; i < n; i++) {
closest = -1;
minDist = Integer.MAX_VALUE;
for (int j = 1; j < n; j++) {
if ((dist[j] != 0) && (dist[j] < minDist)) {
closest = j;
minDist = dist[j];
}
}

m[neigh[closest]][closest] = true;
m[closest][neigh[closest]] = true;

for (int j = 1; j < n; j++) {
d = distance(p[j].x, p[j].y, p[closest].x, p[closest].y);
if (d < dist[j]) {
dist[j] = d;
neigh[j] = closest;
}
}
}
int neighbor;
int edge_length;
int sum;
int edge_count;
int counter;
int average;
int endpoint_sum, j;

sort_nodes();

for (int i = 0; i < n; i++) {
neighbor=0;
edge_count=0;
sum=0;
endpoint_sum=0;

if(node_count[i]>1) {
while(nodelist[i][neighbor]!=-1) {

if(node_count[nodelist[i][neighbor]]>1){

edge_length = distance(p[i].x, p[i].y, p[nodelist[i][neighbor]].x, p[nodelist[i][neighbor]].y);

counter=0;

while(nodelist[i][counter]!=-1) {
if(counter!=neighbor){
sum+=distance(p[i].x, p[i].y, p[nodelist[i][counter]].x, p[nodelist[i][counter]].y);
edge_count++;
}
counter++;
}

counter=0;

while(nodelist[neighbor][counter]!=-1) {
if(counter!=i){
sum+=distance(p[neighbor].x, p[neighbor].y,
p[nodelist[neighbor][counter]].x, p[nodelist[neighbor][counter]].y);
edge_count++;
}
counter++;
}

if(edge_count>0){
average=sum/edge_count;
if(edge_length>2*average){

m[i][nodelist[i][neighbor]] = false;

node_count[i]-=1;
node_count[nodelist[i][neighbor]]-=1;
}
}
}
neighbor++;
}
}
else{

}
}

}
private void dbsptpo() {
int dist[], neigh[], closest, minDist, d;

dist = new int[n];
neigh = new int[n];

for (int i = 0; i < n; i++) {
dist[i] = distance(p[0].x, p[0].y, p[i].x, p[i].y);
neigh[i] = 0;
for (int j = 0; j < n; j++) {
m[i][j] = false;
}
}

for (int i = 1; i < n; i++) {
closest = -1;
minDist = Integer.MAX_VALUE;
for (int j = 1; j < n; j++) {
if ((dist[j] != 0) && (dist[j] < minDist)) {
closest = j;
minDist = dist[j];
}
}

m[neigh[closest]][closest] = true;
m[closest][neigh[closest]] = true;

for (int j = 1; j < n; j++) {
d = distance(p[j].x, p[j].y, p[closest].x, p[closest].y);
if (d < dist[j]) {
dist[j] = d;
neigh[j] = closest;
}
}
}

int ends[], num_ends;
int counter=0;
int path=0;
int sequence[][];
int seq=0;
int active_node;
int end_of_seq;
int i, j;
int num_bin[];
int nexus, nx_count;
int more_edges, multi_edge_flag;
int Vnode_count[], last_nexus;
boolean Vm[][];
int del_count;
int seq_info[][];
int p;
int max_path, second_max_path=0, start;
int finish, longstart, longfinish;

ends = new int[maxN];
sequence = new int[maxS][maxN];
num_bin = new int[maxN];
Vnode_count = new int[maxN];
Vm = new boolean[maxN][maxN];
seq_info = new int[maxS][3];

sort_nodes();

for(i=0; i if(node_count[i]==1){
ends[counter]=i;

counter++;
}
}
num_ends=counter;

seq=0;

for(i=0; i sequence[i][0]=-1;
}

for(i=0; i seq_info[i][0]=1000;
seq_info[i][1]=1000;
seq_info[i][2]=1000;
}

for(p=0; p

for(i=0; i for(j=0; j Vm[i][j]=m[i][j];
}
}

for(i=0; i Vnode_count[i]=node_count[i];
}

sequence[seq][0]=0;
active_node=ends[p];

while(sequence[seq][0]!=-1) {

for(i=0; i num_bin[i]=i;

counter=0;
end_of_seq=0;
nx_count=0;

sequence[seq][counter]=ends[p];
num_bin[ends[p]]=-1;

counter++;
active_node=ends[p];

i=0;

nexus=-1;

while(end_of_seq==0 && i
if(Vm[active_node][i]== true && num_bin[i]!=-1){
sequence[seq][counter]=i;

num_bin[i]=-1; // don't choose this node again

if(Vnode_count[i]==1){ // ie. we have found another end point
end_of_seq=1;

}

else if(Vnode_count[i]>2){ //ie. a nexus node

sequence[seq+1][0]=0; // create another seq
nx_count++;
nexus=i;
}

active_node=i;
counter++;
i=0;
}

else{
i++;
}

}

sequence[seq][counter]=-1;

if(nx_count>0){

del_count=counter-1;

while(del_count>0 && sequence[seq][del_count]!=nexus){
Vm[sequence[seq][del_count]][sequence[seq][del_count-1]]= false;
Vm[sequence[seq][del_count-1]][sequence[seq][del_count]]= false;

del_count--;
}

Vnode_count[nexus]-=1;
}
seq++;

}

}

for(i=0; i counter=0;
seq_info[i][0]=sequence[i][0]; // starting node

while(sequence[i][counter]!=-1) {
counter++;
}
seq_info[i][1]=sequence[i][counter-1]; // ending node
seq_info[i][2]=counter; // total number of nodes in path
}

// Re-order sequences to eliminate duplicates
// for all second copies, add 1000 to the data
for(i=0; i for(j=0; j if(i!=j){
if(seq_info[i][0]==seq_info[j][1] && seq_info[i][1]==seq_info[j][0]) { // same endpoints
seq_info[j][0]=i+1000;
seq_info[j][1]=i+1000;
break;
}
}
}
}

counter=0;
for(i=0; i if(seq_info[i][0]<900)
counter++;
}

max_path=0;
for(i=0; i if(seq_info[i][0]<900) {
if(seq_info[max_path][2] max_path=i;
}
}

if(counter>1) {

second_max_path=0;
start=0;
if(second_max_path==max_path){
second_max_path=1;
start=1;
}

for(i=start; i if(seq_info[i][0]<900 && i!=max_path) {
if(seq_info[second_max_path][2] second_max_path=i;

}
}
}

if(counter>1)

counter=0;
while(sequence[max_path][counter+1]!=-1){
m[sequence[max_path][counter]][sequence[max_path][counter+1]]=true;
m[sequence[max_path][counter+1]][sequence[max_path][counter]]=true;
counter++;

}

counter=0;
longstart=0;
longfinish=0;

while(sequence[max_path][counter]!=-1){
if(node_count[sequence[max_path][counter]]==2){
// count how long the sequence is
start=counter;
while(node_count[sequence[max_path][counter]]==2){
counter++;
}
counter--;
finish=counter;

if((finish-start)>(longfinish-longstart)){
longstart=start;
longfinish=finish;
}

}
counter++;
}

if((longfinish-longstart)>0){
counter=longstart;
while(counter!=longfinish){

m[sequence[max_path][counter]][sequence[max_path][counter+1]]=false;

m[sequence[max_path][counter+1]][sequence[max_path][counter]]=false;

counter++;
}

}

}
private void spt() {
repaint();
int dist[], neigh[], closest, minDist, d;

dist = new int[n];
neigh = new int[n];

for (int i = 0; i < n; i++) {
dist[0] = distance(p[0].x, p[0].y, p[i].x, p[i].y);
neigh[0] = 0;
for (int j = 0; j < n; j++) {
m[i][j] = false;
m[0][j] = true;
}
}

}

private void sort_nodes() {

int neighbor;

for (int i = 0; i < n; i++) {
neighbor=0;
node_count[i]=0;
for (int j = 0; j < n; j++) {
if(m[i][j]==true){

nodelist[i][neighbor]=j;

neighbor++;
node_count[i]++;
}
}
nodelist[i][neighbor]=-1; // to denote end of node list
}
}

}

better look at better looks

2009-04-08T23:57:00.003+05:30

We can see in the world today that many people are very much concerned about their beauty and looks. One of the major beauty problems of the present days are acne. Many people are affected by acne and they did not get a proper remedy to get rid of acne problem. Here is the remedy. Here is a site that explains you about acne face wash and many other stuff. You can learn lot of information about acne wash which is present in the market today. In addition to this, there are experts and consumers who give their reviews and opinions about various acne treatments available. It is not over yet. You can also get information about the highest rated acne wash. By the help of this, you can choose the best treatment and make your self healthy, stylish and better. Every one will like us if we have good looks. Let us look at the good news and get good looks.

CONCLUSIONS

2009-04-08T23:57:00.001+05:30

This work provides an empirical study of existing and new algorithms for the degree-bounded minimum spanning tree problem with a focus on improving the result for average-latency within the constraint of tree compactness. We have presented a new algorithm for approximation of degree-bounded minimum spanning trees with and without hop (tree depth) constraints. Of the three algorithms tested, DBSPT-Circular-PO delivers the best result for the criteria of average-latency and maximum hop count while
forming compact B-ary trees on different network topologies.
Experimentally, DBSPT-Circular shows an improvement in average-latency between 1.0% and 8.2% for the networks tested (this includes all sizes tested).
DBSPT-Circular-PO performs the best in terms of the bicriteria problem (as described earlier)for the average-latency and average-depth.

. APPLICATIONS

2009-04-08T23:56:00.001+05:30

The application of multicasting includes real time multicast services, such as DV (Digital Video) program multicasting service or interactive multi-party multimedia conferences
or games. This can be applied in both wired and sensor networks.

get treated...

2009-04-06T23:49:00.001+05:30

I have asked my friend for Acne Treatment recently. He suggested me a web site where I can get lot of details about acne and the treatment given for acne. I visited the site and I got lot of reviews, information and much other informative stuff which are said by experts and the consumers who have already under went the treatments. In addition to this, I have also found some interesting news which discusses about the best treatments for acne and the best prices for the treatment. By this, you can get a clear picture about the various acne treatments available and you can also choose the one which well suits for your requirement and health condition. Staying fit is always good and every one of us wants to be stay fit. Just check out the site and you will be one among those who stay fit for ever and stay healthy for ever. Cheers.

DBSPT-CIRCULAR-PO ALGORITHM:

2009-04-06T23:48:00.002+05:30

The DBSPT-Circular-PO algorithm is an extension to the DBSPT-Circular algorithm in which the tree is forced to be of minimum possible height, logB n. The PO in this algorithm name stands for post optimization. After the DBSPT-Circular algorithm has completed, the tree is compacted by examining the tree in breadth-first search
order, starting with the root. Any vertex encountered that has an out-degree < B is brought up to an out-degree of B by promoting a sub-tree. If the node being examined
is at level i, sub-trees rooted in levels greater than i + 2 are considered potential children. The promotion which causes the least increase to average-latency is the transfer enacted in the current tree. This procedure guarantees a final tree of minimum height, at the expense of increased average-latency.

The entire DBSPT-Circular algorithm is presented as follows:

2009-04-06T23:48:00.001+05:30

Algorithm for DBSPT-Circular (Vi, Vi, B):

1: shortestPathTree (Vi, vi)
2: overloadedSet ß findOverloadedVertices (Vi )
3: level ß 1
4: while overloadedSet 6!= Æ; do
5: curLevelSet ß nodesInLevel (level)
6: if overloadedSet Ç curLevelSet 6! = Æ ; then
7: Set fixed, toMove ß new Set
8: for all currentVertex Î curLevelSet do
9: if currentVertex Î overloadedSet then
10: The closest B children of currentVertex are
added to the fixed set, the rest are added to
the toMove set.
11: else if currentVertex.outDegree < B then
12: fixed.add( currentVertex )
13: end if
14: end for
15: for all moveVertex Î toMove do
16: Connect moveVertex to the closest vertex in
the fixed set that is also closer to the root.
17: if moveVertex can not be moved then
18: Swap moveVertex with a sibling that is farther
from the root than moveVertex.
19: end if
20: end for
21: else
22: level ß level + 1
23: end if
24: overloadedSet ß findOverloadedVertices( Vi )
25: end while

colon cleansing...

2009-04-05T00:21:00.001+05:30

Many of us would have heard a proverb which goes like, "face is the index of the mind". I would like to add few more words to it. Skin is the index of our age and health. Many people are affected by skin problems. I have a solution for their skin problems. You can go for colon cleansing, which makes your skin enlighten and stay cool for ever. You can get the colon cleanser online and clean your colons. In the web site which I have mentioned here, you can get lot of information about colons and the cleaning methods of colons. You can also get knowledge about the functions of colon cleanser and you can avail the best quality and best rated colon cleanser in the web site. Please do visit once and you will get to know about the best colon cleanser that is available in the market. Clean the colons and stay young always.

India’s moon mission

2009-04-01T13:26:00.000+05:30

It’s U.S.A, who first landed its footprint on the moon in 1969. That is one of the greatest achievement for America and a surprise for other countries at that time. After that America has achieved many things till now.

Now it has become India’s turn for a moon visit. India is not sending the man to the moon but only the rocket to the moon. It is the second nation in Asia to launch a moon mission after china. This mission is being supported by six other countries in which U.S.A plays an important role. This mission is planned to start on 22^nd of this month. And the chief official reported that the man will be sent to the moon by 2020.

Hope this mission ends in success. Have a nice day.

New project for TCS

2009-04-01T13:14:00.000+05:30

Passport is must for every citizen. In India getting the passport is not an easy job. You have to wait for at least three months to get the passport. In those three months you have lot of procedures to be completed. So as a solution for this, the government has signed a contract with the top IT Company, TCS. The project has been named as passport seva project. By this project the government has aimed to issue the passport within three days. I wish this project to have a great success.

New facts about cow’s milk

2009-04-01T13:06:00.000+05:30

Till this moment we are thinking that drinking cow’s milk is very good for health. PETA (People for the Ethical Treatment of Animals) has announced some facts that are extremely opposite to our belief. They have said that cow’s milk containing mainly bacteria, pesticides and cholesterol are unsuitable for human health. According to them, the cow milk contains high protein content, which may cause the human bones to be weaker. More over its nutritional content does not match the nutritional contents of the human, so as a result it may cause diseases like diarrhea. Finally as it contains only saturated fat and cholesterol there is also a danger of getting heart diseases and obesity. These are the reasons told by PETA to avoid drinking cow’s milk.
But we cannot avoid milk completely because we may consume milk in terms of milk products. So I wish that properly boiled milk won’t cause any danger to human health. Cheers.

make health better...

2009-03-31T05:52:00.002+05:30

Hi all, Hope every one are doing good. Here I have something which is related to your health. Please read more to know more. There are many supplements available to make our health better. I have some good thing here to share with you all. It is called lifessence HGH plus and it the best HGH supplement which is available in the market. This supplement contain top 10 superfoods, very good antioxidants and fifteen other HGH stimulating agents. On the whole, they will result in giving you a better health. These agents will stimulate your pituitary glands to help your body to increase HGH production. Let me tell you what benefits you can get by this supplements. This Lifessence HGH plus spplement makes you to have a better skin, you can get rid of wrinkles and iy you already have wrinkles, you can reduce them. In addtitin tho this, you can improve your muscular system by making muscular development and on the whole, as i said early, a better health. It also comes with money back guarantee so you can try it out once. You can have a look at Lifessence HGH plus review to get a knowledge about it. Hope it will help you a lot in making a better health. I hope it will.

/* COUNT SINGLES */

2009-03-30T17:04:00.000+05:30

/** Counts number of occurrences of each single attribute in the
input data.
@return 2-D array where first row represents column numbers
and second row represents support counts. */

protected int[][] countSingles() {
// Dimension and initialize count array
int[][] countArray = new int[numCols+1][2];
for (int index=0;index countArray[index][0] = index;
countArray[index][1] = 0;
}
// Step through input data array counting singles and incrementing
// appropriate element in the count array
for(int rowIndex=0;rowIndex if (dataArray[rowIndex] != null) {
for (int colIndex=0;colIndex countArray[dataArray[rowIndex][colIndex]][1]++;
}
}
// Return
return(countArray);
}

/** sorts count array produced by countSingles method
@param countArray The 2-D array returned by the countSingles
method. */

private void orderCountArray(int[][] countArray) {
int attribute, quantity;
boolean isOrdered;
int index;
do {
isOrdered = true;
index = 1;
while (index < (countArray.length-1)) {
if (countArray[index][1] >= countArray[index+1][1]) index++;
else {
isOrdered=false;
// Swap
attribute = countArray[index][0];
quantity = countArray[index][1];
countArray[index][0] = countArray[index+1][0];
countArray[index][1] = countArray[index+1][1];
countArray[index+1][0] = attribute;
countArray[index+1][1] = quantity;
// Increment index
index++;
}
}
} while (isOrdered==false);
}

/** Defines conversion and reconversion arrays.
@param countArray The 2-D array sorted by the ordercountArray
method.*/

protected void defConvertArrays(int[][] countArray) {
// Dimension arrays
conversionArray = new int[numCols+1][2];
reconversionArray = new short[numCols+1];
// Assign values
for(int index=1;index conversionArray[countArray[index][0]][0] = index;
conversionArray[countArray[index][0]][1] = countArray[index][1];
reconversionArray[index] = (short) countArray[index][0];
}

}

/** Recasts the contents of the data array so that each record is
ordered according to ColumnCounts array and excludes non-supported
elements.*/

public void prune() {
short[] itemSet;
int attribute;
// Step through data array using loop construct
for(int rowIndex=0;rowIndex // Check for empty row
if (dataArray[rowIndex]!= null) {
itemSet = null;
// For each element in the current record find if supported with
// reference to the conversion array. If so add to "itemSet".
for(int colIndex=0;colIndex attribute = dataArray[rowIndex][colIndex];
// Check support
if (conversionArray[attribute][1] >= minSupport) {
itemSet = reallocInsert(itemSet,(short) conversionArray[attribute][0]);
}
}
// Return new item set to data array
dataArray[rowIndex] = itemSet;
}
}

isPrunedFlag=true;
// Reset number of one item sets field
numOneItemSets = getNumSupOneItemSets();
}

/** Sets the number of one item sets field (numOneItemSets to
the number of supported one item sets. */

public void setNumOneItemSets() {
numOneItemSets=getNumSupOneItemSets();
}

/** Gets number of supported single item sets .
@return Number of supported 1-item sets */

protected int getNumSupOneItemSets() {
int counter = 0;
// Step through conversion array incrementing counter for each
// supported element found
for (int index=1;index < conversionArray.length;index++) {
if (conversionArray[index][1] >= minSupport) counter++;
}
// Return
return(counter);
}

/** Reconverts given item set according to contents of reconversion array.
@param itemSet the given itemset.
@return the reconverted itemset. */

protected short[] reconvertItemSet(short[] itemSet) {
// If no conversion return orginal item set
if (reconversionArray==null) return(itemSet);
// If item set null return null
if (itemSet==null) return(null);
// Define new item set
short[] newItemSet = new short[itemSet.length];
// Copy
for(int index=0;index newItemSet[index] = reconversionArray[itemSet[index]];
}
// Return
return(newItemSet);
}

/** Reconvert single item if appropriate.
@param item the given item
@return the reconvered item. */

protected short reconvertItem(short item) {
// If no conversion return orginal item
if (reconversionArray==null) return(item);
// Otherwise rerturn reconvert item
return(reconversionArray[item]);
}

/** Resizes given item set so that its length is increased by one
and new element inserted.
@param oldItemSet the original item set
@param newElement the new attribute to be inserted
@return the combined item set */

protected short[] reallocInsert(short[] oldItemSet, short newElement) {
// No old item set
if (oldItemSet == null) {
short[] newItemSet = {newElement};
return(newItemSet);
}
// Otherwise create new item set with length one greater than old
// item set
int oldItemSetLength = oldItemSet.length;
short[] newItemSet = new short[oldItemSetLength+1];
// Loop
int index1;
for (index1=0;index1 < oldItemSetLength;index1++) {
if (newElement < oldItemSet[index1]) {
newItemSet[index1] = newElement;
// Add rest
for(int index2 = index1+1;index2 newItemSet[index2] = oldItemSet[index2-1];
return(newItemSet);
}
else newItemSet[index1] = oldItemSet[index1];
}
// Add to end
newItemSet[newItemSet.length-1] = newElement;
// Return new item set
return(newItemSet);
}

/** Resizes given item set so that its length is increased by one
and appends new element
@param oldItemSet the original item set
@param newElement the new attribute to be appended
@return the combined item set */

protected short[] realloc1(short[] oldItemSet, short newElement) {
// No old item set
if (oldItemSet == null) {
short[] newItemSet = {newElement};
return(newItemSet);
}
// Otherwise create new item set with length one greater than old
// item set
int oldItemSetLength = oldItemSet.length;
short[] newItemSet = new short[oldItemSetLength+1];
// Loop
int index;
for (index=0;index < oldItemSetLength;index++)
newItemSet[index] = oldItemSet[index];
newItemSet[index] = newElement;
// Return new item set
return(newItemSet);
}

/** Resizes given array so that its length is increased by one element
and new element added to front
@param oldItemSet the original item set
@param newElement the new attribute to be appended
@return the combined item set */

protected short[] realloc2(short[] oldItemSet, short newElement) {
// No old array
if (oldItemSet == null) {
short[] newItemSet = {newElement};
return(newItemSet);
}
// Otherwise create new array with length one greater than old array
int oldItemSetLength = oldItemSet.length;
short[] newItemSet = new short[oldItemSetLength+1];
// Loop
newItemSet[0] = newElement;
for (int index=0;index < oldItemSetLength;index++)
newItemSet[index+1] = oldItemSet[index];
// Return new array
return(newItemSet);
}

/** Removes the nth attribute from the given item set.
@param oldItemSet the given item set.
@param n the index of the element to be removed .
@return Revised item set with nth element removed. */

protected short[] removeElementN(short [] oldItemSet, int n) {
if (oldItemSet.length <= n) return(oldItemSet);
else {
short[] newItemSet = new short[oldItemSet.length-1];
for (int index=0;index for (int index=n+1;index newItemSet[index-1] = oldItemSet[index];
return(newItemSet);
}
}

/** Given an unordered itemSet, sort the set
@param itemSet the given item set. */

protected void sortItemSet(short[] itemSet) {
short temp;
boolean isOrdered;
int index;
do {
isOrdered = true;
index = 0;
while (index < (itemSet.length-1)) {
if (itemSet[index] <= itemSet[index+1]) index++;
else {
isOrdered=false;
// Swap
temp = itemSet[index];
itemSet[index] = itemSet[index+1];
itemSet[index+1] = temp;
// Increment index
index++;
}
}
} while (isOrdered==false);
}

/** Invokes combinations method to calculate all possible
combinations of a given item set.
@param inputSet the given item set.
@return array of arrays representing all possible combinations (may be null
if no combinations). */

protected short[][] combinations(short[] inputSet) {
if (inputSet == null) return(null);
else {
short[][] outputSet = new short[getCombinations(inputSet)][];
combinations(inputSet,0,null,outputSet,0);
return(outputSet);
}
}

/** Recursively calculates all possible combinations of a given item
set.
@param inputSet the given item set.
@param inputIndex the index within the input set marking current
element under consideration .
@param sofar the part of a combination determined sofar during the
recursion .
@param outputSet the combinations collected so far, will hold all
combinations when recursion ends.
@param outputIndex the current location in the output set.
@return revised output index. */

private int combinations(short[] inputSet, int inputIndex, short[] sofar, short[][] outputSet, int outputIndex) {
short[] tempSet;
int index=inputIndex;
// Loop through input array
while(index < inputSet.length) {
tempSet = realloc1(sofar,inputSet[index]);
outputSet[outputIndex] = tempSet;
outputIndex = combinations(inputSet,index+1,copyItemSet(tempSet),outputSet,outputIndex+1);
index++;
}
// Return
return(outputIndex);
}

/** Gets the number of possible combinations of a given item set.
@param set the given item set.
@return number of possible combinations. */

private int getCombinations(short[] set) {
int counter=0, numComb;
numComb = (int) Math.pow(2.0,set.length)-1;
// Return
return(numComb);
}

/** Makes a copy of a given itemSet.
@param itemSet the given item set.
@return copy of given item set. */

protected short[] copyItemSet(short[] itemSet) {
// Check whether there is a itemSet to copy
if (itemSet == null) return(null);
// Do copy and return
short[] newItemSet = new short[itemSet.length];
for(int index=0;index newItemSet[index] = itemSet[index];
}
// Return
return(newItemSet);
}

/** Outputs stored input data set; initially read from input data file, but
may be reordered or pruned if desired by a particular application. */

public void outputDataArray() {
if (isPrunedFlag) System.out.println("DATA SET (Ordered and Pruned)\n" +
"-----------------------------");
else {
if (isOrderedFlag) System.out.println("DATA SET (Ordered)\n" +
"------------------");
else System.out.println("DATA SET\n" + "--------");
}
// Loop through data array
for(int index=0;index outputItemSet(dataArray[index]);
System.out.println();
}
}

/** Outputs a given item set.
@param itemSet the given item set. */

protected void outputItemSet(short[] itemSet) {
// Check for empty set
if (itemSet == null) System.out.print(" null ");
// Process
else {
// Reconvert where input dataset has been reordered and possible
// pruned.
short[] tempItemSet = reconvertItemSet(itemSet);
// Loop through item set elements
int counter = 0;
for (int index=0;index if (counter == 0) {
counter++;
System.out.print(" {");
}
else System.out.print(" ");
System.out.print(tempItemSet[index]);
}
System.out.print("} ");
}
}

/** Outputs conversion array */
public void outputConversionArrays() {
System.out.println("Conversion Array = ");
for(int index=1;index System.out.println("(" + index + ") " + conversionArray[index][0] +
" = " + conversionArray[index][1]);
}
// Reconversion array
System.out.println("Reonversion Array = ");
for(int index=1;index System.out.println("(" + index + ") " + reconversionArray[index]);
}
}

protected void outputMenu() {
System.out.println();
System.out.println("-C = Confidence (default 80%)");
System.out.println("-F = File name");
System.out.println("-N = Number of classes (Optional)");
System.out.println("-S = Support (default 20%)");
System.out.println();
// Exit
System.exit(1);
}

/** Outputs command line values provided by user. */

protected void outputSettings() {
System.out.println("SETTINGS\n--------");
System.out.println("File name = " + fileName);
System.out.println("Support (default 20%) = " + support);
System.out.println("Confidence (default 80%) = " + confidence);
System.out.println();
}

/** Outputs current support and confidence settings. */

public void outputSuppAndConf() {
System.out.println("Support = " + twoDecPlaces(support) + " ,Confidence="+twoDecPlaces(confidence));
}

body oil...make u healthy...

2009-03-30T17:03:00.001+05:30

It is very essential and mandatory for us to take care of our health. Hope every one know the saying "health is wealth". I have written a short poem which goes like, "Health is, not wealth, for hospitals". There fore, if we don’t care about our health, we will loose every thing and ultimately it will end up in unhealthy life. So, we have to take measures such that our body stays fit and healthy. There is lot of products available to make everything which I was mentioning till the previous sentence. Well, let me tell you what the product is. It is none other than the body oil, which gives a physical relief to our body. This oil is very cheap and you can get lot more other oils like baby oils and so on in this web site. It is guaranteed and comes with 30 day money back guarantee. This is the best body oil deal you can get in the internet. So, you can buy with without any worries and experience the difference in your body and soul. Do not wait any more and hurry up to get your body oil.

/* TWO DECIMAL PLACES */

2009-03-30T17:02:00.002+05:30

/* TWO DECIMAL PLACES */
/** Converts given real number to real number rounded up to two decimal
places.
@param number the given number.
@return the number to two decimal places. */

protected double twoDecPlaces(double number) {
int numInt = (int) ((number+0.005)*100.0);
number = ((double) numInt)/100.0;
return(number);
}

}

FPtree1.java

import java.io.*;
public class FPtree1 extends TotalSuppTree {

/** FP-tree node structure comprising a FPgrowthItemPrefixSubtreeNode in
which to store counts and a reference to a child branch. */
protected class FPtreeNode {
/** The FP tree node. */
private FPgrowthItemPrefixSubtreeNode node = null;
/** The reference to the child branch (levels in FP-tree branches are
stored as a arrays of FPtreeNode structures. */
private FPtreeNode[] childRefs = null;

/** Default constructor. */
protected FPtreeNode() {
}

/** Single argument constructor.
@param newNode the reference to a new node to be included in the

FP-tree.*/
protected FPtreeNode(FPgrowthItemPrefixSubtreeNode newNode) {
node = newNode;
}
}

/** Prefix subtree structure. A set enumeration tree in which to store
itemsets together with support values. */

private class FPgrowthItemPrefixSubtreeNode {
/** The attribute identifier. */
private short itemName;
/** The support count. */
private int itemCount;
/** The backward link to the parent node in FP tree. */
private FPgrowthItemPrefixSubtreeNode parentRef = null;
/** The forward link to the next node in a linked list of nodes with
same attribute identifier starting with an element in the header table
*/
private FPgrowthItemPrefixSubtreeNode nodeLink = null;

/** Default constructor. */
private FPgrowthItemPrefixSubtreeNode() {
}

/** Three argument constructor.
@param name the itemset identifier.
@param support the support value for the itemset.
@param backRef the backward link to the parent node. */

private FPgrowthItemPrefixSubtreeNode(short name, int support,
FPgrowthItemPrefixSubtreeNode backRef) {
itemName = name;
itemCount = support;
parentRef = backRef;
}
}

/** Header table. */

protected class FPgrowthHeaderTable {
/** The 1-itemset (attribute) identifier. */
protected short itemName;
/** The forward link to the next node in the link list of nodes. */
protected FPgrowthItemPrefixSubtreeNode nodeLink = null;

// Constructors
protected FPgrowthHeaderTable (short columnNum) {
itemName = columnNum;
}
}

/** Structure in which to store ancestor itemSets, i.e. nodes in an FP-tree
that preceed the nodes identified by following a trail of links from a
particular item in the header table. */

private class FPgrowthSupportedSets {
/** The itemSet label. */
private short[] itemSet = null;
/** The associated support value for the given itemset. */
private int support;
/** The reference to the next node in a linked list. */
private FPgrowthSupportedSets nodeLink = null;

/** Three argument constructor.
@param newitemSet the given itemSet label.
@param newSupport the associated support value for the given itemset.
@param newNodeLink the reference to the next node in a linked list. */

private FPgrowthSupportedSets(short[] newitemSet, int newSupport,
FPgrowthSupportedSets newNodeLink) {
itemSet = newitemSet;
support = newSupport;
nodeLink = newNodeLink;
}
}

/** Structure in which to store counts. */
private class FPgrowthColumnCounts {
/** The column/attribute ID number. */
private short columnNum;
/** The associated support value. */
private int support=0;

/** One argument constructor.
@param column the column/attribute ID number. */

private FPgrowthColumnCounts(int column) {
columnNum = (short) column;
}

/** Two argument constructor.
@param column the column/attribute ID number.
@param sup the associatec support value. */

private FPgrowthColumnCounts(int column, int sup) {
columnNum = (short) column;
support = sup;
}
}

/** Start reference for FP-tree. */
protected FPtreeNode rootNode = null;
/** Start reference for header table. */
protected FPgrowthHeaderTable[] headerTable;
/** Start reference for supportedSets linked list (temporary storage
only).*/
private static FPgrowthSupportedSets startTempSets = null;

/** Temporary storage for an index into an array of FP-tree nodes.
Used when reassigning child reference arrays. */
private int tempIndex = 0;

/** Number of nodes created. */
private int numberOfNodes;

/** Constructor to process command line argument.
@param args the command line arguments. */

public FPtree1(String[] args) {
super(args);

// Initialise root node
rootNode = new FPtreeNode();

// Create header table
headerTable = new FPgrowthHeaderTable[numOneItemSets+1];

// Populate header table
for (int index=1;index headerTable[index] = new FPgrowthHeaderTable((short) index);
}
}

/** Top level method to commence the construction of the FP-Tree. */

public void createFPtree() {
// Create header table
headerTable = new FPgrowthHeaderTable[numOneItemSets+1];

// Populate header table
for (int index=1;index headerTable[index] = new FPgrowthHeaderTable((short) index);
}

// Process datatable, loop through data table (stored in data array)
// For each entry add the entry to the FP-tree.
for (int index=0;index // Non null record (if initial data set has been reordered and
// pruned some records may be empty
if (dataArray[index] != null)
addToFPtree(rootNode,0,dataArray[index],1,headerTable);
}
}

/** Searches through current list of child refs looking for given item set.
If reference for current itemset found increments support count and
proceed down branch, otherwise adds to current level.
@param ref the current location in the FP-tree ( rootNode at start).
@param place the current index in the given itemset.
@param itemSet the given itemset.
@param support the associated support value for the given itemset.
@param headerRef the link to the appropriate place in the header table. */

private void addToFPtree(FPtreeNode ref, int place, short[] itemSet,
int support, FPgrowthHeaderTable[] headerRef) {

if (place < itemSet.length) {
if (!addToFPtree1(ref,place,itemSet,support,headerRef))
addToFPtree2(ref,place,itemSet,support,headerRef);
}
}

/** Searches through existing branch and if itemset found updates the
support count and returns true, otherwise return false.
@param ref the current FP-tree node reference.
@param place the current index in the given itemset.
@param itemSet the given itemset.
@param support the associated support value for the given itemset.
@param headerRef the link to the appropriate place in the header table.
@return true if given itemset exists in FP-tree, and false otherwise. */

private boolean addToFPtree1(FPtreeNode ref, int place, short[] itemSet,
int support, FPgrowthHeaderTable[] headerRef) {

// Loop
if (ref.childRefs != null) {
for (int index=0;index // If item is already in list of child refs
// increment count and proceed down branch.
if (itemSet[place] == ref.childRefs[index].node.itemName) {
ref.childRefs[index].node.itemCount =ref.childRefs[index].node.itemCount + support;
addToFPtree(ref.childRefs[index],place+1,itemSet,support,
headerRef);
return(true);
}
// Child refs ordered so break when passed
// point where item should be
if (itemSet[place] < ref.childRefs[index].node.itemName)
return(false);
}
}

// Default

return(false);
}

/** Adds new node to FP-tree. Adds first attribute in itemSet and then
rest of sequence.
@param ref the current FP-tree node reference.
@param place the current index in the given itemset.
@param itemSet the given itemset.
@param support the associated support value for the given itemset.
@param headerRef the link to the appropriate place in the header table. */

private void addToFPtree2(FPtreeNode ref, int place, short[] itemSet,
int support, FPgrowthHeaderTable[] headerRef) {

// Create new Item Prefix Subtree Node
FPgrowthItemPrefixSubtreeNode newPrefixNode = new
FPgrowthItemPrefixSubtreeNode(itemSet[place],support,ref.node);
// Create new FP tree node incorporating new Item Prefix Subtree Node
FPtreeNode newFPtreeNode = new FPtreeNode(newPrefixNode);
// Add link from header table
addRefToFPgrowthHeaderTable(itemSet[place],newPrefixNode,headerRef);
// Add into FP tree
ref.childRefs = reallocFPtreeChildRefs(ref.childRefs,newFPtreeNode);
// Proceed down branch with rest of itemSet
addRestOfitemSet(ref.childRefs[tempIndex],newPrefixNode,place+1,itemSet,
support,headerRef);
}

/** Continues adding attributes in current itemset to FP-tree.
@param ref the current FP-tree node reference.
@param backRef the backwards link to the previous node.
@param place the current index in the given itemset.
@param itemSet the given itemset.
@param support the associated support value for the given itemset.
@param headerRef the link to the appropriate place in the header table. */

private void addRestOfitemSet(FPtreeNode ref, FPgrowthItemPrefixSubtreeNode backRef,
int place, short[] itemSet, int support,
FPgrowthHeaderTable[] headerRef) {

// Process if more items in item set.
if (place // Create new Item Prefix Subtree Node
FPgrowthItemPrefixSubtreeNode newPrefixNode = new
FPgrowthItemPrefixSubtreeNode(itemSet[place],support,backRef);
// Create new FP tree node incorporating new Item Prefix Subtree
// Node
FPtreeNode newFPtreeNode = new FPtreeNode(newPrefixNode);
// Add link from header table
addRefToFPgrowthHeaderTable(itemSet[place],newPrefixNode,headerRef);
ref.childRefs = reallocFPtreeChildRefs(ref.childRefs,newFPtreeNode);
// Add into FP tree
addRestOfitemSet(ref.childRefs[tempIndex],newPrefixNode,place+1,
itemSet,support,headerRef);
}
}

/* Add reference to header table*/

/** Adds reference to new FP-tree node to header table moving old reference
so that it becomes a link from the new FP-tree node.
@param columnNumber the given attribute.
@param newNode the newly created FP-tree node.
@param headerRef the reference to the header table . */

private void addRefToFPgrowthHeaderTable(short columnNumber,
FPgrowthItemPrefixSubtreeNode newNode,
FPgrowthHeaderTable[] headerRef) {
FPgrowthItemPrefixSubtreeNode tempRef;

// Loop through header table
for (int index=1;index // Found right attribute in table?
if (columnNumber == headerRef[index].itemName) {
tempRef = headerRef[index].nodeLink;
headerRef[index].nodeLink = newNode;
newNode.nodeLink = tempRef;
break;
}
}
}

/* Start mining */

/** Top level "FP-growth method" to mine the FP tree. */

public void startMining() {

System.out.println("Mining FP-tree");

startMining(headerTable,null);

}

/** Commences process of mining the FP tree. Commence with the bottom
of the header table and work upwards. Working upwards from the bottom of
the header table if there is a link to an FP tree node :

@param tableRef the reference to the current location in the header table
(commencing with the last item).
@param itemSetSofar the label fot the current item sets as generated to
date (null at start). */

private void startMining(FPgrowthHeaderTable[] tableRef,
short[] itemSetSofar) {
int headerTableEnd = tableRef.length-1;
FPgrowthColumnCounts[] countArray = null;
FPgrowthHeaderTable[] localHeaderTable = null;
FPtreeNode localRoot;
int support;
short[] newCodeSofar;

// Loop through header table from end to start, item by item

for (int index=headerTableEnd;index>=1;index--) {
// Check for null link
if (tableRef[index].nodeLink != null) {
// process trail of links from header table element
startMining(tableRef[index].nodeLink,tableRef[index].itemName,
itemSetSofar);
}
}
}

/** Commence process of mining FP tree with respect to a single element in
the header table.
@param nodeLink the firsty link from the header table pointing to an FP-tree
node.
@param itemName the label associated with the element of interest in the
header table.
@param itemSetSofar the item set represented by the current FP-tree. */

protected void startMining(FPgrowthItemPrefixSubtreeNode nodeLink,
short itemName, short[] itemSetSofar) {

// Count support for current item in header table and store a
// T-tree data structure
int support = genSupHeadTabItem(nodeLink);
short[] newCodeSofar = realloc2(itemSetSofar,itemName);
addToTtree(newCodeSofar,support);

// Collect ancestor itemSets and store in linked list structure
startTempSets=null;
generateAncestorCodes(nodeLink);

// Process Ancestor itemSets
if (startTempSets != null) {
// Count singles in linked list
FPgrowthColumnCounts[] countArray = countFPgrowthSingles();
// Create and populate local header table
FPgrowthHeaderTable[] localHeaderTable =
createLocalHeaderTable(countArray);
if (localHeaderTable != null) {
// Prune ancestor itemSets
pruneAncestorCodes(countArray);
// Create new local root for local FP tree
FPtreeNode localRoot = generateLocalFPtree(localHeaderTable);
// Mine new FP tree
startMining(localHeaderTable,newCodeSofar);
}
}
}

/* Generarte support for header table single item */

/** Counts support for single attributes in header table by following node
links.
@param nodeLink the start link from the header table.
@return the support valye for the item set indicated by the header table. */

private int genSupHeadTabItem(FPgrowthItemPrefixSubtreeNode nodeLink) {
int counter = 0;

// Loop

while(nodeLink != null) {
counter = counter+nodeLink.itemCount;
nodeLink = nodeLink.nodeLink;
}

// Return
return(counter);
}

/** Generates ancestor itemSets are made up of the parent nodes of a given
node. This method collects such itemSets and stores them in a linked list
pointed at by startTempSets.
@param ref the reference to the current node in the prefix tree containing
itemsets together with support values.*/

private void generateAncestorCodes(FPgrowthItemPrefixSubtreeNode ref) {
short[] ancestorCode = null;
int support;

// Loop

while(ref != null) {
support = ref.itemCount;
ancestorCode = getAncestorCode(ref.parentRef);
// Add to linked list with current support
if (ancestorCode != null) startTempSets =
new FPgrowthSupportedSets(ancestorCode,support,
startTempSets);
// Next ref
ref = ref.nodeLink;
}
}

/** Generate the ancestor itemSet from a given node.
@param ref the reference to the current node in the prefix tree containing
itemsets together with support values. */

private short[] getAncestorCode(FPgrowthItemPrefixSubtreeNode ref) {
short[] itemSet = null;
if (ref == null) return(null);
// Else process
while (ref != null) {
itemSet = realloc2(itemSet,ref.itemName);
ref = ref.parentRef;
}

// Return
return(itemSet);
}

/** Removes elements in ancestor itemSets (pointed at by
startTempSets ) which are not supported by referring to count
array (which contains all the current supported 1 itemsets).
@param countArray the array of FPgrowthColumnCounts structures
describing the single item sets (in terms of labels and associated
support), contained in a linked list of FPgrowthSupportedSets
which in turn describe the ancestor nodes in an FP-tree that preceed the
nodes identified by following a trail of links from a particular item in
the header table. */

private void pruneAncestorCodes(FPgrowthColumnCounts[] countArray) {
FPgrowthSupportedSets ref = startTempSets;

// Loop through linked list of ancestor paths

while(ref != null) {
for(int index=0;index if (countArray[ref.itemSet[index]].support < minSupport)
ref.itemSet = removeElementN(ref.itemSet,index);
}
ref = ref.nodeLink;
}
}

/** Counts frequent 1 item sets in ancestor itemSets linked list and place
into an array.
@return array of FPgrowthColumnCounts structures describing the
single item sets (in terms of labels and associated support), contained in
a linked list of FPgrowthSupportedSets which in turn describe the
ancestor nodes in an FP-tree that preceed the nodes identified by following
a trail of links from a particular item in the header table. */

private FPgrowthColumnCounts[] countFPgrowthSingles() {
int index, place=0;
FPgrowthSupportedSets nodeLink = startTempSets; // Start of linked list

// Dimension array, assume all attributes present, then it will
// be possible to index in to the array.

FPgrowthColumnCounts[] countArray = new
FPgrowthColumnCounts[numOneItemSets+1];
// Initialise array
for (index=1;index new FPgrowthColumnCounts(index);

// Loop through linked list of ancestor itemSets

while (nodeLink != null) {
// Loop through itemSet
for (index=0;index place = nodeLink.itemSet[index];
countArray[place].support = countArray[place].support +
nodeLink.support;
}
nodeLink = nodeLink.nodeLink;
}

// Return
return(countArray);
}

/* Create local header table */

/** Creates a local header table comprising those item that are supported
in the count array.
@param countArray the support for the 1 item sets.
@return a FPgrowth header table. */

private FPgrowthHeaderTable[]
createLocalHeaderTable(FPgrowthColumnCounts[] countArray) {
int index;
FPgrowthHeaderTable[] localHeaderTable;

localHeaderTable = localHeadTabUnordered(countArray);

// Order according single item support

//orderLocalHeaderTable(localHeaderTable,countArray);

// Return

return(localHeaderTable);
}

/* Create new local header table */

/** Create a new local header table, but unorderd.
@param countArray the csupport for the 1 item sets.
@return a FPgrpwth header table. */

private FPgrowthHeaderTable[]
localHeadTabUnordered(FPgrowthColumnCounts[] countArray) {
int counter = 1;

// Loop through array and count supported one item sets
for (int index=1;index if (countArray[index].support >= minSupport) counter++;
}

// Build new Header Table array containing only supported items

if (counter == 1) return(null);
FPgrowthHeaderTable[] localHeaderTable =
new FPgrowthHeaderTable[counter];

// Populate header table

int place=1;
for (int index=1;index if (countArray[index].support >= minSupport) {
localHeaderTable[place] = new
FPgrowthHeaderTable((short) countArray[index].columnNum);
place++;
}
}

// Return

return(localHeaderTable);
}

/* Order local header table */

/** Orders local header table (currently unused).
@param localHeaderTable the FPgrpwth header table to be ordered.
@param countArray the csupport for the 1 item sets. */

private void orderLocalHeaderTable(FPgrowthHeaderTable[] localHeaderTable,
FPgrowthColumnCounts[] countArray) {
boolean isOrdered;
FPgrowthHeaderTable temp;
int index, place1, place2;

//loop through table
do {
index = 1;
isOrdered=true;
while (index < (localHeaderTable.length-1)) {
place1 = localHeaderTable[index].itemName;
place2 = localHeaderTable[index+1].itemName;
if (countArray[place1].support > countArray[place2].support) {
isOrdered=false;
// Swap
temp = localHeaderTable[index];
localHeaderTable[index] = localHeaderTable[index+1];
localHeaderTable[index+1] = temp;
}
// increment index
index++;
}
} while (isOrdered==false);
}

/** Generates a local FP tree
@param tableRef reference to start of header table containing links to
an FP-tree produced during the FP-tree generation process.
@rerurn reference to the start of the generated FP-tree*/

private FPtreeNode generateLocalFPtree(FPgrowthHeaderTable[] tableRef) {
FPgrowthSupportedSets ref = startTempSets;
FPtreeNode localRoot = new FPtreeNode();

// Loop

while(ref != null) {
// Add to conditional FP tree
if (ref.itemSet != null) addToFPtree(localRoot,0,ref.itemSet,
ref.support,tableRef);
ref = ref.nodeLink;
}

// Return

return(localRoot);
}

/** Resizes the given array of FP-tree nodes so that its length is
increased by one element and new element inserted.
@param oldArray the given array of FP-tree nodes.
@param newNode the given node to be added to the FP-tree
@return The revised array of FP-tree nodes. */

private FPtreeNode[] reallocFPtreeChildRefs(FPtreeNode[] oldArray,
FPtreeNode newNode) {

// No old array

if (oldArray == null) {
FPtreeNode[] newArray = {newNode};
tempIndex = 0;
return(newArray);
}

// Otherwise create new array with length one greater than old array

int oldArrayLength = oldArray.length;
FPtreeNode[] newArray = new FPtreeNode[oldArrayLength+1];

// Insert new node in correct order.

for (int index1=0;index1 < oldArrayLength;index1++) {
if (newNode.node.itemName < oldArray[index1].node.itemName) {
newArray[index1] = newNode;
for (int index2=index1;index2 newArray[index2+1] = oldArray[index2];
tempIndex = index1;
return(newArray);
}
newArray[index1] = oldArray[index1];
}

// Default

newArray[oldArrayLength] = newNode;
tempIndex = oldArrayLength;
return(newArray);
}

/** Commences process of outputting the prefix sub tree to the screen,
starting at header table. */

public void outputItemPrefixSubtree() {
int flag;
System.out.println("PREFIX SUBTREE FROM HEADER TABLE");
for(int index=1;index System.out.println("Header = " +
reconvertItem(headerTable[index].itemName));
flag = outputItemPrefixTree(headerTable[index].nodeLink);
if (flag!=1) System.out.println();
}
System.out.println();
}

/** Commences process of outputting a local prefix sub tree to the screen.
@param tableRef the reference to the local header table. */

private void outputItemPrefixSubtree(FPgrowthHeaderTable[] tableRef) {
int flag;
System.out.println("PREFIX SUBTREE FROM LOCAL HEADER TABLE");
for(int index=1;index System.out.println("Header = " +
reconvertItem(tableRef[index].itemName));
flag = outputItemPrefixTree(tableRef[index].nodeLink);
if (flag!=1) System.out.println();
}
System.out.println();
}

/** Outputs the given prefix sub tree.
@param ref the reference to the given branch.
@return a counter representing the current "node number" (used in
output). */

private int outputItemPrefixTree(FPgrowthItemPrefixSubtreeNode ref) {
int counter = 1;

// Loop

while (ref != null) {
System.out.print("(" + counter + ") " +
(reconvertItem(ref.itemName)) + ":" + ref.itemCount + " ");
counter++;
ref = ref.nodeLink;
}

return(counter);
}

/** Commences process of outputting FP-tree to screen. */

public void outputFPtree() {
System.out.println("FP TREE");
outputFPtreeNode1();
System.out.println();
}

/** Commences process of outputting a given branch of an FP-tree to the
screen.
@param ref the reference to the given FP-tree branch. */

private void outputFPtreeNode(FPtreeNode ref) {
System.out.println("LOCAL FP TREE");
outputFPtreeNode2(ref.childRefs,"");
System.out.println();
}

/** Continues process of outputting FP-tree to screen. */

private void outputFPtreeNode1() {
outputFPtreeNode2(rootNode.childRefs,"");
}

/** Outputs a given level in an FP-tree to the screen.
@param ref the reference to the given FP-tree level.
@param nodeID the root string for the node ID. */

private void outputFPtreeNode2(FPtreeNode ref[],String nodeID) {
if (ref == null) return;

// Otherwise process

for (int index=0;index System.out.print("(" + nodeID + (index+1) + ") ");
outputItemPrefixSubtreeNode(ref[index].node);
outputFPtreeNode2(ref[index].childRefs,nodeID+(index+1)+".");
}
}
/** Outputs the given prefix sub tree node.
@param ref the reference to the given node. */

public void outputItemPrefixSubtreeNode(FPgrowthItemPrefixSubtreeNode ref) {
System.out.print((reconvertItem(ref.itemName)) + ":" + ref.itemCount);
if (ref.nodeLink != null) {
System.out.println(" (ref to " +
(reconvertItem(ref.nodeLink.itemName)) + ":" +
ref.nodeLink.itemCount + ")");
}
else System.out.println(" (ref to null)");
}
}

Ttreenode.java

import java.io.*;
import java.util.*;

/** Methods concerned with Ttree node structure. Arrays of these structures
are used to store nodes at the same level in any sub-branch of the T-tree. */

public class TtreeNode {

/** The support associate with the itemset represented by the node. */
public int support = 0;

/** A reference variable to the child (if any) of the node. */
public TtreeNode[] childRef = null;

/** The number of nodes in the T-tree. */
public static int numberOfNodes = 0;

public TtreeNode() {
numberOfNodes++;
}
/** One argument constructor.
@param sup the support value to be included in the structure. */
public TtreeNode(int sup) {
support = sup;
numberOfNodes++;
}

public static int getNumberOfNodes() {
return(numberOfNodes);
}
}