close
1.

図書
図書
1. Nonlinear systems : analysis, stability, and control (: pbk)
Shankar Sastry
出版情報: New York ; Tokyo : Springer, c1999  xxv, 667 p. ; 25 cm
シリーズ名: Interdisciplinary applied mathematics ; v. 10
所蔵情報: loading…
2.

図書
図書
2. Principles of analytical system dynamics
Richard A. Layton
出版情報: New York : Springer, c1998  xiii, 155 p. ; 24 cm
シリーズ名: Mechanical engineering series
所蔵情報: loading…
3.

図書
図書
3. Nonlinear system techniques and applications (cloth : alk. paper)
Julius S. Bendat
出版情報: New York : Wiley, c1998  xiii, 474 p. ; 24 cm
所蔵情報: loading…
目次情報: 続きを見る
Linear Systems, Random Data
Zero-Memory Nonlinear Systems
Direct and Reverse MI/SO
Techniques for Analysis and Identification of Nonlinear Systems
Parallel Linear and Nonlinear Systems
Determination of Physical Parameters with Memory in Nonlinear Systems
Nonlinear System Response Properties of a Naval Frigate from Measured Ocean Engineering Data
Nonlinear System Response Properties of a Naval Barge from Measured Ocean Engineering Data
Bilinear and Trilinear Systems
Input Output Relations for Bilinear and Trilinear Systems
References
Index
Glossary of Symbols
Linear Systems, Random Data
Zero-Memory Nonlinear Systems
Direct and Reverse MI/SO
4.

