Abstract: Disclosed in some examples are methods, systems, and machine readable mediums for online competitive payment bidding and route selection. A payment route matching and selection service may be a network accessible computer based service which allows banks to submit payment requests that are bid on by banks that wish to handle the payment, or part of the payment. Payment requests may specify one or more desired payment properties (such as cost, speed, and the like). Bids may specify offered payment properties (e.g., cost, speed, and the like). The payment route matching and selection service may then attempt to find a payment route (including zero or more payment legs) that most closely (relative to the other routes) matches the desired payment properties of the payment request based upon the offered payment properties of the submitted bids.

Abstract: Disclosed in some examples are methods, machine readable mediums, and systems that provide for improved payment processing utilizing a trusted beneficiary identification (ID) to identify trusted beneficiaries. The trusted beneficiary ID is included in payment details by the payor and signifies that the beneficiary of the payment is trusted by virtue of a prescreening process and was found to be trustworthy. The trusted beneficiary ID speeds payment by reducing false positives on sanctions checking and also by storing a trusted beneficiary record with beneficiary information which may be utilized to reduce missing or incorrect information.

Abstract: A novel probabilistic method for analyzing high cycle fatigue (HCF) in a design of a gas turbine engine is disclosed. The method may comprise identifying a component of the gas turbine engine for high cycle fatigue analysis, inputting parametric data of the component over a predetermined parameter space into at least one computer processor, using the at least one computer processor to build a plurality of flexible models of the component based on the parametric data of the component over the predetermined parameter space, using the at least one computer processor to build a plurality of emulators of the component based on the plurality of flexible models, and using the at least one computer processor to predict a probability of HCF based at least in part on the parametric data of the component over the predetermined parameter space and the plurality of emulators.

Abstract: A novel probabilistic method for analyzing high cycle fatigue (HCF) in a design of a gas turbine engine is disclosed. The method may comprise identifying a component of the gas turbine engine for high cycle fatigue analysis, inputting parametric data of the component over a predetermined parameter space into at least one computer processor, using the at least one computer processor to build a plurality of flexible models of the component based on the parametric data of the component over the predetermined parameter space, using the at least one computer processor to build a plurality of emulators of the component based on the plurality of flexible models, and using the at least one computer processor to predict a probability of HCF based at least in part on the parametric data of the component over the predetermined parameter space and the plurality of emulators.