248 results about "PageRank" patented technology

Systems and methods for ranking Web pages based on hyperlink information in a manner that is resistant to nepotistic links are provided. In one embodiment, a Web search service is provided for returning quality query results. The vulnerability of existing ranking algorithms, such as PageRank, to Web pages that are artificially generated for the sole purpose of inflating the score of target page(s) is addressed. Intuitively, it is recognized that it is less likely to reach a particular page on a Web server having many pages via a random jump than it is to reach a particular page on a Web server having few pages, which implies that the influence of such a page upon another page by linking to, or endorsing, the other page is diminished. Thus, in various non-limiting embodiments, each Web server, not each Web page, is assigned a guaranteed minimum score. This minimum score assigned to a server can then be divided among all the pages on that Web server.

The present invention is directed to a system and a method for generating a temporally ranked set of search results in response to a query. Each result in the set of search results can be ranked temporally or based on the reputation associated with authors of each result and the reputation associated with the repository where each result is located. Temporal ranking takes into account a present importance weight and a future importance weight are assigned to each result. The present importance of each result uses creation date, publication date, in-link dates and search frequency, and the future importance uses an aging factor based on the elapsed time from publication for each search result and a rate at which each search result decreases in importance. Temporal ranking can be applied as a modification of existing and common search engine algorithms include PageRank and HITS.

The present invention is useful for assembling a book. The inventive method includes the steps of specifying pagination information including an indication of whether a page is to be selectively included in the book, determining whether the page is to be assembled into the book based on the pagination information, and generating page description language instructions for production of the book in accordance with the pagination information.

The pages in a network of linked pages are ranked based on the quality of the pages. Page quality is obtained by determining the change over time of the link structure of the page, which is obtained by determining the link structure of the page at different periods of time by taking multiple snapshots of the link structure of the network. The link structures are approximated by their PageRanks, page quality being determined by the formula: Q⁡(p)≈D·Δ⁢ ⁢PR⁢(p)PR⁡(p)+PR⁡(p)where Q(p) is the quality of the page, PR(p) is the current PageRank of the page, ΔPR(p) is the change over time in the PageRank of the page, and D is a constant that determines the relative weight of the terms ΔPR(p) / PR(p) and PR(p).

A method and system for web site navigation utilize an internet browser for navigating a plurality of web pages that are configured by a web server. The plurality of web pages are linked as a first set of web pages and linked as at least a second set of web pages. A jump control section is provided on a navigation bar to the user to provide a visual indication of a total number of the first set of linked web pages. The jump control section also provides a jump box and a jump control button which allow the user to immediately jump to any page within the web site. The jump page box displays the current page number when not activated by the user. The navigation bar also includes a strolling control section that permits the user to stroll through a subset of related web pages, identified as the second set, without requiring the user to reload a web site directory page. The strolling control section also provides a visual indication of the total number of web pages within the subset and the current page number within the subset. A status location indicator is also provided on the navigation bar to indicate a text name of the currently displayed subset. The user may conduct telephone communication with a web site guide, such as a web site help desk, and immediately jump to a desired web page by way of the jump control section without the need to navigate a complicated hierarchy of web pages and hyperlinks.

Apparatus, systems, and methods may operate to receive a first command to display a selected portion of an electronic document, wherein the selected portion is indicated by a visible indicator in a selected segment of a segmented scroll bar having a dynamically compressible trough. Further activities may include sending a second command to display a document page having a page number corresponding to the visible indicator, wherein the trough comprises segments corresponding to the pages of the document. Additional apparatus, systems, and methods are disclosed.

An electronic Yellow Pages viewer shows the pages of a Yellow Pages directory as they appear in the bound version. The print queue used to print the bound version is intercepted, and each page is rasterized into a JPEG file or otherwise converted into an image file. The page / header / advertisement data are parsed to create an index which associates each Yellow Pages heading with the first page on which that heading appears. The viewer runs as a Java applet inside a World Wide Web browser and allows a user to access a page by typing the name of a heading, selecting the heading from a tree view or typing a page number. A Yellow Pages advertiser receives an electronic bill with an electronic tear sheet showing the page on which the advertisement appears. The bill can also include one or more of the reverse page, the opposite page, or other pages in the same heading. The advertisement can be selectively highlighted.

A method of ranking a plurality of linked documents. The method comprises obtaining a plurality of documents, and determining a rank of each document. The rank of each document is generally a function of a rank of all other documents in the plurality of documents which point to the document and is determined by solving, by equation-solving methods (including Gauss-Seidel iteration and partitioning) of a set of equations wherein:xi=(1-α)+α⁢∑j⁢⁢aij⁢xj,where xi is the rank of the page indexed by i, α is a number strictly between 0 and 1.0, the summation is over all indices j such that page j points to page i, and aij is defined to be the reciprocal of the number of links pointing out from page j (denoted dj) if page j points to page i, and zero otherwise.

