Patent US5602964A successfully refreshed from Google Patents.
US5602964A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Automata networks and methods for obtaining optimized dynamically reconfigurable computational architectures and controls
Assignee: Autometric Inc
•
Filing: 1993-05-21
•
Granted: 1997-02-11
•
Expires: 2013-05-21
Abstract
Abstract A system for obtaining optimum performance and optimum graceful degradation from Lie algebra descriptions of a spectrum of reconfigurable network architectures, including, neural nets and cellular automata comprised of interconnected nodes. The dynamic performance of the computational process is monitored by continued extraction of Liapounov exponent indicators, reconfiguring said reconfigurable network architecture when said indicators predict non-optimum performance. The reconfigurable networks are reconfigured and compensatory adjustments are made of signal sampling performance and operating system performance of said reconfigurable network architecture, and the operating system architecture is optimized to the computational task by reconfiguration of nodal capabilities and degree of interconnectedness between nodes to obtain any Lie algebra description architectural form between ideal neural net with maximum interconnectedness and ideal cellular automata with maximum nodal capability.
Inventors
- 👤 Terence W. Barrett
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 10:31
CPC Classifications
G; G05; G05B; G05B13/00; G05B13/02; G05B13/0265; G05B13/027; G06; G06F; G06F11/00; G06F11/30; G06F11/34; G06F18/00; G06F18/40; G06N; G06N3/00; G06N3/02; G06N3/04; G06N3/08; G06N3/082; G06F11/07; G06F11/16; G06F11/20; G06F11/202; G06F11/2035
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
68 words
A method for obtaining optimum performance and optimum degradation from Lie algebra descriptions of a spectrum of reconfigurable network architectures, including, neural nets and cellular automata comprised of interconnected nodes having dynamic performance characteristics of a computational process, comprising: monitoring the dynamic performance of the computational process by continued extraction of Liapounov exponent indicators, and reconfiguring said reconfigurable network architecture when said Liapounov exponent indicators predict non-optimum performance.
Claim 2
Independent Claim
68 words
A method for obtaining optimum performance and optimum degradation from Lie algebra descriptions of a spectrum of reconfigurable network architectures, including, neural nets and cellular automata comprised of interconnected nodes having dynamic performance characteristics of a computational process, comprising: monitoring the dynamic performance of the computational process by continued extraction of Liapounov exponent indicators, and reconfiguring said reconfigurable network architecture when said Liapounov exponent indicators predict non-optimum performance.
Claim 3
Dependent Claim
23 words
The method defined in claim 1, comprising making compensatory adjustments of signal sampling performance and operating system performance of said reconfigurable network architecture.
Claim 4
Dependent Claim
53 words
The method defined in claim 1 or claim 2, comprising: optimizing said reconfigurable network architecture to the computational process by reconfiguration of nodal capabilities and degree of interconnectedness between nodes to obtain a Lie algebra description architectural form between ideal neural net with maximum interconnectedness and ideal cellular automata with maximum nodal capability.
Claim 5
Independent Claim
128 words
A method for obtaining optimum performance and optimum degradation from Lie algebra descriptions of a spectrum of reconfigurable network architectures, including, neural nets and cellular automata comprised of interconnected nodes having dynamic performance characteristics of a computational process, comprising: monitoring the dynamic performance characteristic of the computational process by continued extraction of Liapounov exponent indicators, reconfiguring said reconfigurable network architecture when said Liapounov exponent indicators predict non-optimum performance, making compensatory adjustments of signal sampling performance and operating system performance of said reconfigurable network architecture, and optimizing said reconfigurable network architecture to the computational process by reconfiguration of nodal capabilities and degree of interconnectedness between nodes to obtain a Lie algebra description architectural form between ideal neural net with maximum interconnectedness and ideal cellular automata with maximum nodal capability.
Claim 6
Independent Claim
128 words
A method for obtaining optimum performance and optimum degradation from Lie algebra descriptions of a spectrum of reconfigurable network architectures, including, neural nets and cellular automata comprised of interconnected nodes having dynamic performance characteristics of a computational process, comprising: monitoring the dynamic performance characteristic of the computational process by continued extraction of Liapounov exponent indicators, reconfiguring said reconfigurable network architecture when said Liapounov exponent indicators predict non-optimum performance, making compensatory adjustments of signal sampling performance and operating system performance of said reconfigurable network architecture, and optimizing said reconfigurable network architecture to the computational process by reconfiguration of nodal capabilities and degree of interconnectedness between nodes to obtain a Lie algebra description architectural form between ideal neural net with maximum interconnectedness and ideal cellular automata with maximum nodal capability.
Claim 7
Independent Claim
73 words
A system for obtaining optimum performance and optimum degradation from a Lie algebra descriptions of a spectrum of reconfigurable network architectures, including, neural nets and cellular automata comprised of interconnected nodes having dynamic performance characteristics of a computational process, comprising: means for monitoring the dynamic performance of the computational process by continued extraction of Liapounov exponent indicators, and means for reconfiguring said reconfigurable network architecture when said Liapounov exponent indicators predict non-optimum performance.
Claim 8
Independent Claim
73 words
A system for obtaining optimum performance and optimum degradation from a Lie algebra descriptions of a spectrum of reconfigurable network architectures, including, neural nets and cellular automata comprised of interconnected nodes having dynamic performance characteristics of a computational process, comprising: means for monitoring the dynamic performance of the computational process by continued extraction of Liapounov exponent indicators, and means for reconfiguring said reconfigurable network architecture when said Liapounov exponent indicators predict non-optimum performance.
Claim 9
Dependent Claim
22 words
The system defined in claim 5 comprising means for making compensatory adjustments of the operating system performance of said reconfigurable network architecture.
Claim 10
Dependent Claim
55 words
The system defined in claim 5 or claim 6, comprising: means for optimizing said reconfigurable network architecture to the computational process by reconfiguration of nodal capabilities and degree of interconnectedness between nodes to obtain a Lie algebra description architectural form between ideal neural net with maximum interconnectedness and ideal cellular automata with maximum nodal capability.
Claim 11
Independent Claim
129 words
A system for obtaining optimum performance and optimum degradation from Lie algebra description of a spectrum of reconfigurable network architectures, including, neural nets and cellular automata comprised of interconnected nodes having dynamic performance characteristics of a computational process, comprising: means for monitoring the dynamic performance of the computational process by continued extraction of Liapounov exponent indicators, means for reconfiguring said reconfigurable network architecture when said Liapounov indicators predict non-optimum performance, means making compensatory adjustments of operating system performance of said reconfigurable network architecture, and means for optimizing said reconfigurable network architecture to the computational task by reconfiguration of nodal capabilities and degree of interconnectedness between nodes to obtain a Lie algebra description architectural form between ideal neural net with maximum interconnectedness and ideal cellular automata with maximum nodal capability.
Claim 12
Independent Claim
129 words
A system for obtaining optimum performance and optimum degradation from Lie algebra description of a spectrum of reconfigurable network architectures, including, neural nets and cellular automata comprised of interconnected nodes having dynamic performance characteristics of a computational process, comprising: means for monitoring the dynamic performance of the computational process by continued extraction of Liapounov exponent indicators, means for reconfiguring said reconfigurable network architecture when said Liapounov indicators predict non-optimum performance, means making compensatory adjustments of operating system performance of said reconfigurable network architecture, and means for optimizing said reconfigurable network architecture to the computational task by reconfiguration of nodal capabilities and degree of interconnectedness between nodes to obtain a Lie algebra description architectural form between ideal neural net with maximum interconnectedness and ideal cellular automata with maximum nodal capability.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-02-11 | 2000-08-12 | 2001-02-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-02-11 | 2004-08-12 | 2005-02-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-02-11 | 2008-08-12 | 2009-02-11 | $7700.00 | Window Closed / Lapsed |