Patents by Inventor Peter Francis Ostertag
Peter Francis Ostertag 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: 7337401Abstract: A composite user interface element can be assembled from plural sub-elements. A simplified view of the representation of the user interface element can be provided wherein the composited user interface element appears to be a single element. When defined, various nodes for representing the user interface can be designated as selectively exposable. Such selectively exposable nodes can be ignored when performing operations via the simplified view. Accordingly, programmers can write code that need not take the complexity of the composite user interface element into account. Property determination can be done in light of the selectively exposable nodes. A simplified view can support nested user interface elements having respective selectively exposable nodes.Type: GrantFiled: December 18, 2002Date of Patent: February 26, 2008Assignee: Microsoft CorporationInventors: Peter Francis Ostertag, Mark James Finocchio, Michael Edward Dulac Winser, Benjamin Franklin Wang Jen-Shong Carter, Nicholas Kramer, Samuel Watkins Bent, Namita Gupta
-
Patent number: 7263654Abstract: A system and related techniques accept extensible application markup language (XAML) inputs corresponding to object trees, such as those representing user interface elements, and map those inputs to a binary construct. A mapping engine may generate tokenized binary outputs representing the XAML file input and ultimately the associated user interface or other object. The binary representation generated by the mapping engine may be optimized in multiple ways, including to encode dimension information such as length, width etc. of dialog boxes or other elements in the binary representation without a necessity for explicit definition. Other optimizations include the type indexing of data types when a novel instance of the type is first encountered, and embedding loader definitions to load the object or data reflected in the binary representation without having to do a lookup against loader lists.Type: GrantFiled: April 27, 2005Date of Patent: August 28, 2007Assignee: Microsoft CorporationInventors: Roger Grambihler, Peter Francis Ostertag, Michael John Hillberg
-
Patent number: 7237194Abstract: A system and related techniques accept extensible application markup language (XAML) inputs corresponding to object trees, such as those representing user interface elements, and map those inputs to a binary construct. A mapping engine may generate tokenized binary outputs representing the XAML file input and ultimately the associated user interface or other object. The binary representation generated by the mapping engine may be optimized in multiple ways, including to encode dimension information such as length, width etc. of dialog boxes or other elements in the binary representation without a necessity for explicit definition. Other optimizations include the type indexing of data types when a novel instance of the type is first encountered, and embedding loader definitions to load the object or data reflected in the binary representation without having to do a lookup against loader lists.Type: GrantFiled: November 18, 2003Date of Patent: June 26, 2007Assignee: Microsoft CorporationInventors: Roger Grambihler, Peter Francis Ostertag, Michael John Hillberg
-
Patent number: 7188340Abstract: A hybrid tree data structure is suitable for use in scenarios involving intermingled text and user interface elements. Trees of two different types can be combined via one or more proxy nodes. For example, one type can be efficient at processing user interface elements and another can be efficient at processing text. Operations suitable for user interface elements can be efficiently performed on portions of the hybrid tree having user interface elements, and operations suitable for sequential data can be efficiently performed on portions of the hybrid tree having sequential data. The structure is thus suited for representing documents or graphical user interfaces. A hypertext document can be represented via the hybrid tree to enable more efficient searching, navigation, rendering, or editing of the document. Hybrid tree services can be provided by an operating system service.Type: GrantFiled: June 28, 2002Date of Patent: March 6, 2007Assignee: Microsoft CorporationInventors: Peter Francis Ostertag, Michael J. Hillberg, Jeffrey L. Bogdan, Robert A. Relyea
-
Publication number: 20040122789Abstract: A composite user interface element can be assembled from plural sub-elements. A simplified view of the representation of the user interface element can be provided wherein the composited user interface element appears to be a single element. When defined, various nodes for representing the user interface can be designated as selectively exposable. Such selectively exposable nodes can be ignored when performing operations via the simplified view. Accordingly, programmers can write code that need not take the complexity of the composite user interface element into account. Property determination can be done in light of the selectively exposable nodes. A simplified view can support nested user interface elements having respective selectively exposable nodes.Type: ApplicationFiled: December 18, 2002Publication date: June 24, 2004Applicant: Microsoft CorporationInventors: Peter Francis Ostertag, Mark James Finocchio, Michael Edward Dulac Winser, Benjamin Franklin Wang Jen-Shong Carter, Nicholas Kramer, Samuel Watkins Bent, Namita Gupta
-
Publication number: 20040003349Abstract: A span of data in content having an associated hierarchical representation can be specified as a content segment. The span of data can be specified without modifying the hierarchical representation for the content. Events and properties can be specified for the content segment. If desired, content segments can be stacked on top of one another, and they can overlap. Disjoint (e.g., non-contiguous) content segments can be designated, and sub-segments can be processed. A variety of operations can be performed for the content segments, and a user interface service can provide a variety of services for content segments.Type: ApplicationFiled: December 18, 2002Publication date: January 1, 2004Applicant: Microsoft CorporationInventors: Peter Francis Ostertag, Alex Mogilevsky, Michael J. Hillberg, Nicholas Kramer
-
Publication number: 20040003348Abstract: A hybrid tree data structure is suitable for use in scenarios involving intermingled text and user interface elements. Trees of two different types can be combined via one or more proxy nodes. For example, one type can be efficient at processing user interface elements and another can be efficient at processing text. Operations suitable for user interface elements can be efficiently performed on portions of the hybrid tree having user interface elements, and operations suitable for sequential data can be efficiently performed on portions of the hybrid tree having sequential data. The structure is thus suited for representing documents or graphical user interfaces. A hypertext document can be represented via the hybrid tree to enable more efficient searching, navigation, rendering, or editing of the document. Hybrid tree services can be provided by an operating system service.Type: ApplicationFiled: June 28, 2002Publication date: January 1, 2004Applicant: Microsoft CorporationInventors: Peter Francis Ostertag, Michael J. Hillberg, Jeffrey L. Bogdan, Robert A. Relyea