Vehicular liquid container design and manufacture

    公开(公告)号:US11379627B2

    公开(公告)日:2022-07-05

    申请号:US15476480

    申请日:2017-03-31

    Abstract: A method for certifying a design of a liquid container onboard a vehicle for manufacture of the liquid container is provided. The method includes generating a computer geometric model of the liquid container according to the design, and executable code to reproduce dynamics and operational parameters of the vehicle, with the dynamics of the vehicle including dynamics during a vehicle maneuver that is selectable from a database of vehicle dynamics for a plurality of vehicle maneuvers. The method includes executing a simulating application to perform a simulation of liquid sloshing in the liquid container onboard the vehicle is performed subject to the dynamics and operational parameters, and iterate the simulation to refine a prediction of loads and stresses on the liquid container from the simulation produced thereby. Locations within the liquid container more vulnerable to fatigue-risk are identified based on the prediction, and output for certification of the design.

    Hybrid-computing resource optimization

    公开(公告)号:US12265853B2

    公开(公告)日:2025-04-01

    申请号:US17664063

    申请日:2022-05-19

    Abstract: Arranging computational sub-tasks in a hybrid-computing environment is provided. The method comprises receiving input of a number of nodes, wherein each node represents a computational sub-task, and wherein the nodes are grouped into different sets according to differing computing resources used by the nodes. A computational objective is also received as well as initial data inputs and desired final outputs. A directed graph network is generated comprising the nodes and directed edges connecting the nodes. An optimization problem is then solved to determine a best path through the directed graph network for deriving the desired final outputs from the initial data inputs according to the computational objective. The best path comprises a subset of nodes and directed edges within the directed graph network. The best path to achieve the computational objective and estimated computational resources required for the best path are output to a user.

    Quantum processing system
    5.
    发明授权

    公开(公告)号:US11710060B2

    公开(公告)日:2023-07-25

    申请号:US16904518

    申请日:2020-06-17

    CPC classification number: G06N10/00 G06F30/20

    Abstract: A method, apparatus, system, and computer program product for quantum processing. A target quantum programming for a process for a quantum computer is identified. A universal gate set is selected based on a computer type. Any operation possible for a particular quantum computer can be performed using the universal gate set. Instructions for the process in a source quantum programming language are sent to a source quantum language translator which outputs a digital model representation of quantum computer components that are arranged to perform the process using the instructions. The digital model representation of the quantum computer components and the universal gate set are sent to a target quantum language translator, which outputs the instructions for operations for the process in a target quantum programming language using the digital model representation of the quantum computer components and the universal gate set for the computer type for the quantum computer.

    QUANTUM PROCESSING SYSTEM
    6.
    发明申请

    公开(公告)号:US20210398007A1

    公开(公告)日:2021-12-23

    申请号:US16904518

    申请日:2020-06-17

    Abstract: A method, apparatus, system, and computer program product for quantum processing. A target quantum programming for a process for a quantum computer is identified. A universal gate set is selected based on a computer type. Any operation possible for a particular quantum computer can be performed using the universal gate set. Instructions for the process in a source quantum programming language are sent to a source quantum language translator which outputs a digital model representation of quantum computer components that are arranged to perform the process using the instructions. The digital model representation of the quantum computer components and the universal gate set are sent to a target quantum language translator, which outputs the instructions for operations for the process in a target quantum programming language using the digital model representation of the quantum computer components and the universal gate set for the computer type for the quantum computer.

    Ply optimization feasibility analysis for multi-layer composite parts

    公开(公告)号:US10322792B2

    公开(公告)日:2019-06-18

    申请号:US15399104

    申请日:2017-01-05

    Abstract: Systems and methods are provided for composite part design. One embodiment is a method for selectively analyzing feasibility of optimizing fiber orientations for layers of a multi-layer composite part subdivided into panels that each comprise a fraction of an area of the composite part. The method includes identifying stacking sequence rules that constrain the composition of sublaminates that comprise consecutively stacked layers utilized during optimization, for each panel of the composite part, analyzing the panel by identifying ply counts that constrain a number of plies at the panel, selecting a number of sublaminates to utilize during optimization of the panel, calculating ply count ranges for a laminate, based on the number of sublaminates and the stacking sequence rules, and determining whether the ply counts for the panel comply with the ply count ranges for the laminates.

    Foreign object debris movement simulation

    公开(公告)号:US12175743B2

    公开(公告)日:2024-12-24

    申请号:US17452557

    申请日:2021-10-27

    Abstract: Examples are disclosed that relate to computer-predicting behavior of foreign object debris (FOD) in a machine. In one example, a geometric computer model of the machine is recognized. FOD initial conditions within the geometric computer model of the machine are recognized. A movement schedule for the geometric computer model of the machine is recognized. A movement trajectory of a FOD from a starting position consistent with the FOD initial conditions throughout the geometric computer model of the machine is simulated based at least on the movement schedule for the geometric computer model of the machine. Simulation data detailing a likelihood that the FOD will come to rest at a location within the geometric computer model of the machine based on the simulated movement trajectory is output.

    Reducing Resources in Quantum Circuits
    9.
    发明公开

    公开(公告)号:US20230289501A1

    公开(公告)日:2023-09-14

    申请号:US17653949

    申请日:2022-03-08

    CPC classification number: G06F30/32 G06N10/40 G06N10/20

    Abstract: A method of minimizing a cost function of a quantum computation is provided. The method comprises receiving input of an initial state of a quantum problem instance comprising a Hamiltonian with an associated cost function. The Hamiltonian is converted into a number of Pauli strings, which are used to form an operator pool. The Pauli strings in the operator pool are ranked according to how much they lower a value of the cost function with respect to the initial state. Pauli strings are iteratively added from the operator pool to a parameterized quantum circuit, in a manner to minimize circuit depth, until a variational quantum eigensolver (VQE) algorithm converges to an approximate ground state wave function generated by the parameterized quantum circuit.

    Automated Process for Discovering Optimal Programs and Circuits in New Computing Platforms

    公开(公告)号:US20230153074A1

    公开(公告)日:2023-05-18

    申请号:US17454685

    申请日:2021-11-12

    CPC classification number: G06F8/20 G06F9/455 G06N10/00

    Abstract: A method for discovering optimal algorithms is provided. The method comprises defining a starting condition for a program defining a number of program targets, wherein the program targets map program user-specified inputs to expected outputs, defining a number of program objectives, and defining a number of program constraints. An iterative optimization problem is then initialized to solve for the resulting program. A determination is made if defined termination conditions have been met according to the program targets and optimization objectives. Responsive to the defined termination conditions not being met an update to the program is selected by addition or subtraction of operations, the updated program is evaluated according to the program targets, the number of program objectives are evaluated, and the optimization problem is re-iterated. Responsive to the defined termination conditions being met, the program is reassembled into an instruction set.

Patent Agency Ranking