図書
図書
4. The computational beauty of nature : computer explorations of fractals, chaos, complex systems, and adaptation (: hardcover ; : pbk)
Gary William Flake
出版情報: Cambridge, Mass : The MIT Press, c1998  xviii, 493 p. ; 24 cm
シリーズ名: Bradford book
所蔵情報: loading…
目次情報: 続きを見る
Preface
How to Read This Book
Dealing with Difficult Subjects
Personal Motivation
Acknowledgments
Introduction / 1：
Simplicity and Complexity / 1.1：
The Convergence of the Sciences / 1.2：
The Silicon Laboratory / 1.3：
Computation / I：
Number Systems and Infinity / 2：
Introduction to Number Properties / 2.1：
Counting Numbers / 2.2：
Rational Numbers / 2.3：
Irrational Numbers / 2.4：
Further Reading / 2.5：
Computability and Incomputability / 3：
Godelization / 3.1：
Models of Computation / 3.2：
Lisp and Stutter / 3.3：
Equivalence and Time Complexity / 3.4：
Universal Computation and Decision Problems / 3.5：
Incomputability / 3.6：
Number Sets Revisited / 3.7：
Postscript: Computation / 3.8：
Godel's Incompleteness Result / 4.1：
Incompleteness versus Incomputability / 4.2：
Discrete versus Continuous / 4.3：
Incomputability versus Computability / 4.4：
Fractals / 4.5：
Self-Similarity and Fractal Geometry / 5：
The Cantor Set / 5.1：
The Koch Curve / 5.2：
The Peano Curve / 5.3：
Fractional Dimensions / 5.4：
Random Fractals in Nature and Brownian Motion / 5.5：
Further Exploration / 5.6：
L-Systems and Fractal Growth / 5.7：
Production Systems / 6.1：
Turtle Graphics / 6.2：
Affine Transformation Fractals / 6.3：
A Review of Linear Algebra / 7.1：
Composing Affine Linear Operations / 7.2：
The Multiple Reduction Copy Machine Algorithm / 7.3：
Iterated Functional Systems / 7.4：
The Mandelbrot Set and Julia Sets / 7.5：
Iterative Dynamical Systems / 8.1：
Complex Numbers / 8.2：
The Mandelbrot Set / 8.3：
The M-Set and Computability / 8.4：
The M-Set as the Master Julia Set / 8.5：
Other Mysteries of the M-Set / 8.6：
Postscript: Fractals / 8.7：
Algorithmic Regularity as Simplicity / 9.1：
Stochastic Irregularity as Simplicity / 9.2：
Effective Complexity / 9.3：
Chaos / 9.4：
Nonlinear Dynamics in Simple Maps / 10：
The Logistic Map / 10.1：
Stability and Instability / 10.2：
Bifurcations and Universality / 10.3：
Prediction, Layered Pastry, and Information Loss / 10.4：
The Shadowing Lemma / 10.5：
Characteristics of Chaos / 10.6：
Strange Attractors / 10.7：
The Henon Attractor / 11.1：
A Brief Introduction to Calculus / 11.2：
The Lorenz Attractor / 11.3：
The Mackey-Glass System / 11.4：
Producer-Consumer Dynamics / 11.5：
Producer-Consumer Interactions / 12.1：
Predator-Prey Systems / 12.2：
Generalized Lotka-Volterra Systems / 12.3：
Individual-Based Ecology / 12.4：
Unifying Themes / 12.5：
Controlling Chaos / 12.6：
Taylor Expansions / 13.1：
Vector Calculus / 13.2：
Inner and Outer Vector Product / 13.3：
Eigenvectors, Eigenvalues, and Basis / 13.4：
OGY Control / 13.5：
Controlling the Henon Map / 13.6：
Postscript: Chaos / 13.7：
Chaos and Randomness / 14.1：
Randomness and Incomputability / 14.2：
Incomputability and Chaos / 14.3：
Complex Systems / 14.4：
Cellular Automata / 15：
One-Dimensional CA / 15.1：
Wolfram's CA Classification / 15.2：
Langton's Lambda Parameter / 15.3：
Conway's Game of Life / 15.4：
Natural CA-like Phenomena / 15.5：
Autonomous Agents and Self-Organization / 15.6：
Termites / 16.1：
Virtual Ants / 16.2：
Flocks, Herds, and Schools / 16.3：
Competition and Cooperation / 16.4：
Game Theory and Zero-Sum Games / 17.1：
Nonzero-Sum Games and Dilemmas / 17.2：
Iterated Prisoner's Dilemma / 17.3：
Stable Strategies and Other Considerations / 17.4：
Ecological and Spatial Worlds / 17.5：
Final Thoughts / 17.6：
Natural and Analog Computation / 17.7：
Artificial Neural Networks / 18.1：
Associative Memory and Hebbian Learning / 18.2：
Recalling Letters / 18.3：
Hopfield Networks and Cost Optimization / 18.4：
Postscript: Complex Systems / 18.5：
Phase Transitions in Networks / 19.1：
Phase Transitions in Computation / 19.2：
Phase Transitions and Criticality / 19.3：
Adaptation / 19.4：
Genetics and Evolution / 20：
Biological Adaptation / 20.1：
Heredity as Motivation for Simulated Evolution / 20.2：
Details of a Genetic Algorithm / 20.3：
A Sampling of GA Encodings / 20.4：
Schemata and Implicit Parallelism / 20.5：
Other Evolutionary Inspirations / 20.6：
Classifier Systems / 20.7：
Feedback and Control / 21.1：
Production, Expert, and Classifier Systems / 21.2：
The Zeroth Level Classifier System / 21.3：
Experiments with ZCS / 21.4：
Neural Networks and Learning / 21.5：
Pattern Classification and the Perceptron / 22.1：
Linear Inseparability / 22.2：
Multilayer Perceptrons / 22.3：
Backpropagation / 22.4：
Function Approximation / 22.5：
Internal Representations / 22.6：
Other Applications / 22.7：
Postscript: Adaptation / 22.8：
Models and Search Methods / 23.1：
Search Methods and Environments / 23.2：
Environments and Models / 23.3：
Adaptation and Computation / 23.4：
Epilogue / 23.5：
Duality and Dichotomy / 24：
Web of Connections / 24.1：
Interfaces to Hierarchies / 24.2：
Limitations on Knowledge / 24.3：
Source Code Notes
Glossary
Bibliography
Index
Preface
How to Read This Book
Dealing with Difficult Subjects
5.

