Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

67 results about "Path dependent" patented technology

Path dependence is the dependence of economic outcomes on the path of previous outcomes, rather than simply on current conditions. In a path dependent process, “history matters” — it has an enduring influence.

Methods and apparatus for iterative conditional probability calculation methods for financial instruments with path-dependent payment structures

Methods and apparatus provide for calculating expected present values and conditional probabilities of future payments of path-dependent rules-based securities or derivative contracts using iterative conditional probability calculation methods, including: (a) breaking a payment horizon of the securities or derivative contracts into N time increments over time t=0 to t=N; (b) initializing an array of state variables to assumed values at t=0; (c) applying transition probability models to the assumed values of the state variables at time t=0 and calculating a joint probability distribution for the state variables at time t=1; (d) applying payment calculation models to both the t=0 and t=1 values of the state variables and calculating probabilities and expected present values for the securities or derivative contracts payments occurring between t=0 and t=1 based on values of the state variables at times t=0 and t=1; (e) repeating steps (c)-(d) iteratively at each time t and calculating joint probability distributions for the state variables, probabilities, and expected present values of the the securities or derivative contracts payments occurring between times t and t+1 based on values of the state variables at times t and t+1; and (f) summing the probabilities and the expected present value calculations across time and values of the state variables to obtain the expected present values and conditional probabilities of the future payments of the path-dependent rules-based securities or derivative contracts.
Owner:HUGHES FEFFERMAN SYST

Methods and apparatus for iterative conditional probability calculation methods for financial instruments with path-dependent payment structures

Methods and apparatus provide for calculating expected present values and conditional probabilities of future payments of path-dependent rules-based securities or derivative contracts using iterative conditional probability calculation methods, including: (a) breaking a payment horizon of the securities or derivative contracts into N time increments over time t=0 to t=N; (b) initializing an array of state variables to assumed values at t=0; (c) applying transition probability models to the assumed values of the state variables at time t=0 and calculating a joint probability distribution for the state variables at time t=1; (d) applying payment calculation models to both the t=0 and t=1 values of the state variables and calculating probabilities and expected present values for the securities or derivative contracts payments occurring between t=0 and t=1 based on values of the state variables at times t=0 and t=1; (e) repeating steps (c)-(d) iteratively at each time t and calculating joint probability distributions for the state variables, probabilities, and expected present values of the securities or derivative contracts payments occurring between times t and t+1 based on values of the state variables at times t and t+1; and (f) summing the probabilities and the expected present value calculations across time and values of the state variables to obtain the expected present values and conditional probabilities of the future payments of the path-dependent rules-based securities or derivative contracts. By using the foregoing iterative conditional probability calculation methods it is possible to evolve a composite state variable CSV in a path-independent manner and use CSV to calculate present value cash-flow of a path-dependent rules-based security.
Owner:HUGHES FEFFERMAN SYST

Configuration representation and modeling using configuration spaces

Configuration spaces facilitate the useful presentation of data, particularly configuration data used for representing configured products. Products include features and common features can be grouped by families. For example, an automobile can include a transmission family. The transmission family could include features such as automatic transmission and 4-speed manual transmission. Configuration spaces can be achieved by consolidating selected data without loosing useful information. The degree of consolidation achieved can be significant enough to permit display of data using conventional display technology. Configuration spaces break down the “universe” of possible configurations into constituent spaces defined by groups of rules for a selected feature. Common dependencies between the selected feature and related features can be consolidated to produce a more minimal form of the data used for representing the selected features and related features. Configuration spaces can provide a useful graphical view of the breakdown of all rules written for a single feature or multiple features. The data present in this view can be analyzed to, for example, study the dependency paths of an existing configuration and better understand the impact of revising configuration relationships. Thus, configuration spaces aid in the creation and modification of configuration models.
Owner:VERSATA DEV GROUP

Relational reasoning method, device and equipment based on deep neural network

The invention discloses a relation reasoning method based on a deep neural network. The method comprises the steps of after obtaining sample sentences, constructing a syntactic dependency tree consisting of a plurality of words according to a preset fusion rule, then respectively extracting a main feature of the syntactic dependency tree on a shortest dependency path and an auxiliary feature on anon-shortest dependency path, finally carrying out feature fusion on the main feature and the auxiliary feature according to the preset fusion rule, and obtaining a relation reasoning result accordingto the fusion result. Visibly, according to the method, the characteristics of the syntactic dependency tree on the shortest dependency path and the non-shortest dependency path are extracted respectively and fused, and due to the fact that the auxiliary characteristics have a certain auxiliary effect on the reasoning result, the accuracy of relation reasoning is remarkably improved by effectively utilizing the main characteristics and the auxiliary characteristics of the syntactic dependency tree. In addition, the invention further provides a relation reasoning device and equipment based onthe deep neural network and a computer readable storage medium, and the effects of the relation reasoning device and equipment correspond to the effects of the method.
Owner:GUANGDONG UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products