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.

Abstract: The application is directed to methods and devices for estimating corrosion of a material. One of the methods includes obtaining data regarding corrosion. The data is obtained from various sources, such as but not limited to sensors and observational data. The data is then trained to provide for a more complete data set. The trained data is then used to estimate the expected amount of corrosion for a given situation.

Abstract: A method, a computing system and a computer program product are provided to efficiently define a guide that includes one or more defined sets of ordered ply orientations. In the context of a method, a plurality of stacking sequence rules are received. The method defines the guide including the one or more defined sets of ordered ply orientations in accordance with a constrained, linear integer optimization formulation. In this regard, the method defines the guide by dividing the guide into a plurality of blocks and determining a plurality of sublaminate stacks that satisfy the stacking sequence rules and that have a size limited by a size of the blocks. For each of the plurality of blocks, the method determines in accordance with the constrained, linear integer optimization formulation a sublaminate stack from among the plurality of sublaminate stacks that is compatible with a respective block.

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.

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.

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.

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.

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.

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.

Abstract: A method of identifying surfaces within a discretized mesh model is provided. The method comprises identifying a number of faces in the mesh model and constructing an adjacency graph of connections between the faces. A value is assigned to each connection in the adjacency graph according to a metric of similarity between incident faces of the connection. Connections with a metric of similarity value that satisfies a prescribed policy of elimination are removed from the adjacency graph. From the remaining connections in the adjacency graph a number of strongly connected components in the mesh model are determined.

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.

Abstract: A method of identifying surfaces within a discretized mesh model is provided. The method comprises identifying a number of faces in the mesh model and constructing an adjacency graph of connections between the faces. A value is assigned to each connection in the adjacency graph according to a metric of similarity between incident faces of the connection. Connections with a metric of similarity value that satisfies a prescribed policy of elimination are removed from the adjacency graph. From the remaining connections in the adjacency graph a number of strongly connected components in the mesh model are determined.

Abstract: A method, a computing system and a computer program product are provided to efficiently define a guide that includes one or more defined sets of ordered ply orientations. In the context of a method, a plurality of stacking sequence rules are received. The method defines the guide including the one or more defined sets of ordered ply orientations in accordance with a constrained, linear integer optimization formulation. In this regard, the method defines the guide by dividing the guide into a plurality of blocks and determining a plurality of sublaminate stacks that satisfy the stacking sequence rules and that have a size limited by a size of the blocks.

Abstract: A nestable pallet having three rows of feet extending downward from a support surface is provided. In one aspect, the outer rows of feet are attached by runners at a bottom portion of each foot and the middle row of feet does not include runners. The support surface includes openings to accommodate the outer rows of feet with runners, and the middle row of feet of a like pallet. The absence of runners in the middle row and a corresponding larger opening, allows for greater support area in that portion of the pallet. The pallet can also include reinforcements extending perpendicular to the runners.

Abstract: Systems and methods are provided for composite part design. One embodiment is a method of creating a library of sublaminates used in optimizing fiber orientations of a multi-layer composite part subdivided along its depth into panels that each comprise a fraction of the area of the composite part. The method includes creating sublaminates that each comprise consecutively stacked layers having a unique sequence of fiber orientations, checking the sublaminates for compliance with stacking sequence rules that constrain how fiber orientations are sequenced, and removing sublaminates that do not comply with the stacking sequence rules. The method further includes generating new sublaminates that each include an additional layer, by, for each of multiple fiber orientations: selecting a sublaminate that was not remove, and generating a new sublaminate by appending an additional layer having the fiber orientation to the selected sublaminate.

Abstract: A method and apparatus for analyzing potential corrosion for a vehicle. Potential corrosion surfaces for the vehicle are identified using a model for the vehicle. The corrosion risks are predicted for each of the potential corrosion surfaces. The corrosion risks predicted are aggregated into a group of aggregated corrosion risks for a group of functional design units for the vehicle. A corrosion risk assessment for the vehicle is generated to identify a corrosion risk in the vehicle from the group of aggregated corrosion risks, and to enable a change in the model to reduce the identified corrosion risk.

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.

Abstract: The present invention provides a dolly having a polygonal-shaped platform having an upper surface, a lower surface, a peripheral edge having four corners, a torus-shaped pocket positioned at each corner and dimensioned to receive a wheel from an adjacent dolly, and a plurality of wheels extending from the lower surface and attached thereto.

Abstract: The present invention provides a tray for stacking layers of structural bottles. The tray has an upper surface and an opposed lower surface. The upper surface has a plurality of wells and the lower surface has a plurality of pockets, the pockets and wells are disposed in a corresponding array of columns and rows. An annular seating surface of a well is segmented with each segment having a generally concave surface facing radially inwardly of the well. The concave surface has a vertical portion that extends downwardly and radially inwardly to a radial segment. The radial segment forms a horizontal support surface for receiving a bottom of one of the structural bottles. A first rotational interlock structure extends outward from the concave surface along one of the segments.

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.