Abstract: The invention is a fluid having a kinematic viscosity from 3 to 6 mm2/s, a flash point of higher than 120° C. and a pour point lower than ?40° C., having a boiling point in the range of from 200° C. to 400° C. and a boiling range below 80° C., said fluid comprising more than 95% isoparaffins and less than 3% of naphthens by weight, a biocarbon content of at least 95% by weight, containing less than 100 ppm aromatics by weight. The invention is also a drilling fluid and the use of the fluid to improve the viscosity of the drilling fluid.

Abstract: A device for modifying at least the direction of magnetization of a magnetic layer, the modifying device including a ferroelectric layer having a ferroelectric polarization, arranged on or under the magnetic layer so as to define a stack including at least the magnetic layer and the ferroelectric layer, a generator apt to inject an electric current into the stack along a direction parallel to the plane of the layers of the stack, and a modification unit apt to modify the ferroelectric polarization of the ferroelectric layer, for modifying, with the generator, the direction of magnetization of the magnetic layer.

Abstract: There is provided an internal combustion engine, provided with a crankshaft and one or several cylinders provided on the wall thereof with exhaust ports and closed at the top by a cylinder head provided with intake ports; each cylinder accommodating an engine piston connected to the crankshaft and a coaxial auxiliary piston opposite the engine piston, defining an intake chamber and a combustion chamber; said auxiliary piston axially determining on the side of the combustion chamber a housing that communicates with the intake chamber via transfer ports, the housing of which includes a secondary piston which opens and closes the transfer ports in a back-and-forth movement between a rear position and a forward position.

Abstract: There is provided an internal combustion engine, provided with a crankshaft and one or several cylinders provided on the wall thereof with exhaust ports and closed at the top by a cylinder head provided with intake ports; each cylinder accommodating an engine piston connected to the crankshaft and a coaxial auxiliary piston opposite the engine piston, defining an intake chamber and a combustion chamber; said auxiliary piston axially determining on the side of the combustion chamber a housing that communicates with the intake chamber via transfer ports, the housing of which includes a secondary piston which opens and closes the transfer ports in a back-and-forth movement between a rear position and a forward position.

Abstract: The invention relates to a method for characterising three-dimensional objects, including steps comprising: i) generating a three-dimensional reconstruction of a three-dimensional object; ii) generating a mesh of the object, said mesh being made up of points connected two-by-two by a ridge; iii) characterising the points and/or faces of the mesh of the object according to the statuses of remarkable properties at said points; iv) splitting the object into contiguous three-dimensional regions based on the mesh and the characterisation of the points thereof; v) creating a database of regions that represent objects of an environment; and/or vi) screening a region on a database in order to find objects that contain similar and/or complementary regions; and/or vii) inferring functions of the objects according to similarities in the regions thereof; and/or viii) inferring interactions between objects by complementarity of the regions thereof; and/or ix) specifying the frequency of a region in an environment.

Abstract: A method of managing a call managed at any given time by a call controller, which method includes steps of: choosing an initial call controller managing said call, measuring the satisfaction of criteria during the call, deciding as a function of said measurement to change the call controller managing said call, and in the event of a decision to change, transmitting information relating to the call to the chosen call controller.

Abstract: The invention relates to a method for characterising three-dimensional objects, including steps comprising: i) generating a three-dimensional reconstruction of a three-dimensional object; ii) generating a mesh of the object, said mesh being made up of points connected two-by-two by a ridge; iii) characterising the points and/or faces of the mesh of the object according to the statuses of remarkable properties at said points; iv) splitting the object into contiguous three-dimensional regions based on the mesh and the characterisation of the points thereof; v) creating a database of regions that represent objects of an environment; and/or vi) screening a region on a database in order to find objects that contain similar and/or complementary regions; and/or vii) inferring functions of the objects according to similarities in the regions thereof; and/or viii) inferring interactions between objects by complementarity of the regions thereof; and/or ix) specifying the frequency of a region in an environment.

Abstract: The invention relates to a method for characterising three-dimensional objects, including steps comprising: i) generating a three-dimensional reconstruction of a three-dimensional object; ii) generating a mesh of the object, said mesh being made up of points connected two-by-two by a ridge; iii) characterising the points and/or faces of the mesh of the object according to the statuses of remarkable properties at said points; iv) splitting the object into contiguous three-dimensional regions based on the mesh and the characterisation of the points thereof; v) creating a database of regions that represent objects of an environment; and/or vi) screening a region on a database in order to find objects that contain similar and/or complementary regions; and/or vii) inferring functions of the objects according to similarities in the regions thereof; and/or viii) inferring interactions between objects by complementarity of the regions thereof; and/or ix) specifying the frequency of a region in an environment.

Abstract: The present invention relates to native and platform-independent software code. In a particular embodiment, the method includes providing a first software program compiled to platform-independent code for execution in a first process of the computer system, providing a second software program compiled to native code for execution in a second process of the computer system, and sending a message from the first process to the second process to request a memory buffer.

