Abstract: An aircraft assembly having: a first part; a second part, the second part being movably mounted with respect to the first part; an electro-hydraulic actuator coupled between the second part and a first anchor point, the actuator comprising a cylinder defining a bore and a piston and rod assembly slidably mounted within the bore and an active chamber within which an increase in fluid pressure causes the actuator to change during a first phase between first and second extension states to move the second part relative to the first part. The electro-hydraulic actuator further includes a hydraulic fluid supply circuit comprising a piezo-electric pump operable to supply pressurised fluid to the active chamber to change the actuator between first and second extension states.

Abstract: An aircraft assembly having: a first part; a second part, the second part being movably mounted with respect to the first part; an electro-hydraulic actuator coupled between the second part and a first anchor point, the actuator comprising a cylinder defining a bore and a piston and rod assembly slidably mounted within the bore and an active chamber within which an increase in fluid pressure causes the actuator to change during a first phase between first and second extension states to move the second part relative to the first part. The electro-hydraulic actuator further includes a hydraulic fluid supply circuit comprising a piezo-electric pump operable to supply pressurised fluid to the active chamber to change the actuator between first and second extension states.

Abstract: An aircraft assembly having: a first part; a second part, the second part being movably mounted with respect to the first part; an electro-hydraulic actuator coupled between the second part and a first anchor point, the actuator comprising a cylinder defining a bore and a piston and rod assembly slidably mounted within the bore and an active chamber within which an increase in fluid pressure causes the actuator to change during a first phase between first and second extension states to move the second part relative to the first part. The electro-hydraulic actuator further includes a hydraulic fluid supply circuit comprising a piezo-electric pump operable to supply pressurised fluid to the active chamber to change the actuator between first and second extension states.

Abstract: An aircraft assembly having: a first part; a second part, the second part being movably mounted with respect to the first part; an electro-hydraulic actuator coupled between the second part and a first anchor point, the actuator comprising a cylinder defining a bore and a piston and rod assembly slidably mounted within the bore and an active chamber within which an increase in fluid pressure causes the actuator to change during a first phase between first and second extension states to move the second part relative to the first part. The electro-hydraulic actuator further includes a hydraulic fluid supply circuit comprising a piezo-electric pump operable to supply pressurised fluid to the active chamber to change the actuator between first and second extension states.

Abstract: This invention relates to a system, method and computer program product for determining which anytime technique is the most efficient at solving an anytime problem using a first anytime technique and a second anytime technique to determine a first and a second plurality of solutions, respectively, wherein each of the first and the second the plurality of solutions includes a value and an associated computation time, respectively, and each of the first and the second plurality solutions including a minimized value and associated computation time, respectively. Determining a set of delta value ordinates and computation time ordinates. Determining a representative value ordinate and representative computation time ordinate. Determining an efficient anytime technique.

Abstract: This invention relates to a system, method and computer program product for determining which anytime technique is the most efficient at solving an anytime problem using a first anytime technique and a second anytime technique to determine a first and a second plurality of solutions, respectively, wherein each of the first and the second the plurality of solutions includes a value and an associated computation time, respectively, and each of the first and the second plurality solutions including a minimized value and associated computation time, respectively. Determining a set of delta value ordinates and computation time ordinates. Determining a representative value ordinate and representative computation time ordinate. Determining an efficient anytime technique.

Abstract: According to an aspect, a method for providing a minimal explanation to a set of unsatisfiable constraints involves retrieving a minimal subset of constraints that remain together unsatisfiable. The method includes iterating over a list of n constraints, and building a minimal explanation to a set of unsatisfiable constraints by determining which constraint to add to the set of unsatisfiable constraints. Building includes accelerating by removing an increasing number of constraints until removed further constraints makes the set of constraints satisfiable. A dichotomic search is performed on the removed further constraints. The average observed distance is identified between successive constraints in the set of unsatisfiable constraints. A plurality of 2k further constraints located in the list of constraints is removed at the average observed distance from the most recently added constraint. Testing whether a current selected subset is unsatisfiable is performed for the first log2(n) added constraints.

Abstract: According to an aspect, a method for providing a minimal explanation to a set of unsatisfiable constraints involves retrieving a minimal subset of constraints that remain together unsatisfiable. The method includes iterating over a list of n constraints, and building a minimal explanation to a set of unsatisfiable constraints by determining which constraint to add to the set of unsatisfiable constraints. Building includes accelerating by removing an increasing number of constraints until removed further constraints makes the set of constraints satisfiable. A dichotomic search is performed on the removed further constraints. The average observed distance is identified between successive constraints in the set of unsatisfiable constraints. A plurality of 2k further constraints located in the list of constraints is removed at the average observed distance from the most recently added constraint. Testing whether a current selected subset is unsatisfiable is performed for the first log2(n) added constraints.

