Abstract: A computer-implemented method includes storing a plurality of scheduled elements in a memory area, displaying a time horizon via a display device, and displaying a first portion of the plurality of scheduled elements within the time horizon. In response to a user input, the time horizon is adjusted and a second portion of the plurality of scheduled elements is displayed within the adjusted time horizon.

Abstract: Computer simulation generates improved 3D images of human movement involving an object associated with the human character. A set of axes in 3 dimensional space is originally defined for tracking orientation of the human character in a 3D image. This set of axes is subsequently automatically applied to and used for object(s) carried by the human character. The object is displayed at a constant (same, unchanged) orientation while the human character is illustrated moving in certain ways in succeeding 3D images.

Abstract: A computer-implemented method for defining a group of virtual objects representative of physical objects includes receiving a user input via an input device, wherein the user input relates to at least one virtual object. The method also includes using a processor to determine a purpose of the user input, modifying an object group with respect to the virtual object based on the purpose of the user input, and storing the relationship between the object group and the object in a memory area.

Abstract: A computer-implemented method for filtering components from a logical component hierarchy is provided. The method uses a computing device having a processor and a memory. The method includes identifying, in the memory, a filter associated with the logical component hierarchy. The method also includes comparing, by the processor, a sub-component of the logical component hierarchy with the filter. The method further includes identifying the sub-component for filtration based on the comparison of the sub-component with the filter. The method also includes filtering the sub-component from the logical component hierarchy.

Abstract: A computer-implemented method is provided for use in location correction of virtual objects in a virtual model of a real-world scene. Location of an object consists of both position and orientation of the virtual object. The method includes generating the virtual model, including a virtual object, and acquiring at least one digital image of a real-world object within the real-world scene, wherein the real-world object corresponds to the virtual object. The method also includes calculating an image-based positional difference between at least one predefined point on the virtual object and at least one corresponding point on the real-world object, adjusting the position and/or the orientation of the virtual object based on this image positional difference, and adjusting the virtual model with respect to the corrected location of the virtual object.

Abstract: A computer-implemented method for use in maintaining currency of a projection index of a plurality of database objects. The computer-implemented method includes creating the projection index representative of a connection between a first database object and at least a second database object, determining an entity dependency between the first database object and at least the second database object, determining a path dependency between the first database object and at least the second database object, and updating the projection index in response to a modification of one or both of the entity dependency and the path dependency.

Abstract: A computer-implemented method for providing security in a relational database hosted by a first server, and configured to interact with a second server, includes associating a first ownership vector with an object in the relational database, detecting a change to the object, and associating a second ownership vector with the object in response to detecting the change to the object.

Abstract: A computer-implemented method includes creating a video record of user interactions with a computer program, and displaying a control area configured to receive a rewind user command and an advance user command. In response to receiving the rewind user command, the computer program reverts to a first state that is prior to at least one of the recorded user interactions. In response to receiving the advance user command, the computer program progresses to a second state that is between the first state and a last-known state of the computer program.

Abstract: A computer system and method provides access to Web (global computer network) services data of a target system. The target system exposes data through multiple web services. An application interface is adapted to interface with the target system re-using existing (predefined) web services among applications for the target system. The application interface queries the exposed data. A mapping member maps between application interface query of exposed data and syntax of objects useable in a subject application. The mapping member enables the subject application to access data of object instances generated in response to the query.

Abstract: The number and complexity of the individual computations required to automatically identify geometrical constraints in a two dimensional model are reduced by indexing line vectors associated with individual line segments and tangent vectors associated with individual circular arcs in a polar quadtree index separate and distinct from a Cartesian quadtree index used to index individual points and circles, as well as the end points of the individual line segments and arcs, and the centers of the individual arcs. The Cartesian quadtree is used to identify constraints between point elements, and the polar quadtree is used to identify constraints between line elements. In order to determine whether there is a point-on relationship between a point element and a line element, the line element (which may be a Circle or an arc) is used to define one or more search paths through adjoining nodes of the Cartesian quadtree.

Abstract: A computerized method of drawing provides sketching-type drawing capabilities in a computer-aided design (CAD) environment. Geometrical drawing parts or elements, sketched through a hand-controlled indicator and lacking in the precision criteria or standards associated with formal drawings, are recognized and interpreted as points, straight lines, open arcs, circles and ellipses. Delete and “areafill” symbols, similarly, are recognized and interpreted. The method also provides the capability to distinguish and interpret relatively complex, multiple-part or element strokes. This is done by determining break locations for the elements along the stroke, and by recognizing these elements before re-constituting a stroke meeting precision criteria. A variety of geometrical constraints which are important in a CAD environment, including coincidence, parallelism, tangency and relimitation, are also recognized and imposed.

Abstract: Projection lines from related elements are used to connect the related elements in aligned views and points on an auxiliary foldline are used to connect projection lines from related elements in two offset non-aligned views. 2-dimensional constraints are automatically generated between the related elements and the respective projection lines, and between each point on the auxiliary foldline and the two respective projection lines through that point, to represent a corresponding 3-dimensional constraint between the related elements. The 3-dimension constraints may include "coplanar" (two lines representing a common plane normal to the planes of two views), "line-on" (a line represented by a point in one view is on a plane represented by a line in another view), and "tangent plane" (a plane represented by a line in one view is tangent to a cylinder represented by a circle in another view).

Abstract: The number and complexity of the individual computations required to automatically identify geometrical constraints in a two dimensional model are reduced by indexing line vectors associated with individual line segments and tangent vectors associated with individual circular arcs in a polar quadtree index separate and distinct from a Cartesian quadtree index used to index individual points and circles, as well as the end points of the individual line segments and arcs, and the centers of the individual arcs. The Cartesian quadtree is used to identify constraints between point elements, and the polar quadtree is used to identify constraints between line elements. In order to determine whether there is a point-on relationship between a point element and a line element, the line element (which may be a circle or an arc) is used to define one or more search paths through adjoining nodes of the Cartesian quadtree.