Abstract: The present invention relates to a method for message delivery from a sender process to a receiver process within a computer system, comprising performing an atomic check for the receiver process and a parent of the receiver process, returning a first status of the receiver process and a second status of the parent of the receiver process based on the atomic check, and delivering the message according to the first status and the second status, wherein the first status and the second status stay unchanged during the atomic check.

Abstract: In general, the invention relates to a method for garbage collection. The method includes examining old regions to obtain a mark bitmap, a connectivity matrix, and fragmentation information, where the mark bitmap describes marked words and unmarked words for the old regions. The method further includes identifying a fragmented region in the old regions based on the fragmentation information, where the fragmented region includes at least one of the marked words. The method further includes copying the at least one of the marked words to a new region allocated from a pool of free regions, designating each of the unmarked words not in the fragmented region as free, adjusting a cross-region reference to the fragmented region in the marked words to point to the new region based on the connectivity matrix, and adding the fragmented region to the pool of free regions.

Abstract: A method for garbage collection involves allocating multiple objects in a young generation, where the objects are specific to a task, and where the young generation is specific to the task, performing a minor garbage collection, where an object of the multiple objects is promoted to a promotion area in a shared older generation, and where the promotion area is specific to the task, and freeing the promotion area when the task terminates to obtain a free promotion area without performing a major garbage collection.

Abstract: A propulsion system, including a diesel engine, an air inlet circuit, and an exhaust circuit, for exhaust gases coming from the engine. The inlet circuit includes an adjustment mechanism to control the air flow into the engine and the exhaust circuit includes a nitrogen oxides trap for storage of nitrogen oxides contained in the exhaust gases. During a regeneration mode in which the exhaust gases are provided with reducing agents for regeneration of the nitrogen oxides trap, a set point is determined for the air flow, according to the operating status of the engine, the adjustment mechanism is controlled to obtain an air flow close to the set point, a main fuel injection is carried out, and a secondary fuel injection is carried out during a power phase to maintain the exhaust gas in a reducing state.

Abstract: A method for debugging an application on a source node, that includes creating a first Remote Method Invocation (RMI) by the application at a source node, associating a first debug object with the first RMI, sending the first RMI with the first debug object to a first target node, and receiving debugging information from the first target node, wherein the debugging information is obtained by executing the first RMI on the first target node.

Abstract: A method for minor garbage collection in a multitasking environment involves marking cards as clean, where the cards designate ranges of memory locations in a shared older generation. The method further involves marking a card as dirty when a reference field of an object within the card is modified, where a memory location of the reference field is designated by the card, where the reference field references a live young object in a task-specific young generation, and where the task-specific young generation is associated with a first task. The method further involves marking the card as single-dirty when the card only includes roots of live young objects in the task-specific young generation, and optimizing task-specific minor garbage collection for a second task by skipping the card when the card is marked as single-dirty.

Abstract: A method for minor garbage collection involves marking cards as clean, where the cards designate ranges of memory locations in a shared older generation, marking a card as dirty to obtain a dirty card when a reference field of an object is modified, where the object is allocated in one of multiple promotion areas, where the promotion area is used to promote objects to the shared older generation only for a single task, and where the card designates the reference field's memory location, examining the promotion areas and the cards to identify a region of the dirty card overlapping the promotion area, where promotion areas associated with other tasks are ignored, scanning the region of the dirty card overlapping the promotion area to identify roots of live young objects associated with the single task, and freeing a young object associated with the single task not identified as live during scanning.

Abstract: A method for tracking a target object, involving identifying at least one portion of code corresponding to a constructor for the target object, and inserting a first tracking method before the at least one portion of code and inserting a second tracking method after the at least one portion of code to obtain executable code, wherein the first tracking method and the second tracking method comprise a calling object reference and a target object reference as arguments.

Abstract: In general, the invention relates to a method for garbage collection. The method includes examining old regions to obtain a mark bitmap, a connectivity matrix, and fragmentation information, where the mark bitmap describes marked words and unmarked words for the old regions. The method further includes identifying a fragmented region in the old regions based on the fragmentation information, where the fragmented region includes at least one of the marked words. The method further includes copying the at least one of the marked words to a new region allocated from a pool of free regions, designating each of the unmarked words not in the fragmented region as free, adjusting a cross-region reference to the fragmented region in the marked words to point to the new region based on the connectivity matrix, and adding the fragmented region to the pool of free regions.

Abstract: A method for minor garbage collection in a multitasking environment involves marking cards as clean, where the cards designate ranges of memory locations in a shared older generation. The method further involves marking a card as dirty when a reference field of an object within the card is modified, where a memory location of the reference field is designated by the card, where the reference field references a live young object in a task-specific young generation, and where the task-specific young generation is associated with a first task. The method further involves marking the card as single-dirty when the card only includes roots of live young objects in the task-specific young generation, and optimizing task-specific minor garbage collection for a second task by skipping the card when the card is marked as single-dirty.

Abstract: The present invention relates to a method for message delivery from a sender process to a receiver process within a computer system, comprising performing an atomic check for the receiver process and a parent of the receiver process, returning a first status of the receiver process and a second status of the parent of the receiver process based on the atomic check, and delivering the message according to the first status and the second status, wherein the first status and the second status stay unchanged during the atomic check.