Patents by Inventor Jeffrey S. Pinkston
Jeffrey S. Pinkston 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: 20230385173Abstract: Methods, systems, and computer programs provide real-time report generation. A baseline report is generated based on data, collected by a collector computing device, for events of a first event type for a period. The method receives a request from a user to present an updated report with real-time information that comprises events of the first event type during and after the period. The method further includes accessing configuration data that identifies which event types are enabled for real-time reporting for the user. When the updated report is available in real-time for the user, an event-update request is sent to the at least one device for unreported events. The new events of the first event type are received, and the updated report is generated by aggregating data from the baseline report and the received new events. Further, the method includes causing presentation of the updated report on a user interface.Type: ApplicationFiled: May 27, 2022Publication date: November 30, 2023Inventors: Syam B. PINNAKA, Jeffrey S. PINKSTON, Loretta M. MACKLEM-CLEMENTS, Ramya CHITRAKAR, Xichun XU, Rohit SARASWAT, Sangeetha M. VISWESWARAN, Jeffrey P. COLE
-
Patent number: 9201874Abstract: A nominal type framework can be configured to efficiently correlate different nominal types together based on a minimum set of common type shapes or structures. In one implementation, a developer identifies a number of different nominal types of interest (source types), and identifies the minimum set of common type shapes to be accessed by an application program. The minimum set of common type shapes can then be used to create an intermediate type (target type) to which each of the other different source types can be mapped. For example, one or more proxies can be created that map shapes of the one or more source types to corresponding shapes of the created target type. The application program created by the developer, in turn, can access, operate on, or otherwise use the mapped data of each different source type through a single target type.Type: GrantFiled: February 25, 2008Date of Patent: December 1, 2015Assignee: Microsoft Technology Licensing, LLCInventors: Clemens A. Szyperski, Quetzalcoatl Bradley, Joshua R. Williams, Christopher L. Anderson, Donald F. Box, Jeffrey S. Pinkston, Martin J. Gudgin
-
Patent number: 8756257Abstract: A common data type structure can be used to correlate access requests between applications that implement data in accordance with different types or type structures. In one implementation, a common data structure includes schemes for operations, sequences, records, and atoms (i.e., undefined). The system can then map any type structure to the schemes of the common data structure. In operation, a request for data by an application can involve identifying one or more proxies used by an application to map the data to the common data structure. The proxies map the data to the common data structure based on the shape of the data (to the extent it can be identified). The proxies then can return one or more data structures that comprise the identified mapping information. The application can then perform operations directly on the received data structures.Type: GrantFiled: November 6, 2012Date of Patent: June 17, 2014Assignee: Microsoft CorporationInventors: Clemens A. Szyperski, Quetzalcoatl Bradley, Joshua R. Williams, Christopher L. Anderson, Donald F. Box, Jeffrey S. Pinkston, Martin J. Gudgin
-
Patent number: 8751626Abstract: Embodiments provide an architecture to enable composite, autonomous composite applications and services to be built and deployed. In addition, an infrastructure is provided to enable communication between and amongst distributed applications and services. In one or more embodiments, an example architecture includes or otherwise leverages five logical modules including connectivity services, process services, identity services, lifecycle services and tools.Type: GrantFiled: October 8, 2008Date of Patent: June 10, 2014Assignee: Microsoft CorporationInventors: Jeffrey S Pinkston, Bradford H. Lovering, Donald F. Box, Stevan Swartz, Destry W. Hood
-
Patent number: 8321833Abstract: The subject disclosure relates to a syntax for a scripting language that allows data intensive applications to be written in a compact, human friendly, textual format. The scripting language can be a declarative programming language, such as the āDā programming language, which is well suited to the authoring of data intensive programs. A compact query syntax is provided for D that simplifies the expression of complex and data intensive programs. In another non-limiting aspect, conventional operator precedence is modified to accommodate the compact syntax and other unique features of a general purpose declarative programming language.Type: GrantFiled: October 3, 2008Date of Patent: November 27, 2012Assignee: Microsoft CorporationInventors: David E. Langworthy, Bradford H. Lovering, Donald F. Box, Giovanni M. Della-Libera, Jeffrey S. Pinkston, Jeffrey C. Schlimmer, John D. Doty, John L. Hamby
-
Patent number: 8307016Abstract: A common data type structure can be used to correlate access requests between applications that implement data in accordance with different types or type structures. In one implementation, a common data structure includes schemes for operations, sequences, records, and atoms (i.e., undefined). The system can then map any type structure to the schemes of the common data structure. In operation, a request for data by an application can involve identifying one or more proxies used by an application to map the data to the common data structure. The proxies map the data to the common data structure based on the shape of the data (to the extent it can be identified). The proxies then can return one or more data structures that comprise the identified mapping information. The application can then perform operations directly on the received data structures.Type: GrantFiled: February 25, 2008Date of Patent: November 6, 2012Assignee: Microsoft CorporationInventors: Clemens A. Szyperski, Quetzalcoatl Bradley, Joshua R. Williams, Christopher L. Anderson, Donald F. Box, Jeffrey S. Pinkston, Martin J. Gudgin
-
Publication number: 20100088672Abstract: The subject disclosure relates to a syntax for a scripting language that allows data intensive applications to be written in a compact, human friendly, textual format. The scripting language can be a declarative programming language, such as the āDā programming language, which is well suited to the authoring of data intensive programs. A compact query syntax is provided for D that simplifies the expression of complex and data intensive programs. In another non-limiting aspect, conventional operator precedence is modified to accommodate the compact syntax and other unique features of a general purpose declarative programming language.Type: ApplicationFiled: October 3, 2008Publication date: April 8, 2010Applicant: MICROSOFT CORPORATIONInventors: David E. Langworthy, Bradford H. Lovering, Donald F. Box, Douglas A. Walter, Giovanni M. Della-Libera, Jeffrey S. Pinkston, John D. Doty, John L. Hamby
-
Publication number: 20090216791Abstract: A nominal type framework can be configured to efficiently correlate different nominal types together based on a minimum set of common type shapes or structures. In one implementation, a developer identifies a number of different nominal types of interest (source types), and identifies the minimum set of common type shapes to be accessed by an application program. The minimum set of common type shapes can then be used to create an intermediate type (target type) to which each of the other different source types can be mapped. For example, one or more proxies can be created that map shapes of the one or more source types to corresponding shapes of the created target type. The application program created by the developer, in turn, can access, operate on, or otherwise use the mapped data of each different source type through a single target type.Type: ApplicationFiled: February 25, 2008Publication date: August 27, 2009Applicant: MICROSOFT CORPORATIONInventors: Clemens A. Szyperski, Quetzalcoatl Bradley, Joshua R. Williams, Christopher L. Anderson, Donald F. Box, Jeffrey S. Pinkston, Martin J. Gudgin
-
Publication number: 20090216778Abstract: A common data type structure can be used to correlate access requests between applications that implement data in accordance with different types or type structures. In one implementation, a common data structure includes schemes for operations, sequences, records, and atoms (i.e., undefined). The system can then map any type structure to the schemes of the common data structure. In operation, a request for data by an application can involve identifying one or more proxies used by an application to map the data to the common data structure. The proxies map the data to the common data structure based on the shape of the data (to the extent it can be identified). The proxies then can return one or more data structures that comprise the identified mapping information. The application can then perform operations directly on the received data structures.Type: ApplicationFiled: February 25, 2008Publication date: August 27, 2009Applicant: MICROSOFT CORPORATIONInventors: Clemens A. Szyperski, Quetzalcoatl Bradley, Joshua R. Williams, Christopher L. Anderson, Donald F. Box, Jeffrey S. Pinkston, Martin J. Gudgin
-
Publication number: 20090165021Abstract: Embodiments provide an architecture to enable composite, autonomous composite applications and services to be built and deployed. In addition, an infrastructure is provided to enable communication between and amongst distributed applications and services. In one or more embodiments, an example architecture includes or otherwise leverages five logical modules including connectivity services, process services, identity services, lifecycle services and tools.Type: ApplicationFiled: October 8, 2008Publication date: June 25, 2009Applicant: Microsoft CorporationInventors: Jeffrey S. Pinkston, Bradford H. Lovering, Donald F. Box, Stephen T. Swartz, Destry W. Hood
-
Publication number: 20090157872Abstract: Embodiments provide an architecture to enable composite, autonomous composite applications and services to be built and deployed. In addition, an infrastructure is provided to enable communication between and amongst distributed applications and services. In one or more embodiments, an example architecture includes or otherwise leverages five logical modules including connectivity services, process services, identity services, lifecycle services and tools.Type: ApplicationFiled: October 8, 2008Publication date: June 18, 2009Applicant: Microsoft CorporationInventors: Jeffrey S. Pinkston, Bradford H. Lovering, Donald F. Box, Steven Swartz, Destry W. Hood