Patents by Inventor Joseph S. Beda
Joseph S. Beda 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).
-
Publication number: 20080229189Abstract: A new form of DHTML behaviors, called ˜Element Behaviors,” wherein a behavior component is bound to an HTML element, and not just attached to the element as with attached behaviors. A special processing instruction is used to import the Element Behavior into a Web page. Upon parsing the Web page, the Element Behavior is initialized as soon as it has been downloaded and parsed. This immediate initialization makes the Element Behavior declaratively available to bind synchronously to the element(s) it is modifying. A viewLink is a feature of Element Behaviors that permits encapsulation of a behavior component file (e.g., an HTC file) so that the structure of the HTC file is transparent to a Web page (˜primary document”) to which the HTC file is linked, but the content of the HTC file may be displayed in the primary document.Type: ApplicationFiled: May 30, 2008Publication date: September 18, 2008Applicant: Microsoft CorporationInventors: Ronald R. Martinsen, David H. Massy, Joseph S. Beda, Richard John Gardner, Bulusu K. Mohan, Alexander J. Zotov, John M. Harding, Robert A. Relyea, Markus W. Mielke, Dave Cox, Kris Markel
-
Patent number: 7417645Abstract: An element object model and a vector graphics markup language for using that element object model in a manner that allows program code developers to consistently interface with a scene graph data structure to produce graphics. The vector graphics element object model generally corresponds to shape elements and other elements including image and video elements that correlate with a scene graph object model of the scene graph. Markup may be parsed into data including elements in an element tree that is translated into the objects of a scene graph data structure. Other markup may be translated directly into data and calls that create the scene graph objects. The markup language provides distinct ways to describe an element, including a simple string format or complex property syntax, which may be named, enabling reuse in other locations in the markup.Type: GrantFiled: October 23, 2003Date of Patent: August 26, 2008Assignee: Microsoft CorporationInventors: Joseph S. Beda, Kevin T. Gallo, Adam M. Smith, Gilman K. Wong, Sriram Subramanian
-
Patent number: 7383512Abstract: A new form of DHTML behaviors, called “Element Behaviors,” wherein a behavior component is bound to an HTML element, and not just attached to the element as with attached behaviors. A special processing instruction is used to import the Element Behavior into a Web page. Upon parsing the Web page, the Element Behavior is initialized as soon as it has been downloaded and parsed. This immediate initialization makes the Element Behavior declaratively available to bind synchronously to the element(s) it is modifying. A viewLink is a feature of Element Behaviors that permits encapsulation of a behavior component file (e.g., an HTC file) so that the structure of the HTC file is transparent to a Web page (“primary document”) to which the HTC file is linked, but the content of the HTC file may be displayed in the primary document.Type: GrantFiled: September 29, 2000Date of Patent: June 3, 2008Assignee: Microsoft CorporationInventors: Ronald R. Martinsen, David H. Massy, Joseph S. Beda, Richard John Gardner, Bulusu K. Mohan, Alexander J. Zotov, John M. Harding, Robert A. Relyea, Markus W. Mielke, Dave Cox, Kris Markel
-
Patent number: 7265756Abstract: A parameterized scene graph provides mutable (animated) values and parameterized graph containers such that an application program or the like can selectively change certain aspects of the scene graph description while leaving other aspects intact, and also reuse portions of the scene graph with different parameters. To this end, mutable values are provided, which provide the higher level code with hooks into the scene graph enabling the scene description to be changed. The mutable values may be varied over time to provide animation. A parameterized graph container is also described that enables a scene graph portion to be templatized for reuse throughout a scene in a generic way. In this manner, a single parameterized graph container may be efficiently reused in a scene graph, with different values for its parameters.Type: GrantFiled: June 23, 2005Date of Patent: September 4, 2007Assignee: Microsoft CorporationInventors: Gerhard A. Schneider, Joseph S. Beda, Adam M. Smith, Kevin T. Gallo, Ashraf A. Michail
-
Patent number: 7234144Abstract: Systems and methods are provided for managing the computational resources of coprocessor(s), such as graphics processor(s), in a computing system. The systems and methods illustrate management of computational resources of coprocessors to facilitate efficient execution of multiple applications in a multitasking environment. By enabling multiple threads of execution to compose command buffers in parallel, submitting those command buffers for scheduling and dispatch by the operating system, and fielding interrupts that notify of completion of command buffers, the system enables multiple applications to efficiently share the computational resources available in the system.Type: GrantFiled: January 4, 2002Date of Patent: June 19, 2007Assignee: Microsoft CorporationInventors: Nicholas P. Wilt, Sameer A. Nene, Joseph S. Beda, III
-
Patent number: 7219340Abstract: A changeable pattern and implementation is presented in which types (used in programming environments and virtual machines) may be mutable as controlled by a programmer, and share many of the benefits of value types, without the drawbacks of value types. The changeable pattern provides flexibility for restricting the modifiability of the resultant uses of the values, as well as providing a means for providing notifications upon changes. In one implementation, a single set of changeable types is provided that derive from a common Changeable base class, and any type for which mutability is desired may derive from the Changeable class. Properties associated with the changeable define state that determines cloning and/or changeability characteristics on subsequent uses of the type. True mutability is provided via a status property of next use being set to a changeable reference state such that subsequent uses of the type do not cause a state change.Type: GrantFiled: October 23, 2003Date of Patent: May 15, 2007Assignee: Microsoft CorporationInventors: Greg D. Schechter, Joseph S. Beda
-
Patent number: 7161599Abstract: A multiple-level graphics processing system and method (e.g., of an operating system) for providing improved graphics output including, for example, smooth animation. One such multiple-level graphics processing system comprises two components, including a tick-on-demand or slow-tick high-level component, and a fast-tick (e.g., at the graphics hardware frame refresh rate) low-level component. In general, the high-level, less frequent component performs computationally intensive aspects of updating animation parameters and traversing scene data structures, in order to pass simplified data structures to the low-level component. The low-level component operates at a higher frequency, such as the frame refresh rate of the graphics subsystem, to process the data structures into constant output data for the graphics subsystem. The low-level processing includes interpolating any parameter intervals as necessary to obtain instantaneous values to render the scene for each frame of animation.Type: GrantFiled: June 27, 2002Date of Patent: January 9, 2007Assignee: Microsoft CorporationInventors: Joseph S. Beda, Gregory D. Swedberg, Oreste Dorin Ungureanu, Kevin T. Gallo, Paul C. David, Matthew W. Calkins
-
Patent number: 7145562Abstract: A hierarchy of 2D visual objects and 3D scene objects are integrated for seamless processing to render 2D images including a 2D view of a 3D scene on a 2D computer display. The processing of the 3D model objects and 2D visual objects in the visual hierarchy is integrated so that the processing is readily handed off between 3D and 2D operations. Further the number of transitions between processing visual 2D objects and 3D model objects when creating a display image has no architectural limit. A data structure integrates computer program objects for creating 3D images and 2D images in a visual tree object hierarchy having visual 2D objects or 3D scene objects pointing to 3D model objects. The data structure comprises an object tree hierarchy, one or more visual 2D objects, and one or more 3D reference or scene objects pointing to 3D model objects. The visual 2D objects define operations drawing a 2D image.Type: GrantFiled: May 3, 2004Date of Patent: December 5, 2006Assignee: Microsoft CorporationInventors: Greg D. Schechter, Joseph S. Beda, Gregory D. Swedberg, Adam M. Smith
-
Patent number: 7126606Abstract: A method and system implemented in an application programming interface (API) and an object model allows program code developers to interface in a consistent manner with a scene graph data structure to output graphics. Via the interfaces, program code writes drawing primitives such as geometry data, image data, animation data and other data to visuals that represent a drawing surface, including validation visual objects, drawing visual objects and surface visual objects. The code can also specify transform, clipping and opacity properties on visuals, and add child visuals to other visuals to build up a hierarchical scene graph. A visual manager traverses the scene graph to provide rich graphics data to lower-level graphics components.Type: GrantFiled: March 27, 2003Date of Patent: October 24, 2006Assignee: Microsoft CorporationInventors: Joseph S. Beda, Gerhard A. Schneider, Kevin T. Gallo, Adam M. Smith, Eric Vandenberg, Don Curtis
-
Patent number: 7064766Abstract: An intelligent caching data structure and mechanisms for storing visual information via objects and data representing graphics information. The data structure is generally associated with mechanisms that intelligently control how the visual information therein is populated and used. The cache data structure can be traversed for direct rendering, or traversed for pre-processing the visual information into an instruction stream for another entity. Much of the data typically has no external reference to it, thereby enabling more of the information stored in the data structure to be processed to conserve resources. A transaction/batching-like model for updating the data structure enables external modifications to the data structure without interrupting reading from the data structure, and such that changes received are atomically implemented. A method and mechanism are provided to call back to an application program in order to create or re-create portions of the data structure as needed, to conserve resources.Type: GrantFiled: June 27, 2002Date of Patent: June 20, 2006Assignee: Microsoft CorporationInventors: Joseph S. Beda, Adam M. Smith, Gerhard A. Schneider, Kevin T. Gallo, Ashraf A. Michail
-
Patent number: 6919891Abstract: A parameterized scene graph provides mutable (animated) values and parameterized graph containers such that an application program or the like can selectively change certain aspects of the scene graph description while leaving other aspects intact, and also reuse portions of the scene graph with different parameters. To this end, mutable values are provided, which provide the higher level code with hooks into the scene graph enabling the scene description to be changed. The mutable values may be varied over time to provide animation. A parameterized graph container is also described that enables a scene graph portion to be templatized for reuse throughout a scene in a generic way. In this manner, a single parameterized graph container may be efficiently reused in a scene graph, with different values for its parameters.Type: GrantFiled: June 27, 2002Date of Patent: July 19, 2005Assignee: Microsoft CorporationInventors: Gerhard A. Schneider, Joseph S. Beda, Adam M. Smith, Kevin T. Gallo, Ashraf A. Michail
-
Publication number: 20040194020Abstract: An element object model and a vector graphics markup language for using that element object model in a manner that allows program code developers to consistently interface with a scene graph data structure to produce graphics. The vector graphics element object model generally corresponds to shape elements and other elements including image and video elements that correlate with a scene graph object model of the scene graph. Markup may be parsed into data including elements in an element tree that is translated into the objects of a scene graph data structure. Other markup may be translated directly into data and calls that create the scene graph objects. The markup language provides distinct ways to describe an element, including a simple string format or complex property syntax, which may be named, enabling reuse in other locations in the markup.Type: ApplicationFiled: October 23, 2003Publication date: September 30, 2004Inventors: Joseph S. Beda, Kevin T. Gallo, Adam M. Smith, Gilman K. Wong, Sriram Subramanian
-
Publication number: 20040189667Abstract: An element object model and a vector graphics markup language for using that element object model in a manner that allows program code developers to consistently interface with a scene graph data structure to produce graphics. The vector graphics element object model generally corresponds to shape elements and other elements including image and video elements that correlate with a scene graph object model of the scene graph. Markup may be parsed into data including elements in an element tree that is translated into the objects of a scene graph data structure. Other markup may be translated directly into data and calls that create the scene graph objects. The markup language provides distinct ways to describe an element, including a simple string format or complex property syntax, which may be named, enabling reuse in other locations in the markup.Type: ApplicationFiled: March 27, 2003Publication date: September 30, 2004Applicant: MICROSOFT CORPORATIONInventors: Joseph S. Beda, Kevin T. Gallo, Adam M. Smith, Gilman K. Wong, Sriram Subramanian
-
Publication number: 20040189645Abstract: A method and system implemented in an application programming interface (API) and an object model allows program code developers to interface in a consistent manner with a scene graph data structure to output graphics. Via the interfaces, program code writes drawing primitives such as geometry data, image data, animation data and other data to visuals that represent a drawing surface, including validation visual objects, drawing visual objects and surface visual objects. The code can also specify transform, clipping and opacity properties on visuals, and add child visuals to other visuals to build up a hierarchical scene graph. A visual manager traverses the scene graph to provide rich graphics data to lower-level graphics components.Type: ApplicationFiled: October 23, 2003Publication date: September 30, 2004Inventors: Joseph S. Beda, Gerhard A. Schneider, Kevin T. Gallo, Adam M. Smith, Eric S. Vandenberg, Donald B. Curtis
-
Publication number: 20040189668Abstract: A method and system implemented in an application programming interface (API) and an object model allows program code developers to interface in a consistent manner with a scene graph data structure to output graphics. Via the interfaces, program code writes drawing primitives such as geometry data, image data, animation data and other data to visuals that represent a drawing surface, including validation visual objects, drawing visual objects and surface visual objects. The code can also specify transform, clipping and opacity properties on visuals, and add child visuals to other visuals to build up a hierarchical scene graph. A visual manager traverses the scene graph to provide rich graphics data to lower-level graphics components.Type: ApplicationFiled: March 27, 2003Publication date: September 30, 2004Applicant: MICROSOFT CORPORATIONInventors: Joseph S. Beda, Gerhard A. Schneider, Kevin T. Gallo, Adam M. Smith, Eric Vandenberg, Don Curtis
-
Publication number: 20030140179Abstract: Systems and methods are provided for managing the computational resources of coprocessor(s), such as graphics processor(s), in a computing system. The systems and methods illustrate management of computational resources of coprocessors to facilitate efficient execution of multiple applications in a multitasking environment. By enabling multiple threads of execution to compose command buffers in parallel, submitting those command buffers for scheduling and dispatch by the operating system, and fielding interrupts that notify of completion of command buffers, the system enables multiple applications to efficiently share the computational resources available in the system.Type: ApplicationFiled: January 4, 2002Publication date: July 24, 2003Applicant: Microsoft CorporationInventors: Nicholas P. Wilt, Sameer A. Nene, Joseph S. Beda
-
Publication number: 20030132937Abstract: A parameterized scene graph provides mutable (animated) values and parameterized graph containers such that an application program or the like can selectively change certain aspects of the scene graph description while leaving other aspects intact, and also reuse portions of the scene graph with different parameters. To this end, mutable values are provided, which provide the higher level code with hooks into the scene graph enabling the scene description to be changed. The mutable values may be varied over time to provide animation. A parameterized graph container is also described that enables a scene graph portion to be templatized for reuse throughout a scene in a generic way. In this manner, a single parameterized graph container may be efficiently reused in a scene graph, with different values for its parameters.Type: ApplicationFiled: June 27, 2002Publication date: July 17, 2003Inventors: Gerhard A. Schneider, Joseph S. Beda, Adam M. Smith, Kevin T. Gallo, Ashraf A. Michail
-
Publication number: 20030076328Abstract: A multiple-level graphics processing system and method (e.g., of an operating system) for providing improved graphics output including, for example, smooth animation. One such multiple-level graphics processing system comprises two components, including a tick-on-demand or slow-tick high-level component, and a fast-tick (e.g., at the graphics hardware frame refresh rate) low-level component. In general, the high-level, less frequent component performs computationally intensive aspects of updating animation parameters and traversing scene data structures, in order to pass simplified data structures to the low-level component. The low-level component operates at a higher frequency, such as the frame refresh rate of the graphics subsystem, to process the data structures into constant output data for the graphics subsystem. The low-level processing includes interpolating any parameter intervals as necessary to obtain instantaneous values to render the scene for each frame of animation.Type: ApplicationFiled: June 27, 2002Publication date: April 24, 2003Inventors: Joseph S. Beda, Gregory D. Swedberg, Oreste Dorin Ungureanu, Kevin T. Gallo, Paul C. David, Matthew W. Calkins
-
Publication number: 20030076329Abstract: An intelligent caching data structure and mechanisms for storing visual information via objects and data representing graphics information. The data structure is generally associated with mechanisms that intelligently control how the visual information therein is populated and used. The cache data structure can be traversed for direct rendering, or traversed for pre-processing the visual information into an instruction stream for another entity. Much of the data typically has no external reference to it, thereby enabling more of the information stored in the data structure to be processed to conserve resources. A transaction/batching-like model for updating the data structure enables external modifications to the data structure without interrupting reading from the data structure, and such that changes received are atomically implemented. A method and mechanism are provided to call back to an application program in order to create or re-create portions of the data structure as needed, to conserve resources.Type: ApplicationFiled: June 27, 2002Publication date: April 24, 2003Inventors: Joseph S. Beda, Adam M. Smith, Gerhard A. Schneider, Kevin T. Gallo, Ashraf A. Michail
-
Patent number: 4946906Abstract: A process for producing a polyoxymethylene-polyurethane type alloy, which comprises allowing a polyisocyanate compound, a short chain polyol with a molecular weight of 62 to 350, a long chain polyol with a number-average molecular weight of 400 to 5,000, and optionally additives to react with each other in the presence of at least one or polyoxymethylene polymers.Type: GrantFiled: June 5, 1989Date of Patent: August 7, 1990Assignee: Nippon Polyurethane Industry Co., Ltd.Inventors: Noriyoshi Yano, Toshihiko Fujita