James Xavier Kelly, III
Engineers in San Francisco, CA

8037527, Oct 11, 2011

Nov 1, 2005

11/264418

Scott Milener - San Francisco CA, US
Wendell Brown - Las Vegas NV, US
James Kelly - San Francisco CA, US

BT Web Solutions, LLC - Wilmington DE

G06F 11/00

726 22, 726 23, 726 24, 726 25, 713188

A method and apparatus for look-ahead security. Within a document (e. g. , a web page, a word processing document, a list of electronic mail messages), a link to other content or another document is selected and the content is identified before a user clicks on the link to open the content. The content is placed into a safe cache that prevents the content from adversely affecting the user's computing device. The content is scanned and/or its behavior is analyzed to detect any security threats or undesirable content (e. g. , viruses, worms, scripts, adware, spyware, pornography). Results of the analysis may be collected at a central server. The link or an associated indicator may be configured to indicate whether a threat is present; more information may be provided as desired. A user may be provided with various options to ignore a threat, disable the link, etc.

7539697, May 26, 2009

Dec 13, 2002

10/320783

Prasad N. Akella - Pleasanton CA, US
Timothy J. Connors - Menlo Park CA, US
James Kelly - San Francisco CA, US
Christopher J. Roon - Menlo Park CA, US
Andrew M. Rosenbaum - San Jose CA, US
Christopher S. Tolles - San Francisco CA, US

Spoke Software - San Mateo CA

G06F 17/30

707102, 707 10, 707101, 707201

A relationship graph representing a social network connecting multiple entities is created and maintained as nodes and edges. Data received for an entity is used to create a new node. A strength of relationship value is calculated for each relationship between the new entity and an entity represented by an existing node and assigned to an edge is created to represent each relationship. Data received for an existing node causes the node to be updated, and the strength of relationship values for each of its relationships to be recalculated and assigned to the appropriate edge. More than one node may exist for an entity and conflicts among the data of the multiple nodes are reconciled. The received data may be extracted from data sources owned by a user in accordance with privacy criteria for the user, or may result from processing data in the relationship graph.

2006010, May 11, 2006

Jul 13, 2005

11/180261

James Kelly - San Francisco CA, US
Scott Milener - San Francisco CA, US
Wendell Brown - Las Vegas NV, US

G06F 9/00

715738000

A method and apparatus for enhanced browsing. The apparatus includes a user interface for presenting an enhanced browsing window of content identified by a link in a page displayed by a browser. The apparatus may include a prefetcher for fetching or prefetching the content and a cache for storing the window. The apparatus may also include an ad interface for retrieving advertisements for display with the content. When a first page is displayed in the browser, content identified by a link to a second page is automatically fetched and an enhanced browsing window, which may initially be invisible, is built. When a user mouses-over a status indicator associated with the link, the window is automatically displayed and the user can navigate the displayed content. The status indicator may change appearance to indicate a status of the prefetching (e.g., initiated, completed, success, failure, communication error).

7512612, Mar 31, 2009

Dec 13, 2002

10/322387

Prasad N. Akella - Pleasanton CA, US
Timothy J. Connors - Menlo Park CA, US
James Kelly - San Francisco CA, US
Christopher S. Tolles - San Francisco CA, US

Spoke Software - San Mateo CA

G06F 17/30

707101, 707 3, 707 6

A relationship graph of nodes representing entities and edges representing relationships among the entities is searched to find a match on search criteria, such as an individual or a company. Paths through the relationship graph to the match are identified and a relevance value is associated with each path. A node in each path is specified as a connector for the path. The connectors and relevance values may be displayed to allow a choice of paths. If more than one match is found, a selection may be made by a user. Additionally, any matches may be filtered according to privacy rules.