Microsoft Technology Licensing, LLC

Microsoft Corporation

Zoltan C Szilagyi

Richard Jennings Duncan

Timothy H Kannapel

Jamie N Wakeam

Sashi Raghupathy

Herry Sutanto

Jerome J Turner

Bodin Dresevic

Alexander J Zotov

Todd M Landstad

Subha Bhattacharyay

Matthew P Rhoten

Philip Ti-Fei Su

Haiyong Wang

Gavin M Gear

Steve Dodge

Michael Shilman

Sebastian Poulose

Roman Snytsar

Alexander G Gounares

Robert L Chambers

Peter Loren Engrav

Alex Jacob Simmons

Eric B Fox

David Bargeron

Shawna Julie Davis

Arin J Goldberg

Emily K Rimas-Ribikauskas

Kevin Phillip Paulson

Tobiasz Alexander Zielinski

Eric Burns

David B Perry

Mary Michelle Quinton

Thomas R Wick

Thomas Russo

Kentaro Urata

Ernest L Pennington, Ii

Benoit Jules Jurion

Sally Liu

Harry Kaplanian

Jerome Turner

Terri L Chudzik

Peter I Lee

Lidia Schwarz

Amber P Race

Matthew Paul Rhoten

Tobiasz Zielinski

Richard J Duncan

Systems and methods are provided for controlling the appearance of application windows on a computer display screen. A user identifies either an application window currently running on the computer or a new application to be started. The user also identifies a size, shape, and screen location by inputting a geometric shape, such as by drawing a rectangle with a pen or stylus input device, on the display screen. The appearance of the application window is set based on the geometric shape. The application window is resized and moved, for a currently running application, or created, for a new application, on the display screen.

Controlling application windows in an operating system

A system and method for training a user to perform a flick gesture is described. A flick gesture is a simple gesture that may be easily detected and is characterized by minimal interference with other applications or gestures.

Gesture training

Systems and methods for processing data transform a first data structure (e.g., a hierarchical data structure) into a second data structure (e.g., using a parsing system), wherein the second data structure includes a first set of leaf nodes under a first ancestor node (additional sets of leaf nodes and/or ancestor nodes also may be defined in the second data structure). One or more potential candidate nodes for the ancestor nodes may be identified based, at least in part, on the ancestor nodes from the first data structure associated with the leaf nodes grouped under the new ancestor nodes. In at least some examples, the leaf nodes grouped under a new ancestor node will 'vote' for their original ancestor node, and the node receiving the most 'votes,' in at least some instances, will be reused as the corresponding ancestor node in the second data structure.

Voting based scheme for electronic document node reuse

The claimed subject matter provides a system and/or a method that facilitates conveying enhanced query results. An interface component can receive a query corresponding to data. A visual component can employ a search result based at least in part upon the query, wherein the search result includes a graphic identifying a location of at least one term of the query within the queried data.

Search term location graph

A system and process for enabling updates of an ink analysis document model are described.

On demand data proxy

Methods of selecting a color for an electronic ink are disclosed. A portion of a photograph may be analyzed to determine a representative color value, which may be an average color value for the portion. Depending on the photograph, more than one representative color value may be determined. A color or colors, that may include gradients in brightness or saturation levels, which will be visible on the representative color value or values, may then be determined. A color of the electronic ink is then set to the appropriate color or colors so that when a user inks on a photograph, the ink is visible.

Inking on photographs

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 differentiates locks based on a priority hierarchy. 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. This locking arrangement allows high priority operations that require higher performance and efficiency to receive preferential access to a data structure without preventing lower priority operations from accessing the data structure, while preventing deadlocks between different operations.

Priority differentiated subtree locking

A system and method for assisting with analysis and recognition of ink is described. Analysis hints may be associated with a field. The field may receive electronic ink. Based on the identity of the field and the analysis hint associated with it, at least one of analysis and recognition of ink may be assisted.

Analysis hints

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.

Electronic ink processing

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.

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

Analysis alternates in context trees

Growing community of inventors

Redmond, WA, United States of America

Zoltan C Szilagyi