Techniques are described for generating an authority value of a first one of a plurality of documents. A first component of the authority value is generated with reference to outbound links associated with the first document. The outbound links enable access to a first subset of the plurality of documents. A second component of the authority value is generated with reference to a second subset of the plurality of documents. Each of the second subset of documents represents a potential starting point for a user session. A third component of the authority value is generated representing a likelihood that a user session initiated by any of a population of users will end with the first document. The first, second, and third components of the authority value are combined to generate the authority value. At least one of the first, second, and third components of the authority value is computed with reference to user data relating to at least some of the outbound links and the second subset of documents.

The invention discloses a FLASH data reading / writing method and system. The method comprises a step of distributing N pages as data storage areas in a FLASH, wherein the data storage areas are used for storing data records, one page is taken as an index area and the other N-1 areas are taken as record areas. The method furthermore comprises the following steps of: S101, judging whether a target page Nm is fully written or not, if the judging result is negative, executing the step S103, and otherwise, turning to the steps S1a to S1c; S102, writing to-be-written data into the target pages Nm of the record areas in sequence; S1a, erasing information of pages Nm+2 of the record areas, namely, setting all the contents of the pages as identification information of 0xff; S1b, writing page numbers of the pages Nm+1 of the to-be-written data in the data record areas into the index area in sequence; and S1c, writing the to-be-written data into the pages Nm+1 of the record areas in sequence, wherein the pages N-1 of the record areas form a storage area of a round-robin queue. According to the method and system disclosed by the invention, the erasing frequency of the FLASH is reduced, the service life is prolonged, and the position of the final storage record during the last power down can be rapidly searched after power up.

The invention discloses a courseware annotating method. The method comprises the steps that an annotating instruction sent by a first user is received, and courseware annotating information is generated on the page of the to-be-annotated page number of courseware according to the annotating instruction; the courseware annotating information comprises annotating content and annotating page numbers; the courseware annotating information is sent to a second terminal, and the second terminal can display the courseware annotating information. Correspondingly, the invention discloses a courseware annotating system. According to the courseware annotating method and system, the courseware can be annotated on a first terminal, the courseware annotating information can be fed back to the second terminal in time, and the interaction of the first user and a second user is facilitated.

The invention discloses a sequencing method of node importance in a network, comprising: in a directed network, adding a background node, and building bidirectional link between the background node and each node in the directed network; at initial time, distributing a unit resource for each node; randomly migrating in the directed network containing the background node to distribute resource until stable state; distributing the resource of the background node in the stable state to other nodes; under the stable state, taking the sum of the resource amount of each node and the resource amount obtained from the background node as the node importance fraction; and according to the importance fraction, sequencing the nodes from high to low, wherein the node which ranks in the front is more important or has bigger influence. On the basis of PageRank, the invention introduces the background node in, so that the original sequencing method depending on the parameter is changed into the method which does not depend on parameters. In addition, the method handles the network sequencing problem containing a plurality of independent groups while solving the problem of dangling links in the node sequencing.

The invention provides a user influence analysis method based on social network user behaviors and relates to the technical field of information. According to the method, users with high influence can be analyzed comprehensively with the user relation method and the user activity method through a data set of a social network. Compared with a model based on PageRank of an existing method for analyzing influence based on the social network, the user influence analysis method based on social network user behaviors relates to more data relations, diffusion of influence is relevant to the initial value, the diffusion process is influenced by the number and the content of user comments, and thus the method is more reasonable. Compared with a model based on an IDM, the relation between the method and users can be utilized more fully, and layer fracture phenomena do not exist in the IDM. Compared with a traditional model based on user behaviors, a mode of the offline relation between humans is subjected to analogy, and thus the original intention of turning the offline relation between humans to the online relation in the social network can be fit better.

The invention discloses an extensible partition method for associated flow graph data, comprising the following steps: (1) preprocessing graph data and converting a node as the node ID; (2) adding each preprocessed side which is existed in an ID form in FIFO and waiting to enter into a sliding window to process; 3) completing the sliding window and calculating the PageRank value of each node according to a mixing approximation PageRank method; (4), tracking the collection of the initial node corresponded by each node in a subgraph, which is composed of sides in the sliding window and obtaining associated value of each node; (5) obtaining a plurality of centroids and corresponding clusters by adopting an affinity propagation clustering algorithm to all nodes in the window; (6) obtaining a plurality of partitioning results which are not of uniform size via associating repeated iteration of a clustering method and storing the partitioning results whose scales are less than threshold value in the sliding window; (7) transmitting the partitioning results whose scales reach or exceed the threshold value to the appropriate storage node by using a data distribution method; and finishing the graph data partitioning. Compared with the prior art, the method provided by the invention has higher partitioning quality.

