Patents by Inventor Stuart John Harding Kent
Stuart John Harding Kent 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: 8997024Abstract: A method includes transmitting an interface to a display device, where the interface represents a view of at least a portion of a graph. The graph is based on a model of a system and includes a plurality of nodes connected by a plurality of links, where at least one node of the graph includes another node. The method includes receiving a command to store a placemarker corresponding to the view and storing the placemarker. The placemarker is selectable to restore the view at the interface.Type: GrantFiled: December 9, 2010Date of Patent: March 31, 2015Assignee: Microsoft Technology Licensing, LLCInventors: Stuart John Harding Kent, Blair Stuart McGlashan, Jens Kåre Jacobsen, Tyler Edward Gibson, Andrew Jude Byrne, Sadi Sufi Khan
-
Patent number: 8924385Abstract: A method for providing a query-based diagrammatic presentation of data includes generating a filter element that defines a set of groups and includes a set of declarative queries that define information to be included in the set of groups. The filter element is applied to a data source, which includes performing the set of declarative queries on the data source, thereby generating a set of query results for each of the groups. A diagram is generated that includes a set of shapes representing the set of groups, and a set of nodes nested within each of the shapes, wherein the nodes for each group are determined based on the query results for that group.Type: GrantFiled: April 12, 2011Date of Patent: December 30, 2014Assignee: Microsoft CorporationInventors: Blair Stuart McGlashan, J. Duncan C. Pocklington, Jean-Marc Prieur, Stuart John Harding Kent, Eyal Lantzman
-
Patent number: 8365129Abstract: A computer system identifies a source node that is to be connected to a target node, where the target node is connected to the source node using an edge that links a connection region associated with the source node to a candidate connection region of the target node. The computer system identifies candidate connection region constraints that place restrictions on where the candidate connection regions can be positioned on the target node and determines, based on the identified candidate connection region constraints, the position of each candidate connection region relative to the target node. At least two of the candidate connection regions are disconnected so that an edge's connection to the target node can change between the disconnected connection regions. The computer system also visually represents the position of each of the candidate connection regions of the target node.Type: GrantFiled: December 4, 2009Date of Patent: January 29, 2013Assignee: Microsoft CorporationInventors: Fabian Omar Winternitz, Kael R. Rowan, Timothy Garry Dwyer, Stuart John Harding Kent, Lev Borisovich Nachmanson
-
Publication number: 20120265773Abstract: A method for providing a query-based diagrammatic presentation of data includes generating a filter element that defines a set of groups and includes a set of declarative queries that define information to be included in the set of groups. The filter element is applied to a data source, which includes performing the set of declarative queries on the data source, thereby generating a set of query results for each of the groups. A diagram is generated that includes a set of shapes representing the set of groups, and a set of nodes nested within each of the shapes, wherein the nodes for each group are determined based on the query results for that group.Type: ApplicationFiled: April 12, 2011Publication date: October 18, 2012Applicant: Microsoft CorporationInventors: Blair Stuart McGlashan, J. Duncan C. Pocklington, Jean-Marc Prieur, Stuart John Harding Kent, Eyal Lantzman
-
Publication number: 20120151419Abstract: A method includes transmitting an interface to a display device, where the interface represents a view of at least a portion of a graph. The graph is based on a model of a system and includes a plurality of nodes connected by a plurality of links, where at least one node of the graph includes another node. The method includes receiving a command to store a placemarker corresponding to the view and storing the placemarker. The placemarker is selectable to restore the view at the interface.Type: ApplicationFiled: December 9, 2010Publication date: June 14, 2012Applicant: Microsoft CorporationInventors: Stuart John Harding Kent, Blair Stuart McGlashan, Jens Kåre Jacobsen, Tyler Edward Gibson, Andrew Jude Byrne, Sadi Sufi Khan
-
Publication number: 20110154234Abstract: In an embodiment, a computer system instantiates an interactive layout system that is configured to display a layout with various diagram portions, where each diagram portion includes layout parts and corresponding constraints identifying how the layout parts of the diagram portion are to be displayed. The computer system receives input from a user indicating that at least one of the diagram portions is to be moved. The computer system determines the manner in which each diagram portion is to be moved based on the received user input. The moving includes rotating and/or scaling the diagram portions of the layout according to the received user input, such that the layout parts remain fixed in position relative to one another, but are scaled and/or rotated to fit the surrounding layout according to the corresponding constraints. The computer system dynamically moves the layout parts of the diagram portions according to the determination.Type: ApplicationFiled: December 18, 2009Publication date: June 23, 2011Applicant: MICROSOFT CORPORATIONInventors: Fabian Omar Winternitz, Kael R. Rowan, Timothy Garry Dwyer, Stuart John Harding Kent, George G. Robertson
-
Publication number: 20110134926Abstract: A computer system identifies a source node that is to be connected to a target node, where the target node is connected to the source node using an edge that links a connection region associated with the source node to a candidate connection region of the target node. The computer system identifies candidate connection region constraints that place restrictions on where the candidate connection regions can be positioned on the target node and determines, based on the identified candidate connection region constraints, the position of each candidate connection region relative to the target node. At least two of the candidate connection regions are disconnected so that an edge's connection to the target node can change between the disconnected connection regions. The computer system also visually represents the position of each of the candidate connection regions of the target node.Type: ApplicationFiled: December 4, 2009Publication date: June 9, 2011Applicant: MICROSOFT CORPORATIONInventors: Fabian Omar Winternitz, Kael R. Rowan, Timothy Garry Dwyer, Stuart John Harding Kent, Lev Borisovich Nachmanson
-
Patent number: 7814427Abstract: A designer tool that facilitates design of an object model. The tool takes as input a computer-readable representation of a graph of objects (e.g., classes), and creates automatically one or more diagrams that depict these classes as editable trees showing their relationships and properties. These graphs naturally have a tree-like structure which is exploited by the approach. The design tool system includes a layout component that receives as input one or more of the graphs, and converts the one or more graphs into the editable treelike structure. The system further comprises a presentation component that presents the editable treelike structure as a treelike structure diagram, and facilitates user interaction therewith. The tool can be used for opening, editing and saving existing object model files or to create new ones.Type: GrantFiled: January 5, 2005Date of Patent: October 12, 2010Assignee: Microsoft CorporationInventors: Stephen John Cook, Gareth Alun Jones, Stuart John Harding Kent, Alan Cameron Wills