図書
図書
5. Abstract compositional analysis of iterated relations : a structural approach to complex state transition systems
Frédéric Geurts
出版情報: Berlin : Springer, c1998  xiv, 280 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1426
所蔵情報: loading…
目次情報: 続きを見る
Foreword / Michel Sintzoff
Preface
Prologue: Aims, Themes, and Motivations / 1：
Complex Relational Dynamical Systems / 1.1：
The Context: A First Contact with Dynamical Systems / 1.1.1：
Mutual Exclusion / 1.1.2：
Social Pressure / 1.1.3：
On the Chaotic Demography of Rabbits / 1.1.4：
Tools and Motivations / 1.2：
Overview of the Monograph / 1.3：
Mathematical Framework: Iterated Relations and Composition / Part I：
Dynamics of Relations / 2：
Functional Discrete-Time Dynamical Systems / 2.1：
Relational Dynamical Systems / 2.2：
Point-Level Nondeterministic Dynamics / 2.2.1：
Set-Level Deterministic Dynamics / 2.2.2：
Comparison / 2.2.3：
Preliminary Definitions and Properties / 2.3：
Basic Definitions About Relations / 2.3.1：
Notions from Topology / 2.3.2：
Monotonicity and General Junctivity Properties / 2.3.3：
Fixpoint Theorems / 2.3.4：
Elementary Properties / 2.3.5：
Metric Properties / 2.3.6：
Transfinite Iterations / 2.4：
Motivation / 2.4.1：
Transfinite Fixpoint Theorem / 2.4.2：
Transfinite Limits of Iterations / 2.4.3：
Discussion / 2.5：
Relations vs Functions / 2.5.1：
Set-Level Dynamics and Predicate-Transformers / 2.5.2：
Point-Level Dynamics and Trace Semantics / 2.5.3：
Nondeterminism and Probabilistic Choices / 2.5.4：
Time Structure / 2.5.5：
Dynamics of Composed Relations / 3：
Structural Composition / 3.1：
Composition of Relations / 3.2：
Unary Operators / 3.2.1：
N-Ary Operators / 3.2.2：
Composed Dynamical Systems / 3.2.3：
One-Step Set-Level Evolution of Composed Relations / 3.3：
Point-Level Dynamics of Composed Systems / 3.3.2：
Algebraic Properties of Composition Operators / 3.4：
Composition of Unary Operators / 3.4.1：
Composition of Unary and N-Ary Operators / 3.4.2：
Composition of N-Ary Operators / 3.4.3：
Fixpoint Theory for the Composition / 3.4.4：
Composition Operators / 3.5：
Nondeterminism and Probabilities Revisited / 3.5.2：
Fixpoint Operator and Composition / 3.5.3：
Abstract Complexity: Abstraction, Invariance, Attraction / Part II：
Abstract Observation of Dynamics / 4：
Observation of Systems / 4.1：
Trace-Based Dynamics / 4.2：
Symbolic Observation / 4.3：
Abstraction of Systems / 4.4：
Qualitative Abstract Verification / 4.5：
Observation as Abstraction / 4.6：
Observation and Abstraction: Related Work / 4.7：
Symbolic Dynamics vs Astract Observation / 4.7.2：
Invariance, Attraction, Complexity / 4.7.3：
Invariance / 5.1：
Forward and Backward Invariance / 5.1.1：
Global Invariance / 5.1.2：
Strong Invariance / 5.1.3：
Structure of Invariants / 5.2：
Trace-Parametrized Invariants / 5.2.1：
Fullness and Atomicity / 5.2.2：
Chaos / 5.2.3：
Fullness Implies Trace Chaos / 5.2.4：
Fullness and Atomicity Imply Knudsen Chaos / 5.2.5：
Devaney vs Trace vs Knudsen Chaos / 5.2.6：
Fullness and Atomicity Criteria / 5.3：
Criteria / 5.3.1：
Case Studies: Dyadic Map, Cantor Relation, Logistic Map / 5.3.2：
Attraction / 5.4：
Intuition: From Reachability to Attraction / 5.4.1：
From Weak to Full Attraction / 5.4.2：
A Taxonomy of Attraction / 5.4.3：
Attraction Criteria / 5.5：
Attraction by Invariants / 5.6：
Invariance and Attraction: Related Notions / 5.7：
Energy-Like Functions / 5.7.2：
Dynamical Complexity / 5.7.3：
Abstract Compositional Analysis of Systems: Dynamics and Computations / Part III：
Compositional Analysis of Dynamical Properties / 6：
Aims and Informal Results / 6.1：
Inversion / 6.2：
Restrictions / 6.3：
Domain Restriction / 6.3.1：
Range Restriction / 6.3.2：
Negation / 6.4：
Sequential Composition / 6.5：
Intersection / 6.6：
Union / 6.7：
Products / 6.8：
Free Product / 6.8.1：
Connected Product / 6.8.2：
Combining Union with Free Product / 6.9：
Compositionality: Summary / 6.10：
Limitations and Open Problems / 6.10.2：
Related Work / 6.10.3：
Emergence of Complexity by Structural Composition / 6.10.4：
Case Studies: Compositional Analysis of Dynamics / 7：
A Collection of Complex Behaviors / 7.1：
Smale Horseshoe Map / 7.2：
Cantor Relation / 7.3：
From Cantor Relation to Truncated Logistic Map / 7.4：
Paperfoldings / 7.5：
Introduction / 7.5.1：
Paperfolding Sequences / 7.5.2：
Dynamical Complexity of Paperfoldings / 7.5.3：
Partial Conclusions / 7.5.4：
Discussion: Compositional Dynamical Complexity / 7.6：
Experimental Compositional Analysis of Cellular Automata / 8：
Aims and Motivations: Attraction-Based Classification and Composition / 8.1：
Preliminary Notions / 8.2：
Cellular Automata / 8.2.1：
Transfinite Attraction / 8.2.2：
Shifted Hamming Distance / 8.2.3：
Experimental Classification / 8.3：
Formal Attraction-Based Classification / 8.4：
Type-<$>{\cal N}<$> Cellular Automata / 8.4.1：
Type-<$>{\cal F}<$> Cellular Automata / 8.4.3：
Type-<$>{\cal P}<$> Cellular Automata / 8.4.4：
Type-<$>{\cal S}<$> Cellular Automata / 8.4.5：
Type-<$>{\cal A}<$> Cellular Automata / 8.4.6：
Structural Organizations of CA Classes / 8.4.7：
Motivation: Simulation vs Theoretical Results / 8.5.1：
Linear Periodicity Hierarchy / 8.5.2：
Periodicity Clustering / 8.5.3：
Organization w.r.t. Shifted Hamming Distance / 8.5.4：
Dynamical Complexity in CA / 8.5.5：
Conjectures in CA Composition / 8.6：
Complexity by Composition of Shifts / 8.7：
Rules 2 and 16 / 8.7.1：
A More Precise Conjecture / 8.7.2：
Qualitative Analysis and Complexity Measures / 8.8：
Compositional Analysis of Complex CA / 8.9：
Local Disjunction, Local Union, and Global Union / 8.9.1：
Comparison and Summary of Results / 8.9.2：
Summary and Partial Conclusion / 8.10：
Open Questions / 8.10.2：
Classification: State-of-the-Art / 8.10.3：
Aperiodicity in Cellular Automata / 8.10.4：
Related Work in Composition / 8.10.5：
Compositional Analysis of Computational Properties / 9：
Automata as Dynamical Systems / 9.1：
Comparing Dynamical Systems / 9.2：
Extrinsic Method / 9.2.1：
Intrinsic Method / 9.2.2：
Our Comparison / 9.2.3：
From Locality to Globality / 9.3：
Turing Machines / 9.3.1：
Continuous Functions / 9.3.2：
General Model / 9.3.4：
Comparison Through Simulation / 9.4：
Simulation / 9.4.1：
Choice of Coding / 9.4.2：
From TM to CA / 9.4.3：
From CA to CF / 9.4.4：
Weak Hierarchy / 9.4.5：
Topological and Metric Properties / 9.5：
Continuity / 9.5.1：
Shift-Invariance / 9.5.2：
Lipschitz Property / 9.5.3：
Shift-Vanishing Effect / 9.5.4：
Nondeterminism / 9.5.5：
Summary / 9.5.6：
Computability of Initial Conditions / 9.6：
Hierarchy of Systems / 9.7：
Composition and Computation / 9.8：
Further Work / 9.8.2：
Epilogue: Conclusions and Directions for Future Work / 9.8.3：
Contributions and Related Work / 10.1：
Mathematical Framework / 10.1.1：
Compositional Analysis / 10.1.2：
Directions for Future Research / 10.2：
A Patchwork of Open Technical Issues / 10.2.1：
Fractal Image Compression / 10.2.2：
Distributed Dynamical Optimization / 10.2.3：
Distributed Systems and Self-Stabilization / 10.2.4：
Probabilistic Systems and Measures / 10.2.5：
Higher-Order Systems, Control, and Learning / 10.2.6：
Design of Attraction-Based Systems / 10.2.7：
The Garden of Structural Similarities / 10.3：
Coda: Compositional Complexity Revisited / 10.4：
Bibliography
Glossary of Symbols
Index
Foreword / Michel Sintzoff
Preface
Prologue: Aims, Themes, and Motivations / 1：
6.

