<doi_batch xmlns="http://www.crossref.org/schema/4.4.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" version="4.4.0"><head><doi_batch_id>6a3fa469-6a41-4c0b-b87b-e593fec15748</doi_batch_id><timestamp>20250919083426580</timestamp><depositor><depositor_name>wseas:wseas</depositor_name><email_address>mdt@crossref.org</email_address></depositor><registrant>MDT Deposit</registrant></head><body><journal><journal_metadata language="en"><full_title>WSEAS TRANSACTIONS ON COMPUTERS</full_title><issn media_type="electronic">2224-2872</issn><issn media_type="print">1109-2750</issn><archive_locations><archive name="Portico"/></archive_locations><doi_data><doi>10.37394/23205</doi><resource>http://wseas.org/wseas/cms.action?id=4026</resource></doi_data></journal_metadata><journal_issue><publication_date media_type="online"><month>1</month><day>7</day><year>2025</year></publication_date><publication_date media_type="print"><month>1</month><day>7</day><year>2025</year></publication_date><journal_volume><volume>24</volume><doi_data><doi>10.37394/23205.2025.24</doi><resource>https://wseas.com/journals/computers/2025.php</resource></doi_data></journal_volume></journal_issue><journal_article language="en"><titles><title>Application of the power method to Web Search Engine: RankPage and Content Model</title></titles><contributors><person_name sequence="first" contributor_role="author"><given_name>Ahmed</given_name><surname>Kanber</surname><affiliation>Department OF informatique CRMEF MARRAKECH Rue Mozdalifa 40100 MOROCCO</affiliation></person_name></contributors><jats:abstract xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1"><jats:p>This work studies models and algorithms used by Internet search engines to evaluate the relevance of search results and display them in order of importance. These methods are rooted in linear algebra and can be interpreted in terms of graph theory. This text presents the foundational ideas, key theorems, and an iterative algorithm for assigning two types of scores (content and link) to web pages. We also discuss the conditions under which the algorithm converges and is ”well-posed.” Finally, we present an improved variant of the approach that takes into account higher-order connections between pages.</jats:p></jats:abstract><publication_date media_type="online"><month>9</month><day>19</day><year>2025</year></publication_date><publication_date media_type="print"><month>9</month><day>19</day><year>2025</year></publication_date><pages><first_page>148</first_page><last_page>156</last_page></pages><publisher_item><item_number item_number_type="article_number">15</item_number></publisher_item><ai:program xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" name="AccessIndicators"><ai:free_to_read start_date="2025-09-19"/><ai:license_ref applies_to="am" start_date="2025-09-19">https://wseas.com/journals/computers/2025/a305105-015(2025).pdf</ai:license_ref></ai:program><archive_locations><archive name="Portico"/></archive_locations><doi_data><doi>10.37394/23205.2025.24.15</doi><resource>https://wseas.com/journals/computers/2025/a305105-015(2025).pdf</resource></doi_data><citation_list><citation key="ref0"><unstructured_citation>A. N. Langville and C. D. Meyer Google’s PageRank and Beyond:, The Science of Search Engine Rankings, Princeton University Press, 2006. </unstructured_citation></citation><citation key="ref1"><doi>10.1137/1.9780898718164</doi><unstructured_citation>M. W. Berry and M. Browne Understanding Search Engines, Mathematical Modeling and Text Retrieval, 2nd Edition, SIAM, , 2005.s. </unstructured_citation></citation><citation key="ref2"><unstructured_citation>Jasmine Novak, Andrew Tomkins , John Tomlin PageRank Computation and the Structure of the Web: Experiments and Algorithms,Arvind Arasu Computer Science Department, Stanford University, CA 94305 </unstructured_citation></citation><citation key="ref3"><unstructured_citation>C. D. Manning, P. Raghavan, and H. Schütze, Introduction to Information Retrieval, Cambridge University Press, 2008. </unstructured_citation></citation><citation key="ref4"><unstructured_citation>J.SAVOY A learning scheme for information retrieval in Hypertext. Information Processing Management, CAT.INIST, vol. 30, no 4, 1994. </unstructured_citation></citation><citation key="ref5"><unstructured_citation>S. Deerwester, S. T. Dumais, G. W. Furnas, T. K. Landauer, and R. Harshman Indexing by Latent Semantic Analysis, Journal of the American Society for Information Science, 41(6):391–407, 1990. </unstructured_citation></citation><citation key="ref6"><unstructured_citation>Sergey Brin et Lawrence Page The anatomy of a large-scale hypertextualWeb search engine, Computer Networks and ISDN Systems, 30(1–7) :107–117,1998. </unstructured_citation></citation><citation key="ref7"><unstructured_citation>A.H.Bentbib, A.Kanber Block Power Method for SVD Decomposition , An.Univ. Ovidius Constanta, Vol. 23(2),2015, 45–58. </unstructured_citation></citation><citation key="ref8"><unstructured_citation>Agrégation externe de mathématiques Épreuve de modélisation, option B : Calcul Scientifique Texte public, 2019 </unstructured_citation></citation><citation key="ref9"><unstructured_citation>G. Salton, A. Wong, and C. S. Yang A Vector Space Model for Automatic Indexing, Communications of the ACM, 18(11):613–620, 1975. </unstructured_citation></citation><citation key="ref10"><doi>10.1145/324133.324140</doi><unstructured_citation>J.M.Kleinberg Authoritative Sources in a Hyperlinked Environment:, Journal of the ACM, Vol. 46, No. 5, September 1999, pp. 604–632., 1999.</unstructured_citation></citation></citation_list></journal_article></journal></body></doi_batch>