Abstract: The disclosed calibration method includes a calibration phantom positioned on an adjustable table on the surface of a mechanical couch, with the phantom's centre at an estimated location for the iso-centre of a radio therapy treatment apparatus. The calibration phantom is then irradiated using the apparatus, and the relative location of the center of the calibration phantom and the iso-centre of the apparatus is determined by analyzing images of the irradiation of the calibration phantom. The calibration phantom is then repositioned by the mechanical couch applying an offset corresponding to the determined relative location of the centre of the calibration phantom and the iso-centre of the apparatus to the calibration phantom. Images of the relocated calibration phantom are obtained, to which the offset has been applied, and the obtained images are processed to set the co-ordinate system of a stereoscopic camera system relative to the iso-centre of the apparatus.

Abstract: A boat hull protection system to prevent structural and cosmetic damage to vessels and prevent them from sinking. The system includes inflatable members inflated using pneumatics such as compressed air that can be selectively inflated by a user along the stern, starboard or port sides, or bow of a given vessel. The inflatable members are inflated using a plurality of inflatable compartments housed within the inflatable members thereby allowing the system to continue being effective in light of a failure to a portion of the inflatable member.

Abstract: Disclosed are a method and system for implementing an array data type of a programming language using various data structures. The disclosed method includes a plurality of implementations in which the array data type may be implemented. The implementations provide an efficient way to retrieve elements from the array, especially in the order they are inserted into the array. The data structures also minimize the computing resources required to manage and access the array. The disclosed technique also selects one of the many implementations based on criteria such as access pattern or size of the array.

Abstract: The disclosure is related to optimizing generation of intermediate representation (IR) for a script code by eliminating redundant reference count code from the IR. The reference count code includes code that manages a reference count of an object, e.g., code that increments a reference count of the object (“incref code”) and an observer code which consumes or the execution of which depends on the reference count of the object. The IR is analyzed to identify redundant reference count code. Counters associated with the object are evaluated and upon satisfying the optimization criterion, the incref code is moved closer to the observer code. The incref code and the observer code that are adjacent to each other are identified as redundant code pair and the code pair is eliminated from the IR to generate an optimized IR. The optimized IR is further converted to an executable code.

Abstract: Disclosed are a method and system for implementing an array data type of a programming language using various data structures. The disclosed method includes a plurality of implementations in which the array data type may be implemented. The implementations provide an efficient way to retrieve elements from the array, especially in the order they are inserted into the array. The data structures also minimize the computing resources required to manage and access the array. The disclosed technique also selects one of the many implementations based on criteria such as access pattern or size of the array.

Abstract: Disclosed are a method and system for implementing an array data type of a programming language using various data structures. The disclosed method includes a plurality of implementations in which the array data type may be implemented. The implementations provide an efficient way to retrieve elements from the array, especially in the order they are inserted into the array. The data structures also minimize the computing resources required to manage and access the array. The disclosed technique also selects one of the many implementations based on criteria such as access pattern or size of the array.

Abstract: The disclosure is related to optimizing generation of intermediate representation (IR) for a script code by eliminating redundant reference count code from the IR. The reference count code includes code that manages a reference count of an object, e.g., code that increments a reference count of the object (“incref code”) and an observer code which consumes or the execution of which depends on the reference count of the object. The IR is analyzed to identify redundant reference count code. Counters associated with the object are evaluated and upon satisfying the optimization criterion, the incref code is moved closer to the observer code. The incref code and the observer code that are adjacent to each other are identified as redundant code pair and the code pair is eliminated from the IR to generate an optimized IR. The optimized IR is further converted to an executable code.