図書
図書
6. Control of uncertain systems with bounded inputs (pbk. : alk. paper)
Sophie Tarbouriech and Germain Garcia, (eds)
出版情報: London ; New York : Springer-Verlag, c1997  xiv, 186 p. ; 24cm
シリーズ名: Lecture notes in control and information sciences ; 227
所蔵情報: loading…
7.

図書
図書
7. Object-oriented systems analysis and design (:pbk)
Ronald J. Norman
出版情報: Upper Saddle River, NJ : Prentice Hall, c1996  xxvi, 430 p. ; 24 cm
シリーズ名: Prentice Hall series in information management
所蔵情報: loading…
8.

図書
図書
8. Analysis of dynamical and cognitive systems : advanced course, Stockholm, Sweden, August 9-14, 1993 : proceedings (: gw)
Stig I. Andersson (ed.)
出版情報: Berlin ; New York : Springer-Verlag, c1995  vi, 260 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 888
所蔵情報: loading…
9.

図書
図書
9. Computational dynamics in multibody systems
edited by Manuel F.O.S. Pereira and Jorge A.C. Ambrósio
出版情報: Dordrecht : Kluwer Academic, c1995  viii, 316 p. ; 25 cm
所蔵情報: loading…
10.

図書
図書
10. Over-constrained systems
Michael Jampel, Eugene Freuder, Michael Maher (eds.)
出版情報: Berlin ; New York : Springer, c1996  x, 309 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1106
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