Zoltan C Szilagyi, 47PO Box 1460, New York, NY 10163

7206776, Apr 17, 2007

Aug 15, 2002

10/222953

Zoltan C Szilagyi - Redmond WA, US
Matthew Paul Rhoten - Seattle WA, US
Philip Ti-Fei Su - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 17/30
G06F 15/16

707 3, 707 4, 709223

A locking arrangement for data structures is provided that prevents deadlocks, but still allows different threads to simultaneously obtain locks on different nodes of a data structure for both read and write operations. The locking system will fail a request to lock one or more resources in a data structure if access to those resources has already been restricted by a conflicting lock of an equal or higher priority. The locking system may also employ preemptable and non-preemptable locks such that, if a preemptable lock with a lower priority has restricted access to resources, then the locking system will preempt the lower priority lock in favor of a conflicting higher priority lock. Alternately, if a non-preemptable lock with a lower priority has restricted access to resources, then the locking system will wait until the lower priority lock is removed before implementing a requested conflicting higher priority lock.

7218779, May 15, 2007

Jan 21, 2003

10/347331

Steve Dodge - Sammamish WA, US
Alexander Gounares - Kirkland WA, US
Arin J Goldberg - Woodinville WA, US
Bodin Dresevic - Bellevue WA, US
Jerome J Turner - Redmond WA, US
Matthew Paul Rhoten - Seattle WA, US
Robert L Chambers - Sammamish WA, US
Sashi Raghupathy - Redmond WA, US
Timothy H Kannapel - Bellevue WA, US
Tobiasz Zielinski - Redmond WA, US
Zoltan C Szilagyi - Redmond WA, US

Microsoft Corporation - Redmond CA

G06K 9/34

382177, 382178, 382180, 382202, 382203

Methods for communicating between an application and an ink divider object (which stores ink strokes to be divided into groups) may include: (a) issuing a divide request to the ink divider object, optionally by the application; (b) in response to the divide request, calling a divide method, which groups the stored ink strokes into one or more groupings of strokes having a first predetermined granularity (e. g. , words, lines, paragraphs, sentences, drawings, etc. ); and (c) making information regarding the one or more groupings of strokes available to the application. This “information” made available to the application may include, for example, the actual groupings of the strokes, the number of stroke groupings having the first predetermined granularity, machine generated text corresponding to the stroke groupings, or the like. The results of the divide method may be stored in an ink division result object. In some examples, the ink division result object may include the originally divided strokes and allow retrieval of groupings of strokes of various different granularities.

7283670, Oct 16, 2007

Aug 21, 2003

10/646474

Jamie Wakeam - Redmond WA, US
Richard Duncan - Kirkland WA, US
Bodin Dresevic - Bellevue WA, US
Herry Sutanto - Kirkland WA, US
Sashi Raghupathy - Redmond WA, US
Timothy H. Kannapel - Bellevue WA, US
Zoltan Szilagyi - Redmond WA, US
Michael Shilman - Seattle WA, US

Microsoft Corporation - Redmond WA

G06K 9/18

382186

A method of analyzing electronic ink, in which document data for a document containing electronic ink content is received from a software application running on a first processing thread. The first processing thread is employed to provide the document data to an electronic ink analysis process for analyzing on a second processing thread. Control of the first processing thread is then returned to the software application. After the results of the analysis are received, the results are reconciled with the current document data for the document.

7468801, Dec 23, 2008

Aug 21, 2003

10/646473

Jamie Wakeam - Redmond WA, US
Richard Duncan - Kirkland WA, US
Bodin Dresevic - Bellevue WA, US
Herry Sutanto - Kirkland WA, US
Sashi Raghupathy - Redmond WA, US
Timothy H. Kannapel - Bellevue WA, US
Zoltan Szilagyi - Redmond WA, US
Jerome Turner - Redmond WA, US
Todd Landstad - Sammamish WA, US
Haiyong Wang - Redmond WA, US
Roman Snytsar - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 15/00
G06K 1/00
G06K 9/18

358 114, 382186, 382112, 382177, 358 115, 358 111

An application programming interface instantiates an ink analyzer object that receives document data for a document containing electronic ink content from a software application hosting the document and running on a first processing thread. The ink analyzer object then employs the first thread to make a copy of the document data, provides the copy of the document data to an electronic ink analysis process, and returns control of the first processing thread to the analysis process. After the analysis process has analyzed the electronic ink, the ink analyzer object reconciles the results of the analysis process with current document data for the document.

7502805, Mar 10, 2009

Aug 21, 2003

10/646472

Jamie Wakeam - Redmond WA, US
Richard Duncan - Kirkland WA, US
Herry Sutanto - Kirkland WA, US
Sashi Raghupathy - Redmond WA, US
Timothy H. Kannapel - Bellevue WA, US
Zoltan Szilagyi - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 7/00
G06F 17/30
G06K 9/18

707101, 707 1, 707 2, 707201, 382186

A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.

7502812, Mar 10, 2009

Jun 8, 2006

11/423030

Jamie Wakeam - Redmond WA, US
Richard Duncan - Kirkland WA, US
Herry Sutanto - Kirkland WA, US
Sashi Raghupathy - Redmond CA, US
Timothy H. Kannapel - Bellevue WA, US
Zoltan Szilagyi - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 7/00
G06F 17/30

707201, 707101, 707202, 707203

A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.

7518749, Apr 14, 2009

Nov 12, 2004

10/986160

Richard J. Duncan - Kirkland WA, US
Jamie N. Wakeam - Redmond WA, US
Zoltan C. Szilagyi - Bellevue WA, US
Jerome J. Turner - Redmond WA, US
Timothy H. Kannapel - Bellevue WA, US
Subha Bhattacharyay - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06K 9/00

358 18, 358 21, 358 12, 382181, 382182, 382187, 382189, 382190

A system, method, data structure, and application programming interface is described that stores alternate recognition results in an ink tree lattice.

7533338, May 12, 2009

Aug 21, 2003

10/644900

Richard Duncan - Kirkland WA, US
Bodin Dresevic - Bellevue WA, US
Jamie Wakeam - Redmond WA, US
Herry Sutanto - Kirkland WA, US
Sashi Raghupathy - Redmond WA, US
Timothy H. Kannapel - Bellevue WA, US
Zoltan Szilagyi - Redmond WA, US
Jerome Turner - Redmond WA, US
Todd Landstad - Redmond WA, US
Thomas Wick - Seattle WA, US
Alex Simmons - Redmond WA, US
Peter Engrav - Seattle WA, US
Kevin Phillip Paulson - Redmond WA, US
Kentaro Urata - Kirkland WA, US
Steve Dodge - Sammamish WA, US
David M. Bargeron - Seattle WA, US
Michael Shilman - Seattle WA, US

Microsoft Corporation - Redmond WA

G06F 17/00
G06F 12/00

715268, 715230, 715232, 715234, 7071041, 711113

Systems, methods, and computer-readable media for making rich, flexible, and more natural electronic ink annotations in an electronic document include creating a first context node associated with a first portion of a base portion of an electronic document; creating a second context node associated with an annotation to the base portion; and linking the second context node with the first context node.