Abstract: Methods and systems are provided for adjusting an EGR valve operation based on results from an EGR valve diagnostic. In one example, a method may include executing the EGR valve diagnostic during an engine deactivation, wherein the EGR valve diagnostic estimates an EGR valve stickiness used to adjust the EGR valve operation.

Abstract: Methods and systems are provided for an EGR valve diagnostic. In one example, a method may include actuating an EGR valve between first and second positions. The method may further includes determining one or more characteristics of the EGR valve during the diagnostic to determine if an EGR valve cleaning is desired.

Abstract: Described herein is an x-ray tube assembly that includes: a housing that encloses an inner volume; a movable divider within the inner volume, the movable divider dividing the inner volume into a first volume and a second volume; an x-ray tube within the first volume; the first volume between the housing and the x-ray tube filled with an insulating fluid; and the second volume filled with a compressible gas.

Abstract: Methods and systems are provided for adjusting an EGR valve operation based on results from an EGR valve diagnostic. In one example, a method may include executing the EGR valve diagnostic during an engine deactivation, wherein the EGR valve diagnostic estimates an EGR valve stickiness used to adjust the EGR valve operation.

Abstract: Methods and systems are provided for an EGR valve diagnostic. In one example, a method may include actuating an EGR valve between first and second positions. The method may further includes determining one or more characteristics of the EGR valve during the diagnostic to determine if an EGR valve cleaning is desired.

Abstract: Described herein is an x-ray tube assembly that includes: a housing that encloses an inner volume; a movable divider within the inner volume, the movable divider dividing the inner volume into a first volume and a second volume; an x-ray tube within the first volume; the first volume between the housing and the x-ray tube filled with an insulating fluid; and the second volume filled with a compressible gas.

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

Abstract: The present invention relates to a coated particle including a particle including at least one chelating agent of the formula COOH—CHX—N—(CH2—COOH)2, wherein X stands for carboxyalkyl, alkyl, hydroxyalkyl or aminoalkyl, and alkyl is a C1-C4 alkyl group, and the coating on the particle includes at least one scale-inhibiting additive, a process to prepare such particle, and to the use thereof in detergents, in oil field applications, in agriculture and in water treatment.

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

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

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

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

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

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

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

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

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