Abstract: A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence.

Abstract: A method is disclosed for determining a conformation of a molecule on at least one degree of freedom to optimize according to at least one molecular objective function, the method comprising generating using at least one corresponding degree of freedom to optimize a connected rigid bodies representation for the molecule by identifying a plurality of groups of atoms, generating a data structure representative of the connected rigid bodies representation generating at least one neighborhood for each generated neighborhood of the at least one generated neighborhoods, generating a corresponding binary optimization problem using the data structure, providing the generated corresponding binary optimization problem to a high-performance binary optimizer, obtaining a solution from the high-performance binary optimizer; and providing at least one corresponding solution.

Abstract: A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence.

Abstract: A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence.

Abstract: A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence.

Abstract: A method is disclosed for determining a conformation of a molecule on at least one degree of freedom to optimize according to at least one molecular objective function, the method comprising generating using at least one corresponding degree of freedom to optimize a connected rigid bodies representation for the molecule by identifying a plurality of groups of atoms, generating a data structure representative of the connected rigid bodies representation generating at least one neighborhood for each generated neighborhood of the at least one generated neighborhoods, generating a corresponding binary optimization problem using the data structure, providing the generated corresponding binary optimization problem to a high-performance binary optimizer, obtaining a solution from the high-performance binary optimizer; and providing at least one corresponding solution.

Abstract: A method is disclosed for determining a minimum connected dominating set in a graph, the method comprising obtaining an indication of an input graph, the input graph comprising a plurality of nodes and a plurality of edges; generating a distance table comprising for each node of the input graph, an indication of a distance between the given node and each of the other node of the plurality of nodes; generating a corresponding constrained binary quadratic programming problem using the generated distance table; providing the corresponding constrained binary quadratic programming problem to a quantum annealing solver; obtaining at least one approximate solution from the quantum annealing solver; post-processing the at least one approximate solution and providing the post-processed at least one approximate solution.

Abstract: A method is disclosed for determining a minimum connected dominating set in a graph, the method comprising obtaining an indication of an input graph, the input graph comprising a plurality of nodes and a plurality of edges; generating a distance table comprising for each node of the input graph, an indication of a distance between the given node and each of the other node of the plurality of nodes; generating a corresponding constrained binary quadratic programming problem using the generated distance table; providing the corresponding constrained binary quadratic programming problem to a quantum annealing solver; obtaining at least one approximate solution from the quantum annealing solver; post-processing the at least one approximate solution and providing the post-processed at least one approximate solution.

Abstract: A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence.

Abstract: A method, apparatus and system for fusing real-time ultrasound images with pre-acquired medical images are described.

Abstract: A medication access control device having a high-strength, high-impact cover and base that allows manual advancing and actuated dispensing of tablets, capsules, or pills of virtually all sizes from a medication cartridge, having penetrable seals, through a dispensing hole located at the base of the device housing. The medication cartridge rests on a cartridge driver rotatably connected to the bottom half of the device housing. A battery powers a timing device and solenoid to draw a locking lug from steps on the cartridge driver. A spring advances a lug lock to hold the locking lug open until the medication cartridge is rotated. As the medication cartridge is rotated a cartridge device tooth advances a trigger, which releases the locking lug and locks the cartridge driver from rotating. A rewind protection lock prevents the cartridge driver from rotating backwards. A switch resets the timer as the cartridge driver is rotated.

Abstract: A medication access control device having a high-strength, high-impact cover and base that allows manual advancing and actuated dispensing of tablets, capsules, or pills of virtually all sizes from a medication cartridge, having penetrable seals, through a dispensing hole located at the base of the device housing. The medication cartridge rests on a cartridge driver rotatably connected to the bottom half of the device housing. A battery powers a timing device and solenoid to draw a locking lug from steps on the cartridge driver. A spring advances a lug lock to hold the locking lug open until the medication cartridge is rotated. As the medication cartridge is rotated a cartridge device tooth advances a trigger, which releases the locking lug and locks the cartridge driver from rotating. A rewind protection lock prevents the cartridge driver from rotating backwards. A switch resets the timer as the cartridge driver is rotated.

Abstract: Described is a method of providing image guidance for use in an organ or area of interest subjected to motion that includes acquiring a three-dimensional image of the organ or area of interest of the subject with at least two imageable, visible markers and at least one magnetically tracked marker in place, acquiring a three-dimensional image of the organ or area of the subject with at least two imageable, visible markers and at least one magnetically tracked marker in place, correlating a magnetic field space to the three-dimensional image space, providing an overlay of a magnetically tracked probe in the three-dimensional image space, planning a path to a target within the organ or area of interest within the subject, and proceeding along the planned path.

Abstract: A robotic manipulator having a gripping tool assembly for separating a thin sheet of metal from a stack of metal sheets. The assembly comprises a frame mounted to a lift arm. A separating device is pivotally mounted to the frame for grasping and lifting a corner of the top metal sheet to create an initial separation of the sheet from the stack. A plurality of stationary suction lifters are secured to the frame for grasping and lifting the remaining portions of the top sheet. The gripping tool assembly is characterized by first and second air hoses or nozzles mounted to the frame with the first air nozzle positioned above the second air nozzle whereby the first air nozzle provides pressurized air toward the corner of the sheet to assist in the initial separation of the sheet and the second air nozzle provides pressurized air below the sheet after the initial separation of the sheet from the stack.

Abstract: A plastic tamper-proof sealing plug assembly for use in securely sealing the vale outlet of a pressurized bottle or any other type of container. The tamper-proof assembly has a tubular gasket provided with a central opening, sized to fit into and seal a valve outlet, and a sealing plug element with a plug projecting from it, which is sized to snugly fit into the tubular gasket in order to close the valve outlet. The tamper-proof assembly also has a security seal in the form of a strap has one end attached to one side of the sealing plug element and also has another free end. The strap projects outwards from the side of the sealing plug element and is long enough to surround the valve. The tamper-proof assembly further has a fastener for irreversibly fastening the free end of the strap to the sealing plug element so that the strap must be broken in order to remove the plug and the gasket if necessary, from the valve outlet.