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
MineServer：洛杉矶CN2 GIA VPS/512MB内存/20GB NVME/800GB流量/200Mbps/KVM,58元/季
mineserver怎么样?mineserver是一家国人商家，主要提供香港CN2 KVM VPS、香港CMI KVM VPS、日本CN2 KVM VPS、洛杉矶cn2 gia端口转发等服务，之前介绍过几次，最近比较活跃。这家新推出了洛杉矶CN2 GIA VPS，512MB内存/20GB NVME/800GB流量/200Mbps/KVM,58元/季，并且进行了带宽升级，同时IP更改为美国IP。点击...
Virmach：1核/512M1核M1核512M/夏季美国vps促销,年付$7.2,9月更换AMD平台
virmach怎么样？virmach家这几年非常火，从商家的黑五闪购开始，以超低的价格吸引了大批的国人客户，而且商家的机器还是非常稳定的，站长手里的4.75刀年付已经用了两年了，非常稳定，不过商家到国内的线路一般，目前商家新上了夏季优惠促销，价格低到发指，年付7.2美元起，商家反馈将在9月开始更换AMD+NVMe平台，这个消息从年初就有了，不过一直没有更换，目前这个时间也不确定是否准确。点击进入：...
香港云服务器 1核 256M 19.9元/月 Mineserver Ltd
Mineserver(ASN142586|UK CompanyNumber 1351696)，已经成立一年半。主营香港日本机房的VPS、物理服务器业务。Telegram群组: @mineserver1 | Discord群组: https://discord.gg/MTB8ww9GEA7折循环优惠：JP30（JPCN2宣布产品可以使用）8折循环优惠：CMI20（仅1024M以上套餐可以使用）9折循...
pagerank为你推荐
-
apple.com.cn苹果官网怎么查序列号phpwindPHPWind 是什么？怎么用？即时通平台有好的放单平台吗?网站方案设计网站文案策划怎么写billboardchina中国有进美国BillBoard榜的人吗团购程序团购的具体流程是什么？仿佛很简单便捷的样子？联系我们代码农业银行代码社区动力你为什么想当一名社区工作者oscommercewedopay的通道怎么样？网店系统哪个公司开发商城系统比较好？