Patents by Inventor Kenth Engo-Monsen
Kenth Engo-Monsen has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7889679Abstract: A system for analyzing a network including a plurality of nodes associated and/or connected together by links. The system includes a processor coupled to a data memory. The processor is configured to access a first representation of the network and associated link weight measures w in the memory. Moreover, the system is configured to provide node values for the nodes and determine from the node values corresponding slope measures for links existing between the nodes, the slope measures being computed from a function of differences in node values and from the weight measures w for the links, the weight measures w being used for scaling the function of differences in nodes values; to select for at least some of the nodes one or more steepest ascent links having one or more greatest positive slope measures; and to generate a second representation corresponding to a steepest ascent graph of the network derived from information included in the steepest ascent links.Type: GrantFiled: February 2, 2009Date of Patent: February 15, 2011Assignee: Telenor ASAInventors: Geoffrey Canright, Kenth Engø-Monsen, Johannes Bjelland, Richard Seyler Ling, Pål Roe Sundsøy
-
Patent number: 7881227Abstract: A method for improved spreading of information in a network is described, together with corresponding methods with the opposite aim, namely to hinder the spreading of harmful information in a network. The harmful information may be (for example) a data virus. The first method includes as its characterizing feature to connect at least one node of high Eigenvector Centrality Index in a first region with at least one node of high Eigenvector Centrality Index in a second region. These connections may be made using direct links, or with the help of a new node lying between the nodes to be connected. One method for preventing spreading of information or physical traffic in a network may include as its characterizing feature to inoculate at least one center node by blocking any transmission of unwanted information on all links in/out of said center node.Type: GrantFiled: July 6, 2007Date of Patent: February 1, 2011Assignee: Telenor ASAInventors: Geoffrey Canright, Kenth Engø-Monsen
-
Patent number: 7844595Abstract: A device, computer program product and a method for computing the similarity of a set of documents that avoids the large, wasted computational effort involved in calculating very small similarity scores by using thresholds to stop a similarity calculation between documents, thus ensuring that, with high probability, all document pairs with higher similarity than the thresholds have been found.Type: GrantFiled: November 13, 2009Date of Patent: November 30, 2010Assignee: Telenor ASAInventors: Geoffrey Canright, Kenth Engo-Monsen
-
Patent number: 7752198Abstract: A method, device and computer program product for determining an importance score for a document D in a document set by exploiting a similarity matrix/graph S or subgraph S?.Type: GrantFiled: April 24, 2007Date of Patent: July 6, 2010Assignee: Telenor ASAInventors: Geoffrey Canright, Kenth Engo-Monsen
-
Publication number: 20100131515Abstract: A device, computer program product and a method for computing the similarity of a set of documents that avoids the large, wasted computational effort involved in calculating very small similarity scores by using thresholds to stop a similarity calculation between documents, thus ensuring that, with high probability, all document pairs with higher similarity than the thresholds have been found.Type: ApplicationFiled: November 13, 2009Publication date: May 27, 2010Applicant: TELENOR ASAInventors: Geoffrey CANRIGHT, Kenth ENGO-MONSEN
-
Patent number: 7689559Abstract: A device, computer program product and a method for searching, navigating or retrieving documents in a set of electronic documents, including performing a link analysis of the set of electronic documents. The link analysis includes one of analyzing at least two of the set of documents with at least a portion of a similarity graph constructed among the set of documents and analyzing the at least two of the set of documents with the at least a portion of the similarity graph and at least a portion of a hyperlink graph constructed from hyperlinks between the set of documents. Also described is a method for building a similarity matrix.Type: GrantFiled: February 8, 2006Date of Patent: March 30, 2010Assignee: Telenor ASAInventors: Geoffrey Canright, Kenth Engo-Monsen
-
Patent number: 7680812Abstract: A method, apparatus, and computer program product for a personal search engine that includes a hybrid web composed of: the similarity web, and directed hyperlinks. Components include a parser (extracting words from documents); a text relevance analyzer; a link analysis method; the similarity web; a similarity analyzer; and hyperlinks. Other components include a navigation window; and FQSs. The combination of all the above may be incorporated into a working personal search engine.Type: GrantFiled: September 16, 2005Date of Patent: March 16, 2010Assignee: Telenor ASAInventors: Geoffrey Canright, Kenth Engo-Monsen
-
Publication number: 20090296600Abstract: A method for analysis and visualization of a network is disclosed. The analysis method is based on the use of the steepest ascent graph (SAG). Specifically, the method: (i) uses the SAG to define subregions, in a way that allows iterative refinement; (ii) presents a new and highly efficient way of calculating the SAG; (iii) uses the SAG, and the definitions in (i), as the foundation of a novel method for displaying the structure of the network in a two-dimensional visualization.Type: ApplicationFiled: October 27, 2006Publication date: December 3, 2009Inventors: Geoffrey Canright, Kenth Engø-Monsen, Åsmund Weltzien
-
Patent number: 7610367Abstract: A method is capable of being used for determining an ability of a network to spread information or physical traffic. The network includes network nodes interconnected by links. The method comprises steps of: mapping a topology of the network, computing values of link strength between the nodes, computing an eigenvector centrality index for all nodes, and based on examining the eigenvector centrality of all neighboring nodes of each node, identifying nodes which are local maxima of the eigenvector centrality index as centre nodes, grouping the nodes into regions surrounding each identified centre node, assigning a role to each node from its position in a region, as centre nodes, region member nodes, border nodes, bridge nodes, dangler nodes, and measuring the susceptibility of the network to spreading, based on the number of regions, their size, and how they are connected.Type: GrantFiled: December 29, 2004Date of Patent: October 27, 2009Assignee: Telenor ASAInventors: George Canright, Kenth Engo-Monsen, Asmund Weltzien
-
Publication number: 20090252046Abstract: A system for analyzing a network including a plurality of nodes associated and/or connected together by links. The system includes a processor coupled to a data memory. The processor is configured to access a first representation of the network and associated link weight measures w in the memory. Moreover, the system is configured to provide node values for the nodes and determine from the node values corresponding slope measures for links existing between the nodes, the slope measures being computed from a function of differences in node values and from the weight measures w for the links, the weight measures w being used for scaling the function of differences in nodes values; to select for at least some of the nodes one or more steepest ascent links having one or more greatest positive slope measures; and to generate a second representation corresponding to a steepest ascent graph of the network derived from information included in the steepest ascent links.Type: ApplicationFiled: February 2, 2009Publication date: October 8, 2009Inventors: Geoffrey Canright, Kenth Engo-Monsen, Johannes Bjelland, Richard Seyler Ling, Pal Roe Sundsoy
-
Publication number: 20090141652Abstract: A method for improved spreading of information in a network is described, together with corresponding methods with the opposite aim, namely to hinder the spreading of harmful information in a network. The harmful information may be (for example) a data virus. The first method includes as its characterizing feature to connect at least one node of high Eigenvector Centrality Index in a first region with at least one node of high Eigenvector Centrality Index in a second region. These connections may be made using direct links, or with the help of a new node lying between the nodes to be connected. One method for preventing spreading of information or physical traffic in a network may include as its characterizing feature to inoculate at least one centre node by blocking any transmission of unwanted information on all links in/out of said centre node.Type: ApplicationFiled: July 6, 2007Publication date: June 4, 2009Inventors: Geoffrey Canright, Kenth Engo-Monsen
-
Patent number: 7493320Abstract: A method, device, and computer program product for ranking documents using link analysis, with remedies for sinks, including forming a metagraph from an original graph containing a link and a node; and one of reversing a link in the metagraph, and pumping a source in the metagraph.Type: GrantFiled: August 16, 2004Date of Patent: February 17, 2009Assignee: Telenor ASAInventors: Geoffrey Canright, Kenth Engø-Monsen, Mark Burgess
-
Publication number: 20070250502Abstract: A method, device and computer program product for determining an importance score for a document D in a document set by exploiting a similarity matrix/graph S or subgraph S'.Type: ApplicationFiled: April 24, 2007Publication date: October 25, 2007Inventors: Geoffrey CANRIGHT, Kenth Engo-Monsen
-
Patent number: 7281005Abstract: A method, system, and computer program product for hypertext link analysis that includes independently employing non-normalized backward and forward operators to obtain two independent weights for each document in a hypertext-linked graph, for subsequent ranking and analysis.Type: GrantFiled: October 20, 2003Date of Patent: October 9, 2007Assignee: Telenor ASAInventors: Geoffrey Canright, Kenth Engo-Monsen
-
Publication number: 20070185871Abstract: A device, computer program product and a method for searching, navigating or retrieving documents in a set of electronic documents, including performing a link analysis of the set of electronic documents. The link analysis includes one of analyzing at least two of the set of documents with at least a portion of a similarity graph constructed among the set of documents and analyzing the at least two of the set of documents with the at least a portion of the similarity graph and at least a portion of a hyperlink graph constructed from hyperlinks between the set of documents. Also described is a method for building a similarity matrix.Type: ApplicationFiled: February 8, 2006Publication date: August 9, 2007Applicant: TELENOR ASAInventors: Geoffrey Canright, Kenth Engo-Monsen
-
Publication number: 20070168533Abstract: A method is disclosed for determining the ability of a network to spread information or physical traffic. Said network includes a number of network nodes interconnected by links. The method comprises mapping the topology of a network, computing a value for link strength between the nodes, computing an Eigenvector Centrality index for all nodes, based on said link strength values identifying nodes which are local maxima of the Eigenvector Centrality index as centre nodes, grouping the nodes into regions surrounding each identified centre node, assigning a role to each node from its position in a region, as centre nodes, region member nodes, border nodes, bridge nodes, dangler nodes, and measuring the susceptibility of the network to spreading, based on the number of regions, their size, and how they are connected.Type: ApplicationFiled: December 29, 2004Publication date: July 19, 2007Inventors: Geoffrey Canright, Kenth Engo-Monsen, Asmund Weltzien
-
Publication number: 20060059144Abstract: A method, apparatus, and computer program product for a personal search engine that includes a hybrid web composed of: the similarity web, and directed hyperlinks. Components include a parser (extracting words from documents); a text relevance analyzer; a link analysis method; the similarity web; a similarity analyzer; and hyperlinks. Other components include a navigation window; and FQSs. The combination of all the above may be incorporated into a working personal search engine.Type: ApplicationFiled: September 16, 2005Publication date: March 16, 2006Applicant: TELENOR ASAInventors: Geoffrey Canright, Kenth Engo-Monsen
-
Publication number: 20060059119Abstract: A method, device, and computer program product for ranking documents using link analysis, with remedies for sinks, including forming a metagraph from an original graph containing a link and a node; and one of reversing a link in the metagraph, and pumping a source in the metagraph.Type: ApplicationFiled: August 16, 2004Publication date: March 16, 2006Applicant: TELENOR ASAInventors: Geoffrey Canright, Kenth Engo-Monsen, Mark Burgess
-
Publication number: 20050086260Abstract: A method, system, and computer program product for hypertext link analysis that includes independently employing non-normalized backward and forward operators to obtain two independent weights for each document in a hypertext-linked graph, for subsequent ranking and analysis.Type: ApplicationFiled: October 20, 2003Publication date: April 21, 2005Applicant: TELENOR ASAInventors: Geoffrey Canright, Kenth Engo-Monsen