Displaying an adjustable widened virtual image

    公开(公告)号:GB2370931A

    公开(公告)日:2002-07-10

    申请号:GB0100380

    申请日:2001-01-06

    Applicant: IBM

    Abstract: An image display apparatus with a display device for displaying images and a viewing device for viewing an image in the left eye and a different image in the right eye. Two smaller images, a left image and a right image, are created from the same 2 dimensional image. The left image includes, as it's left most part, the left most part of the 2 dimensional image, the right image includes, as it's right most, the right most part of the image 2 dimensional image, and both said left and right images include a common central part of said full image. When the left and right images are displayed such that the left eye sees one image and the right eye sees the other image, the viewer sees the 2 dimensional image as a virtual image that can be wider than the viewable width of the display device. The width of the virtual image can be varied to accommodate the viewer. Shuttered glasses may be used to block the view of the right/left eyes, in synchronisation with the operation of the display device.

    Syntax validation using syntax trees

    公开(公告)号:GB2366402A

    公开(公告)日:2002-03-06

    申请号:GB0021148

    申请日:2000-08-30

    Applicant: IBM

    Abstract: Validation of a syntactical statement employing a stored syntax tree which represents all possible syntax options. The tree consists of a network of junction nodes and data nodes between a root node and an end node, where all paths through the tree lead to the end node. First, a syntactical statement is passed to the root node, where it is parsed into elementary tokens. Next, a table is created to store the tokens, and entries representing the end node of the syntax. The location of a current node in the syntax tree is also maintained, where the current node is initially the root node. Then, the potential node that can be selected from the current node and their distances from the current node are returned. The potential nodes are then compared to the stored tokens, and a potential node is selected. Finally, the location of the current node is updated and the process is repeated until the syntactical statement has been validated. Also disclosed is a syntax checker comprising a stored syntax tree which represents a body of valid syntax and a table for holding elementary tokens of syntax making up a syntactical statement to be checked.

    Managing a set of software modules in a runtime environment

    公开(公告)号:GB2506596A

    公开(公告)日:2014-04-09

    申请号:GB201217574

    申请日:2012-10-02

    Applicant: IBM

    Abstract: A method of managing software modules in a software runtime environment comprises identifying for each module in a set of modules a static dependency on another module (403). For each set of interdependent modules identifying a further subset connected by a static dependency (404) and in response to a change in state (501) of a module applying the change in states to all modules in the subset (504). Where a module has only dynamic dependencies on other software modules changes are applied only to that module. The set of software modules form an application program and dependencies are identified prior to runtime. Those modules identified as having static dependencies may be contained in a wrapper for operation within the software runtime environment. The modules may be JavaRTM modules and the runtime environment may be OSGI compliant.

    Recognition of command related items in object code

    公开(公告)号:GB2366399A

    公开(公告)日:2002-03-06

    申请号:GB0021006

    申请日:2000-08-26

    Applicant: IBM

    Abstract: A system and method of recognising command related items in a body of object code, such as command names and/or associated option names involves entering a list of required command names and/or option names in programming language form into a filter table. The object code is then scanned for all bit strings potentially representing command names and identifying such names. For each potential command name, succeeding bits are then examined for bits which represent valid options for each said command name so as to further confirm the identity of commands having valid combinations of command names and/or options. Optionally, the command/option syntax may also be checked. The candiate commands, including options, now identified in programming language form are then compared with the entries in the filter table to determine whether or not they match the required list, which may be further refined by use of logical operators.

Patent Agency Ranking