Patents by Inventor Matthew J. Warren

Matthew J. Warren 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: 20240139689
    Abstract: Halogen-free, microporous polyolefin membranes are disclosed herein. The halogen-free, microporous polyolefin membranes can be manufactured using an environmentally friendly manufacturing process that includes extrusion of polymer-plasticizer mixtures followed by sheet formation and extraction of the plasticizer with a halogen-free solvent. The halogen-free solvent has a flashpoint greater than about 23° C. and an initial boiling point at least about 50° C. lower than the flashpoint of the plasticizer. The process can further be a closed loop process in which the halogen-free solvent can be reused.
    Type: Application
    Filed: January 9, 2024
    Publication date: May 2, 2024
    Inventors: Weston J. Wood, Don Spitz, Matthew Alan Warren, Cory S. Rogers, Richard W. Pekala
  • Patent number: 11372630
    Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.
    Type: Grant
    Filed: February 17, 2020
    Date of Patent: June 28, 2022
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Matthew J. Warren, Mads Torgersen, Renaud Paquay, Neal M. Gafter, Jared Parsons, David N. Schach, Aleksey V. Tsingauz, Peter Golde, Kevin Andrew Pilch, Karen Liu
  • Publication number: 20200183667
    Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.
    Type: Application
    Filed: February 17, 2020
    Publication date: June 11, 2020
    Inventors: Matthew J. Warren, Avner Y. Aharoni, Mads Torgersen, Renaud Paquay, Neal M. Gafter, Jared Parsons, David N. Schach, Aleksey V. Tsingauz, Peter Golde, Kevin Pilch-Bisson, Karen Liu
  • Patent number: 10678331
    Abstract: An input device for a graphical user interface is provided. The device includes a finger sensor component for attachment to a finger of a user's hand, a touch sensitive elongate member for positioning along the finger, a thumb sensor component attached to a thumb of the user's hand, and a touch sensitive elongate member for positioning along the thumb. The finger and thumb sensors sense an intersection of contact between the two touch sensitive elongate members to define an input of a coordinate in a two-dimensional plane of a graphical user interface as defined by the lengths of the elongate members providing axis dimensions. The device also includes a pressure sensitive to sense a discrete input event by increased pressure at the intersection of contact of the two touch sensitive elongate members. The device communicates sensed inputs to a remote graphical user interface.
    Type: Grant
    Filed: July 31, 2018
    Date of Patent: June 9, 2020
    Assignee: International Business Machines Corporation
    Inventors: Matthew J. Warren, Laura F. Storey, Dominik Ullmann, Fraser I. MacIntosh
  • Patent number: 10564944
    Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.
    Type: Grant
    Filed: January 7, 2010
    Date of Patent: February 18, 2020
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Matthew J. Warren, Avner Y. Aharoni, Mads Torgersen, Renaud Paquay, Neal M. Gafter, Jared Parsons, David N. Schach, Aleksey V. Tsingauz, Peter Golde, Kevin Pilch-Bisson, Karen Liu
  • Publication number: 20200042085
    Abstract: An input device for a graphical user interface is provided. The device includes a finger sensor component for attachment to a finger of a user's hand, a touch sensitive elongate member for positioning along the finger, a thumb sensor component attached to a thumb of the user's hand, and a touch sensitive elongate member for positioning along the thumb. The finger and thumb sensors sense an intersection of contact between the two touch sensitive elongate members to define an input of a coordinate in a two-dimensional plane of a graphical user interface as defined by the lengths of the elongate members providing axis dimensions. The device also includes a pressure sensitive to sense a discrete input event by increased pressure at the intersection of contact of the two touch sensitive elongate members. The device communicates sensed inputs to a remote graphical user interface.
    Type: Application
    Filed: July 31, 2018
    Publication date: February 6, 2020
    Inventors: Matthew J. Warren, Laura F. Storey, Dominik Ullmann, Fraser I. MacIntosh
  • Patent number: 10049554
    Abstract: An apparatus for an embedded sensor cable assembly, where a first cable assembly includes a cable portion and a connector portion. The cable portion includes a first embedded sensor and a second embedded sensor, where the first embedded sensor is electrically coupled to the second embedded sensor and where the first embedded sensor and the second embedded sensor is capable of registering orientation measurements. A microcontroller is electrically coupled to the connector portion, first embedded sensor and the second embedded sensor, where the microcontroller is capable of receiving the orientation measurements from the first embedded sensor and the second embedded sensor.
    Type: Grant
    Filed: May 11, 2017
    Date of Patent: August 14, 2018
    Assignee: International Business Machines Corporation
    Inventors: Dawn N. Ahukanna, Fraser I. MacIntosh, Laura F. Storey, Dominik Ullmann, Matthew J. Warren
  • Patent number: 9940814
    Abstract: An apparatus for an embedded sensor cable assembly, where a first cable assembly includes a cable portion and a connector portion. The cable portion includes a first embedded sensor and a second embedded sensor, where the first embedded sensor is electrically coupled to the second embedded sensor and where the first embedded sensor and the second embedded sensor is capable of registering orientation measurements. A microcontroller is electrically coupled to the connector portion, first embedded sensor and the second embedded sensor, where the microcontroller is capable of receiving the orientation measurements from the first embedded sensor and the second embedded sensor.
    Type: Grant
    Filed: October 2, 2017
    Date of Patent: April 10, 2018
    Assignee: International Business Machines Corporation
    Inventors: Dawn N. Ahukanna, Fraser I. MacIntosh, Laura F. Storey, Dominik Ullmann, Matthew J. Warren
  • Patent number: 9736270
    Abstract: An operation (such as a relational query) may be processed on a processing engine (such as a relational database server) on behalf of a client. A conventional processing involves the delivery of the operation to the processing engine, which executes the entire operation to completion and returns a result data set. It may be more efficient to allocate part of the operation to be performed on the client, but a developer may be unable or unavailable to rewrite the operation in a distributed manner. Instead, the operation may be automatically partitioned into a pre-engine client portion, a processing engine portion, and a client portion, and the instructions of each portion may be automatically allocated respectively to the client, the server, and the client. The partitioning may be adjusted to conserve computing resources, such as bandwidth and storage, and the instructions may be reordered to improve the processing of the operation.
    Type: Grant
    Filed: January 25, 2013
    Date of Patent: August 15, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Erik Meijer, Dinesh Chandrakant Kulkarni, Matthew J. Warren, Anders Hejlsberg
  • Patent number: 9712646
    Abstract: An operation (such as a relational query) may be processed on a processing engine (such as a relational database server) on behalf of a client. A conventional processing involves the delivery of the operation to the processing engine, which executes the entire operation to completion and returns a result data set. It may be more efficient to allocate part of the operation to be performed on the client, but a developer may be unable or unavailable to rewrite the operation in a distributed manner. Instead, the operation may be automatically partitioned into a pre-engine client portion, a processing engine portion, and a client portion, and the instructions of each portion may be automatically allocated respectively to the client, the server, and the client. The partitioning may be adjusted to conserve computing resources, such as bandwidth and storage, and the instructions may be reordered to improve the processing of the operation.
    Type: Grant
    Filed: January 25, 2013
    Date of Patent: July 18, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Erik Meijer, Dinesh Chandrakant Kulkami, Matthew J. Warren, Anders Hejlsberg
  • Patent number: 9524275
    Abstract: Methods, systems and computer program products are provided for selectively translating documents. For example, a computer system may be provided that selectively loads a specified portion of a document in a meta-markup language into system memory. Portions of the document that are not specified remain unloaded into the system memory. Once the specified portions of the document have been loaded into memory, the computer system translates the selectively loaded portion of the document from one format to another format. Translated portions of the document may then be provided, in some cases, to entities such as users, software applications or data stores. At least some portions of the document that were not specified or selected for loading into memory remain untranslated and unloaded into system memory. As such, unnecessary loading and translating of unspecified portions of the document is avoided.
    Type: Grant
    Filed: April 18, 2013
    Date of Patent: December 20, 2016
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Nithyalakshmi Sampathkumar, Matthew J. Warren, Martin Maly, Mark W. Fussell
  • Patent number: 9075667
    Abstract: A static type, called “dynamic”, is introduced into a statically bound programming language. An expression or subexpression that is defined as a static type called “dynamic” in the source code of a program written in the statically bound programming language, is bound based on its runtime type instead of on its compile time type. Binding can be performed based on a mixture of compile time and runtime types that are based on the specification of types of expressions in source code. This type of binding is called hybrid binding. Operations are bound using the runtime type of constituent expressions (i.e., the runtime type of a receiver, an argument, or an operand) typed as dynamic and the compile time type of static constituents. If any constituent expression of an operation is dynamic, binding occurs at runtime instead of at compile time.
    Type: Grant
    Filed: May 21, 2009
    Date of Patent: July 7, 2015
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Mads Torgersen, Anders Hejlsberg, James J. Hugunin, Matthew J. Warren, Neal Gafter, Lucian Jules Wischik, Robert Eric Lippert, Samuel Y. Ng, Christopher Joseph Burrows, Alex C. Turner
  • Patent number: 8918767
    Abstract: The present invention extends to methods, systems, and computer program products for transforming source code to await execution of asynchronous operations. Embodiments of the invention simplify authoring and use of asynchronous methods, by generating statements that use well-defined awaitable objects to await completion of asynchronous operations. For example, a computer system can transform a statement that requests to await the completion of an asynchronous operation into a plurality of statements that use a predefined pattern of members of an awaitable object corresponding the asynchronous operation. The pattern can include one or more members configured to return a completion status of the asynchronous operation, one or more members configured to resume execution of the asynchronous method at a resumption point when the asynchronous operation completes, and one or more members configured to retrieve completion results.
    Type: Grant
    Filed: June 16, 2011
    Date of Patent: December 23, 2014
    Assignee: Microsoft Corporation
    Inventors: Stephen Harris Toub, Mads Torgersen, Lucian Jules Wischik, Anders Hejlsberg, Niklas Gustafsson, Dmitry Lomov, Matthew J. Warren
  • Patent number: 8819046
    Abstract: Data source queries may be specified in various languages, such as SQL, XQuery, and object-oriented languages, and each language may have various linguistic features that enable different types of queries. It may be advantageous to formulate mixed language queries having portions specified in a first language and portions specified in a second language, and to provide mixed language query evaluation components that can parse portions of queries of different languages. It may also be advantageous to permit the translation of single language queries into multiple languages to be parsed by such mixed language query evaluation components. Such techniques may permit queries to utilize linguistic features and processing techniques of one language that are less efficient, less direct, or simply unavailable in another language.
    Type: Grant
    Filed: June 24, 2008
    Date of Patent: August 26, 2014
    Assignee: Microsoft Corporation
    Inventors: Matthew J. Warren, Anders Hejlsberg, Ion Vasilian, Erik Meijer, Dinesh C. Kulkarni
  • Patent number: 8713048
    Abstract: Queries targeting various data sources are processed in a query processing pipeline that parses the query into a set of operations (e.g., an expression tree or a translated SQL query) using a set of query operators, each handling a particular type of operation. The query operators are often designed in an unspecialized manner, such that each query operator handles one query operation in an atomic, generic manner (e.g., sorting generic data items for an ORDER BY clause.) More efficient queries may be devised by including specialized queries that operate in common but special cases, such as a sorting of a particular data type (e.g., a floating-point number sort) or a sequence of two or more operations that are often performed together (e.g., a WHERE test of an attribute followed by a SELECT of the same attribute.) The use of specialized operators may result in the formulation of more efficient queries.
    Type: Grant
    Filed: June 24, 2008
    Date of Patent: April 29, 2014
    Assignee: Microsoft Corporation
    Inventors: Erik Meijer, Mads Torgersen, Anders Hejlsberg, Matthew J. Warren, John W. Dyer
  • Patent number: 8572585
    Abstract: The present invention extends to methods, systems, and computer program products for representing various programming elements with compiler-generated tasks. Embodiments of the invention enable access to the future state of a method through a handle to a single and composable task object. For example, an asynchronous method is rewritten to generate and return a handle to an instance of a builder object, which represents one or more future states of the asynchronous method. Information about operation of the asynchronous method is then passed through the handle. Accordingly, state of the asynchronous method is trackable prior to and after completing.
    Type: Grant
    Filed: June 16, 2011
    Date of Patent: October 29, 2013
    Assignee: Microsoft Corporation
    Inventors: Stephen Harris Toub, Mads Torgersen, Lucian Jules Wishchik, Anders Hejlsberg, Dmitry Lomov, Matthew J. Warren, Robert Eric Lippert
  • Patent number: 8555261
    Abstract: A system and method for parsing XML is provided. The method includes associating an input stream with a pull model parser, accepting requests to selectively parse out XML items from the input stream and retrieving metadata information associated with the parsed out XML items. The method further includes checking the pulled XML item to determine whether it conforms to XML syntax and/or semantic standards and validating the pulled XML item to determine whether it conforms to a selected DTD.
    Type: Grant
    Filed: June 28, 2001
    Date of Patent: October 8, 2013
    Assignee: Microsoft Corporation
    Inventors: Anders Hejlsberg, Christopher J. Lovett, Matthew J. Warren, Chia-Hsun Chen, Mark W. Fussell, Neetu Rajpal
  • Publication number: 20130232406
    Abstract: Methods, systems and computer program products are provided for selectively translating documents. For example, a computer system may be provided that selectively loads a specified portion of a document in a meta-markup language into system memory. Portions of the document that are not specified remain unloaded into the system memory. Once the specified portions of the document have been loaded into memory, the computer system translates the selectively loaded portion of the document from one format to another format. Translated portions of the document may then be provided, in some cases, to entities such as users, software applications or data stores. At least some portions of the document that were not specified or selected for loading into memory remain untranslated and unloaded into system memory. As such, unnecessary loading and translating of unspecified portions of the document is avoided.
    Type: Application
    Filed: April 18, 2013
    Publication date: September 5, 2013
    Inventors: Nithyalakshmi Sampathkumar, Matthew J. Warren, Martin Maly, Mark W. Fussell
  • Publication number: 20130152061
    Abstract: An augmented parser can create an augmented parse tree that captures all the information in the source code as additional elements. Information included in the augmented parse tree can include whitespace, comments, pre-processor directives, line continuation characters, missing text, text errors, and original text. Thus, the augmented parse tree can be used to fully reconstruct the original source code, character for character, including spaces, comments, and incorrect code. The improved parser can store syntactic error information in the original source code in the parse tree. The augmented parse tree can be used to generate or modify source code. The parse tree created by the augmented parser can be used for incremental parsing to create a new augmented parse tree after a change.
    Type: Application
    Filed: December 12, 2011
    Publication date: June 13, 2013
    Applicant: Microsoft Corporation
    Inventors: Peter Golde, Matthew J. Warren, Neal M. Gafter, HeeJae Chang
  • Patent number: 8375044
    Abstract: Queries against data sources (such as language-integrated queries to be applied against relational databases) may be prepared for processing by a query processing pipeline. This pipeline performs services including transforming the query into a form more easily applied by the data source, e.g., into SQL, by matching query terms with query operators configured to handle various query operations. Many query processing pipelines include single-item query operators that perform individual operations (e.g., an updating query operator that specifies an updating of individual records of a table.) An integrated query pipeline may be devised that includes both single-item query operators and multiple-item query operators that specify operations on sets of data items.
    Type: Grant
    Filed: June 24, 2008
    Date of Patent: February 12, 2013
    Assignee: Microsoft Corporation
    Inventors: Evgueni Zabokritski, Matthew J. Warren, Anders Hejlsberg, Luca Bolognese, Erik Meijer, Dinesh Chandrakant Kulkarni