The invention provides a detection method for a phishing site. The method comprises the following steps of: firstly, extracting a backward link set of a known trusted site set and a backward link set of a known phishing site set through a backward link, and forming a network topology structure set by using each set; secondly, calculating the credibility of a site in the network topology structure set by combining a PageRank-based web page credibility algorithm and a mode recognition method to obtain a credibility database; thirdly, extracting a backward link set of a site to be detected, and searching for the credibility of a web page in the backward link set of the site to be detected from the credibility database to obtain the credibility of the site to be detected; and finally, determining the site to be detected as the phishing site if the credibility of the site to be detected is lower than a preset threshold value. According to the method, an interconnection relationship between the sites is utilized, the phishing site can be effectively detected in real time, and the method is difficult to break by malicious attacks.

The invention discloses an entity linking method based on a graph model, which is mainly used for dealing with the entity linking problem of unstructured text. The method includes the steps of firstlyconstructing an entity association diagram of the same text by using all entity reference items obtained in the same text and the corresponding candidate entity set as the basis of the dynamic entitydisambiguation algorithm; then, through the dynamic entity disambiguation algorithm based on graph and PageRank, selecting the highest-scoring undisambiguated candidate entity as the target entity ofentity reference in each round, and completing the disambiguation selection process of entity reference corresponding to multiple candidate entities step by step; at last, utilizing XGBoost in a machine learning domain to judge the target entity, linking the logged-in target entity correctly, and identifying the unlogged target entity correctly.

The invention discloses a distributed searching method based on cloud computing. The method includes the steps that network files of various formats are crawled through a distributed web crawler; a document table format with a user-defined format is extracted through the files crawled by the distributed parallel extraction analysis crawler; the extracted document content is stored into a distributed database, and a document table database is established; an index table is established through the document table database, and a parallel computing technology is also adopted; an index table format is also of a user-defined format; index files are imported to an index database, and index data are provided for a searcher; a PageRank and optimized on-line sorting algorithm is adopted in search results. The distributed searching method based on cloud computing has the advantages that the distributed storage and computing characteristic is adopted, by the aid of the improved and optimized sorting algorithm, the search results are more accurate, and due to the fact that the semantic extension keyword technology is used, and the search results are richer.

The invention discloses a journal influence evaluating method based on academic big data. According to the method, Average influence of all theses in every journal is used for representing the influence of the journal. A method for calculating the journal influence is a PageRank-based algorithm, namely, AR-PJageRank, the algorithm takes a similarity, an author H index and other factors between a thesis and another thesis referring to the thesis into consideration, AR makes the algorithm be a weighting algorithm, and in the algorithm iteration process, when all the theses vote a thesis cited by the theses, different contributions can be given due to the similarities between the thesis and the referenced thesis; PageRank makes the importance of each thesis greatly increased, an H index of each thesis is calculated through the sum of the author H indexes, and the H index serves as a label of the thesis so that difference of each thesis can gradually emerge in the calculation process. Accordingly, the method can accurately distinguish the influence of each thesis, and finally the influence of each thesis is obtained.

This invention relates to a keyboard matrix unscrambling method based on Boolean process including the following steps: defining flag bits, scanning output lines of the keyboard matrix, enquiring if there is a key pressed, enquiring the key to unscramble flag bits, eliminatiung dithering delay, enquiring the level of which port is changed, enquiring which corresponding input port has output scan level to be analyzed by the corresponding operation key and the set key unscrambles the flag bits, which provides a keyboard matrix scan unscramble mode more quickly and accurately.

The invention discloses a scientific and technical literature importance degree evaluation method based on PageRank and time decay. Impact factors including a referenced scientific and technical literature, an author, a presentation meeting / periodical and the like jointly construct a link network of the scientific and technical literature, wherein the impact factors are associated with the scientific and technical literature. The scientific and technical literature importance degree evaluation method has the basic thought that a relational network, which is associated with the scientific and technical literature, of a meeting / periodical-presentation year, presentation year-scientific and technical literature, scientific and technical literature-scientific and technical literature and scientific and technical literature-author is converted into a directed graph; then, the PageRank value of each node is calculated on the basis of the directed graph, the scientific and technical literature and a scientific and technical literature reference link are subjected to timed decay processing, wherein ''reference'' time and an authority score are in an inverse ratio; and finally, according to the obtained authority score, weighting processing is carried out to carry out authority value sorting on the scientific and technical literature so as to improve accuracy and reliability for calculating the authority value of the scientific and technical literature. When a user retrieves a target scientific and technical literature, the user can quickly find the most authoritative scientific and technical literature under a situation that an amount of search results is large.

