personpagerank
pagerank 时间:2021-04-19 阅读:()
Topic-SensitivePageRankPresentedby:BratislavV.
Stojanoviunimatrix0@live.
comUniversityofBelgradeSchoolofElectricalEngineeringPage1/29IntroductionTheWorldWideWebisgrowingrapidlyTherearemorethan100millionwebsitesandmorethan10billionpagesoverthere!
Wedidn'tmentionthecontentthatcannotbeindexedbystandardsearchengines(Deepweb)!
Forexample,ifwetypetheword"golf"insideGoogle,wewillendupwitharound456millionresults!
Othersearchengineswillyieldmoreorlessdifferentresults.
Why"Whatmakesthefoundationofthesearchengine""Whydowepreferonesearchengineoveranother"BratislavStojanovi(unimatrix0@live.
com)|Page2/29ProblemDefinition"HowcanwefindexactlywhatwewantontheWWWinafastandefficientmatter"Everysearchengineneedstorankpages,buthowBiggerthevaluemeansthepagehasmorecontentBiggerthevaluemeansquerywordsaremorefrequentBiggerthevaluemeansthepageismoreimportantEverypagehasitsownrankofimportance,butwhatisimportanceTrafficanalysisFinancialstatementanalysisLinkstructureanalysis$$$BratislavStojanovi(unimatrix0@live.
com)|Page3/29ProblemImportanceNearly90%oftraffictomostwebsitesisfoundbyusingasearchengineordirectoryBratislavStojanovi(unimatrix0@live.
com)|Page4/29WheredousersclickmoreoftenWhatwillbetheresultofthequery"golf"ProblemTrendOureverydaylifeisclutteredwithatonsofdifferentinformationsFindingarealinformationhasbecomeevenmoredifficultTherehasbeenacoupleofmillionnewwebsitesadded,onlyinthelastyear!
Googleisthemostpopularwebsite,andthesecondmostvisitedwebsiteontheplanet!
BratislavStojanovi(unimatrix0@live.
com)|Page5/29ExistingSolutionsHITS(Hyperlink-InducedTopicSearch)HyperSearchPageRankHilltopSALSA(StochasticApproachforLinkStructureAnalysis)TrustRankAndmanyothervariants…BratislavStojanovi(unimatrix0@live.
com)|Page6/29Solution#1:HITSHubsandAuthoritiesJohnM.
Kleinberg,CornellUniversity,NY,'98ReflectsthetimewhentheinternetwasoriginallyformingTwotypesofpages:HubsAuthoritiesHubpageprovideslinkstogoodauthoritiesonthesubjectAuthoritypageprovidesagoodinformationaboutthesubjectBratislavStojanovi(unimatrix0@live.
com)|Page7/29Solution#1:HITSCriticism:ExpensiveatruntimeScoresarecalculatedusingsubgraphoftheentireWebgraphSimpleanditerativeQuery-specificrankscoreBratislavStojanovi(unimatrix0@live.
com)|Page8/29Solution#2:PageRankLawrence"Larry"Page,SergeyBrin,Stanford,1998UsedbytheGooglesearchengineUsesarandomsurfermodelRepresentsthelikelihoodthatapersonrandomlyclickingonlinkswillarriveatanyparticularpageProbabilitydistributionisevenlydividedamongallpagesintheWebgraphPageRankvalueiscomputedforeachpageofflineInterpretsahyperlinkfrompageitopagejasavote,bypagei,forpagejAnalyzesthepagethatcaststhevoteaswellBratislavStojanovi(unimatrix0@live.
com)|Page9/29Solution#2:PageRank"Pageisimportantifmanyimportantpagespointtoit"SimplifiedPageRankformula:r=PR(G)Input:WebgraphG=(V,E)Output:RankvectorrLetGhavennodes(pages)In-linksofpagei:HyperlinksthatpointtopageifromotherpagesOut-linksofpagei:HyperlinksthatpointouttootherpagesfrompageiBratislavStojanovi(unimatrix0@live.
com)|Page10/29Solution#2:PageRankOriginalPageRankformula:Dampingfactord=0.
85Moregeneralformula:Recursivedefinition!
Equationoftheeigensystem,wherethesolutiontoPisaneigenvectorwiththecorrespondingeigenvalueof1ComputationcanbedoneusingpoweriterationmethodBratislavStojanovi(unimatrix0@live.
com)|Page11/29Solution#2:PageRankBratislavStojanovi(unimatrix0@live.
com)|Page12/29P1P2P3P4I11111I2I3I4I5111110.
330.
330.
330.
50.
51P1P2P3P4I11111I211.
830.
330.
83I3I4I511.
830.
330.
830.
330.
330.
330.
1650.
1650.
831.
83P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I4I51.
3251.
830.
330.
4950.
610.
610.
610.
1650.
1651.
3250.
495P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I41.
3251.
270.
610.
775I51.
271.
3250.
610.
7750.
4420.
4420.
4421.
270.
3050.
3050.
775P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I41.
3251.
270.
610.
775I51.
271.
5220.
4420.
7471.
5221.
270.
4420.
747ConvergesDEPENDS!
Solution#2:PageRankCriticism:QueryindependentrankscoreRandomsurfermodelnotappropriateinsomesituationsPronetomanipulations(Googlebombs,linkfarms…)InexpensiveatruntimeScoresarecalculatedusingtheentireWebgraphAlgorithmhashooksfor"personalization"BratislavStojanovi(unimatrix0@live.
com)|Page13/29Solution#3:TrustRankGyngyi,Garcia-Molina,Pedersen,Stanford&Yahoo!
,2004LinkanalysisalgorithmFindsmotivationinPageRankmanipulationUsedtosemi-automaticallyseparateusefulwebpagesfromspamWebspampagesarecreatedonlywiththeintentionofmisleadingsearchenginesHumanexpertscaneasilyidentifyspampages,butit'stooexpensivetomanuallyevaluateeverythingBratislavStojanovi(unimatrix0@live.
com)|Page14/29Solution#3:TrustRankSelectasmallsetofseedpagestobeevaluatedbyanexpertNow,extendoutwardfromtheseedsetandseeksimilarpagesbyusinglinksAlternatively,wecanpickasmallsetofspampagesTRcanbeusedtocalculatespammassSpammassisthemeasureoftheimpactoflinkspammingonapagerankingInsteadofPR,wecalculateInversePR"Pagesarebadiftheylinktobadpages"BratislavStojanovi(unimatrix0@live.
com)|Page15/29Solution#3:TrustRankCriticism:Semi-automatedseparationofreputable,goodpagesfromspampagesIncontrasttoPR,TRdifferentiatesgoodandbadpagesBasedonagoodseedsetoflessthan200pages,resultshaveshownthatTRcaneffectivelyfilteroutspamBratislavStojanovi(unimatrix0@live.
com)|Page16/29ProposedSolutionTSPR(Topic-SensitivePageRank)TaherH.
Haveliwala,StanfordUniversity,2003"Personalized"versionofPageRankInsteadofcomputingasinglerankvector,whydon'twecomputeasetofrankvectors,oneforeach(basis)topicUsestheOpenDirectoryProjectasasourceofrepresentativebasistopics(http://www.
dmoz.
org)orYahoo!
Calculateintwosteps,fullyautomatically:Pre-processingQuery-processingPreprocessingstepiscalculatedoffline,justaswithordinaryPageRankBratislavStojanovi(unimatrix0@live.
com)|Page17/29IsitbetterQuery-specificrankscoreFullyautomatedMakeuseofcontextStillinexpensiveatruntimeBratislavStojanovi(unimatrix0@live.
com)|Page18/29IsitoriginalThefirsttopic-sensitivepersonalizationofPageRankSourceofideasformanyotherpossiblepersonalizationsTahergotajobatGoogleInc.
in2003asamemberofSearchQualityGroupCited994timesonGoogleScholarBratislavStojanovi(unimatrix0@live.
com)|Page19/29TrendSearchincontextandsemanticwebareverypopulartopicsnowadaysTheywillcertainlyplayasignificantroleinthenextstepoftheWorldWideWebevolutionTheSemanticWebasaglobalvisionhasremainedlargelyunrealizedThereisabeliefthatWeb3.
0willdramaticallyimprovethefunctionalityandusabilityofsearchenginesBratislavStojanovi(unimatrix0@live.
com)|Page20/29Topic-SensitivePageRank1/7PageRankformula:r=PR(G)Topic-SensitivePageRankformula:r=IPR(G,v)IPRstandsfor"Influenced"PageRankInput:WebgraphG=(V,E)InfluencevectorisavectorofbasistopicstOutput:ListofrankvectorsrItmapspageito:pageiimportance,WRTtopictiBratislavStojanovi(unimatrix0@live.
com)|Page21/29Topic-SensitivePageRank2/7Forthesakeofsimplicity,let'sconsidersomepageiandonly16topics(categories):WecanpickthemfromthefirstlevelofODPStep1isperformedonce,offline,duringWebcrawlItusesthefollowingiterativeapproach:BratislavStojanovi(unimatrix0@live.
com)|Page22/29Foreachtopiccjεv{//Part1:Calcvjvj[i]=0;if(iεpages(cj)){vj[i]=1/num(pages(cj))}//Part2:Calcrjrj[i]=IPR(W,vj[i]);}Topic-SensitivePageRank3/7BratislavStojanovi(unimatrix0@live.
com)|Page23/29Step2assumesthatwecalculatesomedistributionofweightsoverthe16topicsinourbasisOnlythelinkstructureofpagesrelevanttothequerytopicwillbeusedtorankpageiExample:Queryis"golf"Withnoadditionalcontext,thedistributionoftopicweightswewoulduseis:Topic-SensitivePageRank4/7BratislavStojanovi(unimatrix0@live.
com)|Page24/29Ifuserissuesqueriesaboutinvestmentopportunities,afollow-upqueryon"golf"shouldberankeddifferently,withthebusiness-specificrankvectorExample:Queryis"golf",butthepreviousquerywas"financialservicesinvestments"Distributionoftopicweightswewoulduseis:Topic-SensitivePageRank5/7BratislavStojanovi(unimatrix0@live.
com)|Page25/29Attheend,calculatethecompositePageRankscoreusingthefollowingformula:Interpretationofthecompositescore:WeightedsumofrankvectorsitselfformsavalidrankvectorThefinalscorecanbeusedinconjuctionwithotherscoringschemesTopic-SensitivePageRank6/7BratislavStojanovi(unimatrix0@live.
com)|Page26/29Topic:SportsTopic:SportsAfterawhile:P1(sports)=0.
895P1(business)=1.
2731111111P1P2P3P4P5P6P7I11111111I2Topic:BusinessTopic:Business11andsoon…Finally:P1(sports,business)==0.
55*0.
895+0.
85*1.
273=0.
533110.
330.
330.
330.
330.
330.
3310.
330.
330.
33P1P2P3P4P5P6P7I11111111I2110.
330.
660.
331.
331.
33P1P2P3P4P5P6I1I2P1P2P3P4P5P6I1111111I2110.
330.
660.
331.
331.
331111P1P2P3P4P5P6I1111111I2………………Topic-SensitivePageRank7/7BratislavStojanovi(unimatrix0@live.
com)|Page27/29ConclusionImplicitlymakesuseofIR(InformationRetrieval)indeterminingthetopicofthequeryHowever,thisuseofIRisNOTvulnerabletomanipulation,becauseODPiscompiledbythousandsofvolunteereditorsUsingasmallbasissetisimportantforkeepingthequery-timecostslowFuturework:UsefinergrainedbasissetWeightingschemebasedonpagesimilaritytoODPcategory,ratherthanpagemembershiptoODPcategoryBratislavStojanovi(unimatrix0@live.
com)|Page28/29QuestionsandDiscussionBratislavStojanovi(unimatrix0@live.
com)|Page29/29Yes
Stojanoviunimatrix0@live.
comUniversityofBelgradeSchoolofElectricalEngineeringPage1/29IntroductionTheWorldWideWebisgrowingrapidlyTherearemorethan100millionwebsitesandmorethan10billionpagesoverthere!
Wedidn'tmentionthecontentthatcannotbeindexedbystandardsearchengines(Deepweb)!
Forexample,ifwetypetheword"golf"insideGoogle,wewillendupwitharound456millionresults!
Othersearchengineswillyieldmoreorlessdifferentresults.
Why"Whatmakesthefoundationofthesearchengine""Whydowepreferonesearchengineoveranother"BratislavStojanovi(unimatrix0@live.
com)|Page2/29ProblemDefinition"HowcanwefindexactlywhatwewantontheWWWinafastandefficientmatter"Everysearchengineneedstorankpages,buthowBiggerthevaluemeansthepagehasmorecontentBiggerthevaluemeansquerywordsaremorefrequentBiggerthevaluemeansthepageismoreimportantEverypagehasitsownrankofimportance,butwhatisimportanceTrafficanalysisFinancialstatementanalysisLinkstructureanalysis$$$BratislavStojanovi(unimatrix0@live.
com)|Page3/29ProblemImportanceNearly90%oftraffictomostwebsitesisfoundbyusingasearchengineordirectoryBratislavStojanovi(unimatrix0@live.
com)|Page4/29WheredousersclickmoreoftenWhatwillbetheresultofthequery"golf"ProblemTrendOureverydaylifeisclutteredwithatonsofdifferentinformationsFindingarealinformationhasbecomeevenmoredifficultTherehasbeenacoupleofmillionnewwebsitesadded,onlyinthelastyear!
Googleisthemostpopularwebsite,andthesecondmostvisitedwebsiteontheplanet!
BratislavStojanovi(unimatrix0@live.
com)|Page5/29ExistingSolutionsHITS(Hyperlink-InducedTopicSearch)HyperSearchPageRankHilltopSALSA(StochasticApproachforLinkStructureAnalysis)TrustRankAndmanyothervariants…BratislavStojanovi(unimatrix0@live.
com)|Page6/29Solution#1:HITSHubsandAuthoritiesJohnM.
Kleinberg,CornellUniversity,NY,'98ReflectsthetimewhentheinternetwasoriginallyformingTwotypesofpages:HubsAuthoritiesHubpageprovideslinkstogoodauthoritiesonthesubjectAuthoritypageprovidesagoodinformationaboutthesubjectBratislavStojanovi(unimatrix0@live.
com)|Page7/29Solution#1:HITSCriticism:ExpensiveatruntimeScoresarecalculatedusingsubgraphoftheentireWebgraphSimpleanditerativeQuery-specificrankscoreBratislavStojanovi(unimatrix0@live.
com)|Page8/29Solution#2:PageRankLawrence"Larry"Page,SergeyBrin,Stanford,1998UsedbytheGooglesearchengineUsesarandomsurfermodelRepresentsthelikelihoodthatapersonrandomlyclickingonlinkswillarriveatanyparticularpageProbabilitydistributionisevenlydividedamongallpagesintheWebgraphPageRankvalueiscomputedforeachpageofflineInterpretsahyperlinkfrompageitopagejasavote,bypagei,forpagejAnalyzesthepagethatcaststhevoteaswellBratislavStojanovi(unimatrix0@live.
com)|Page9/29Solution#2:PageRank"Pageisimportantifmanyimportantpagespointtoit"SimplifiedPageRankformula:r=PR(G)Input:WebgraphG=(V,E)Output:RankvectorrLetGhavennodes(pages)In-linksofpagei:HyperlinksthatpointtopageifromotherpagesOut-linksofpagei:HyperlinksthatpointouttootherpagesfrompageiBratislavStojanovi(unimatrix0@live.
com)|Page10/29Solution#2:PageRankOriginalPageRankformula:Dampingfactord=0.
85Moregeneralformula:Recursivedefinition!
Equationoftheeigensystem,wherethesolutiontoPisaneigenvectorwiththecorrespondingeigenvalueof1ComputationcanbedoneusingpoweriterationmethodBratislavStojanovi(unimatrix0@live.
com)|Page11/29Solution#2:PageRankBratislavStojanovi(unimatrix0@live.
com)|Page12/29P1P2P3P4I11111I2I3I4I5111110.
330.
330.
330.
50.
51P1P2P3P4I11111I211.
830.
330.
83I3I4I511.
830.
330.
830.
330.
330.
330.
1650.
1650.
831.
83P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I4I51.
3251.
830.
330.
4950.
610.
610.
610.
1650.
1651.
3250.
495P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I41.
3251.
270.
610.
775I51.
271.
3250.
610.
7750.
4420.
4420.
4421.
270.
3050.
3050.
775P1P2P3P4I11111I211.
830.
330.
83I31.
831.
3250.
330.
495I41.
3251.
270.
610.
775I51.
271.
5220.
4420.
7471.
5221.
270.
4420.
747ConvergesDEPENDS!
Solution#2:PageRankCriticism:QueryindependentrankscoreRandomsurfermodelnotappropriateinsomesituationsPronetomanipulations(Googlebombs,linkfarms…)InexpensiveatruntimeScoresarecalculatedusingtheentireWebgraphAlgorithmhashooksfor"personalization"BratislavStojanovi(unimatrix0@live.
com)|Page13/29Solution#3:TrustRankGyngyi,Garcia-Molina,Pedersen,Stanford&Yahoo!
,2004LinkanalysisalgorithmFindsmotivationinPageRankmanipulationUsedtosemi-automaticallyseparateusefulwebpagesfromspamWebspampagesarecreatedonlywiththeintentionofmisleadingsearchenginesHumanexpertscaneasilyidentifyspampages,butit'stooexpensivetomanuallyevaluateeverythingBratislavStojanovi(unimatrix0@live.
com)|Page14/29Solution#3:TrustRankSelectasmallsetofseedpagestobeevaluatedbyanexpertNow,extendoutwardfromtheseedsetandseeksimilarpagesbyusinglinksAlternatively,wecanpickasmallsetofspampagesTRcanbeusedtocalculatespammassSpammassisthemeasureoftheimpactoflinkspammingonapagerankingInsteadofPR,wecalculateInversePR"Pagesarebadiftheylinktobadpages"BratislavStojanovi(unimatrix0@live.
com)|Page15/29Solution#3:TrustRankCriticism:Semi-automatedseparationofreputable,goodpagesfromspampagesIncontrasttoPR,TRdifferentiatesgoodandbadpagesBasedonagoodseedsetoflessthan200pages,resultshaveshownthatTRcaneffectivelyfilteroutspamBratislavStojanovi(unimatrix0@live.
com)|Page16/29ProposedSolutionTSPR(Topic-SensitivePageRank)TaherH.
Haveliwala,StanfordUniversity,2003"Personalized"versionofPageRankInsteadofcomputingasinglerankvector,whydon'twecomputeasetofrankvectors,oneforeach(basis)topicUsestheOpenDirectoryProjectasasourceofrepresentativebasistopics(http://www.
dmoz.
org)orYahoo!
Calculateintwosteps,fullyautomatically:Pre-processingQuery-processingPreprocessingstepiscalculatedoffline,justaswithordinaryPageRankBratislavStojanovi(unimatrix0@live.
com)|Page17/29IsitbetterQuery-specificrankscoreFullyautomatedMakeuseofcontextStillinexpensiveatruntimeBratislavStojanovi(unimatrix0@live.
com)|Page18/29IsitoriginalThefirsttopic-sensitivepersonalizationofPageRankSourceofideasformanyotherpossiblepersonalizationsTahergotajobatGoogleInc.
in2003asamemberofSearchQualityGroupCited994timesonGoogleScholarBratislavStojanovi(unimatrix0@live.
com)|Page19/29TrendSearchincontextandsemanticwebareverypopulartopicsnowadaysTheywillcertainlyplayasignificantroleinthenextstepoftheWorldWideWebevolutionTheSemanticWebasaglobalvisionhasremainedlargelyunrealizedThereisabeliefthatWeb3.
0willdramaticallyimprovethefunctionalityandusabilityofsearchenginesBratislavStojanovi(unimatrix0@live.
com)|Page20/29Topic-SensitivePageRank1/7PageRankformula:r=PR(G)Topic-SensitivePageRankformula:r=IPR(G,v)IPRstandsfor"Influenced"PageRankInput:WebgraphG=(V,E)InfluencevectorisavectorofbasistopicstOutput:ListofrankvectorsrItmapspageito:pageiimportance,WRTtopictiBratislavStojanovi(unimatrix0@live.
com)|Page21/29Topic-SensitivePageRank2/7Forthesakeofsimplicity,let'sconsidersomepageiandonly16topics(categories):WecanpickthemfromthefirstlevelofODPStep1isperformedonce,offline,duringWebcrawlItusesthefollowingiterativeapproach:BratislavStojanovi(unimatrix0@live.
com)|Page22/29Foreachtopiccjεv{//Part1:Calcvjvj[i]=0;if(iεpages(cj)){vj[i]=1/num(pages(cj))}//Part2:Calcrjrj[i]=IPR(W,vj[i]);}Topic-SensitivePageRank3/7BratislavStojanovi(unimatrix0@live.
com)|Page23/29Step2assumesthatwecalculatesomedistributionofweightsoverthe16topicsinourbasisOnlythelinkstructureofpagesrelevanttothequerytopicwillbeusedtorankpageiExample:Queryis"golf"Withnoadditionalcontext,thedistributionoftopicweightswewoulduseis:Topic-SensitivePageRank4/7BratislavStojanovi(unimatrix0@live.
com)|Page24/29Ifuserissuesqueriesaboutinvestmentopportunities,afollow-upqueryon"golf"shouldberankeddifferently,withthebusiness-specificrankvectorExample:Queryis"golf",butthepreviousquerywas"financialservicesinvestments"Distributionoftopicweightswewoulduseis:Topic-SensitivePageRank5/7BratislavStojanovi(unimatrix0@live.
com)|Page25/29Attheend,calculatethecompositePageRankscoreusingthefollowingformula:Interpretationofthecompositescore:WeightedsumofrankvectorsitselfformsavalidrankvectorThefinalscorecanbeusedinconjuctionwithotherscoringschemesTopic-SensitivePageRank6/7BratislavStojanovi(unimatrix0@live.
com)|Page26/29Topic:SportsTopic:SportsAfterawhile:P1(sports)=0.
895P1(business)=1.
2731111111P1P2P3P4P5P6P7I11111111I2Topic:BusinessTopic:Business11andsoon…Finally:P1(sports,business)==0.
55*0.
895+0.
85*1.
273=0.
533110.
330.
330.
330.
330.
330.
3310.
330.
330.
33P1P2P3P4P5P6P7I11111111I2110.
330.
660.
331.
331.
33P1P2P3P4P5P6I1I2P1P2P3P4P5P6I1111111I2110.
330.
660.
331.
331.
331111P1P2P3P4P5P6I1111111I2………………Topic-SensitivePageRank7/7BratislavStojanovi(unimatrix0@live.
com)|Page27/29ConclusionImplicitlymakesuseofIR(InformationRetrieval)indeterminingthetopicofthequeryHowever,thisuseofIRisNOTvulnerabletomanipulation,becauseODPiscompiledbythousandsofvolunteereditorsUsingasmallbasissetisimportantforkeepingthequery-timecostslowFuturework:UsefinergrainedbasissetWeightingschemebasedonpagesimilaritytoODPcategory,ratherthanpagemembershiptoODPcategoryBratislavStojanovi(unimatrix0@live.
com)|Page28/29QuestionsandDiscussionBratislavStojanovi(unimatrix0@live.
com)|Page29/29Yes
- personpagerank相关文档
- belongingpagerank
- originatingpagerank
- matrixpagerank
- errorpagerank
- estimatepagerank
- pagepagerank
LightNode($7.71/月)香港cn2精品线路
LightNode官网LightNode是一家位于香港的VPS服务商.提供基于KVM虚拟化技术的VPS.在提供全球常见节点的同时，还具备东南亚地区、中国香港等边缘节点.满足开发者建站，游戏应用，外贸电商等应用场景的需求。为用户带来高性能服务器以及优质的服务的同时还提供丰厚的促销活动，新用户注册最高送$20。注册用户带新客即可得10%返佣。商家支持PayPal，支付宝等支付方式。官网：https:/...
Advinservers：美国达拉斯便宜VPS/1核/4GB/80GB SSD/1Gbps不限流量/月付$2.5/美国10Gbps高防服务器/高达3.5TBDDos保护$149.99元/月
Advinservers，国外商家，公司位于新泽西州，似乎刚刚新成立不久，主要提供美国和欧洲地区VPS和独立服务器业务等。现在有几款产品优惠，高达7.5TB的存储VPS和高达3.5TBDDoS保护的美国纽约高防服务器，性价比非常不错，有兴趣的可以关注一下，并且支持Paypal付款。官方网站点击直达官方网站促销产品第一款VPS为预购，预计8月1日交付。CPU为英特尔至强 CPU（X 或 E5）。官方...
数脉科技：六月优惠促销,免备案香港物理服务器,E3-1230v2处理器16G内存,350元/月
数脉科技六月优惠促销发布了！数脉科技对香港自营机房的香港服务器进行超低价促销，可选择30M、50M、100Mbps的优质bgp网络。更大带宽可在选购时选择同样享受优惠，目前仅提供HKBGP、阿里云产品，香港CN2、产品优惠码续费有效，仅限新购，每个客户可使用于一个订单。新客户可以立减400元，或者选择对应的机器用相应的优惠码，有需要的朋友可以尝试一下。点击进入：数脉科技官方网站地址数脉科技是一家成...
pagerank为你推荐
-
phpwindPHPWind 都有什么功能thinkphp什么是THINKPHP 和 MVC的概念access数据库修复求救，ACCESS数据库破坏了，怎么修复？iprouteEigrp 的管理距离是多少啊苹果appstore宕机为什App Store下载软件 到了一半就停了 不动了filezillaserver谁用过FileZilla_Server啊，请教计算机cuteftp本公司www抢米网怎么样才能在小米官方网站抢到手机？购物车（淘宝）为什么推荐购物车购买,是什么意思啊?