Abstract: A counter-rotating turbine for a turbine engine comprising an inner rotor having an inner drum to which is attached a plurality of inner impellers rotatably supported by a first shaft, an outer rotor comprising an outer drum to which is fastened a plurality of outer impellers rotatably supported by a second shaft coaxial with the first shaft, the outer rotor comprising a downstream impeller having a plurality of downstream moving blades extending between an outer shroud and an inner shroud, one upstream end of the outer shroud being attached downstream of said outer drum, the inner shroud being attached to the second shaft, at least one of the inner shroud and of the outer shroud comprising at least one flexible transition part configured to allow elastic deformation of said shroud in the radial direction.

Abstract: A method of testing a weld joint includes: preparing a part that includes at least one weld joint which joins at least two metal components with one another; machining at least one hole in the at least one weld joint; inserting, into the at least one port hole, a probe that includes a mirror attached to a camera; and reflecting an image of the weld joint off of the minor and to the camera while the probe is inserted into the at least one port hole. A method of analyzing a weld joint includes: machining a port hole in the weld joint; etching the weld joint; inserting a probe into the port hole, the probe including a minor; reflecting an image of the weld joint off of the mirror towards a camera; capturing the image with the camera; and analyzing the weld joint using the image captured by the camera.

Abstract: A stamp tool assembly is provided that includes a forming cavity for shaping a blank into a formed part. The stamp tool assembly includes adjustable block assembly for modifying the amount of material draw-in from subsequently stamped blanks. A draw-in sensor measures the amount of material from the blanks that is not drawn-into the forming cavity during each stroke. Based on the readings from the draw-in sensor, the adjustable block assembly is expanded or reduced. The adjustable block assembly includes a pair of opposing inclined plates having interlocking teeth such that movement of one plate with respect to the other plate changes a vertical extension of the adjustable block assembly. The adjustable block assembly sets the spacing between two opposing draw-in surfaces, which, in turn, changes the amount of draw-in. Multiple adjustable block assemblies and draw-in sensors may be used in conjunction and controlled via a controlling system.

Abstract: The invention relates to a medical instrument guiding device comprising the medical instrument, a monitoring device (2) comprising a support (3) and a medical imaging probe (4) which is arranged on the support, a screen (10), and a control unit (11) of the device which is connected to the screen and the probe for generating at least one three-dimensional image, the control unit being configured to generate at least one two-dimensional image on the screen showing a deformation of the instrument from at least the three-dimensional image, the control unit being configured to estimate a virtual path of the instrument from the deformation of the instrument for extending the insertion thereof to a target, and deduce therefrom at least one distance between the virtual path and the target.

Abstract: Managing secondary objects efficiently increases garbage collection concurrency and reduces object storage requirements. Aliveness marking of secondary objects is integrated with aliveness marking of referenced objects. Allocation of reference-sized secondary object identifier fields in objects which are not primary objects is avoided; a dedicated bit specifies primary objects, together with an object relationship table. A primary object is one with at least one secondary object which is deemed alive by garbage collection if the primary object is alive, without being a referenced object of the primary object. Any referenced objects of the alive primary object will also still be deemed alive. Code paths for marking referenced objects can be shared to allow more efficient secondary object marking. Primary-secondary object relationships may be represented in dependent handles, and may be specified in a hash table or other data structure.

Abstract: Garbage collectors and other software may utilize performant lock-free multithreaded software. Unitary lock-free updates to a set of variables involves an updating value Z, release barriers and acquire barriers that enforce orderings on code execution, and atomicity resulting from variable alignment. Conveyance is accomplished with a values placing step and a values retrieving step. Values placing replaces a non-updated value in a variable Var1 with Z, executes a release barrier, replaces the non-updated values of other variables with update values, executes another release barrier, and replaces Z with the Var1 update value. Values retrieving reads from Var1 into a variable DestVar1A, executes an acquire barrier, reads from the other variables into respective destination variables, executes another acquire barrier, reads from Var1 into a variable DestVar1B, and repeats if DestVar1A is Z or if DestVar1A and DestVar1B are unequal. This solution conveys the update values without locks, as a unit.