Abstract: According to an aspect, a method for providing a minimal explanation to a set of unsatisfiable constraints involves retrieving a minimal subset of constraints that remain together unsatisfiable. The method includes iterating over a list of n constraints, and building a minimal explanation to a set of unsatisfiable constraints by determining which constraint to add to the set of unsatisfiable constraints. Building includes accelerating by removing an increasing number of constraints until removed further constraints makes the set of constraints satisfiable. A dichotomic search is performed on the removed further constraints. The average observed distance is identified between successive constraints in the set of unsatisfiable constraints. A plurality of 2k further constraints located in the list of constraints is removed at the average observed distance from the most recently added constraint. Testing whether a current selected subset is unsatisfiable is performed for the first log2(n) added constraints.

Abstract: According to an aspect, a method for providing a minimal explanation to a set of unsatisfiable constraints involves retrieving a minimal subset of constraints that remain together unsatisfiable. The method includes iterating over a list of n constraints, and building a minimal explanation to a set of unsatisfiable constraints by determining which constraint to add to the set of unsatisfiable constraints. Building includes accelerating by removing an increasing number of constraints until removed further constraints makes the set of constraints satisfiable. A dichotomic search is performed on the removed further constraints. The average observed distance is identified between successive constraints in the set of unsatisfiable constraints. A plurality of 2k further constraints located in the list of constraints is removed at the average observed distance from the most recently added constraint. Testing whether a current selected subset is unsatisfiable is performed for the first log2(n) added constraints.

Abstract: There is described a landing gear having a bogie including a elongated beam (2) for accommodating at least two axles receiving each a pair of ground engaging wheels, at least one axle (5) being pivotally mounted on the elongated beam. The landing gear further includes axle travel limitation means (10) extending between said pivotable axle and said elongated beam to be hitched up thereto, said travel limitation means being deformable one way starting from an stable and lockable state thereof corresponding to a landing position of said pivotable axle. There are also described independently lockable and actuatable telescopic struts.

Abstract: There is described a landing gear having a bogie including a elongated beam (2) for accommodating at least two axles receiving each a pair of ground engaging wheels, at least one axle (5) being pivotally mounted on the elongated beam. The landing gear further includes axle travel limitation means (10) extending between said pivotable axle and said elongated beam to be hitched up thereto, said travel limitation means being deformable one way starting from an stable and lockable state thereof corresponding to a landing position of said pivotable axle. There are also described independently lockable and actuatable telescopic struts.

Abstract: There is described a landing gear having a bogie including a elongated beam (2) for accommodating at least two axles receiving each a pair of ground engaging wheels, at least one axle (5) being pivotally mounted on the elongated beam. The landing gear further includes axle travel limitation means (10) extending between said pivotable axle and said elongated beam to be hitched up thereto, said travel limitation means being deformable one way starting from an stable and lockable state thereof corresponding to a landing position of said pivotable axle. There are also described independently lockable and actuatable telescopic struts.

Abstract: The present invention relates to methods and systems for applying evolutionary algorithms to generate robust search strategies for problems including decision variables. In one aspect, the invention encodes genomes of at least one triplet comprising a variable, assignment priority, and assigned value. The genome may later be decoded to determine a partial or complete assignment of values to variables. If a partial assignment is reached, a search strategy may be applied to generate a complete or more complete assignment. The genomes may also be evolved to produce offspring genomes. One type of evolutionary operator, called the Lamarckian operator is introduced, wherein the similarities, differences, and unbound variables resulting from the decoding of two or more parent genomes are collected. These collections are then used to encode an offspring genome, building upon the strengths of the parents.

Abstract: The invention generally provides a biomarker for sleepiness, a method for detecting sleepiness, and a method of identifying nucleic acids associated with sleepiness.

Abstract: The present invention relates to methods and systems for applying evolutionary algorithms to generate robust search strategies for problems including decision variables. In one aspect, the invention encodes genomes of at least one triplet comprising a variable, assignment priority, and assigned value. The genome may later be decoded to determine a partial or complete assignment of values to variables. If a partial assignment is reached, a search strategy may be applied to generate a complete or more complete assignment. The genomes may also be evolved to produce offspring genomes. One type of evolutionary operator, called the Lamarckian operator is introduced, wherein the similarities, differences, and unbound variables resulting from the decoding of two or more parent genomes are collected. These collections are then used to encode an offspring genome, building upon the strengths of the parents.

Abstract: The invention generally provides a biomarker for sleepiness, a method for detecting sleepiness, and a method of identifying nucleic acids associated with sleepiness.

Abstract: Commands are processed by hardware within a virtual client computing environment, such as graphics-related commands processed by graphics hardware. A server computing device includes graphics hardware, a virtual client computing environment, and a server computing environment. The graphics hardware processes graphics-related commands into responses. The virtual client computing environment includes an encoding application that issues the commands. The server computing environment includes a decoding application. The encoding application includes a first thread that receives the commands and places them onto a first queue. The encoding application includes a second thread that receives the responses from a second queue and communicates the responses to a remote display device.