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

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.

Hearing device and method for choosing a program in a multi program hearing device

The invention concerns a hearing device having an input transducer and an output transducer with a signal path therebetween, signal processing means connected in said signal path for influencing a signal in the signal path dependent on a PPS (processing parameter set), and a PPS memory accessible by the signal processor means for storing a number of different PPS's for use by the signal processing means. The system has means for monitoring the acoustic environment in a learning mode, where the user chooses the PPS to be used in the signal processing. Later in an automatic mode the hearing aid system chooses the PPS based on a comparison of the current acoustic environment with the monitored environment in the learning phase.
Owner:OTICON

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

High efficiency redundancy architecture in SRAM compiler

ActiveUS20050088887A1Minimally impactsRead-only memoriesDigital storagePath dependentCompiler
A yield enhancement circuit substitutes a redundant sub-circuit for a faulty sub-circuit in an integrated circuit such as memory. The yield enhancement circuit has a plurality of fault indication devices, which is associated with one sub circuit of the integrated circuits such that one fault indication device is activated to generate a fault signal to express the existence of a fault within the faulty sub-circuit. Additionally selected adjacent fault indication devices generate the fault signal to express the existence of the fault within the faulty circuit. A fault detection device determines the existence of the faulty sub-circuit and transmits a redundancy implementation signal to a plurality of redundancy activation circuits. Each redundancy activation circuit selectively transfers input / output signals to a designated path dependent on the expression of the existence of a fault within the integrated circuit.
Owner:TAIWAN SEMICON MFG CO LTD

Method and apparatus for optimization of redundant link usage in a multi-shelf network element

A method and apparatus for optimizing redundant link usage allows a portion of the wasted bandwidth in a redundant link system to be utilized for additional data traffic without compromising the ability of the system to respond to and correct for a failure of a link. In one embodiment, one of two independent, individually addressable links is selected as a nominal communication path, and the other as a standby communication path. The path independent traffic is sent via the nominal communication path, while the path dependent data is sent via the nominal communication path or the standby path, in accordance with the dependence of the traffic. In another embodiment, critical time sensitive traffic is sent via a nominal and standby time sensitive paths, while normal traffic is sent via nominal normal path, and non-critical traffic is sent via a standby normal path.
Owner:RPX CORP +1

Gas spring

InactiveUS20050045438A1Excellently controllable stroke behaviourNegatively affectedLiquid springsGas based dampersGas springEngineering
A gas spring comprises a cylindrical casing, in which a piston rod is guided for displacement concentric of a central longitudinal axis. A damping piston is mounted on the piston rod, dividing the interior of the casing into two sectional casing chambers. A filling of compressed gas is provided inside the casing. A damping device is provided for velocity-dependent damping of a motion of stroke of the damping piston and another damping device is provided for path-dependent damping of a motion of stroke of the damping piston. The result is a gas spring of excellently controllable stroke behaviour.
Owner:SUSPA

Network protection switching mechanisms and methods of network protection

A network protection switching mechanism comprises a plurality of optical switches located at a plurality of nodes; a plurality of optical communication paths between said switches; switch based fault detectors located as part of at least two switches which generate detection results representative of the identification of a fault; switch based controllers located as part of said at least two switches; and internal switch- communication means between said fault detectors and said controllers which facilitate the transmission of detection results from said fault detectors to said controllers; wherein said controllers directly cause switching to an alternative optical communication path dependent upon the receipt of said detection results; whereby autonomous switch based protection without dependence on either inter-switch control communication or higher level network control communication is achieved.
Owner:POLATIS

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