<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress.com" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>

<channel>
	<title>google-pr &amp;laquo; WordPress.com Tag Feed</title>
	<link>http://en.wordpress.com/tag/google-pr/</link>
	<description>Feed of posts on WordPress.com tagged "google-pr"</description>
	<pubDate>Wed, 02 Dec 2009 08:30:32 +0000</pubDate>

	<generator>http://en.wordpress.com/tags/</generator>
	<language>en</language>

<item>
<title><![CDATA[Backlink gratis ? Ini dia 200 lebih daftar situs dan blog dofollow.]]></title>
<link>http://sekoteng.wordpress.com/2009/11/26/butuh-backlink-ini-dia-200-lebih-daftar-situs-dan-blog-dofollow/</link>
<pubDate>Thu, 26 Nov 2009 09:01:16 +0000</pubDate>
<dc:creator>sekoteng</dc:creator>
<guid>http://sekoteng.wordpress.com/2009/11/26/butuh-backlink-ini-dia-200-lebih-daftar-situs-dan-blog-dofollow/</guid>
<description><![CDATA[Backlink adalah yang paling diburu oleh para blogger dan webmaster karena backlink menentukan page r]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Backlink adalah yang paling diburu oleh para blogger dan webmaster karena backlink menentukan page rank situs atau blog kita. Dengan PR yang tinggi berarti ada harapan traffic yang tinggi pula. Nah tentunya untuk mendapatkan backlink dengan cara yang paling mudah adalah dengan cara meninggalkan komentar di blog atau situs blog yang menerapkan dofollow. <strong>Ini dia 200 lebih daftar situs dan blog dofollow</strong></p>
<p>1 http://dir.yahoo.com/<br />
2 http://www.dmoz.org 9<br />
3 http://www.stpt.com/ 8<br />
4 http://www.lii.org/pub/htdocs/home.htm 8<br />
5 http://yahooligans.yahoo.com/ 8<br />
6 http://www.blogwise.com/ 8<br />
7 http://www.open-site.org 8<br />
8 http://www.bloggernity.com 7<br />
9 http://www.podcastzoom.com/ 7<br />
10 http://www.blogrankings.com 7<br />
11 http://www.bloguniverse.com 7<br />
12 http://www.femina.com 7<br />
13 http://www.gogreece.com 7<br />
14 http://www.lanic.utexas.edu 7<br />
15 http://www.polishworld.com 7<br />
16 http://www.nationaldirectory.com/ 7<br />
17 http://www.sacentral.sa.gov.au/site/page.cfm 7<br />
18 http://www.worldhot.com/ 7<br />
19 http://www.123india.com/ 7<br />
20 http://www.kinderstart.com 7<br />
21 http://www.portal.eatonweb.com 7<br />
22 http://businessweek.directorym.com 7<br />
23 http://www.elib.org/ 7<br />
24 http://www.ezilon.com/ 6<br />
25 http://www.yourwebloghere.com 6<br />
26 http://www.epooch.com/ 6<br />
27 http://www.christiansunite.com/ 6<br />
28 http://www.toronto1.biz/ 6<br />
29 http://www.vxbox.com/ 6<br />
30 http://www.canadianeh.com 6<br />
31 http://www.aardvark.co.za 6<br />
32 http://www.nzs.com/ 6<br />
33 http://www.aigam.com 6<br />
34 http://linkcentre.com 6<br />
35 http://www.info-listings.com/ 6<br />
36 http://www.zensearch.com/ 6<br />
37 http://www.bluedir.com/ 6<br />
38 http://www.imegamall.com/ 6<br />
39 http://payvand.com/yp/ 6<br />
40 http://www.globalgateway.com/ 6<br />
41 http://www.canlinks.net/ 6<br />
42 http://www.albanywebsites.com 6<br />
43 http://searchsight.com/ 6<br />
44 http://www.siteranking.com/ 6<br />
45 http://findingblog.com/ 6<br />
46 http://link-ads.com/ 6<br />
47 http://www.directoryforce.com/ 6<br />
48 http://www.gimpsy.com 6<br />
49 http://www.iguide.co.il/ 6<br />
50 http://www.webworldindex.com 6<br />
51 http://www.canadopedia.com/ 6<br />
52 http://indiafocus.indiainfo.com/ 6<br />
53 http://www.americasbest.com/ 6<br />
54 http://www.great-british-pages.co.uk/ 6<br />
55 http://www.somuch.com/ 6<br />
56 http://www.illumirate.com/ 5<br />
57 http://www.christianlinks.com/ 5<br />
58 http://www.click2directory.com 5<br />
59 http://www.axelis.com/ 5<br />
60 http://www.eurofind.biz 5<br />
61 http://www.abilogic.com 5<br />
62 http://www.gandalfdir.com/ 5<br />
63 http://www.josh.nu 5<br />
64 http://www.linketeria.com/ 5<br />
65 http://www.londinium.com 5<br />
66 http://www.jamjaa.com/ 5<br />
67 http://www.megri.com/ 5<br />
68 http://www.mavicanet.com/directory/eng/ 5<br />
69 http://www.poddys.com/ 5<br />
70 http://www.pedsters-planet.co.uk/ 5<br />
71 http://directory.portalit.net/ 5<br />
72 http://www.tsection.com/ 5<br />
73 http://www.addurl-free.com/ 5<br />
74 http://www.worldsbiggestdirectory.com/ 5<br />
75 http://www.777media.com/ 5<br />
76 http://www.buzznick.com/ 5<br />
77 http://www.directory.ldmstudio.com 5<br />
78 http://www.evenseek.com 5<br />
79 http://www.forage.in 5<br />
80 http://www.global-weblinks.com/ 5<br />
81 http://www.network-room.com/links/ 5<br />
82 http://www.rdirectory.net 5<br />
83 http://search.able2know.com/ 5<br />
84 http://www.siteinclusion.com/ 5<br />
85 http://www.mddccommunity.com/ 5<br />
86 http://slsites.com/ 5<br />
87 http://www.finditireland.com/ 5<br />
88 http://www.dirdir.info/ 5<br />
89 http://www.my-kerala.com/ 5<br />
90 http://www.a-free-directory.info/ 5<br />
91 http://www.webdirectory-submit.com/ 5<br />
92 http://www.my-india.net/ 5<br />
93 http://www.dramba.com/ 5<br />
94 http://www.worthwhilelink.com/ 5<br />
95 http://allfreethings.com/ 5<br />
96 http://www.eu-directweb.com/ 5<br />
97 http://directory.lonelyway.com/ 5<br />
98 http://www.uk-web-index.co.uk/ 5<br />
99 http://www.infignos.com/ 5<br />
100 http://www.singaporesearchengine.com/ 5<br />
101 http://searchwarp.com 5<br />
102 http://www.zeezo.com/ 5<br />
103 http://sonicquest.com/ 5<br />
104 http://www.aryawat.com/ 5<br />
105 http://www.skoobe.biz/ 5<br />
106 http://www.busybits.com/ 5<br />
107 http://www.unifieddirectory.com 5<br />
108 http://dir.ukwizz.com 5<br />
109 http://www.top5jamaica.com/ 5<br />
110 http://www.thetopsites.net/ 5<br />
111 http://www.trycanada.com/ 5<br />
112 http://www.allshops.com/ 5<br />
113 http://www.anyapex.com/ 5<br />
114 http://www.jtrotta.com/ 5<br />
115 http://www.indiabook.com/ 5<br />
116 http://www.resourcehelp.com/ 5<br />
117 http://www.pleaseretrieve.com/ 5<br />
118 http://www.moldova.com/ 5<br />
119 http://www.annasinkovska.com/fashion-directory/ 5<br />
120 http://www.infotiger.com 5<br />
121 http://www.christianwebsite.com/search 5<br />
122 http://www.lybot.com 5<br />
123 http://www.4ppl.com/directory 5<br />
124 http://www.directorylist.org/ 5<br />
125 http://www.spotjockey.co.uk/ 5<br />
126 http://www.turnpike.net/ 5<br />
127 http://www.searchtheweb.com 5<br />
128 http://www.typicallyspanish.com/html/english/ 5<br />
129 http://www.aha.co.za/ 5<br />
130 http://www.zielony.pl/ 5<br />
131 http://www.amray.com/ 5<br />
132 http://www.best-websites.net/ 5<br />
133 http://en.wedoo.com/ 5<br />
134 http://www.url.biz 5<br />
135 http://www.downunderindex.com/ 5<br />
136 http://www.dxpnet.com/riot/ 5<br />
137 http://www.data-spain.com/ 5<br />
138 http://directory.bizhat.com/ 5<br />
139 http://www.burf.com 5<br />
140 http://www.landoflinks.com/ 5<br />
141 http://www.hedir.com/ 5<br />
142 http://www.submiturlhere.com/ 5<br />
143 http://www.worldsiteindex.com/ 5<br />
144 http://www.dhundo.com/ 5<br />
145 http://www.infovisual.info/directory/index.php 5<br />
146 http://www.hotlaunch.com 4<br />
147 http://www.add-link.info/ 4<br />
148 http://www.am-directory.com/ 4<br />
149 http://www.apexoo.com/directory/ 4<br />
150 http://www.abifind.com 4<br />
151 http://www.adverts.gr/grsearch/pages/ 4<br />
152 http://www.businesscatalogonline.com/ 4<br />
153 http://www.buildturkey.com 4<br />
154 http://www.biblestudynotes.org/links/ 4<br />
155 http://buycanuck.com/ 4<br />
156 http://www.bugsdirectory.com 4<br />
157 http://blue.daffodil.uk.com/directory/ 4<br />
158 http://www.clasione.com/ 4<br />
159 http://www.directory-free.com/ 4<br />
160 http://www.directoryon.info/ 4<br />
161 http://www.directorystorm.com/ 4<br />
162 http://www.findwhatwhere.info/ 4<br />
163 http://www.directorydelux.com/ 4<br />
164 http://www.englandsportal.com 4<br />
165 http://www.exoode.com/directory/ 4<br />
166 http://www.floridadirectory.biz 4<br />
167 http://www.friendlycanadian.com/search/ 4<br />
168 http://www.fxdir.com/ 4<br />
169 http://www.ir8.net/ 4<br />
170 http://www.iconcave.com/partners/ 4<br />
171 http://www.indexrated.com/ 4<br />
172 http://www.look4business.org/ 4<br />
173 http://www.listmyniche.com 4<br />
174 http://www.linkengine.com 4<br />
175 http://www.nintra.com/directory/index.pl 4<br />
176 http://www.openhere.com/ 4<br />
177 http://www.orangefish-directory.co.uk 4<br />
178 http://www.robolink.co.uk 4<br />
179 http://red-links.com/ 4<br />
180 http://www.redjuniper.com/ 4<br />
181 http://www.rndirectory.com 4<br />
182 http://www.seekabove.com/ 4<br />
183 http://www.searchmaryland.com 4<br />
184 http://www.simpledir.com/ 4<br />
185 http://www.spheri.com/ 4<br />
186 http://www.sgtsearch.com/ 4<br />
187 http://www.ShopShootah.com 4<br />
188 http://www.thames-valley-business.co.uk 4<br />
189 http://www.thesearchbrain.co.uk 4<br />
190 http://www.thelocalweb.net 4<br />
191 http://www.wura.co.uk/ 4<br />
192 http://www.uudir.com/ 4<br />
193 http://www.UKbest50.co.uk 4<br />
194 http://www.urlshack.com 4<br />
195 http://www.velendi.com/ 4<br />
196 http://www.web-central.info 4<br />
197 http://www.worldwidedirectory.org/ 4<br />
198 http://www.wholeworld.com 4<br />
199 http://www.weblinkdirectory.net/ 4<br />
200 http://www.wahlinks.com/ 4<br />
201 http://heiseidemocracy.com PR /5<br />
202 http://blogs.speech-writers.com/4<br />
203 http://www.wordpressmax.com/3<br />
204 http://www.rosshetherington.com/3<br />
205 http://www.howtospoter.com/3<br />
206 http://www.dollarsblog.com/3<br />
207 http://www.fabiozanet.com/3<br />
208 http://www.blogsthatfollow.com/3<br />
209 http://recipes.kaboose.com /6<br />
210 http://black20.com /6<br />
211 http://www.uncaged.com /5<br />
212 http://www.dikti.go.id /7<br />
213 http://www.Therss.net (PR 3)<br />
214 http://www.Abdulkamil.com (PR 3)<br />
215 http://www.Kerjakeras.com (PR 3)<br />
216 http://www.Benlahmen.com (PR 3)<br />
217 http://www.Realish.net (PR 1)<br />
218 http://www.Bamznyubi.co.cc (PR 3)<br />
217 http://www.Blogguebo.com (PR 4)<br />
218 http://www.ruanghati.com (PR 6)<br />
219 http://dag.wieers.com PR6<br />
220 http://www.bumpzee.com PR6</p>
<p>WordPress:<br />
http://chikastuff.wordpress.com /5<br />
http://asruldinazis.wordpress.com /5<br />
http://fertobhades.wordpress.com /5<br />
http://mumtazanas.wordpress.com /5<br />
http://www.yepiye.wordprees.com /5<br />
http://edratna.wordpress.com /5<br />
http://rahard.wordpress.com/6<br />
http://rovicky.wordpress.com/5<br />
http://caping.wordpress.com/5<br />
http://priandoyo.wordpress.com/5</p>
<p>Blogger:<br />
http://www.Ristizona.blogspot.com (PR 3)<br />
http://www.Pabriktea.blogspot.com (PR 3)<br />
http://www.Endarfitrianto.blogspot.com (PR 4)<br />
http://www.Dhuwuh.blogspot.com (PR 4)<br />
http://www.inicuma.blogspot.com (PR 4)<br />
http://www.Jovieblog.blogspot.com (PR 4)<br />
http://Endarfitrianto.blogspot.com /4</p>
<p><strong>Ini dia 200 lebih daftar situs dan blog dofollow</strong>, mungkin link2 diatas tidak update dan ada broken link-nya atau PR-nya turun <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> , tapi lumayan buat referensi yooo&#8230;</p>
<div id="attachment_449" class="wp-caption alignleft" style="width: 160px"><a href="http://sekoteng.wordpress.com/files/2009/11/google-pagerank.png"><img class="size-thumbnail wp-image-449" title="google-pagerank" src="http://sekoteng.wordpress.com/files/2009/11/google-pagerank.png?w=150" alt="Ini dia 200 lebih daftar situs dan blog dofollow." width="150" height="66" /></a><p class="wp-caption-text">google pagerank</p></div>
<p>&#160;</p>
<p>&#160;</p>
<p>&#160;</p>
<p>&#160;</p>
<p>Source: Internet.</p>
<p>image: google image search</p>
<p>Tulisan terkait:</p>
<p><a href="http://sekoteng.wordpress.com/2009/09/02/goolge-pr-website-menjadi-nakenapa/">goolge-pr-website-menjadi-nakenapa</a></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Page Rank 2]]></title>
<link>http://blog.conscendo.de/2009/11/02/page-rank-2/</link>
<pubDate>Mon, 02 Nov 2009 13:35:06 +0000</pubDate>
<dc:creator>swenseo</dc:creator>
<guid>http://blog.conscendo.de/2009/11/02/page-rank-2/</guid>
<description><![CDATA[Offfensichtlich hat google schon vor Weihnachten ein paar Geschenke verteilt. Gleich 2 unserer Kunde]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Offfensichtlich hat google schon vor Weihnachten ein paar Geschenke verteilt. Gleich 2 unserer Kunden sind im Page Rank ein gutes Stück nach vorne gekommen. Auch unsere corporate site: <a href="http://conscendo.de/">www.conscendo.de</a> ist von Page Rank 1 auf PR 2 gestiegen!</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Best  Google PR update.....]]></title>
<link>http://babudeepan.com/2009/10/30/best-google-pr-update/</link>
<pubDate>Fri, 30 Oct 2009 05:59:54 +0000</pubDate>
<dc:creator>babudeepan</dc:creator>
<guid>http://babudeepan.com/2009/10/30/best-google-pr-update/</guid>
<description><![CDATA[Hi webmasters, i have been blogging since 2008 july but i have never experienced like this update. I]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Hi webmasters, i have been blogging since 2008 july but i have never experienced like this update. I have many own domains and i got good google PR this update. Some remain constant and many have increased in PR. Many of my friends got good update this time. Going to enjoy this great day. </p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Google PR – PageRank FAQs]]></title>
<link>http://kerryfreeseotips.wordpress.com/2009/09/09/google-pr-%e2%80%93-pagerank-faqs/</link>
<pubDate>Wed, 09 Sep 2009 12:07:10 +0000</pubDate>
<dc:creator>kerrylbseo</dc:creator>
<guid>http://kerryfreeseotips.wordpress.com/2009/09/09/google-pr-%e2%80%93-pagerank-faqs/</guid>
<description><![CDATA[There acquire to be a lot of questions about WW that beforehand some bodies aren’t acclimatized with]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>There acquire to be a lot of questions about WW that beforehand some bodies aren’t acclimatized with PR and how it works. I’ve put this cilia calm in an beforehand to acceptance questions that would save new assembly advertisement basal PR questions. Accomplishment it’s advantageous to them.</p>
<p>What is Page Rank (PR)?</p>
<p>This is Google’s take:</p>
<p>PageRank relies on the abnormally free attributes of the web by appliance its all-embracing hotlink assay as an indicator of an abandoned page’s value. In essence, Google interprets a hotlink from page A to page B as a vote, by page A, for page B. But, Google looks at added than the backbreaking accumulated of votes, or links a page receives; it aswell analyzes the page that casts the vote. Votes casting by pages that are themselves “important” amend added heavily and admonition to achieve added pages “important.</p>
<p>More…</p>
<p>How can I assay my PR?</p>
<p>If you install the Google Toolbar (available here) you will see a blooming indicator in your Internet Explorer toolbar bold you the PR of the page. Hovering over the blooming bar will accordance you a accumulated which is the page’s PR. If you don’t acquire the toolbar you can still assay an abandoned page’s PR appliance abounding accoutrement on the internet. There are aswell toolbars for Firefox users, like this example.</p>
<p>How does page rank affect your advertisement in SERPs (Search Engine Aftereffect Pages)?</p>
<p>It doesn’t. [*see calendar at bottom] There was a time if academy page rank pages were added adequate to amore avant-garde of lower PR pages but that is not the case anymore as a few seaches will demonstrate. There are a lot of added factors that affect breadth your page is displayed in the results. Google states that it does not acclamation webmasters bargain links to acceptance their PR. Google sees that as aggravating to “game” their seek engine. It is about acclimatized that exchanging/buying links actually for PR is a adulteration of time (and, in fact, can acquire adverse effects).</p>
<p>What adverse accoutrement will I face for diplomacy PR?</p>
<p>Sites with academy PR about achieve money by diplomacy links on their top PR pages. If Google is acquainted that they are diplomacy PR rather than just diplomacy ad amplitude (don’t ask me how Google can accustom the abnormality or if, indeed, they can) Google may penalise both the abettor and buyer. This can crop the assay of blurred breadth you appear in the after-effects but may not necessarily aftereffect in a abatement of the PR you see in the toolbar.</p>
<p>I’d still like to beforehand the Page Rank of my site?</p>
<p>First, sites don’t acquire PR, pages do. That’s why it’s attainable for an centralized page to acquire a academy PR than the home page. The way a page gets PR is from links to it and that’s the abandoned way of ambulatory PR. IBLs (incoming backlinks) from top PR pages can accordance you added PR than links from low PR pages. There is one added bureau at play. The PR they “give” is beforehand over the accumulated of attainable links on the pages. You may get added PR annual from a PR3 page with abandoned two outbound links than a PR7 page with hundreds of outbound links.</p>
<p>What links do I allegation to get to crop my homepage to PR6</p>
<p>There isn’t a quick acceptance to that. One hotlink from a adequate PR7 page (or actually a top PR6 page) could accordance you a PR6. OTOH, you may allegation hundreds of links from PR3 and 4 pages to get to a PR6. By the above admeasurement a hotlink from a PR3 page that afterwards rises to a PR7 will dispatch in accumulated as the “giving” page’s PR keeps improving.</p>
<p>I’ve added a lot of IBLs but I don’t see my PR changing/my PR has dropped</p>
<p>There are several affirmation why you may not be seeing the result. First, a PR5 ranges all the way from a PR5.00001 to a PR5.99999. You could acquire bigger from a 5.0 to a 5.9 and you’ll acquire no way of animate it from the PR toolbar. Second, the accumulated of a PR5 itself could acquire changed. So, even if you were on a PR5.9, added a lot in IBLs, and still didn’t achieve it to a 6.0 it could be because the arrangement has afflicted and, acceptance you are still at 5.9 the 5.9 is added admired than it was before. Third, the accumulated of the pages that are band to you would acquire adequate afflicted themselves so the PR they are giving you allegedly changed.</p>
<p>How about does the PR change?</p>
<p>This could adapt widely. It may be a ages or six months afore Google adapt the PR above all the pages they’ve indexed. One activity you can be constant off: If Google revises PR there’ll be at diminutive one cilia accomplishment about it. <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>Will they accustom me if they adapt PR?</p>
<p>No.</p>
<p>Help, I’ve absent all PR!</p>
<p>Before agitation sets in assay whether you are banausic barred or white barred. If the toolbar shows white for the page it’s not been barred and your PR will allegedly appear back. Calendar aswell that Google sees http://www.example.com/widget.htm, http://www.example.com/widget.html, and http://example.com/widget.htm as three adapted pages. If you acquire links advancing to all three afresh your acceptance PR is accepting accumulated by those three pages.</p>
<p>Why is my PR added in the Google calendar than it is on the toolbar?</p>
<p>The Google calendar uses a adapted arrangement to the toolbar.</p>
<p>It was simple to get from a PR4 to a PR5 but it’s demography abounding best to get to a PR6, why’s that?</p>
<p>The PR arrangement is not linear, it’s logarithmic i.e. melancholia from a PR9 to a PR10 achieve accessory like a one point acceptance and crave the above accumulated of ability as traveling from PR1 to PR2 but that’s not the case. It is accoutrements of times added difficult. The exact log arrangement acclimated is conflicting but there has been acceptance accomplishment that it could be about “5″.</p>
<p>How can I blot PR on my website and ahead it from traveling to added sites?</p>
<p>There are different agency bodies try to “horde” PR. They use javascript or a cgi if they are band to alfresco pages in the accomplishment that Google won’t see these as links and appropriately not crop any PR away from the site. That is misguided. As a absorption of accustomed seek after-effects actualization pages that appear top in the after-effects sometimes acquire a lot of attainable links and are ranked top in SERPs because of that. So, yes, it may beforehand your PR if you shield/mask attainable links but that will adequate be at the aggregate of blow you some Google traffic.</p>
<p>If PR is about bootless from the point of actualization of Google cartage afresh why did you built-in on for so connected and covering all those point?</p>
<p>PR still has accumulated to some. Bodies diplomacy sites may get a academy aggregate as not all buyers realise that PR has absolute little value. Webmasters diplomacy altercation links on their sites can get added money for the ads they sell. There are added such uses for academy PR. For example, it is believed that sites with academy PR pages get indexed added often.</p>
<p>So if PR doesn’t activate how I rank afresh what does?</p>
<p>That’s the amateur dollar question. <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  Nobody knows for constant except Google themselves. But if you blot abounding time browsing accomplishment – and description the blubbering – you may get a bigger absorption of what works and what doesn’t.</p>
<p>Any added questions we should acquire here?</p>
<p>&#60; Note: this authentic affirmation has authentic to be an beautification of the</p>
<p>real situation. PR does affect ranking, but it is abandoned one of abounding factors.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[আমার Google PR3 কি হওয়া উচিত?]]></title>
<link>http://akashprodip.wordpress.com/2009/09/05/google-pagerank-pr3/</link>
<pubDate>Sat, 05 Sep 2009 07:39:22 +0000</pubDate>
<dc:creator>Florence Ria</dc:creator>
<guid>http://akashprodip.wordpress.com/2009/09/05/google-pagerank-pr3/</guid>
<description><![CDATA[বুঝলাম না কিকরেই বা এটা হলো! অনেকদিন পরে ব্লগে আসলাম, টুকিটাকি এটা সেটা ঘঁটাঘাঁটি করতে গিয়ে দেখি অত্]]></description>
<content:encoded><![CDATA[বুঝলাম না কিকরেই বা এটা হলো! অনেকদিন পরে ব্লগে আসলাম, টুকিটাকি এটা সেটা ঘঁটাঘাঁটি করতে গিয়ে দেখি অত্]]></content:encoded>
</item>
<item>
<title><![CDATA[SEO Tips # 58 - Confused about Google Page Rank?]]></title>
<link>http://abdulmalick.wordpress.com/2009/08/18/seo-tips-58-confused-about-google-page-rank/</link>
<pubDate>Tue, 18 Aug 2009 07:05:12 +0000</pubDate>
<dc:creator>abdulmalick</dc:creator>
<guid>http://abdulmalick.wordpress.com/2009/08/18/seo-tips-58-confused-about-google-page-rank/</guid>
<description><![CDATA[Are you confused about Google Page Rank? Let&#8217;s talk about it over the next couple of days. Tip]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Are you confused about Google Page Rank? Let&#8217;s talk about it over<br />
the next couple of days.</p>
<p>Tip: Did you know that Google Page Rank is only one small influence<br />
to relevancy?</p>
<p>Hint: Don&#8217;t get obsessed with trying to achieve a high page rank value.<br />
Instead focus on building true visibility. Google PR and actual<br />
visibility in the rankings are not the same thing.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Google Pagerank update]]></title>
<link>http://stefferson.wordpress.com/2009/08/17/google-pagerank-update-2009/</link>
<pubDate>Mon, 17 Aug 2009 09:19:00 +0000</pubDate>
<dc:creator>stefferson</dc:creator>
<guid>http://stefferson.wordpress.com/2009/08/17/google-pagerank-update-2009/</guid>
<description><![CDATA[Next Google Pagerank update 2009? 1-15 November 2009 Recent Google Pagerank Update: 29 July 2009 23-]]></description>
<content:encoded><![CDATA[Next Google Pagerank update 2009? 1-15 November 2009 Recent Google Pagerank Update: 29 July 2009 23-]]></content:encoded>
</item>
<item>
<title><![CDATA[... de ce a anunţat Google că dezvoltă Chrome OS înainte de a termina softul respectiv.]]></title>
<link>http://amaflatazi.wordpress.com/2009/07/09/de-ce-a-anuntat-google-ca-dezvolta-chrome-os-inainte-de-a-termina-softul-respectiv/</link>
<pubDate>Thu, 09 Jul 2009 22:02:49 +0000</pubDate>
<dc:creator>Victor</dc:creator>
<guid>http://amaflatazi.wordpress.com/2009/07/09/de-ce-a-anuntat-google-ca-dezvolta-chrome-os-inainte-de-a-termina-softul-respectiv/</guid>
<description><![CDATA[Pentru că luni Microsoft urmează să anunţe că Office va avea şi o componentă online, la fel ca Googl]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Pentru că luni Microsoft urmează să anunţe că Office va avea şi o componentă <a href="http://workspace.officelive.com/en-us/">online</a>, la fel ca Google Docs.</p>
<p>Adică vom putea să partajăm documente şi să lucrăm mai eficient direct din Office.</p>
<p>Google se pare că s-a grăbit cu anunţul pentru a mai &#8220;<a href="http://workspace.officelive.com/en-us/">fura</a>&#8221; din atenţia acordată Microsoft.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Google Page Rank]]></title>
<link>http://shopbillishirts.wordpress.com/2009/07/04/google-page-rank/</link>
<pubDate>Sat, 04 Jul 2009 00:45:58 +0000</pubDate>
<dc:creator>shopbillishirts</dc:creator>
<guid>http://shopbillishirts.wordpress.com/2009/07/04/google-page-rank/</guid>
<description><![CDATA[How important is it really? I have noticed that my tshirt site now has a page ranking of 3 up from 2]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>How important is it really? I have noticed that my tshirt site now has a page ranking of 3 up from 2 last month. For some reason this blog which dosen&#8217;t get a lot of external activity has a PR of 1.. does it carry any clout? I guess we will find out! I think the reason that I have gotten a PR3 just because of my reciprocal links with other websites through sites like linkpartners.com.</p>
<p>Last month we made just under $70 and hopefully we will beat that for July. So far we&#8217;ve started out pretty slow with a sole sale from zazzle and nothing yet from CP. I&#8217;m not fretting though because there&#8217;s still a lot of the month left. I have also tried raising my markup slightly since it was mentioned that perhaps my prices were a little too low.  Customer&#8217;s want value, and they don&#8217;t necessarily care about cost if they are getting good value for their money.</p>
<p>We shall see what the month has in store for Billishirts &#8211; hopefully it will bring lots of commissions!</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Press Release - for Google PR]]></title>
<link>http://socializ1ng.wordpress.com/2009/07/03/press-release-for-google-pr/</link>
<pubDate>Fri, 03 Jul 2009 13:18:27 +0000</pubDate>
<dc:creator>socializ1ng</dc:creator>
<guid>http://socializ1ng.wordpress.com/2009/07/03/press-release-for-google-pr/</guid>
<description><![CDATA[One of the often quoted tips is :use one of the PR agencies who get their releases in Google News. Y]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>One of the often quoted tips is :use one of the PR agencies who get their releases in Google News. You should better traffic and a temporary PR kick which might push your rankings higher. Google News is an &#8220;authority&#8221; site and carries some clout. Some of PR websites alos have good authority value too.</p>
<p><a href="http://jalbum.net/users/lifestyles/">Photo albums</a><br />
<a href="http://www.startupnation.com/profile/JulyB">StartupNation</a><br />
<a href="http://docs.jquery.com/User:JulyB">jQuery JavaScript</a><br />
<a href="http://www.ourmedia.org/users/julyb">ourmedia.org</a><br />
<a href="http://www.golflink.com/community/members/julyb">GolfLink</a><br />
<a href="http://democracyforamerica.com/users/638759-july-b?type=public">DemocracyForAmerica.com</a><br />
<a href="http://www.javaworld.com/community/user/22841">JavaWorld&#8217;s  Daily Brew</a></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Google page rank]]></title>
<link>http://cferseta.wordpress.com/2009/06/26/google-page-rank/</link>
<pubDate>Fri, 26 Jun 2009 05:08:21 +0000</pubDate>
<dc:creator>cferseta</dc:creator>
<guid>http://cferseta.wordpress.com/2009/06/26/google-page-rank/</guid>
<description><![CDATA[Alaltaieri, 24 iunie 2009, google a recalculat page rankul. Ultima data a fost 28 mai. Vad ca pastre]]></description>
<content:encoded><![CDATA[Alaltaieri, 24 iunie 2009, google a recalculat page rankul. Ultima data a fost 28 mai. Vad ca pastre]]></content:encoded>
</item>
<item>
<title><![CDATA[Akhirnya Google PR Naik Lagi]]></title>
<link>http://blognyadiana.wordpress.com/2009/06/25/akhirnya-google-pr-naik-lagi/</link>
<pubDate>Wed, 24 Jun 2009 23:35:21 +0000</pubDate>
<dc:creator>diana</dc:creator>
<guid>http://blognyadiana.wordpress.com/2009/06/25/akhirnya-google-pr-naik-lagi/</guid>
<description><![CDATA[Setelah sempat turun dari PR 4 sampai PR 2 akhirnya dinaikan lagi sama google ke PR 3. Maklumlah jar]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><font color="teal">Setelah sempat turun dari PR 4 sampai PR 2  akhirnya dinaikan lagi sama google ke <!--more-->PR 3. Maklumlah jarang posting.</p>
<p>Meskipun pada saat PR turun tapi jumlah pengunjung blog ini malah naik, jadi ternyata tak ada korelasi positif antara PR dan jumlah pengunjung. </p>
<p>Bagi sebagian blogger mungkin masih menganggap penting soal PR ini.</font> </p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[ Best10 Ways to increase your Google Page Rank]]></title>
<link>http://meroblognet.wordpress.com/2009/06/14/best10-ways-to-increase-your-google-page-rank/</link>
<pubDate>Sun, 14 Jun 2009 11:24:09 +0000</pubDate>
<dc:creator>Rajendra Dhakal-Senior Software Developer</dc:creator>
<guid>http://meroblognet.wordpress.com/2009/06/14/best10-ways-to-increase-your-google-page-rank/</guid>
<description><![CDATA[Best10 Ways to  increase your Google Page Rank Use Lots of Meta tags with commas and make sure not t]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><strong>Best10 Ways to  increase your Google Page Rank</strong></p>
<ol>
<li><strong>Use Lots of Meta tags with commas and make sure not to repeat more than 3 times.</strong></li>
<li><strong>Make sure at least one link to google</strong></li>
<li><strong>Use browser safe colors for looks and <a href="http://article.meroblog.net/Best10-Ways-to-increase-your-Google-Page-Rank.html">more</a></strong></li>
</ol>
<p>We have Download able file for more information. follow link <a href="http://www.meroblog.net/Softwre-Download/Top-10-Best-Ways-to-increase-your-PageRank.pdf">click</a></p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Google PageRank 10 Sites - May 2009]]></title>
<link>http://sethuram.wordpress.com/2009/06/01/google-pagerank-10-sites-may-2009/</link>
<pubDate>Mon, 01 Jun 2009 20:31:31 +0000</pubDate>
<dc:creator>sethuram</dc:creator>
<guid>http://sethuram.wordpress.com/2009/06/01/google-pagerank-10-sites-may-2009/</guid>
<description><![CDATA[Google frequently updates its algorithm which effects PR&#8217;s of many sites and backlinks for tho]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Google frequently updates its algorithm which effects PR&#8217;s of many sites and backlinks for those.Recent update was happend on 27th may 2009.A PageRank 10 site has the top most importance according to Google&#8217;s system and every webmaster struggle to get the traffic related with this ranking.</p>
<table style="border-collapse:collapse;width:323pt;" border="0" cellspacing="0" cellpadding="0" width="428">
<col style="width:155pt;" width="206"></col>
<col style="width:44pt;" width="58"></col>
<col style="width:50pt;" width="66"></col>
<col style="width:74pt;" width="98"></col>
<tbody>
<tr style="height:12.75pt;">
<td style="height:12.75pt;width:155pt;" width="206" height="17"><span style="color:#3366ff;"><strong>Title</strong></span></td>
<td style="width:44pt;" width="58"><span style="color:#3366ff;"><strong>PR</strong></span></td>
<td style="width:50pt;" width="66"><span style="color:#3366ff;"><strong>GBLs</strong></span></td>
<td style="width:74pt;" width="98"><span style="color:#3366ff;"><strong>URL</strong></span></td>
</tr>
<tr style="height:12.75pt;">
<td style="height:12.75pt;" height="17">Google Search</td>
<td>10</td>
<td>548,000</td>
<td><a href="http://www.google.com/" target="_blank">http://www.google.com</a></td>
</tr>
<tr style="height:12.75pt;">
<td style="height:12.75pt;" height="17">Adobe</td>
<td>10</td>
<td>102,000</td>
<td><a href="http://www.adobe.com/">http://www.adobe.com/</a></td>
</tr>
<tr style="height:12.75pt;">
<td style="height:12.75pt;" height="17">World Wide Web Consortium</td>
<td>10</td>
<td>35,400</td>
<td><a href="http://www.w3.org/">http://www.w3.org/</a></td>
</tr>
<tr style="height:12.75pt;">
<td style="height:12.75pt;" height="17">The W3C CSS Validation   Service</td>
<td>10</td>
<td>452,000</td>
<td><a href="http://jigsaw.w3.org/css-validator/">http://jigsaw.w3.org/css-validator/</a></td>
</tr>
<tr style="height:12.75pt;">
<td style="height:12.75pt;" height="17">CNN news</td>
<td>10</td>
<td>99,000</td>
<td><a href="http://www.cnn.com/">http://www.cnn.com/</a></td>
</tr>
<tr style="height:12.75pt;">
<td style="height:12.75pt;" height="17">US Goverment website</td>
<td>10</td>
<td>21,700</td>
<td><a href="http://www.usa.gov/index.shtml">http://www.usa.gov/</a></td>
</tr>
<tr style="height:12.75pt;">
<td style="height:12.75pt;" height="17">Adobe &#8211; Adobe Flash Player</td>
<td>10</td>
<td>318,000</td>
<td><a href="http://get.adobe.com/flashplayer/">http://get.adobe.com/flashplayer/</a></td>
</tr>
<tr style="height:14.25pt;">
<td style="height:14.25pt;" height="19">Adobe &#8211; Adobe Reader Download</td>
<td>10</td>
<td>457,000</td>
<td><a href="http://get.adobe.com/reader/">http://get.adobe.com/reader/</a></td>
</tr>
<tr style="height:12.75pt;">
<td style="height:12.75pt;" height="17">National Portal of India</td>
<td>10</td>
<td>1,390</td>
<td><a href="http://india.gov.in/">http://india.gov.in/</a></td>
</tr>
</tbody>
</table>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Azi google a recalculat page rank-ul]]></title>
<link>http://cferseta.wordpress.com/2009/05/28/azi-google-a-realocat-page-rank-ul/</link>
<pubDate>Thu, 28 May 2009 19:35:29 +0000</pubDate>
<dc:creator>cferseta</dc:creator>
<guid>http://cferseta.wordpress.com/2009/05/28/azi-google-a-realocat-page-rank-ul/</guid>
<description><![CDATA[Azi pe la pranz google a recalculat page rank-ul. Parca ultima data l-a dat acum o luna. In orice ca]]></description>
<content:encoded><![CDATA[Azi pe la pranz google a recalculat page rank-ul. Parca ultima data l-a dat acum o luna. In orice ca]]></content:encoded>
</item>
<item>
<title><![CDATA[The Importance of Google PageRank: A Guide For Small Business Executives]]></title>
<link>http://kpgraphicarts.wordpress.com/2009/05/03/the-importance-of-google-pagerank-a-guide-for-small-business-executives/</link>
<pubDate>Sun, 03 May 2009 21:18:06 +0000</pubDate>
<dc:creator>kpgraphicarts</dc:creator>
<guid>http://kpgraphicarts.wordpress.com/2009/05/03/the-importance-of-google-pagerank-a-guide-for-small-business-executives/</guid>
<description><![CDATA[If you’ve spent time (or are simply curious) about online marketing, then the topic of search engine]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>If you’ve spent time (or are simply curious) about online marketing, then the topic of search engine optimization (SEO) usually comes up.  And, no discussion of search<em> </em>engine <em>anything</em> is complete these days without some mention of Google.  This article provides a brief overview of how Google ranks search results with a look at their PageRank™ algorithm (a key component).  I’m not a search engine expert (that’s the bad news).  The good news is that I know enough to describe Google PageRank in relatively simple terms (such that you can impress your friends and family with your new-found knowledge).</p>
<p><strong>Quick Intro To SEO (Search Engine Optimization)</strong></p>
<p>Put quite simply, SEO is the process of optimizing your website for the search engines (like Google).  By “optimizing”, I mean attempting to make it such that searches for specific phrases rank your website higher in the search results than other websites.  There are lots of good reasons to want to rank higher, but for businesses, the primary reason is to generate good leads for your offering.  Millions of people use Google every day looking for a product, service or information.  Some of these people might be potential clients looking for <em>your</em> particular offering.  There are two ways for you to show up on the results page when users are doing a search. The first is paid advertising (I’ll talk about this in a future article) and the second is what is known as “organic” (or “natural”) search.  The natural search results are listed free and are dependent on Google’s estimation of how relevant and credible your website is.  Natural search results are my favorite kind, because you don’t have to pay money for them, and they often works <em>better</em> than paid advertising.  I liken this to the difference between getting mentioned in a magazine article and purchasing an ad in that same magazine.  </p>
<p>If you can rank high on the free (organic) search results for Google, it’s like getting tens of thousands of dollars worth of free advertising in the most relevant trade magazines for your industry, every time a new issue comes out.  I’m not sure about you, but that’s pretty interesting to me.  It’s a great way to grow your business and find new clients.  So, how do you get all this free, effective advertising in the search engines?  Well, to do that you need to understand the Google algorithm and how it determines who gets listed.</p>
<p><strong>Google’s Search Algorithm</strong></p>
<p>First, let’s establish a simple example which we can use to frame our discussion.  Let’s assume you are the partner in a boutique strategy consulting firm.  Lets further say that your specialization is advising technical founders of high-growth, venture-backed companies on how to be better at selling.  Now, you could probably identify a number of search phrases that your potential clients might use when interested in this particular topic.  Users may search for something like “technical sales consultant to founder”.  Or, they may just start by looking for content (instead of consulting) and search on “successful technical selling”.  In either case, Google has an algorithm that figures out which websites of the hundreds of millions out there should be displayed <em>in rank order</em> on the results page.  These are the organic (i.e. non-paid) results.  You want to rank high on these results.  [Author’s note:  If you do actually search Google on “successful technical selling”, you’ll find that my OnStartups.com blog ranks #1].</p>
<p>Though Google’s algorithm is extremely sophisticated, it boils down to something like this:</p>
<p>Search Ranking = Relevance * PageRank</p>
<p>Relevance is basically the measure of how your website (or more accurately one of your web pages) <em>matches</em> the search phrase the user has entered.  Measuring relevance is a relatively sophisticated process, but it boils down to some fundamentals like the title of the page, words on the page and how frequently they occur, etc.  So, if your home page has things like “technical selling”, it drives up the relevance for this particular search.  The reason my blog article is ranked #1 on Google for “successful technical selling” is in no small part because of the title OF ONE OF MY ARTICLES (“Successful Selling Tips For The Technically Gifted”).    Basically, Google figures out what your page is “about” by looking at it’s content (and by looking at other sites with similar content that are linking to yours).  It then uses this to figure out how relevant you are for a particular search phrase.</p>
<p>PageRank is an <em>independent </em>measure of Google’s perception of the quality/authority/credibility of an individual web page.  It does not depend on any particular search phrase.  For the public (you and me), Google conveniently reports this as a number from 0-10 (10 being the best).  So, assuming for a second that your web page and your competitors web-page has the same <em>relevance</em> – then whoever has the higher PageRank gets the better ranking – and shows up at the top of the results page.  This is why PageRank is so important.  Your relevance is based on your content (if you’re a consulting company specializing in technical selling, your relevance for stainless steel monkey wrench searches is going to be understandably low).  Your PageRank is what counts.</p>
<p><strong>How PageRank Is Calculated</strong></p>
<p>There has been a lot written and a lot debated about Google’s PageRank, but on one point there is near unanimous agreement.  PageRank is primarily determined by how many other web pages are <em>linking</em> into you.  Google considers this kind of inbound a link a vote of confidence.    But, here’s the trick:  Not all inbound links are created equal.  Web pages with more credibility that link to you have more “value” to your PageRank than those with less credibility.  How is this credibility determined?  Why, by <em>their</em> PageRank, of course!  So, let’s take an example.  Lets say you have your Uncle Charlie link to you from his blog to your small business website.  Let’s also say that Uncle Charlie’s blog has a Page Rank of 3 (this is being a little generous because all Uncle Charlie writes about is his dog Sparky and he has limited inbound links).  This link from Uncle Charlie will certainly help you – a little bit.  It will help you more if you can find 100 such Uncle Charlie websites with a PageRank of 3 and get them to link to you.  </p>
<p>However, if you get a single link from <a href="http://www.hubspot.com/">HubSpot.com</a> (the sponsor of this blog), it’ll help you more than a 100 Uncle Charlie websites.  Why?  Because HubSpot.com has a PageRank of 6 and a link from it is <em>much</em> more valuable.  I divide up PageRank into these broad categories:</p>
<p>0-3:  New sites or sites with very minimal links<br />
4-5:  Popular sites with a fair amount of inbound links<br />
6:  Very popular sites that have hundreds of links, many of them quality links<br />
7-10:  Usually media brands (NYTimes.com), big companies or A-list bloggers.</p>
<p>Now, it’s important to note that PageRank is believed to be calculated on a <em>logarithmic</em> scale.  What this roughly means is that the difference between PR4 and PR5 is likely 5-10 times than the difference between PR3 and PR4.  So, there are likely  over a 100 times as many web pages with a PageRank of 2 than there are with a PageRank of 4.   This means that if you get to a PageRank of 6 or so, you’re likely well into the top 0.1% of all websites out there.  If most of your peer group is straggling around with a PR2 or PR3, you’re <em>way</em> ahead of the game. </p>
<p><strong>What’s Your PageRank?</strong><br />
<strong> </strong><br />
There are two ways to figure out what your approximate PageRank is.  One, you can download the <a href="http://toolbar.google.com/">Google Toolbar</a> (the PageRank feature is not turned on by default, so you’d have to enable it after installation).  </p>
<p>The other way is to use our immensely popular (and free) <a href="http://www.websitegrader.com">Website Grader</a> tool.  It will not only tell you your Google PageRank, but a bunch of interesting other stuff. </p>
<p><strong>Quick recap:  </strong>Organic search is like free advertising.  It’s worth the investment to try and get a high ranking by the major search engines.  To rank high you should do two things:  First, make sure your site has the right <em>relevant</em> content for the types of searches your potential clients are conducting.  Second, try to get the highest PageRank possible.  To do this, you need to get as many inbound links from as many high PageRank web pages as possible.</p>
<p>-Dharmesh Shah</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Increase Your Google PR]]></title>
<link>http://kpgraphicarts.wordpress.com/2009/05/03/increase-your-google-pr/</link>
<pubDate>Sun, 03 May 2009 20:58:52 +0000</pubDate>
<dc:creator>kpgraphicarts</dc:creator>
<guid>http://kpgraphicarts.wordpress.com/2009/05/03/increase-your-google-pr/</guid>
<description><![CDATA[http://adrianniculescu.com/2009/05/03/10-steps-to-increase-your-google-pr/ 10 Steps To Increase Your]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><a href="http://adrianniculescu.com/2009/05/03/10-steps-to-increase-your-google-pr/">http://adrianniculescu.com/2009/05/03/10-steps-to-increase-your-google-pr/</a></p>
<h2><a title="10 Steps To Increase Your Google Pr" rel="bookmark" href="http://adrianniculescu.com/2009/05/03/10-steps-to-increase-your-google-pr/">10 Steps To Increase Your Google Pr</a></h2>
<div class="entry">
<div class="snap_preview">
<p>There is no secret behind the success you can have by increasing your Google pr, but the true secret is how you can do so. There is an array of different ways you can increase your Google pr, but persistence and using a combination of several methods will help you climb up the search engine and increase your pr faster. So, here’s how to increase your Google pr.</p>
<p>1. Link exchange<br />
If you link to other sites that are similar to yours, your Google pr will rise because of the multiple links you have pointing back at your site. If you link to sites unrelated to yours, Google will penalize you.</p>
<p>2. Content<br />
The kind of content you produce goes a long way. If you can offer fresh and enticing content to your readers, more than likely you will get a frequent return base to see what else you have to offer, which Google loves.</p>
<p>3. Forums<br />
Posting in forums is a great way to spread your knowledge across the Web and advertise your products and business at the same time. A lot of forums allow signatures where you can link your site and refer people to it, which in turn will generate more traffic and increase your Google pr.</p>
<p>4. Blogs<br />
Having a blog associated with your website is almost essential today. How to increase your Google pr from blogs is by consistently posting new ideas and thoughts every day, offering advice and answering questions, and obviously promoting your business.</p>
<p>5. Article writing<br />
Article writing is one of the best ways out there to increase your Google pr. You have the ability to spread your knowledge, use keyword optimization, submit the article to thousands of article directories, and spread your website link through the resource box.</p>
<p>6. Write reviews<br />
As crazy as it may sound, your Google pr can and will go up if you write reviews on anything. Whether it is on movies, books or sports games, the key is subtly placing the link to your website in it.</p>
<p>7. Affiliate programs<br />
Affiliate programs can increase your Google pr, but it can also hurt it as well. It is vital that you join a successful affiliate program that correlates with your website; otherwise you will see your Google pr drop.</p>
<p>8. Free<br />
All you have to do is put up the word free and people are immediately interested. By sending a free e-book out through an auto-responder or free articles for a week, you will generate a high volume of traffic just to receive the FREE item.</p>
<p>9. Newsletter<br />
A newsletter is a great way to increase your Google pr because it keeps visitors involved and continuously keeps them up to date with what is going on in your business.</p>
<p>10. Keyword optimization<br />
Keyword optimization is about the most difficult way to increase your Google pr, but it can potentially raise it the most. By targeting specific keywords throughout your entire website and in all of your content and articles, you will slowly rise to the top of the search engines.</p></div>
</div>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Google Page Rank]]></title>
<link>http://kpgraphicarts.wordpress.com/2009/05/03/google-page-rank/</link>
<pubDate>Sun, 03 May 2009 16:54:50 +0000</pubDate>
<dc:creator>kpgraphicarts</dc:creator>
<guid>http://kpgraphicarts.wordpress.com/2009/05/03/google-page-rank/</guid>
<description><![CDATA[http://en.wikipedia.org/wiki/PageRank PageRank is a link analysis algorithm used by the Google Inter]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><a href="http://en.wikipedia.org/wiki/PageRank">http://en.wikipedia.org/wiki/PageRank</a></p>
<p><strong>PageRank</strong> is a <a title="Network theory" href="http://kpgraphicarts.wordpress.com/wiki/Network_theory#link_analysis">link analysis</a> algorithm used by the <a title="Google" href="http://kpgraphicarts.wordpress.com/wiki/Google">Google</a> Internet <a class="mw-redirect" title="Search engine" href="http://kpgraphicarts.wordpress.com/wiki/Search_engine">search engine</a> that assigns a numerical weighting to each element of a <a title="Hyperlink" href="http://kpgraphicarts.wordpress.com/wiki/Hyperlink">hyperlinked</a> set of documents, such as the <a title="World Wide Web" href="http://kpgraphicarts.wordpress.com/wiki/World_Wide_Web">World Wide Web</a>, with the purpose of &#8220;measuring&#8221; its relative importance within the set. The <a title="Algorithm" href="http://kpgraphicarts.wordpress.com/wiki/Algorithm">algorithm</a> may be applied to any collection of entities with <a title="Reciprocal" href="http://kpgraphicarts.wordpress.com/wiki/Reciprocal">reciprocal</a> quotations and references. The numerical weight that it assigns to any given element <em>E</em> is also called the <em>PageRank of E</em> and denoted by <span class="texhtml"><em>P</em><em>R</em>(<em>E</em>).</span></p>
<p>The name &#8220;PageRank&#8221; is a <a title="Trademark" href="http://kpgraphicarts.wordpress.com/wiki/Trademark">trademark</a> of Google, and the PageRank process has been <a title="Patent" href="http://kpgraphicarts.wordpress.com/wiki/Patent">patented</a> (<a class="external text" title="http://www.google.com/patents?vid=6285999" rel="nofollow" href="http://www.google.com/patents?vid=6285999">U.S. Patent 6,285,999</a>). However, the patent is assigned to <a title="Stanford University" href="http://kpgraphicarts.wordpress.com/wiki/Stanford_University">Stanford University</a> and not to Google. Google has exclusive license rights on the patent from Stanford University. The university received 1.8 million shares of Google in exchange for use of the patent; the shares were sold in 2005 for <a class="mw-redirect" title="US$" href="http://kpgraphicarts.wordpress.com/wiki/US$">$</a>336 million.<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-0"><span>[</span>1<span>]</span></a></sup><sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-1"><span>[</span>2<span>]</span></a></sup></p>
<p><img class="aligncenter size-full wp-image-195" title="400px-pageranks-example_svg" src="http://kpgraphicarts.wordpress.com/files/2009/05/400px-pageranks-example_svg.png" alt="400px-pageranks-example_svg" width="400" height="322" /></p>
<div class="thumbcaption">
<div class="magnify"><a class="internal" title="Enlarge" href="http://kpgraphicarts.wordpress.com/wiki/File:PageRanks-Example.svg"><img src="http://kpgraphicarts.wordpress.com/skins-1.5/common/images/magnify-clip.png" alt="" width="15" height="11" /></a></div>
<p>Mathematical <strong>PageRanks</strong> (out of 100) for a simple network (PageRanks reported by Google are rescaled logarithmically). Page C has a higher PageRank than Page E, even though it has fewer links to it: the link it has is much higher valued. A web surfer who chooses a random link on every page (but with 15% likelihood jumps to a random page on the whole web) is going to be on Page E for 8.1% of the time. (The 15% likelihood of jumping to an arbitrary page corresponds to a damping factor of 85%.) Without damping, all web surfers would eventually end up on Pages A, B, or C, and all other pages would have PageRank zero. Page A is assumed to link to all pages in the web, because it has no outgoing links.</p>
<div class="thumbcaption"><span class="mw-headline">Description</span>Google describes PageRank:<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-googletechnology-2"><span>[</span>3<span>]</span></a></sup></div>
<table class="cquote" style="border-collapse:collapse;background-color:transparent;border-style:none;margin:auto;" border="0">
<tbody>
<tr>
<td style="font-weight:bold;font-size:35px;color:#b2b7f2;font-family:'Times New Roman',serif;text-align:left;padding:10px;" width="20" valign="top">“</td>
<td style="padding:4px 10px;" valign="top">PageRank relies on the uniquely democratic nature of the web by using its vast link structure as an indicator of an individual page&#8217;s value. In essence, Google interprets a link from page A to page B as a vote, by page A, for page B. But, Google looks at more than the sheer volume of votes, or links a page receives; it also analyzes the page that casts the vote. Votes cast by pages that are themselves &#8220;important&#8221; weigh more heavily and help to make other pages &#8220;important&#8221;.</td>
<td style="font-weight:bold;font-size:36px;color:#b2b7f2;font-family:'Times New Roman',serif;text-align:right;padding:10px;" width="20" valign="bottom">”</td>
</tr>
</tbody>
</table>
<p>In other words, a PageRank results from a &#8220;ballot&#8221; among all the other pages on the World Wide Web about how important a page is. A hyperlink to a page counts as a vote of support. The PageRank of a page is defined <a title="Recursion" href="http://kpgraphicarts.wordpress.com/wiki/Recursion">recursively</a> and depends on the number and PageRank metric of all pages that link to it (&#8220;<a class="mw-redirect" title="Incoming link" href="http://kpgraphicarts.wordpress.com/wiki/Incoming_link">incoming links</a>&#8220;). A page that is linked to by many pages with high PageRank receives a high rank itself. If there are no links to a web page there is no support for that page.</p>
<p>Google assigns a numeric weighting from 0-10 for each webpage on the Internet; this PageRank denotes a site’s importance in the eyes of Google. The PageRank is derived from a theoretical probability value on a <a title="Logarithmic scale" href="http://kpgraphicarts.wordpress.com/wiki/Logarithmic_scale">logarithmic scale</a> like the <a class="mw-redirect" title="Richter Scale" href="http://kpgraphicarts.wordpress.com/wiki/Richter_Scale">Richter Scale</a>. The PageRank of a particular page is roughly based upon the quantity of inbound links as well as the PageRank of the pages providing the links. It is known that other factors, e.g. relevance of search words on the page and actual visits to the page reported by the Google toolbar also influence the PageRank.<sup class="noprint Inline-Template"><span style="white-space:nowrap;">[<em><a title="Wikipedia:Cleanup" href="http://kpgraphicarts.wordpress.com/wiki/Wikipedia:Cleanup">citation needed</a></em>]</span></sup> In order to prevent manipulation, <a title="Spoofing attack" href="http://kpgraphicarts.wordpress.com/wiki/Spoofing_attack">spoofing</a> and <a title="Spamdexing" href="http://kpgraphicarts.wordpress.com/wiki/Spamdexing">Spamdexing</a>, Google provides no specific details about how other factors influence PageRank.<sup class="noprint Inline-Template"><span style="white-space:nowrap;">[<em><a title="Wikipedia:Cleanup" href="http://kpgraphicarts.wordpress.com/wiki/Wikipedia:Cleanup">citation needed</a></em>]</span></sup></p>
<p>Numerous academic papers concerning PageRank have been published since Page and Brin&#8217;s original paper.<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-originalpaper-3"><span>[</span>4<span>]</span></a></sup> In practice, the PageRank concept has proven to be vulnerable to manipulation, and extensive research has been devoted to identifying falsely inflated PageRank and ways to ignore links from documents with falsely inflated PageRank.</p>
<p>Other link-based ranking algorithms for Web pages include the <a title="HITS algorithm" href="http://kpgraphicarts.wordpress.com/wiki/HITS_algorithm">HITS algorithm</a> invented by <a title="Jon Kleinberg" href="http://kpgraphicarts.wordpress.com/wiki/Jon_Kleinberg">Jon Kleinberg</a> (used by <a title="Teoma" href="http://kpgraphicarts.wordpress.com/wiki/Teoma">Teoma</a> and now <a title="Ask.com" href="http://kpgraphicarts.wordpress.com/wiki/Ask.com">Ask.com</a>), the IBM <a title="CLEVER project" href="http://kpgraphicarts.wordpress.com/wiki/CLEVER_project">CLEVER project</a>, and the <a title="TrustRank" href="http://kpgraphicarts.wordpress.com/wiki/TrustRank">TrustRank</a> algorithm.</p>
<p>PageRank was developed at <a title="Stanford University" href="http://kpgraphicarts.wordpress.com/wiki/Stanford_University">Stanford University</a> by <a title="Larry Page" href="http://kpgraphicarts.wordpress.com/wiki/Larry_Page">Larry Page</a> (hence the name <em>Page</em>-Rank<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-4"><span>[</span>5<span>]</span></a></sup>) and later <a title="Sergey Brin" href="http://kpgraphicarts.wordpress.com/wiki/Sergey_Brin">Sergey Brin</a> as part of a research project about a new kind of search engine. The project started in 1995 and led to a functional prototype, named Google, in 1998. Shortly after, Page and Brin founded <a class="mw-redirect" title="Google Inc." href="http://kpgraphicarts.wordpress.com/wiki/Google_Inc.">Google Inc.</a>, the company behind the <a title="Google search" href="http://kpgraphicarts.wordpress.com/wiki/Google_search">Google search</a> engine. While just one of many factors which determine the ranking of Google search results, PageRank continues to provide the basis for all of Google&#8217;s web search tools.<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-googletechnology-2"><span>[</span>3<span>]</span></a></sup></p>
<p>PageRank is based on <a title="Citation analysis" href="http://kpgraphicarts.wordpress.com/wiki/Citation_analysis">citation analysis</a> that was developed in the 1950s by <a title="Eugene Garfield" href="http://kpgraphicarts.wordpress.com/wiki/Eugene_Garfield">Eugene Garfield</a> at the University of Pennsylvania, and Google&#8217;s founders cite Garfield&#8217;s work in their original paper. By following links from one page to another, virtual communities of webpages are found. Web link analysis was first developed by <a title="Jon Kleinberg" href="http://kpgraphicarts.wordpress.com/wiki/Jon_Kleinberg">Jon Kleinberg</a> and his team while working on the CLEVER project at IBM&#8217;s <a class="mw-redirect" title="Almaden Research Center" href="http://kpgraphicarts.wordpress.com/wiki/Almaden_Research_Center">Almaden Research Center</a>.</p>
<p> </p>
<h2><span class="mw-headline">Algorithm</span></h2>
<p>PageRank is a <a title="Probability distribution" href="http://kpgraphicarts.wordpress.com/wiki/Probability_distribution">probability distribution</a> used to represent the likelihood that a person randomly clicking on links will arrive at any particular page. PageRank can be calculated for collections of documents of any size. It is assumed in several research papers that the distribution is evenly divided between all documents in the collection at the beginning of the computational process. The PageRank computations require several passes, called &#8220;iterations&#8221;, through the collection to adjust approximate PageRank values to more closely reflect the theoretical true value.</p>
<p>A probability is expressed as a numeric value between 0 and 1. A 0.5 probability is commonly expressed as a &#8220;50% chance&#8221; of something happening. Hence, a PageRank of 0.5 means there is a 50% chance that a person clicking on a random link will be directed to the document with the 0.5 PageRank.</p>
<p><span class="mw-headline">Simplified algorithm</span></p>
<p><span class="mw-headline"><img class="aligncenter size-full wp-image-196" title="507px-linkstruct2_svg" src="http://kpgraphicarts.wordpress.com/files/2009/05/507px-linkstruct2_svg.png" alt="507px-linkstruct2_svg" width="507" height="466" /></span></p>
<p>Assume a small universe of four web pages: <strong>A</strong>, <strong>B</strong>, <strong>C</strong> and <strong>D</strong>. The initial approximation of PageRank would be evenly divided between these four documents. Hence, each document would begin with an estimated PageRank of 0.25.</p>
<p>In the original form of PageRank initial values were simply 1. This meant that the sum of all pages was the total number of pages on the web. Later versions of PageRank (see the below formulas) would assume a probability distribution between 0 and 1. Here we&#8217;re going to simply use a probability distribution hence the initial value of 0.25.</p>
<p>If pages <strong>B</strong>, <strong>C</strong>, and <strong>D</strong> each only link to <strong>A</strong>, they would each confer 0.25 PageRank to <strong>A</strong>. All PageRank <strong>PR( )</strong> in this simplistic system would thus gather to <strong>A</strong> because all links would be pointing to <strong>A</strong>.</p>
<dl>
<dd><img class="tex" src="http://upload.wikimedia.org/math/3/2/d/32d474c0957cfa862e9fb93723a6254a.png" alt="PR(A)= PR(B) + PR(C) + PR(D).\," /> </dd>
</dl>
<p>This is 0.75.</p>
<p>Again, suppose page <strong>B</strong> also has a link to page <strong>C</strong>, and page <strong>D</strong> has links to all three pages. The <em>value of the link-votes is divided among all the outbound links on a page</em>. Thus, page <strong>B</strong> gives a vote worth 0.125 to page <strong>A</strong> and a vote worth 0.125 to page <strong>C</strong>. Only one third of <strong>D</strong>&#8217;s PageRank is counted for A&#8217;s PageRank (approximately 0.083).</p>
<dl>
<dd><img class="tex" src="http://upload.wikimedia.org/math/0/1/2/012e0ce7d92e50f7bbdd8675166987a0.png" alt="PR(A)= \frac{PR(B)}{2}+ \frac{PR(C)}{1}+ \frac{PR(D)}{3}.\," /> </dd>
</dl>
<p>In other words, the PageRank conferred by an outbound link <strong>L( )</strong> is equal to the document&#8217;s own PageRank score divided by the normalized number of outbound links (it is assumed that links to specific URLs only count once per document).</p>
<dl>
<dd><img class="tex" src="http://upload.wikimedia.org/math/f/8/4/f84534849f09191b1e145152404ceb6e.png" alt="PR(A)= \frac{PR(B)}{L(B)}+ \frac{PR(C)}{L(C)}+ \frac{PR(D)}{L(D)}. \," /> </dd>
</dl>
<p>In the general case, the PageRank value for any page <strong>u</strong> can be expressed as:</p>
<dl>
<dd><img class="tex" src="http://upload.wikimedia.org/math/a/c/4/ac48cfa215bf51c9cab4b92df790674b.png" alt="PR(u) = \sum_{v \in B_u} \frac{PR(v)}{L(v)}" />, </dd>
</dl>
<p>i.e. the PageRank value for a page <strong>u</strong> is dependent on the PageRank values for each page <strong>v</strong> out of the set <strong>B<sub>u</sub></strong> (this set contains all pages linking to page <strong>u</strong>), divided by the number <em>L</em>(<em>v</em>) of links from page <strong>v</strong>.</p>
<p><span class="mw-headline">Damping factor</span>The PageRank theory holds that even an imaginary surfer who is randomly clicking on links will eventually stop clicking. The probability, at any step, that the person will continue is a damping factor <em>d</em>. Various studies have tested different damping factors, but it is generally assumed that the damping factor will be set around 0.85.<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-5"><span>[</span>6<span>]</span></a></sup></p>
<p>The damping factor is subtracted from 1 (and in some variations of the algorithm, the result is divided by the number of documents in the collection) and this term is then added to the product of the damping factor and the sum of the incoming PageRank scores.</p>
<p>That is,</p>
<dl>
<dd><img class="tex" src="http://upload.wikimedia.org/math/1/d/c/1dc89801a24868f1635cd107dfbcbbae.png" alt="PR(A)= 1 - d + d \left( \frac{PR(B)}{L(B)}+ \frac{PR(C)}{L(C)}+ \frac{PR(D)}{L(D)}+\,\cdots \right)" /> </dd>
</dl>
<p>or (<em>N</em> = the number of documents in collection)</p>
<dl>
<dd><img class="tex" src="http://upload.wikimedia.org/math/5/c/9/5c9a6cc4c1381791153f64891d34b00e.png" alt="PR(A)= {1 - d \over N} + d \left( \frac{PR(B)}{L(B)}+ \frac{PR(C)}{L(C)}+ \frac{PR(D)}{L(D)}+\,\cdots \right) ." /> </dd>
</dl>
<p>So any page&#8217;s PageRank is derived in large part from the PageRanks of other pages. The damping factor adjusts the derived value downward. The second formula above supports the original statement in Page and Brin&#8217;s paper that &#8220;the sum of all PageRanks is one&#8221;.<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-originalpaper-3"><span>[</span>4<span>]</span></a></sup> Unfortunately, however, Page and Brin gave the first formula, which has led to some confusion.</p>
<p>Google recalculates PageRank scores each time it crawls the Web and rebuilds its index. As Google increases the number of documents in its collection, the initial approximation of PageRank decreases for all documents.</p>
<p>The formula uses a model of a <em>random surfer</em> who gets bored after several clicks and switches to a random page. The PageRank value of a page reflects the chance that the random surfer will land on that page by clicking on a link. It can be understood as a <a title="Markov chain" href="http://kpgraphicarts.wordpress.com/wiki/Markov_chain">Markov chain</a> in which the states are pages, and the transitions are all equally probable and are the links between pages.</p>
<p>If a page has no links to other pages, it becomes a sink and therefore terminates the random surfing process. However, the solution is quite simple. If the random surfer arrives at a sink page, it picks another <a title="Uniform Resource Locator" href="http://kpgraphicarts.wordpress.com/wiki/Uniform_Resource_Locator">URL</a> at random and continues surfing again.</p>
<p>When calculating PageRank, pages with no outbound links are assumed to link out to all other pages in the collection. Their PageRank scores are therefore divided evenly among all other pages. In other words, to be fair with pages that are not sinks, these random transitions are added to all nodes in the Web, with a residual probability of usually <em>d</em> = 0.85, estimated from the frequency that an average surfer uses his or her browser&#8217;s bookmark feature.</p>
<p>So, the equation is as follows:</p>
<dl>
<dd><img class="tex" src="http://upload.wikimedia.org/math/8/0/1/80125f33d12ceb608fdb9daec09d9c10.png" alt="PR(p_i) = \frac{1-d}{N} + d \sum_{p_j \in M(p_i)} \frac{PR (p_j)}{L(p_j)}" /> </dd>
</dl>
<p>where <span class="texhtml"><em>p</em><sub>1</sub>,<em>p</em><sub>2</sub>,&#8230;,<em>p</em><sub><em>N</em></sub></span> are the pages under consideration, <span class="texhtml"><em>M</em>(<em>p</em><sub><em>i</em></sub>)</span> is the set of pages that link to <span class="texhtml"><em>p</em><sub><em>i</em></sub></span>, <span class="texhtml"><em>L</em>(<em>p</em><sub><em>j</em></sub>)</span> is the number of outbound links on page <span class="texhtml"><em>p</em><sub><em>j</em></sub></span>, and <em>N</em> is the total number of pages.</p>
<p>The PageRank values are the entries of the dominant <a class="mw-redirect" title="Eigenvector" href="http://kpgraphicarts.wordpress.com/wiki/Eigenvector">eigenvector</a> of the <a class="mw-redirect" title="Modified adjacency matrix" href="http://kpgraphicarts.wordpress.com/wiki/Modified_adjacency_matrix">modified adjacency matrix</a>. This makes PageRank a particularly elegant metric: the eigenvector is</p>
<dl>
<dd><img class="tex" src="http://upload.wikimedia.org/math/8/3/b/83bef20457b3924d0a8a5bcd19fb5181.png" alt=" \mathbf{R} = \begin{bmatrix} PR(p_1) \\ PR(p_2) \\ \vdots \\ PR(p_N) \end{bmatrix} " /> </dd>
</dl>
<p>where <strong>R</strong> is the solution of the equation</p>
<dl>
<dd><img class="tex" src="http://upload.wikimedia.org/math/a/0/e/a0e11cd17235ba8f80701fe365b9790f.png" alt=" \mathbf{R} =  \begin{bmatrix} {(1-d)/ N} \\ {(1-d) / N} \\ \vdots \\ {(1-d) / N} \end{bmatrix}  + d  \begin{bmatrix} \ell(p_1,p_1) &#38; \ell(p_1,p_2) &#38; \cdots &#38; \ell(p_1,p_N) \\ \ell(p_2,p_1) &#38; \ddots &#38;  &#38; \vdots \\ \vdots &#38; &#38; \ell(p_i,p_j) &#38; \\ \ell(p_N,p_1) &#38; \cdots &#38; &#38; \ell(p_N,p_N) \end{bmatrix}  \mathbf{R}  " /> </dd>
</dl>
<p>where the adjacency function <img class="tex" src="http://upload.wikimedia.org/math/1/6/f/16fea48a55ae38596a244daacd999cb5.png" alt="\ell(p_i,p_j)" /> is 0 if page <span class="texhtml"><em>p</em><sub><em>j</em></sub></span> does not link to <span class="texhtml"><em>p</em><sub><em>i</em></sub></span>, and normalised such that, for each <em>j</em></p>
<dl>
<dd><img class="tex" src="http://upload.wikimedia.org/math/5/9/3/5934d61059c133aef38a6815479b514e.png" alt="\sum_{i = 1}^N \ell(p_i,p_j) = 1" />, </dd>
</dl>
<p>i.e. the elements of each column sum up to 1.</p>
<p>This is a variant of the <a class="mw-redirect" title="Eigenvector centrality" href="http://kpgraphicarts.wordpress.com/wiki/Eigenvector_centrality">eigenvector centrality</a> measure used commonly in <a title="Network analysis" href="http://kpgraphicarts.wordpress.com/wiki/Network_analysis">network analysis</a>.</p>
<p>Because of the large eigengap of the modified adjacency matrix above, <sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-6"><span>[</span>7<span>]</span></a></sup> the values of the PageRank eigenvector are fast to approximate (only a few iterations are needed).</p>
<p>As a result of <a title="Markov process" href="http://kpgraphicarts.wordpress.com/wiki/Markov_process">Markov theory</a>, it can be shown that the PageRank of a page is the probability of being at that page after lots of clicks. This happens to equal <span class="texhtml"><em>t</em> <sup>− 1</sup></span> where <span class="texhtml"><em>t</em></span> is the <a title="Expected value" href="http://kpgraphicarts.wordpress.com/wiki/Expected_value">expectation</a> of the number of clicks (or random jumps) required to get from the page back to itself.</p>
<p>The main disadvantage is that it favors older pages, because a new page, even a very good one, will not have many links unless it is part of an existing site (a site being a densely connected set of pages, such as <a title="Wikipedia" href="http://kpgraphicarts.wordpress.com/wiki/Wikipedia">Wikipedia</a>). The Google Directory (itself a derivative of the <a title="Open Directory Project" href="http://kpgraphicarts.wordpress.com/wiki/Open_Directory_Project">Open Directory Project</a>) allows users to see results sorted by PageRank within categories. The Google Directory is the only service offered by Google where PageRank directly determines display order. In Google&#8217;s other search services (such as its primary Web search) PageRank is used to weigh the relevance scores of pages shown in search results.</p>
<p>Several strategies have been proposed to accelerate the computation of PageRank.<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-7"><span>[</span>8<span>]</span></a></sup></p>
<p>Various strategies to manipulate PageRank have been employed in concerted efforts to improve search results rankings and monetize advertising links. These strategies have severely impacted the reliability of the PageRank concept, which seeks to determine which documents are actually highly valued by the Web community.</p>
<p>Google is known to actively penalize <a title="Link farm" href="http://kpgraphicarts.wordpress.com/wiki/Link_farm">link farms</a> and other schemes designed to artificially inflate PageRank. In December 2007 Google started <em>actively</em> penalizing sites selling paid text links. How Google identifies link farms and other PageRank manipulation tools are among Google&#8217;s <a title="Trade secret" href="http://kpgraphicarts.wordpress.com/wiki/Trade_secret">trade secrets</a>.</p>
<p> </p>
<h3><span class="mw-headline">Google Toolbar</span></h3>
<p>The <a title="Google Toolbar" href="http://kpgraphicarts.wordpress.com/wiki/Google_Toolbar">Google Toolbar</a>&#8217;s PageRank feature displays a visited page&#8217;s PageRank as a whole number between 0 and 10. The most popular websites have a PageRank of 10. The least have a PageRank of 0. Google has not disclosed the precise method for determining a Toolbar PageRank value, yet it can still be found by visiting: <a class="external free" title="http://www.google.com/search?client=navclient-auto&#38;ch=6-1484155081&#38;features=Rank&#38;q=info:http://www.wikipedia.org/" rel="nofollow" href="http://www.google.com/search?client=navclient-auto&#38;ch=6-1484155081&#38;features=Rank&#38;q=info:http://www.wikipedia.org/">http://www.google.com/search?client=navclient-auto&#38;ch=6-1484155081&#38;features=Rank&#38;q=info:http://www.wikipedia.org/</a> where www.wikipedia.org is the website name.</p>
<p>The following one-line Javascript performs the URL substitution and can be used as a <a title="Bookmarklet" href="http://kpgraphicarts.wordpress.com/wiki/Bookmarklet">bookmarklet</a> in any browser bookmark bar (including Google Chrome which presently lacks a Google Toolbar add-in):</p>
<div style="text-align:left;" dir="ltr">
<pre class="source-javascript">javascript:<span class="kw1">void</span><span class="br0">(</span><span class="br0">(</span><span class="kw2">function</span><span class="br0">(</span><span class="br0">)</span><span class="br0">{</span>var%20a=location.<span class="me1">href</span>.<span class="me1">replace</span><span class="br0">(</span><span class="re0">/^http%5C:%5C/%5C/<span class="br0">(</span>.<span class="me1">*</span><span class="br0">)</span>$/</span>,<span class="st0">"$1"</span><span class="br0">)</span>;location.<span class="me1">href</span>=<span class="st0">"http://www.google.com/
search?client=navclient-auto&#38;ch=6-1484155081&#38;features=Rank&#38;q=info:"</span>+escape<span class="br0">(</span>a<span class="br0">)</span>;<span class="br0">}</span><span class="br0">)</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span></pre>
</div>
<p> </p>
<h3><span class="mw-headline">SERP Rank</span></h3>
<p>The <a class="mw-redirect" title="SERP" href="http://kpgraphicarts.wordpress.com/wiki/SERP">SERP</a> (Search Engine Results Page) is the actual result returned by a search engine in response to a keyword query. The SERP consists of a list of links to web pages with associated text <a title="Snippet" href="http://kpgraphicarts.wordpress.com/wiki/Snippet">snippets</a>. The SERP rank of a web page refers to the placement of the corresponding link on the SERP, where higher placement means higher SERP rank. The SERP rank of a web page is not only a function of its PageRank, but depends on a relatively large and continuously adjusted set of factors <sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-Vaughn09-8"><span>[</span>9<span>]</span></a></sup>. <a title="Search engine optimization" href="http://kpgraphicarts.wordpress.com/wiki/Search_engine_optimization">SEO</a> (Search Engine Optimization) is aimed at achieving the highest possible SERP rank for a website or a set of web pages.</p>
<p> <span class="mw-headline"><strong>Google directory PageRank</strong></span></p>
<p>The <a title="List of Google products" href="http://kpgraphicarts.wordpress.com/wiki/List_of_Google_products#Search">Google Directory</a> PageRank is an 8-unit measurement. These values can be viewed in the Google Directory. Unlike the Google Toolbar which shows the PageRank value by a mouseover of the green bar, the Google Directory does not show the PageRank as a numeric value but only as a green bar.</p>
<p> </p>
<h3><span class="mw-headline">False or spoofed PageRank</span></h3>
<p>While the PageRank shown in the Toolbar is considered to be derived from an accurate PageRank value (at some time prior to the time of publication by Google) for most sites, it must be noted that this value is also easily manipulated. A current flaw is that any low PageRank page that is redirected, via a 302 server header or a &#8220;Refresh&#8221; <a class="mw-redirect" title="Meta tag" href="http://kpgraphicarts.wordpress.com/wiki/Meta_tag">meta tag</a>, to a high PageRank page causes the lower PageRank page to acquire the PageRank of the destination page. In theory a new, <a class="mw-redirect" title="PR0" href="http://kpgraphicarts.wordpress.com/wiki/PR0">PR0</a> page with no incoming links can be redirected to the Google home page &#8211; which is a PR 10 &#8211; and by the next PageRank update the PR of the new page will be upgraded to a PR10. This <a class="mw-redirect" title="Spoofing" href="http://kpgraphicarts.wordpress.com/wiki/Spoofing">spoofing</a> technique, also known as <a class="mw-redirect" title="302 Google Jacking" href="http://kpgraphicarts.wordpress.com/wiki/302_Google_Jacking">302 Google Jacking</a>, is a known failing or bug in the system. Any page&#8217;s PageRank can be spoofed to a higher or lower number of the webmaster&#8217;s choice and only Google has access to the real PageRank of the page. Spoofing is generally detected by running a Google search for a URL with questionable PageRank, as the results will display the URL of an entirely different site (the one redirected to) in its results.</p>
<p> </p>
<h3><span class="mw-headline">Manipulating PageRank</span></h3>
<p>For <a title="Search engine optimization" href="http://kpgraphicarts.wordpress.com/wiki/Search_engine_optimization">search-engine optimization</a> purposes, some companies offer to sell high PageRank links to webmasters.<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-Cutts-0414-9"><span>[</span>10<span>]</span></a></sup> As links from higher-PR pages are believed to be more valuable, they tend to be more expensive. It can be an effective and viable marketing strategy to buy link advertisements on content pages of quality and relevant sites to drive traffic and increase a webmaster&#8217;s link popularity. However, Google has publicly warned webmasters that if they are or were discovered to be selling links for the purpose of conferring PageRank and reputation, their links will be devalued (ignored in the calculation of other pages&#8217; PageRanks). The practice of buying and selling links is intensely debated across the Webmaster community. Google advises webmasters to use the <a title="Nofollow" href="http://kpgraphicarts.wordpress.com/wiki/Nofollow">nofollow</a> <a title="HTML" href="http://kpgraphicarts.wordpress.com/wiki/HTML">HTML</a> <a title="Attribute (computing)" href="http://kpgraphicarts.wordpress.com/wiki/Attribute_(computing)">attribute</a> value on sponsored links. According to <a title="Matt Cutts" href="http://kpgraphicarts.wordpress.com/wiki/Matt_Cutts">Matt Cutts</a>, Google is concerned about webmasters who try to game the system, and thereby reduce the quality and relevancy of Google search results.<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-Cutts-0414-9"><span>[</span>10<span>]</span></a></sup></p>
<p> </p>
<h3> <span class="mw-headline">The intentional surfer model</span></h3>
<p>The original PageRank algorithm reflects the so-called random surfer model, meaning that the PageRank of a particular page is derived from the theoretical probability of visiting that page when clicking on links at random. However, real users do not randomly surf the web, but follow links according to their interest and intention. A page ranking model that reflects the importance of a particular page as a function of how many actual visits it receives by real users is called the <em>intentional surfer model</em><sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-Jos07-10"><span>[</span>11<span>]</span></a></sup>. The Google toolbar sends information to Google for every page visited, and thereby provides a basis for computing PageRank based on the intentional surfer model. The introduction of the <a title="Nofollow" href="http://kpgraphicarts.wordpress.com/wiki/Nofollow">nofollow</a> attribute by Google to combat <a title="Spamdexing" href="http://kpgraphicarts.wordpress.com/wiki/Spamdexing">Spamdexing</a> has the side effect that webmasters commonly use it on outgoing link to increase their own PageRank. This causes a loss of actual links for the Web crawlers to follow, thereby making the original PageRank algorithm based on the random surfer model potentially unreliable. Using information about users&#8217; browsing habits provided by the Google toolbar partly compensates for the loss of information caused by the <a title="Nofollow" href="http://kpgraphicarts.wordpress.com/wiki/Nofollow">nofollow</a> attribute. The <a class="mw-redirect" title="SERP" href="http://kpgraphicarts.wordpress.com/wiki/SERP">SERP</a> rank of a page, which determines a page&#8217;s actual placement in the search results, is based on a combination of the random surfer model (PageRank) and the intentional surfer model (browsing habits) in addition to other factors <sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-SEOnotepad09-11"><span>[</span>12<span>]</span></a></sup>.</p>
<p> </p>
<h3> <span class="mw-headline">Other uses</span></h3>
<p>A version of PageRank has recently been proposed as a replacement for the traditional <a title="Institute for Scientific Information" href="http://kpgraphicarts.wordpress.com/wiki/Institute_for_Scientific_Information">Institute for Scientific Information</a> (ISI) <a title="Impact factor" href="http://kpgraphicarts.wordpress.com/wiki/Impact_factor">impact factor</a>,<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-12"><span>[</span>13<span>]</span></a></sup> and implemented at <a class="external text" title="http://www.eigenfactor.org" rel="nofollow" href="http://www.eigenfactor.org/">eigenfactor.org</a>. Instead of merely counting total citation to a journal, the &#8220;importance&#8221; of each citation is determined in a PageRank fashion.</p>
<p>A similar new use of PageRank is to rank academic doctoral programs based on their records of placing their graduates in faculty positions. In PageRank terms, academic departments link to each other by hiring their faculty from each other (and from themselves). <sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-13"><span>[</span>14<span>]</span></a></sup></p>
<p>PageRank has been used to rank spaces or streets to predict how many people (pedestrians or vehicles) come to the individual spaces or streets. <sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-14"><span>[</span>15<span>]</span></a></sup></p>
<p><sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-15"><span>[</span>16<span>]</span></a></sup></p>
<p>PageRank has also been used to automatically rank <a title="WordNet" href="http://kpgraphicarts.wordpress.com/wiki/WordNet">WordNet</a> <a class="mw-redirect" title="Synsets" href="http://kpgraphicarts.wordpress.com/wiki/Synsets">synsets</a> according to how strongly they possess a given semantic property, such as positivity or negativity. <sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-16"><span>[</span>17<span>]</span></a></sup></p>
<p>A dynamic weighting method similar to PageRank has been used to generate customized reading lists based on the link structure of Wikipedia. <sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-17"><span>[</span>18<span>]</span></a></sup></p>
<p>A <a title="Web crawler" href="http://kpgraphicarts.wordpress.com/wiki/Web_crawler">Web crawler</a> may use PageRank as one of a number of importance metrics it uses to determine which URL to visit next during a crawl of the web. One of the early working papers</p>
<p><sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-18"><span>[</span>19<span>]</span></a></sup> which were used in the creation of Google is <em>Efficient crawling through URL ordering</em>,</p>
<p><sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-19"><span>[</span>20<span>]</span></a></sup></p>
<p>which discusses the use of a number of different importance metrics to determine how deeply, and how much of a site Google will crawl. PageRank is presented as one of a number of these importance metrics, though there are others listed such as the number of inbound and outbound links for a URL, and the distance from the root directory on a site to the URL.</p>
<p>The PageRank may also be used as a <a class="external text" title="http://de.scientificcommons.org/23846375" rel="nofollow" href="http://de.scientificcommons.org/23846375">methodology</a> to measure the apparent impact of a community like the <a title="Blogosphere" href="http://kpgraphicarts.wordpress.com/wiki/Blogosphere">Blogosphere</a> on the overall Web itself. This approach uses therefore the PageRank to measure the distribution of attention in reflection of the <a title="Scale-free network" href="http://kpgraphicarts.wordpress.com/wiki/Scale-free_network">Scale-free network</a> paradigm.</p>
<p> </p>
<h2><span class="mw-headline">Google&#8217;s <tt>rel="nofollow"</tt> option</span></h2>
<p>In early 2005, Google implemented a new value, &#8220;<a title="Nofollow" href="http://kpgraphicarts.wordpress.com/wiki/Nofollow">nofollow</a>&#8220;<sup class="reference"><a href="http://kpgraphicarts.wordpress.com/wp-admin/#cite_note-20"><span>[</span>21<span>]</span></a></sup>, for the <a title="Semantic link" href="http://kpgraphicarts.wordpress.com/wiki/Semantic_link">rel</a> attribute of HTML link and anchor elements, so that website developers and <a class="mw-redirect" title="Bloggers" href="http://kpgraphicarts.wordpress.com/wiki/Bloggers">bloggers</a> can make links that Google will not consider for the purposes of PageRank — they are links that no longer constitute a &#8220;vote&#8221; in the PageRank system. The nofollow relationship was added in an attempt to help combat <a title="Spamdexing" href="http://kpgraphicarts.wordpress.com/wiki/Spamdexing">spamdexing</a>.</p>
<p>As an example, people could previously create many message-board posts with links to their website to artificially inflate their PageRank. With the nofollow value, message-board administrators can modify their code to automatically insert &#8220;rel=&#8217;nofollow&#8217;&#8221; to all hyperlinks in posts, thus preventing PageRank from being affected by those particular posts. This method of avoidance, however, also has various drawbacks, such as reducing the link value of actual comments. (See: <a title="Spam in blogs" href="http://kpgraphicarts.wordpress.com/wiki/Spam_in_blogs#nofollow">Spam in blogs#nofollow</a>)</div>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[How to Use Google PR to Incite A Web Sales Explosion]]></title>
<link>http://adrianniculescu.com/2009/05/03/how-to-use-google-pr-to-incite-a-web-sales-explosion/</link>
<pubDate>Sun, 03 May 2009 16:04:24 +0000</pubDate>
<dc:creator>Greenfield Staff</dc:creator>
<guid>http://adrianniculescu.com/2009/05/03/how-to-use-google-pr-to-incite-a-web-sales-explosion/</guid>
<description><![CDATA[A lot of new web developers ask me the same question: What is PR?  &#8220;Page Rank,&#8221; sometime]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p><strong>A lot of new web developers ask me the same question: What is PR?</strong> </p>
<p>&#8220;<strong>Page Rank</strong>,&#8221; sometimes abbreviated PR, was developed by Google&#8217;s founders <span style="text-decoration:underline;"><strong>Larry Page</strong></span> and <strong><span style="text-decoration:underline;">Sergey Brin</span></strong>. Here is how Google describes the &#8220;<strong>Page Rank</strong>&#8221; system: <strong>Page Rank</strong> relies on the uniquely democratic nature of the web by using its vast link structure as an indicator of an individual page&#8217;s value. In essence, Google interprets a link from page A to page B as a vote, by page A, for page B. But, Google looks at more than the sheer volume of votes, or links a page receives; it also analyzes the page that casts the vote. Votes cast by pages that are  themselves &#8220;important&#8221; weigh more heavily and help to make other pages &#8220;important.&#8221; Important, high-quality sites receive a higher <strong>Page Rank</strong>, which Google remembers each time it conducts a search. Of course, important pages mean nothing to you if they don&#8217;t match your query. So, Google combines <strong>Page Rank</strong> with sophisticated text-matching techniques to find pages that are both important and relevant to your search. Google goes far beyond the number of times a term appears on a page and examines all aspects of the page&#8217;s content (and the content of the pages linking to it) to determine if it&#8217;s a good match for your query. <strong>Page Rank</strong> is rated on a scale of PR-0 to PR-10. A site with a ranking of PR-10 is much higher than one rated PR-0. When a site has a high page ranking, there will be more opportunities for search engine users to locate and view the site. Thus, more traffic will be routed to that site because it is viewed by the web community as a valuable resource.</p>
<p><strong>What Does This Mean For You?</strong></p>
<p>Well, it all goes back to link pop&#8230; If you have a ton of quality, relevant, incoming one-way links to your website, your <strong>Google PR</strong> is going to shoot through the roof!</p>
<p>A high <strong>Google PR</strong> means more exposure for you. Heightened exposure leads to more visitors, and more visitors basically means bigger sales. Simple enough.</p>
<p>Ask any successful web developer how to inexpensively gain quality non-reciprocal links and they&#8217;ll tell you: Find and exchange links with as many websites that relate to your own and also submit to as many directories as you can.</p>
<p>Don&#8217;t forget about directories, they are viewed by web users as a quick and easy way to find valuable resources tailored specifically to their search. As a result of directories&#8217; popularity, a submission to a lot of them will generate a great deal of targeted traffic.</p>
<p>There&#8217;s only one problem: The directory submission process is long and tedious. Some directories, such as Yahoo! Directory, cost up to $300 for one submission. If you&#8217;re operating on a tight budget, you are better off spreading your money over many smaller directory submissions. Unfortunately, that can take a lot of  time.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[10 Steps To Increase Your Google Pr]]></title>
<link>http://adrianniculescu.com/2009/05/03/10-steps-to-increase-your-google-pr/</link>
<pubDate>Sun, 03 May 2009 13:43:00 +0000</pubDate>
<dc:creator>Greenfield Staff</dc:creator>
<guid>http://adrianniculescu.com/2009/05/03/10-steps-to-increase-your-google-pr/</guid>
<description><![CDATA[There is no secret behind the success you can have by increasing your Google pr, but the true secret]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>There is no secret behind the success you can have by increasing your Google pr, but the true secret is how you can do so.  There is an array of different ways you can increase your Google pr, but persistence and using a combination of several methods will help you climb up the search engine and increase your pr faster.  So, here’s how to increase your Google pr.</p>
<p>1. Link exchange<br />
If you link to other sites that are similar to yours, your Google pr will rise because of the multiple links you have pointing back at your site.  If you link to sites unrelated to yours, Google will penalize you.</p>
<p>2. Content<br />
The kind of content you produce goes a long way.  If you can offer fresh and enticing content to your readers, more than likely you will get a frequent return base to see what else you have to offer, which Google loves.</p>
<p>3. Forums<br />
Posting in forums is a great way to spread your knowledge across the Web and advertise your products and business at the same time.  A lot of forums allow signatures where you can link your site and refer people to it, which in turn will generate more traffic and increase your Google pr.</p>
<p>4. Blogs<br />
Having a blog associated with your website is almost essential today.  How to increase your Google pr from blogs is by consistently posting new ideas and thoughts every day, offering advice and answering questions, and obviously promoting your business.</p>
<p>5. Article writing<br />
Article writing is one of the best ways out there to increase your Google pr.  You have the ability to spread your knowledge, use keyword optimization, submit the article to thousands of article directories, and spread your website link through the resource box.</p>
<p>6. Write reviews<br />
As crazy as it may sound, your Google pr can and will go up if you write reviews on anything.  Whether it is on movies, books or sports games, the key is subtly placing the link to your website in it.</p>
<p>7. Affiliate programs<br />
Affiliate programs can increase your Google pr, but it can also hurt it as well.  It is vital that you join a successful affiliate program that correlates with your website; otherwise you will see your Google pr drop.</p>
<p>8. Free<br />
All you have to do is put up the word free and people are immediately interested.  By sending a free e-book out through an auto-responder or free articles for a week, you will generate a high volume of traffic just to receive the FREE item.</p>
<p>9. Newsletter<br />
A newsletter is a great way to increase your Google pr because it keeps visitors involved and continuously keeps them up to date with what is going on in your business.</p>
<p>10. Keyword optimization<br />
Keyword optimization is about the most difficult way to increase your Google pr, but it can potentially raise it the most.  By targeting specific keywords throughout your entire website and in all of your content and articles, you will slowly rise to the top of the search engines.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[DoFollow attribute &amp; CommentLuv]]></title>
<link>http://tomgurney.wordpress.com/2009/04/17/dofollow-attribute-commentluv/</link>
<pubDate>Fri, 17 Apr 2009 05:03:34 +0000</pubDate>
<dc:creator>tomgurney</dc:creator>
<guid>http://tomgurney.wordpress.com/2009/04/17/dofollow-attribute-commentluv/</guid>
<description><![CDATA[Sorry for the geeky post today, but am trying to improve my blogs&#8217; position on Google today. I]]></description>
<content:encoded><![CDATA[<div class='snap_preview'><p>Sorry for the geeky post today, but am trying to improve my blogs&#8217; position on Google today. I need DoFollow &#38; CommentLuv set up to encourage people to find and comment on my blog. A blog without interaction is just a diary really.</p>
<p>I wish WordPress will give me the option atleast, but otherwise i will need to host all my blogs myself on separate domains which i don&#8217;t want to do for now. I spent this morning looking for dofollow blogs, and feel rude that i can&#8217;t offer them the same service on my blog.</p>
</div>]]></content:encoded>
</item>
<item>
<title><![CDATA[Where Did My Google Page Rank Go?]]></title>
<link>http://chelltan.wordpress.com/2009/04/14/where-did-my-google-page-rank-go/</link>
<pubDate>Tue, 14 Apr 2009 12:45:23 +0000</pubDate>
<dc:creator>Chell</dc:creator>
<guid>http://chelltan.wordpress.com/2009/04/14/where-did-my-google-page-rank-go/</guid>
<description><![CDATA[&nbsp; I watched in helpless disbelief how my PR dwindled from 4 to 2 in the last month and thought ]]></description>
<content:encoded><![CDATA[&nbsp; I watched in helpless disbelief how my PR dwindled from 4 to 2 in the last month and thought ]]></content:encoded>
</item>
<item>
<title><![CDATA[e-marketing : Peluang UKM jadi UKM-B]]></title>
<link>http://balipropertyexpo.wordpress.com/2009/04/13/e-marketing-peluang-ukm-jadi-ukm-b/</link>
<pubDate>Mon, 13 Apr 2009 07:49:10 +0000</pubDate>
<dc:creator>Dadang Razzak</dc:creator>
<guid>http://balipropertyexpo.wordpress.com/2009/04/13/e-marketing-peluang-ukm-jadi-ukm-b/</guid>
<description><![CDATA[WWW &#8211; WWR &#8211; WWT Peluang Besar Untuk Si Kecil   Dengan semakin maju dan tersedianya media]]></description>
<content:encoded><![CDATA[WWW &#8211; WWR &#8211; WWT Peluang Besar Untuk Si Kecil   Dengan semakin maju dan tersedianya media]]></content:encoded>
</item>
<item>
<title><![CDATA[Bisnis Bali : Di Bali Perlu Investasi Terpadu]]></title>
<link>http://balipropertyexpo.wordpress.com/2009/04/08/bisnis-bali-di-bali-perlu-investasi-terpadu/</link>
<pubDate>Tue, 07 Apr 2009 18:11:19 +0000</pubDate>
<dc:creator>Dadang Razzak</dc:creator>
<guid>http://balipropertyexpo.wordpress.com/2009/04/08/bisnis-bali-di-bali-perlu-investasi-terpadu/</guid>
<description><![CDATA[Di Bali, Perlu Investasi Terpadu Denpasar (BisnisBali) -Banyak komponen masyarakat luar daerah menga]]></description>
<content:encoded><![CDATA[Di Bali, Perlu Investasi Terpadu Denpasar (BisnisBali) -Banyak komponen masyarakat luar daerah menga]]></content:encoded>
</item>

</channel>
</rss>