Abstract: Memory reclamation is tailored to avoid certain synchronization instructions, speeding concurrent garbage collection while preserving data integrity and availability. Garbage collection reclaims objects no longer in use, or other unused areas of memory. Pointers are partitioned into address portions holding address values and non-address portions having a special bit. Marking code writes only the non-address portions, setting the special bit as a mark reference, relocation candidate, etc. Mutator threads may concurrently mutate the entire pointer to update the address, but mutation does not cause incorrect reclamations or failure to do other operations such as relocation. Meanwhile, execution speed is increased by avoiding CAS (compare-and-swap instructions or compare-and-set) synchronization instructions. Non-CAS yet nonetheless atomic writes are used instead. Mutators run in user or kernel address spaces.

Abstract: Garbage collectors and other software may utilize performant lock-free multithreaded software. Unitary lock-free updates to a set of variables involves an updating value Z, release barriers and acquire barriers that enforce orderings on code execution, and atomicity resulting from variable alignment. Conveyance is accomplished with a values placing step and a values retrieving step. Values placing replaces a non-updated value in Var1 with Z, executes a release barrier, replaces the non-updated values of other variables with update values, executes another release barrier, and replaces Z with the Var1 update value. Values retrieving reads from Var1 into DestVar1A, executes an acquire barrier, reads from the other variables into respective destination variables, executes another acquire barrier, reads from Var1 into DestVar1B, and repeats if DestVar1A is Z or if DestVar1A and DestVar1B are unequal. This solution conveys the update values without locks, as a unit.

Abstract: Managing secondary objects efficiently increases garbage collection concurrency and reduces object storage requirements. Aliveness marking of secondary objects is integrated with aliveness marking of referenced objects. Allocation of reference-sized secondary object identifier fields in objects which are not primary objects is avoided; a dedicated bit specifies primary objects, together with an object relationship table. A primary object is one with at least one secondary object which is deemed alive by garbage collection if the primary object is alive, without being a referenced object of the primary object. Any referenced objects of the alive primary object will also still be deemed alive. Code paths for marking referenced objects can be shared to allow more efficient secondary object marking. Primary-secondary object relationships may be represented in dependent handles, and may be specified in a hash table or other data structure.

Abstract: The invention concerns a device for displaying an internal organ of a patient comprising a computer (2) and a screen (3) connected to the computer in order to display at least one image of the internal organ. According to the invention, the computer is arranged to determine, from at least one medical examination previously carried out on the internal organ, at least one confidence area (10) and/or at least one affected area (11), at least partially encompassing one or more portions (9) of the internal organ where samples have been taken and/or at least partially encompassing one or more areas previously identified as suspect during a medical imaging procedure, and to display, on the screen, the image of the internal organ supplemented with the confidence area and/or the affected area. The invention also concerns a corresponding display method.

Abstract: Memory reclamation is tailored to avoid certain synchronization instructions, speeding concurrent garbage collection while preserving data integrity and availability. Garbage collection reclaims objects no longer in use, or other unused areas of memory. Pointers are partitioned into address portions holding address values and non-address portions having a special bit. Marking code writes only the non-address portions, setting the special bit as a mark reference, relocation candidate, etc. Mutator threads may concurrently mutate the entire pointer to update the address, but mutation does not cause incorrect reclamations or failure to do other operations such as relocation. Meanwhile, execution speed is increased by avoiding CAS (compare-and-swap instructions or compare-and-set) synchronization instructions. Non-CAS yet nonetheless atomic writes are used instead. Mutators run in user or kernel address spaces.

Abstract: Memory reclamation is tailored to avoid certain synchronization instructions, speeding concurrent garbage collection while preserving data integrity and availability. Garbage collection reclaims objects no longer in use, or other unused areas of memory. Pointers are partitioned into address portions holding address values and garbage collection portions having a special bit. Marking code writes only the garbage collection portions, setting the special bit as a mark reference, relocation candidate, etc. Mutator threads may concurrently mutate the entire pointer to update the address, but mutation does not cause incorrect reclamations or failure to do other operations such as relocation. Meanwhile, execution speed is increased by avoiding CAS (compare-and-swap instructions or compare-and-set) synchronization instructions in the garbage collector. Non-CAS yet nonetheless atomic writes are used instead. Mutators run in user or kernel address spaces.

Abstract: The invention relates to an endoscopic instrument (1) having an elongate body with a distal end (4) designed to be introduced into the body of the patient so as to come into proximity with an internal organ, the distal end carrying a tool (7) for intervention on the internal organ. The endoscopic instrument has a fool (10) rigidly connected to the distal end and designed to bear on the internal organ, and also controllable means (13) for conferring movements on the tool, at least in directions transverse to a longitudinal axis (X) of the distal end of the endoscopic instrument, when the foot is bearing against the internal organ.

