Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

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

Abstract: 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.

Abstract: 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.

Abstract: 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.

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

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Methods and systems for providing operating system support of computer telephone sets are described. Services are provided to standardize the interactions between computer telephony applications and telephone sets, to unify those interactions into a coherent whole, and to simplify the interactions by automatically performing common tasks. A default Telephone Manager provides all the functionality needed to support basic telephony. With all call processing performed on the host computer, telephone sets attached to the host need have no native intelligence. Support for transporting voice to distant locations is provided entirely by the host computer rendering the telephone set independent of any transport technology.

Abstract: A system, method, and data structure are described that permit schemas to be written for ink. In a first example, a schema may be written for addressing various nodes types in a hierarchy of ink. In another example, a schema may be written defining user interactions. Finally, these schemas may be combined to provide extensibility of new interaction models.

Abstract: 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.