PageRank (PR) is used by web search engine Google in ranking individual web pages. However, it is known that this value is also easily manipulated by methods known as spoofing. Further, the calculation of PR will require iterative cycles of computations to achieve a “steady” value. This would mean that huge computation resources are required to obtain reasonably reliable PR values for various web pages. This invention provides relatively accurate and simple methods for ranking the importance of a node in a network. The web graph or the network is first represented by an incidence matrix or a representation matrix W. The matrix W is then self-multiplied to obtain flow matrix. The flow capacity, or the rank of each node, is then obtained from the flow matrix.

The embodiment of the invention discloses a page generation method and device, equipment and a storage medium. The method comprises the steps of determining a reference page template corresponding toa target page from a pre-generated page template set according to page demand information of the target page to be generated; calling a standard configuration syntax tree corresponding to the reference page template, and determining distinguishing element information of the target page relative to the reference page template; and generating a target page by modifying the standard configuration syntax tree in combination with a page rendering engine according to the standard configuration syntax tree and the distinguishing element information. According to the method, when a to-be-generated page with a customization requirement exists, the reusable page template can be determined from the existing page templates, and the page meeting the customization requirement can be simply and quickly generated by modifying the configuration syntax tree corresponding to the page template; therefore, the flexibility and universality of ranking development are fully utilized, the utilization rate of the developed page template is increased, and then the development efficiency of the page number to be generated is greatly improved.

A method for recommending points of interest base on the importance of the points of interest and the authoritativeness of a user is disclosed. The method mainly includes the following steps: firstly,according to the check-in behavior of the user and the interest point and the co-occurrence relationship between the interest point and the user, by means of the hybrid model of HITS and PageRank, the user authority and the importance of the interest point are calculated; secondly, the importance of interest points is integrated in the Poisson factor model to model the check-in behavior of users;then, the user authority is integrated into the point of interest recommendation model to measure the confidence of the user's sign-in behavior data; then, the stochastic gradient descent algorithm is used to learn the implicit eigenvectors of users and interest points; finally, according to the implicit eigenvectors of users and interest points, the check-in frequency of unregistered interest points is predicted, and the potential interest points of users are recommended according to the predicted check-in frequency. The method mainly solves the problem of recommending points of interest ina location-based social network.

The invention discloses a fast-approaching typesetting method and device of an electronic reader, belonging to the field of typesetting display. The method comprises the following steps: carrying out paging according to set typesetting parameters so as to obtain the initial window length and the total page number in a document, and calculating a page initial point of each page according to the initial window length; obtaining an indicated position of the document according to the page initial point of a specified page number, carrying out paging on the document again from the indicated position of the document, accurately typesetting the page to which the specified page number belongs and each page in a preset page number of pages following the specified page number line by line, and revising the initial window length according to the accurate typesetting result; displaying the document on the electronic reader according to the page initial point after revision. According to the invention, accurate typesetting can be carried out line by line and typesetting can be carried out many times based on the preset number of accurate typesetting, so that the page initial point data can be revised, fast-approaching typesetting can be realized, running speed can be improved, the typesetting needs no restricted condition and the typesetting time cannot be increased with the increase of the document length.

The invention aims to provide a method and equipment for determining the recommendation degree of a hyperlink based on the recommendation attribute of the hyperlink. The method comprises the following steps: acquiring a hyperlink in a page by using hyperlink analyzing equipment; acquiring the recommendation attribute of the hyperlink according to the hyperlink; determining the recommendation degree of the hyperlink through weighting according to the recommendation attribute. Compared with the prior art, the method has the advantages that the result accuracy and the search result ranking quality of page ranking algorithms such as PageRank can be improved and use experience of search users can be enhanced since the recommendation degree of the hyperlink is determined on the basis of the recommendation attribute of the hyperlink in the page.

The invention relates to a semantic web object-ordering method based on Pagerank, which comprises steps of (1) collecting semantic web files from internet and acquiring semantic web terms from the files, wherein the semantic web terms refer to semantic elements in the semantic web files, equal to words which have types of subjects or objects, or attributes of predicates, (2) adding additional paths among the semantic web files, among the semantic web terms, and between the semantic web files and the terms so as to construct a semantic object web with rich links, and (3) calculating order values for objects of the semantic web by adopting Pagerrank link analysis algorithm according to the adjacent relation of the semantic object web with rich links. The invention has the advantages that the invention is established on the base of the semantic object ordering web containing richer links and is added with self-definable links and weights thereof which are retractable in terms of describing network links, thereby guaranteeing higher ordering accuracy and wider application.