Abstract: Memory reclamation is tailored to avoid certain synchronization instructions, speeding concurrent garbage collection while preserving data integrity and availability. Garbage collection reclaims objects no longer in use, or other unused areas of memory. Pointers are partitioned into address portions holding address values and garbage collection portions having a special bit. Marking code writes only the garbage collection portions, setting the special bit as a mark reference, relocation candidate, etc. Mutator threads may concurrently mutate the entire pointer to update the address, but mutation does not cause incorrect reclamations or failure to do other operations such as relocation. Meanwhile, execution speed is increased by avoiding CAS (compare-and-swap instructions or compare-and-set) synchronization instructions in the garbage collector. Non-CAS yet nonetheless atomic writes are used instead. Mutators run in user or kernel address spaces.

Abstract: The invention relates to a medical instrument guiding device comprising the medical instrument, a monitoring device (2) comprising a support (3) and a medical imaging probe (4) which is arranged on the support, a screen (10), and a control unit (11) of the device which is connected to the screen and the probe for generating at least one three-dimensional image, the control unit being configured to generate at least one two-dimensional image on the screen showing a deformation of the instrument from at least the three-dimensional image, the control unit being configured to estimate a virtual path of the instrument from the deformation of the instrument for extending the insertion thereof to a target, and deduce therefrom at least one distance between the virtual path and the target.

Abstract: The invention concerns a device for displaying an internal organ of a patient comprising a computer (2) and a screen (3) connected to the computer in order to display at least one image of the internal organ. According to the invention, the computer is arranged to determine, from at least one medical examination previously carried out on the internal organ, at least one confidence area (10) and/or at least one affected area (11), at least partially encompassing one or more portions (9) of the internal organ where samples have been taken and/or at least partially encompassing one or more areas previously identified as suspect during a medical imaging procedure, and to display, on the screen, the image of the internal organ supplemented with the confidence area and/or the affected area. The invention also concerns a corresponding display method.

Abstract: Garbage collection of objects within the heap of a computing system, and movement of adjacent sets of live objects as a whole in order to perform compaction. The compaction may be performed even if there are adjacent sets of live objects that include one or more pinned objects that should not be moved by the garbage collector. The garbage collector uses gaps to include relocation information with respect to sets of adjacent objects of the same pinned status. Some gaps may be formulated by writing over the live objects themselves, in which case that written over data is saved off prior to formulating the gap. When compaction is performed, the saved off data is used to fully integrate the adjacent objects of the same pinned status in the process of compaction.

Abstract: A device for guiding a medical instrument (2) inserted into a natural duct (101) or an artificial duct of a patient in order to bring at least a distal end (1) of the instrument in proximity to an internal organ (100). The device includes an articulated arm (3) with a plurality of degrees of freedom, for moving a proximal end (4) of the instrument, and a controlled blocking mechanism (7) for blocking the degrees of freedom of the articulated arm. The blocking mechanism is designed in such a way that, for at least one of the degrees of freedom, a blockage imposed on the degree of freedom can be released when an outer stress exerted on the instrument (2) exceeds a predetermined threshold.

Abstract: Controlling garbage collection operations. The method includes setting up garbage collection to collect objects that are no longer in use in a managed code environment. The method further includes receiving managed code input specifying a desired quantum within which it is desired that garbage collection not be performed. The method further includes performing a computing operation to determine the desired quantum can likely be met. The method further includes running memory operations within the quantum without running the initialized garbage collection.

Abstract: The invention relates to a surgical instrument comprising: a distal tool (5) securely fastened at a distal end of a rotation shaft (4) and rotatably mounted on and in the extension of a distal member (30) rotatably mounted at an end of an elongated arm (3), an comprising motorized means (20) for actuating the distal motion of the distal tool (5) and further comprising controlling means (21) for a user to control the motorized means (20); a handle (1) extending from the actuation unit (2) and comprising a lever (11) mechanically coupled to the distal tool (5) for actuation of said distal tool (5); characterized in that the handle (1) has a non-axially-symmetric shape and is mounted on and in the extension of the actuation unit (2) with coupling means (12,22) enabling rotation of the handle (1) relative to the actuation unit (2) around the longitudinal axis, and wherein the controlling means (21) are adapted to be operated by the user whatever the rotational position of the handle (1) relative to the actuat