Fermilab Fermilab Core Computing Division

Library Home |  Ask a Librarian library@fnal.gov |  Book Catalog |  Library Journals |  Requests |  SPIRES |  Fermilab Documents |

Fermilab Library
SPIRES-BOOKS: FIND KEYWORD ALGORITHM ANALYSIS AND PROBLEM COMPLEXITY *END*INIT* use /tmp/qspiwww.webspi1/30502.95 QRY 131.225.70.96 . find keyword algorithm analysis and problem complexity ( in books using www Cover
Image
Call number:SPRINGER-2016-9783319282626:ONLINE Show nearby items on shelf
Title:Sparse Grids and Applications - Stuttgart 2014
Author(s):
Date:2016
Edition:1st ed. 2016
Size:1 online resource (24 p.)
Note:10.1007/978-3-319-28262-6
Contents:Peng Chen and Christoph Schwab: Adaptive Sparse Grid Model Order Reduction for Fast Bayesian Estimation and Inversion -- Fabian Franzelin and Dirk Pflüger: From Data to Uncertainty: An E_cient Integrated Data-Driven Sparse Grid Approach to Propagat e Uncertainty -- Helmut Harbrecht and Michael Peters: Combination Technique Based Second Moment Analysis for Elliptic PDEs on Random Domains -- Brendan Harding: Adaptive sparse grids and extrapolation techniques -- Philipp Hupp and Riko Jacob: A Cache-Opt imal Alternative to the Unidirectional Hierarchization Algorithm -- Valeriy Khakhutskyy and Markus Hegland: Spatially-Dimension- Adaptive Sparse Grids for Online Learning -- Katharina Kormann and Eric Sonnendrücker: Sparse Grids for the Vlasov–Poisson Equation -- Fabio Nobile, Lorenzo Tamellini, Francesco Tesei and Raul Tempone: An Adaptive Sparse Grid Algorithm for Elliptic PDEs with Lognormal Diffusion Coefficient -- David Pfander, Alexander Heinecke, and Dirk Pflüger: A New Subspace-Based
Algorithm for E_cient Spatially Adaptive Sparse Grid Regression, Classification and Multi- Evaluation -- Sharif Rahman, Xuchun Ren, and Vaibhav Yadav: High-Dimensional Stochastic Design Optimization by Adaptive-Sparse Polynomial Dimensional Decompos ition -- Jie Shen, Yingwei Wang, and Haijun Yu: E_cient Spectral-Element Methods for the Electronic Schrödinger Equation -- Hoang Tran, Clayton G. Webster, and Guannan Zhang: A Sparse Grid Method for Bayesian Uncertainty Quantification with Application t o Large Eddy Simulation Turbulence Models -- Julian Valentin and Dirk Pflüger: Hierarchical Gradient-Based Optimization with BSplines on Sparse Grids
ISBN:9783319282626
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Lecture Notes in Computational Science and Engineering: 109
Keywords: Mathematics , Algorithms , Computer mathematics , Mathematics , Computational Science and Engineering , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9783034806121:ONLINE Show nearby items on shelf
Title:Separable Type Representations of Matrices and Fast Algorithms [electronic resource] : Volume 2 Eigenvalue Method
Author(s): Yuli Eidelman
Israel Gohberg
Iulian Haimovici
Date:2014
Publisher:Basel : Springer Basel : Imprint: Birkhuser
Size:1 online resource
Note:This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The primary focus is on fast algorithms (many of linear complexity) for matrices insemiseparable, quasiseparable , band and companion form. The work examines algorithms of multiplication, inversion and description of eigenstructure and includes a wealth of illustrative examples throughout the different chapters. Thesecond volume, consisting of four parts, addresses the eigenvalue problem for matrices with quasiseparable structure and applications to the polynomial root finding problem. In the first part the properties of the characteristicpolynomials of principal leading submatrices, the structure of eigenspaces and the basic methods for computing eigenvalues are studied in detail for matrices with quasiseparable representation of the first order. The second part isdevoted to the divide and conquer method, with the main algorithms also being derived for matrices wit h quasiseparable representation of order one. The QR iteration method for some classes of matrices with quasiseparablerepresentations of any order is studied in the third part. This method is then used in the last part in order to provide a fast solver fo r the polynomial root finding problem. The work is based mostly on results obtained by the authorsand their coauthors. Due to its many significant applications and accessible style, the text will be a valuable resource for engineers, scientists, numerical analysts, computer scientists and mathematicians alike
Contents:Part 5. The eigenvalue structure of order one quasiseparable matrices
21. Quasiseparable of order one matrices. Characteristic polynomials
22. Eigenvalues with geometric multiplicity one
23. Kernels of quasiseparable of order one matrices
24. Multiple eigenvalues
Part 6. Divide and conquer method for eigenproblems
25. Divide step
26. Conquer step and rational matrix functions eigenproblem
27. Complete algorithm for Hermitian matrices
28. Complete algorithm for unitary Hessenberg matrices
Part 7. Algorithms for qr iterations and for reduction to Hessenberg form
ISBN:9783034806121
Series:eBooks
Series:SpringerLink
Series:Operator Theory: Advances and Applications, 0255-0156 : v235
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Matrix theory , Numerical analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461452423:ONLINE Show nearby items on shelf
Title:Connected Dominating Set: Theory and Applications [electronic resource]
Author(s): Ding-Zhu Du
Peng-Jun Wan
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:The connected dominating set (CDS)has been a classic subject studied in graph theory since 1975. It has been discovered inrecent years thatCDS has important applications in communication networks especially in wirelessnetworks as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. Thiswork isa valuable reference for researchers in computer s cience and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, industrial engineering, anddiscrete mathematics. The book may also be used as a text in a graduate seminar fo r PhD students. Readers should have a basic knowledge of computational complexity and combinatorial optimization. In this book, the authors present thestate-of-the-art in the study of connected dominating sets. Each chapter is devoted to one problem, and consists of three parts: motivation and overview, problem complexity analysis, and approximation algorithm designs. The text isdesigned togive the reader a clear understanding of thebackground, formulation, existing important research results, and open pr oblems. Topics include minimum CDS, routing-cost constrained CDS, weighted CDS, directed CDS, SCDS(strongly connected dominating set), WCDS (weakly connected dominating set), CDS-partition, virtual backbone in wireless networks, convertor placement in opt ical networks, coverage in wireless sensor networks, and more
Note:Springer eBooks
ISBN:9781461452423
Series:e-books
Series:SpringerLink (Online service)
Series:Springer Optimization and Its Applications, 1931-6828 : v77
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer Communication Networks , Computer software , Combinatorics , Mathematical optimization
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2009-9780387094144:ONLINE Show nearby items on shelf
Title:Linear and Integer Programming vs Linear Integration and Counting [electronic resource] : A Duality Viewpoint
Author(s): Jean-Bernard Lasserre
Date:2009
Publisher:New York, NY : Springer New York
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:In this book the author analyzes and compares four closely related problems, namely linear programming, integer programming, linear integration, linear summation (or counting). The focus is on duality and the approach is rathernovel as it puts intege r programming in perspective with three associated problems, and permits one to define discrete analogues of well-known continuous duality concepts, and the rationale behind them. Also, the approach highlightsthe difference between the discrete and contin uous cases. Central in the analysis are the continuous and discrete Brion and Vergne's formulae for linear integration and counting. This approach provides some new insights on dualityconcepts for integer programs, and also permits to retrieve and shed ne w light on some well-known results. For instance, Gomory relaxations and the abstract superadditive dual of integer programs are re-interpreted in this algebraicapproach. This book will serve graduate students and researchers in applied mathematics, optim ization, operations research and computer science. Due to the substantial practical importance of some presented problems, researchers inother areas will also find this book useful
Note:Springer eBooks
Contents:Preface. Introduction
Part I. Linear Integration and Linear Programming. The Linear Integration Problem I. Comparing the Continuous Problems P and I
Part II. Linear Counting and Integer Programming
The Linear Counting Problem I(d). Relating the Discrete Problems P(d) and I(d) with P
Part III. Duality. Duality and Gomory Relaxations. Barvinoks Counting Algorithm and Gomory Relaxations. A Discrete Farkas Lemma. The Integer Hull of a Convex Rational Polytope. Duality and Superadditive Functions
Appendix: Legendre
Fenchel, Laplace, Cramer, and Z Transforms. References. Glossary
ISBN:9780387094144
Series:e-books
Series:SpringerLink (Online service)
Series:Springer Series in Operations Research and Financial Engineering, 1431-8598
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computational complexity , Discrete groups , Mathematical optimization , Operations research
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2004-9781441989093:ONLINE Show nearby items on shelf
Title:Collectives and the Design of Complex Systems
Author(s):
Date:2004
Size:1 online resource (323 p.)
Note:10.1007/978-1-4419-8909-3
Contents:1. A Survey of Collectives -- 2. Theory of Collective Intelligence -- 3. On Learnable Mechanism Design -- 4. Asynchronous Learning in Decentralized Environments: A Game-Theoretic Approach -- 5. Competition between Adaptive Agents:
Learning and Collective Efficiency -- 6. Managing Catastrophic Changes in a Collective -- 7. Effects of Interagent Communications on the Collective -- 8. Man and Superman: Human Limitations, Innovation, and Emergence in Resource
Competition -- 9. Design Principles for the Distributed Control of Modular Self-Reconfigurable Robots -- 10. Two Paradigms for the Design of Artificial Collectives -- 11. Efficiency and Equity in Collective Systems of Interacting
Heterogeneous Agents -- 12. Selection in Coevolutionary Algorithms and the Inverse Problem -- 13. Dynamics of Large Autonomous Computational Systems -- About the Editors
ISBN:9781441989093
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Computers , Artificial intelligence , System theory , Mathematics , Complex Systems , Artificial Intelligence (incl. Robotics) , Algorithm Analysis and Problem Complexity , Computing Methodologies
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2004-9780817682200:ONLINE Show nearby items on shelf
Title:Transforms and Fast Algorithms for Signal Analysis and Representations
Author(s): Guoan Bi
Date:2004
Size:1 online resource (422 p.)
Note:10.1007/978-0-8176-8220-0
Contents:1 Introduction -- 1.1 Discrete linear transforms -- 1.2 Fast algorithms -- 1.3 New transforms -- 1.4 Organization of the book -- References -- 2 Polynomial Transforms and Their Fast Algorithms -- 2.1 Basic number theory -- 2.2 Basic
polynomial theory -- 2.3 1D polynomial transform -- 2.4 Fast polynomial transform -- 2.5 MD polynomial transform and fast algorithm -- 2.6 Chapter summary -- References -- 3 Fast Fourier Transform Algorithms -- 3.1 Introduction -- 3.2
Radix-2 and split-radix algorithms -- 3.3 Generalized split-radix algorithm -- 3.4 Prime factor algorithms -- 3.5 Generalized 2D split-radix algorithms -- 3.6 Fast algorithms for generalized DFT -- 3.7 Polynomial transform algorithms
for MD DFT -- 3.8 Chapter summary -- 4 Fast Algorithms for 1D Discrete Hartley Transform -- 4.1 Introduction -- 4.2 Split-radix algorithms -- 4.3 Generalized split-radix algorithms -- 4.4 Radix-2 algorithms for type-II, -III and -IV
DHTs -- 4.5 Prime factor algorithms -- 4.6 Radix-q algorithms -- 4.7 Fast algorithms using type-I DHT -- 4.8 Chapter summary -- 5 Fast Algorithms for MD Discrete Hartley Transform -- 5.1 Introduction -- 5.2 Split-radix algorithms for
2D type-I DHT -- 5.3 Fast algorithms for 2D type-II, -III and -IV DHTs -- 5.4 Fast algorithms based on type-I DHT -- 5.5 PT-based radix-2 algorithm for MD type-I DHT -- 5.6 PT-based radix-2 algorithm for MD type-II DHT -- 5.7 PT-based
radix-q algorithm for MD type-I DHT -- 5.8 PT-based radix-q algorithm for MD type-II DHT -- 5.9 Chapter summary -- References -- 6 Fast Algorithms for 1D Discrete Cosine Transform -- 6.1 Introduction -- 6.2 Radix-2 algorithms -- 6.3
Prime factor algorithms -- 6.4 Radix-q algorithms -- 6.5 Fast algorithms based on type-I bCT -- 6.6 Chapter summary -- 7 Fast Algorithms for MD Discrete Cosine Transform -- 7.1 Introduction -- 7.2 Algorithms for 2D type-I, -II and -III
DCTs -- 7.3 Prime factor algorithm for MD DCT -- 7.4 PT-based radix-2 algorithm for MD type-II DCT -- 7.5 PT-based radix-2 algorithm for MD type-III DCT -- 7.6 PT-based radix-q algorithm for MD type-II DCT -- 7.7 PT-based radix-q
algorithm for MD type-III DCT -- 7.8 Chapter summary -- 8 Integer Transforms and Fast Algorithms -- 8.1 Introduction -- 8.2 Preliminaries -- 8.3 Integer DCT and fast algorithms -- 8.4 Integer DHT and fast algorithms -- 8.5 MD Integer
DCT and fast algorithms -- 8.6 MD Integer DHT and fast algorithms -- 8.7 Chapter summary -- References -- 9 New Methods of Time-Frequency Analysis -- 9.1 Introduction -- 9.2 Preliminaries -- 9.3 Harmonic transform -- 9.4 Tomographic
time-frequency transform -- 9.5 Chapter summary -- References
ISBN:9780817682200
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Engineering , Algorithms , Fourier analysis , Applied mathematics , Engineering mathematics , Electrical engineering , Engineering , Communications Engineering, Networks , Appl.Mathematics/Computational Methods of Engineering , Applications of Mathematics , Algorithm Analysis and Problem Complexity , Fourier Analysis , Algorithms
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2003-9783662050781:ONLINE Show nearby items on shelf
Title:Numerical Optimization Theoretical and Practical Aspects
Author(s): J. Frédéric Bonnans
Date:2003
Size:1 online resource (423 p.)
Note:10.1007/978-3-662-05078-1
Contents:1 General Introduction -- 2 Basic Methods -- 3 Line-Searches -- 4 Newtonian Methods -- 5 Conjugate Gradient -- 6 Special Methods -- 7 Some Theory of Nonsmooth Optimization -- 8 Some Methods in Nonsmooth Optimization -- 9 Bundle
Methods. The Quest of Descent -- 10 Decomposition and Duality -- 11 Background -- 12 Local Methods for Problems with Equality Constraints -- 13 Local Methods for Problems with Equality and Inequality Constraints -- 14 Exact
Penalization -- 15 Globalization by Line-Search -- 16 Quasi-Newton Versions -- 17 Linearly Constrained Optimization and Simplex Algorithm -- 18 Linear Monotone Complementarity and Associated Vector Fields -- 19 Predictor-Corrector
Algorithms -- 20 Non-Feasible Algorithms -- 21 Self-Duality -- 22 One-Step Methods -- 23 Complexity of Linear Optimization Problems with Integer Data -- 24 Karmarkar’s Algorithm -- References
ISBN:9783662050781
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Computer science , Numerical analysis , Mathematical optimization , Calculus of variations , Operations research , Management science , Mathematics , Optimization , Operations Research, Management Science , Calculus of Variations and Optimal Control Optimization , Numerical Analysis , Algorithm Analysis and Problem Complexity , Mathematics of Computing
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2003-9780387224442:ONLINE Show nearby items on shelf
Title:Recent Advances in Algorithms and Combinatorics
Author(s):
Date:2003
Size:1 online resource (352 p.)
Note:10.1007/b98891
Contents:The Matching Lattice -- Discrete Mathematics and Radio Channel Assignment -- On the coloration of perfect graphs -- Algorithmic Aspects of Tree Width -- A Survey on Clique Graphs -- Semidefinite Programs and Combinatorial Optimization
-- Approximability of NP-Optimization Problems -- Pattern Inference under many Guises -- Szemerédi’s Regularity Lemma and Quasi-randomness
ISBN:9780387224442
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Operations research , Management science , Discrete mathematics , Combinatorics , Mathematics , Discrete Mathematics , Combinatorics , Algorithm Analysis and Problem Complexity , Operations Research, Management Science
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2002-9783642040160:ONLINE Show nearby items on shelf
Title:Graph Colouring and the Probabilistic Method
Author(s): Michael Molloy
Date:2002
Size:1 online resource (326 p.)
Note:10.1007/978-3-642-04016-0
Contents:1. Colouring Preliminaries -- 2. Probabilistic Preliminaries -- 3. The First Moment Method -- 4. The Lovász Local Lemma -- 5. The Chernoff Bound -- 6. Hadwiger’s Conjecture -- 7. A First Glimpse of Total Colouring -- 8. The Strong
Chromatic Number -- 9. Total Colouring Revisited -- 10. Talagrand’s Inequality and Colouring Sparse Graphs -- 11. Azuma’s Inequality and a Strengthening of Brooks’ Theorem -- 12. Graphs with Girth at Least Five -- 13. Triangle-Free
Graphs -- 14. The List Colouring Conjecture -- 15. The Structural Decomposition -- 16. ?, ? and ? -- 17. Near Optimal Total Colouring I: Sparse Graphs -- 18. Near Optimal Total Colouring II: General Graphs -- 19. Generalizations of the
Local Lemma -- 20. A Closer Look at Talagrand’s Inequality -- 21. Finding Fractional Colourings and Large Stable Sets -- 22. Hard-Core Distributions on Matchings -- 23. The Asymptotics of Edge Colouring Multigraphs -- 24. The Method of
Conditional Expectations -- 25. Algorithmic Aspects of the Local Lemma -- References
ISBN:9783642040160
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Algorithms and Combinatorics: 23
Keywords: Mathematics , Computers , Algorithms , Computer science , Probabilities , Combinatorics , Mathematics , Probability Theory and Stochastic Processes , Combinatorics , Theory of Computation , Math Applications in Computer Science , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2002-9781461200857:ONLINE Show nearby items on shelf
Title:Diophantine Equations and Power Integral Bases New Computational Methods
Author(s): István Gaál
Date:2002
Size:1 online resource (208 p.)
Note:10.1007/978-1-4612-0085-7
Contents:1 Introduction -- 1.1 Basic concepts -- 1.2 Related results -- 2 Auxiliary Results, Tools -- 2.1 Baker’s method, effective finiteness theorems -- 2.2 Reduction -- 2.3 Enumeration methods -- 2.4 Software, hardware -- 3 Auxiliary
Equations -- 3.1 Thue equations -- 3.2 Inhomogeneous Thue equations -- 3.3 Relative Thue equations -- 3.4 The resolution of norm form equations -- 4 Index Form Equations in General -- 4.1 The structure of the index form -- 4.2 Using
resolvents -- 4.3 Factorizing the index form when proper subfields exist -- 4.4 Composite fields -- 5 Cubic Fields -- 5.1 Arbitrary cubic fields -- 5.2 Simplest cubic fields -- 6 Quartic Fields -- 6.1 Algorithm for arbitrary quartic
fields -- 6.2 Simplest quartic fields -- 6.3 An interesting application to mixed dihedral quartic fields -- 6.4 Totally complex quartic fields -- 6.5 Bicyclic biquadratic number fields -- 7 Quintic Fields -- 7.1 Algorithm for arbitrary
quintic fields -- 7.2 Lehmer’s quintics -- 8 Sextic Fields -- 8.1 Sextic fields with a quadratic subfield -- 8.2 Sextic fields with a cubic subfield -- 8.3 Sextic fields as composite fields -- 9 Relative Power Integral Bases -- 9.1
Basic concepts -- 9.2 Relative cubic extensions -- 9.3 Relative quartic extensions -- 10 Some Higher Degree Fields -- 10.1 Octic fields with a quadratic subfield -- 10.2 Nonic fields with cubic subfields -- 10.3 Some more fields of
higher degree -- 11 Tables -- 11.1 Cubic fields -- 11.2 Quartic fields -- 11.3 Sextic fields -- References -- Author Index
ISBN:9781461200857
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Computer science , Mathematics , Mathematics, general , Algorithm Analysis and Problem Complexity , Mathematics of Computing , Algorithms
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2002-9781447138860:ONLINE Show nearby items on shelf
Title:Digraphs Theory, Algorithms and Applications
Author(s): Jørgen Bang-Jensen
Date:2002
Size:1 online resource (754 p.)
Note:10.1007/978-1-4471-3886-0
Contents:1. Basic Terminology, Notation and Results -- 2. Distances -- 3. Flows in Networks -- 4. Classes of Digraphs -- 5. Hamiltonicity and Related Problems -- 6. Hamiltonian Refinements -- 7. Global Connectivity -- 8. Orientations of Graphs
-- 9. Disjoint Paths and Trees -- 10. Cycle Structure of Digraphs -- 11. Generalizations of Digraphs -- 12. Additional Topics -- References -- Symbol Index -- Author Index
ISBN:9781447138860
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Mathematical optimization , Calculus of variations , Combinatorics , Mathematics , Combinatorics , Optimization , Calculus of Variations and Optimal Control Optimization , Algorithms , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2001-9783662043356:ONLINE Show nearby items on shelf
Title:Soft Computing Integrating Evolutionary, Neural, and Fuzzy Systems
Author(s): Andrea Tettamanzi
Date:2001
Size:1 online resource (328 p.)
Note:10.1007/978-3-662-04335-6
Contents:1 Evolutionary Algorithms -- 2 Artificial Neural Networks -- 3 Fuzzy Systems -- 4 Evolutionary Design of Artificial Neural Networks -- 5 Evolutionary Design of Fuzzy Systems -- 6 Neuro-fuzzy Systems -- 7 Fuzzy Evolutionary Algorithms
-- 8 Natural Parallel (Soft) Computing -- 9 Epilogue
ISBN:9783662043356
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Computers , Algorithms , Mathematical logic , Artificial intelligence , Complexity, Computational , Mathematics , Mathematical Logic and Foundations , Artificial Intelligence (incl. Robotics) , Computation by Abstract Devices , Algorithm Analysis and Problem Complexity , Mathematical Logic and Formal Languages , Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2001-9783642575921:ONLINE Show nearby items on shelf
Title:Approximation, Optimization and Mathematical Economics
Author(s):
Date:2001
Size:1 online resource (393 p.)
Note:10.1007/978-3-642-57592-1
Contents:On the Banach Contraction Principle for Multivalued Mappings -- The Second-order in Time Continuous Newton Method -- Polynomial Density in Lp(R, d?) and Representation of All Measures Which Generate a Determinate Hamburger Moment
Problem -- Characterizing the Premium at the Equilibrium of a Reinsurance Market with Short Sale Constraints -- Computational Aspects of Primal Dual Proximal Algorithms for M-estimation with Constraints -- Approximate Saddle Point
Assertions for a General Class of Approximation Problems -- Trends in Hölder Approximation -- Classical Overlapping Generations Models with Incomplete Markets -- Poisson-Hermite Representation of Solutions for the
Equation$$\frac{{{\partial ^2}}}{{\partial {t^2}}}u\left( {x,t} \right) + {\Delta _x}u\left( {x,t} \right) - 2x\cdot{\nabla _x}u\left( {x,t} \right) = 0 $$ -- Formulae for the Sensitivity Analysis of Linear Programming Problems --
Numerical Aspects in Locating the Corner of the L-curve -- Geometric Design by Means of a G2Continuous A-Spline -- The Veto Mechanism Revisited -- A Relaxed Cutting Plane Algorithm for Solving Fuzzy Variational Inequalities -- Towards
Metric Theory of Metric Regularity -- Shape Extraction by Nonlinear Diffusion -- Existence of Cooperative Equilibria in Strategic Form Games -- A Note on Entropy Optimization -- Some Applications of the Mollification Method --
Observable Instability for the Repeated Prisoner’s Dilemma -- Optimization and Algebraic Techniques for Image Analysis -- S.O.C.R.A.t.E.S. Simultaneous Optimal Control by Recursive and Adaptive Estimation System: Problem Formulation
and Computational Results -- Approximation of Functions and Sets -- Approximating with Radial Basis Functions: an Evolutionary Approach -- Staircase Algorithm and Boundary Valued Convex Interpolation by Gregory’s Splines -- Generic
Existence of Local Political Equilibrium -- The Feasible Set in Generalized Semi-Infinite Optimization -- The Complexity of High-Order Interior-Point Methods for Solving Sufficient Complementarity Problems -- Constructing Separable
Objective Functions -- Polar Forms, p-Values, and the Core -- Orthogonal Matrix Polynomials, Connection Between Recurrences on the Unit Circle and on a Finite Interval -- Fast Least Squares Approximation Using Tensor Products of
Functions and Linear Forms
ISBN:9783642575921
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Operations research , Decision making , Mathematical analysis , Analysis (Mathematics) , Mathematical optimization , Calculus of variations , Economic theory , Mathematics , Analysis , Economic Theory/Quantitative Economics/Mathematical Methods , Optimization , Operation Research/Decision Theory , Calculus of Variations and Optimal Control Optimization
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2001-9783642566660:ONLINE Show nearby items on shelf
Title:Computer Algebra in Scientific Computing CASC 2001 Proceedings of the Fourth International Workshop on Computer Algebra in Scientific Computing, Konstanz, Sept. 22-26, 2001
Author(s):
Date:2001
Size:1 online resource (555 p.)
Note:10.1007/978-3-642-56666-0
Contents:Jets. A Maple-Package for Formal Differential Geometry -- Computing Stratifications of Quotients of Finite Groups and an Application to Shape Memory Alloy -- A MuPAD Library for Differential Equation -- Algebraic Identification
Algorithm and Application to Dynamical Systems -- Cooperation Between a Dynamic Geometry Environment and a Computer Algebra System for Geometric Discovery -- On the Stability of Steady Motions of a Solar-Sail Satellite -- Application
of Computer Algebra for Investigation of a Group Properties of the Navier-Stokes Equations for Compressible Viscous Heat-Conducting Gas -- Mathematica and Nilpotent Lie Superalgebras -- Neighborhoods of an Ordinary Linear Differential
Equation -- Invariants of Finite Groups and Involutive Division -- Symbolic Computation and Boundary Conditions for the Wave Equation -- Parametric Systems of Linear Congruences -- Bifurcation Analysis of Low Resonant Case of the
Generalized Henon - Heiles System -- An Involutive Reduction Method to Find Invariant Solutions for Partial Differential Equations -- Recurrence Functions and Numerical Characteristics of Graphs -- A New Combinatorial Algorithm for
Large Markov Chains -- GROOME - Tool Supported Graphical Object Oriented Modelling for Computer Algebra and Scientific Computing -- Construction of Janet Bases I.Monomial Bases -- Construction of Janet Bases II.Polynomial Bases --
Low-Dimensional Quasi-Filiform Lie Algebras with Great Length -- Algebraic Methods for Sectioning Parametric Surfaces -- The Methods of Computer Algebra and the Arnold-Moser Theorem -- Symbolic Algorithms of Algebraic Perturbation
Theory: Hydrogen Atom in the Field of Distant Charge -- Perturbation versus Differentiation Indices -- Employment of the Gröbner Bases in Analysis of Systems Having Algebraic First Integrals -- “Coalgebra” Structures on 1-Homological
Models for Commutative Differential Graded Algebras -- Conservative Finite Difference Schemes for Cosymmetric Systems -- A Mathematica Solver for Two-Point Singularly-Perturbed Boundary Value Problems -- A New Algorithm for Computing
Cohomologies of Lie Superalgebras -- Parallel Computing with Mathematica -- Solution of Systems of Linear Diophantine Equations -- SYMOPT: Symbolic Parametric Mathematical Programming -- Representing Graph Properties by Polynomial
Ideals -- Parametric G1-Blending of Several Surfaces -- A Method of Logic Deduction and Verification in KBS Using Positive Integers -- Progressive Long Waves on a Slope (A New Solution to the Euler Equation?) -- The Method of Newton
Polyhedra for Investigating Singular Positions of Some Mechanisms -- Algebraic Predicates for Empirical Data -- Fractional Driftless Fokker-Planck Equation with Power Law Diffusion Coefficients -- Factorization of Overdetermined
Systems of Linear Partial Differential Equations with Finite-Dimensional Solution Space -- Semilinear Motion Planning Among Moving Objects in REDLOG -- Author Index
ISBN:9783642566660
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Physics , Mathematics , Algorithms , Theoretical, Mathematical and Computational Physics , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2001-9783642566288:ONLINE Show nearby items on shelf
Title:Linear Optimization and Extensions Problems and Solutions
Author(s): Dimitris Alevras
Date:2001
Size:1 online resource (449 p.)
Note:10.1007/978-3-642-56628-8
Contents:1 Introduction -- 1.1 Minicases and Exercises -- 2 The Linear Programming Problem -- 2.1 Exercises -- 3 Basic Concepts -- 3.1 Exercises -- 4 Five Preliminaries -- 4.1 Exercises -- 5 Simplex Algorithms -- 5.1 Exercises -- 6 Primal-Dual
Pairs -- 6.1 Exercises -- 7 Analytical Geometry -- 7.1 Points, Lines, Subspaces -- 7.2 Polyhedra, Ideal Descriptions, Cones -- 7.3 Point Sets, Affine Transformations, Minimal Generators -- 7.4 Double Description Algorithms -- 7.5
Digital Sizes of Rational Polyhedra and Linear Optimization -- 7.6 Geometry and Complexity of Simplex Algorithms -- 7.7 Circles, Spheres, Ellipsoids -- 7.8 Exercises -- 8 Projective Algorithms -- 8.1 A Basic Algorithm -- 8.2 Analysis,
Algebra, Geometry -- 8.3 The Cross Ratio -- 8.4 Reflection on a Circle and Sandwiching -- 8.5 A Projective Algorithm -- 8.6 Centers, Barriers, Newton Steps -- 8.7 Exercises -- 9 Ellipsoid Algorithms -- 9.1 Matrix Norms, Approximate
Inverses, Matrix Inequalities -- 9.2 Ellipsoid “Halving” in Approximate Arithmetic -- 9.3 Polynomial-Time Algorithms for Linear Programming -- 9.4 Deep Cuts, Sliding Objective, Large Steps, Line Search -- 9.5 Optimal Separators, Most
Violated Separators, Separation -- 9.6 ?-Solidification of Flats, Polytopal Norms, Rounding -- 9.7 Optimization and Separation -- 9.8 Exercises -- 10 Combinatorial Optimization: An Introduction -- 10.1 The Berlin Airlift Model
Revisited -- 10.2Complete Formulations and Their Implications -- 10.3 Extremal Characterizations of Ideal Formulations -- 10.4 Polyhedra with the Integrality Property -- 10.5 Exercises -- Appendices -- A Short-Term Financial Management
-- A. 1 Solution to the Cash Management Case -- B Operations Management in a Refinery -- B.l Steam Production in a Refinery -- B.2 The Optimization Problem -- B.3 Technological Constraints, Profits and Costs -- B.4 Formulation of the
Problem -- B.5 Solution to the Refinery Case -- C Automatized Production: PCBs and Ulysses’ Problem -- C.l Solutions to Ulysses’ Problem
ISBN:9783642566288
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Operations research , Decision making , Mathematical optimization , Calculus of variations , Discrete mathematics , Combinatorics , Economic theory , Mathematics , Discrete Mathematics , Optimization , Economic Theory/Quantitative Economics/Mathematical Methods , Combinatorics , Operation Research/Decision Theory , Calculus of Variations and Optimal Control Optimization
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2000-9789401142519:ONLINE Show nearby items on shelf
Title:Complex Harmonic Splines, Periodic Quasi-Wavelets Theory and Applications
Author(s): Han-lin Chen
Date:2000
Size:1 online resource (226 p.)
Note:10.1007/978-94-011-4251-9
Contents:1. Theory and Application of Complex Harmonic Spline Functions -- §1.1 The Interpolating Complex Spline Functions on ? -- §1.2 Quasi-Interpolant Complex Splines on ? -- §1.3 Complex Harmonic Splines and Their Function-theoretical
Properties -- §1.4 Geometric Property of CHSF -- §1.5 Application of CHSF to Approximation of Conformal Mappings -- §1.6 Algorithm for Computing P(z) -- §1.7 The Mappings Between Two Arbitrary Domains -- 2. Periodic Quasi-Wavelets --
§2.1 Periodic Orthonormal Quasi-wavelets -- §2.2 Quasi-wavelets on the Unit Circle -- §2.3 Anti-periodic Orthonormal Quasi-wavelets -- §2.4 Real Valued Periodic Quasi-wavelets -- §2.5 Other Methods in Periodic Multi-resolution Analysis
-- 3. The Application of Quasi-Wavelets in Solving a Boundary Integral Equation of the Second Kind -- §3.1 Discretization -- §3.2 Simplifying the Procedure by Using PQW -- §3.3 Algorithm -- §3.4 Complexity -- §3.5 The Convergence of
the Approximate Solution -- §3.6 Error Analysis -- §3.7 The Dirichlet Problem -- 4. The Periodic Cardinal Interpolatory Wavelets -- §4.1 The Periodic Cardinal Interpolatory Scaling Functions -- §4.2 The Periodic Cardinal Interpolatory
Wavelets -- §4.3 Symmetry of Scaling Functions and Wavelets -- §4.4 Dual Scaling Functions and Dual Wavelets -- §4.5 Algorithms -- §4.6 Localization of PISF via Spline Approach -- §4.7 Localization of PISF via Circular Approach -- §4.8
Local Properties of PCIW -- §4.9 Examples -- Concluding Remarks -- References -- Author Index
ISBN:9789401142519
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Approximation theory , Functions of complex variables , Integral equations , Computer mathematics , Mathematics , Approximations and Expansions , Integral Equations , Functions of a Complex Variable , Computational Mathematics and Numerical Analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2000-9783642572012:ONLINE Show nearby items on shelf
Title:Computer Algebra in Scientific Computing CASC 2000
Author(s):
Date:2000
Size:1 online resource (439 p.)
Note:10.1007/978-3-642-57201-2
Contents:Fast Matrix Computation of Subresultant Polynomial Remainder Sequences -- About Simultaneous Representation of Two Natural Numbers by a Sum of Three Primes -- On a Description of Irreducible Component in the Set of Nilpotent Leibniz
Algebras Containing the Algebra of Maximal Nilindex, and Classification of Graded Filiform Leibniz Algebras -- Application of Computer Algebra in Problems on Stabilization of Gyroscopic Systems -- Implementing Computational Services
Based on OpenMath -- Group Classification of the Navier-Stokes Equations for Compressible Viscous Heat-Conducting Gas -- Plotting Functions and Singularities with Maple and Java on a Component-based Web Architecture -- Stable
Self-Oscillatory Regimes in Volterra Models of Three Populations -- Computing “Small” 1-Homological Models for Commutative Differential Graded Algebras -- Effective computation of algebra of derivations of Lie algebras -- An
Integration and Reduction for Ordinary Non Linear Differential Equations Library -- Complexity of Derivatives Generated by Symbolic Differentiation -- An Assessment of the Efficiency of Computer Algebra Systems in the Solution of
Scientific Computing Problems -- On the Relation Between Pommaret and Janet Bases -- An (Asymptotic) Error Bound for the Evaluation of Polynomials at Roots -- Three Remarks on Comprehensive Gröbner and SAGBI Bases -- Computing the
Cylindrical Algebraic Decomposition Adapted to a Set of Equalities -- Symbolic Algorithms of Algebraic Perturbation Theory for a Hydrogen Atom: the Stark Effect -- CADECOM: Computer Algebra software for functional DECOMposition --
Computeralgebra and the Systematic Construction of Finite Unlabeled Structures -- Heat Invariant E2 for Nonminimal Operator on Manifolds with Torsion -- Computer Algebra for Automated Performance Modeling of Fortran Programs -- A
Parallel Symbolic-Numerical Approach to Algebraic Curve Plotting -- Parametric Analysis for a Nonlinear System -- Extended Splicing System and Semigroup of Dominoes -- Newton Polyhedra and the Reversible System of Ordinary Differential
Equations -- Condition Analysis of Overdetermined Algebraic Problems -- An Algebraic Approach to Offsetting and Blending of Solids -- Application of Computer Algebra Methods to Some Problems of Theoretical and Applied Celestial
Mechanics -- Computing the Frobenius Normal Form of a Sparse Matrix -- Lessons Learned from Using CORBA for Components in Scientific Computing -- Deciding Linear-Transcendental Problems -- Author Index
ISBN:9783642572012
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Physics , Mathematics , Algorithms , Theoretical, Mathematical and Computational Physics , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2000-9783034884051:ONLINE Show nearby items on shelf
Title:Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Author(s):
Date:2000
Size:1 online resource (341 p.)
Note:10.1007/978-3-0348-8405-1
Contents:1 Rawa trees -- 2 The height and width of simple trees -- 3 On the node structure of binary search trees -- 4 The saturation level in binary search tree -- 5 Smoothness and decay properties of the limiting quicksort density function
-- 6 The number of descendants in simply generated random trees -- 7 An universal predictor based on pattern matching, preliminary results -- 8 A bijective proof of the arborescent form of the multivariable Lagrange’s inversion formula
-- 9 Counting paths on the slit plane -- 10 Random generation of words of context-free languages according to the frequencies of letters -- 11 An algebra for generating trees -- 12 A set of well-defined operations on succession rules
-- 13 Convergence of a genetic algorithm with finite population -- 14 Complexity issues for a redistribution problem -- 15 On the rate of escape of a mutation-selection algorithm -- 16 Randomized rendezvous -- 17 Computing closed-form
stochastic bounds on the stationary distribution of Markov chains -- 18 Effects of reordering and lumping in the analysis of discrete-time SANs -- 19 Large deviations for polling systems -- 20 A nonlinear integral operator encountered
in the bandwidth sharing of a star-shaped network -- 21 A new proof of Yaglom’s exponential limit law -- 22 The branching measure, Hausdorff and packing measures on the Galion-Watson tree -- 23 Likelihood ratio processes and asymptotic
statistics for systems of interacting diffusions with branching and immigration -- 24 Probabilistic Analysis of a Schröder Walk Generation Algorithm -- 25 Gibbs families -- 26 Generating functions with high-order poles are nearly
polynomial -- 27 Ultrahigh Moments for a Brownian Excursion -- 28 A zero-one law for random sentences in description logics
ISBN:9783034884051
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Probabilities , Mathematics , Probability Theory and Stochastic Processes , Mathematics, general
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2000-9781461213901:ONLINE Show nearby items on shelf
Title:An Introduction to Quantum Computing Algorithms
Author(s): Arthur O Pittenger
Date:2000
Size:1 online resource (140 p.)
Note:10.1007/978-1-4612-1390-1
Contents:1 Quantum -- 2 Basics of Quantum Computation -- 3 Quantum Algorithms -- 4 Quantum Error-Correcting Codes -- Afterword -- References
ISBN:9781461213901
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Progress in Computer Science and Applied Logic : 19
Keywords: Computer science , Computers , Algorithms , Computer science , Applied mathematics , Engineering mathematics , Quantum physics , Quantum computers , Spintronics , Computer Science , Theory of Computation , Applications of Mathematics , Math Applications in Computer Science , Quantum Physics , Quantum Information Technology, Spintronics , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2000-9781461213888:ONLINE Show nearby items on shelf
Title:Algorithmic Problems in Groups and Semigroups
Author(s):
Date:2000
Size:1 online resource (309 p.)
Note:10.1007/978-1-4612-1388-8
Contents:Syntactic and Global Semigroup Theory: A Synthesis Approach -- Semigroups with Central Idempotents -- Algebraic Geometry over Groups -- Aspects of the Theory of Free Groups -- Polynomial Isoperimetric Inequalities for Richard
Thompson’s Groups F, T,and V -- Ordered Monoids and J-Trivial Monoids -- A Remark on Finitely Generated Subgroups of Free Groups -- Homotopy Reduction Systems for Monoid Presentations II:The Guba—Sapir Reduction and Homotopy Modules --
Algorithmic Problems for Finite Groups and Finite Semigroups -- A Survey on the Computational Power of Some Classes of Finite Monoid Presentations -- Rewriting Systems, Finiteness Conditions, and Associated Functions -- Multiparty
Communication Complexity of Finite Monoids -- Presentations for Monoids, Their Maximal Subgroups, and Schützenberger Groups -- On the Growth of Relatively Free Semigroups -- When Can One Finite Monoid Simulate Another? -- Computing
Closures of Finitely Generated Subgroups of the Free Group
ISBN:9781461213888
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Group theory , Mathematical logic , Combinatorics , Mathematics , Group Theory and Generalizations , Algorithm Analysis and Problem Complexity , Combinatorics , Mathematical Logic and Foundations
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2000-9781447136576:ONLINE Show nearby items on shelf
Title:Discrete Mathematics Using a Computer
Author(s): Cordelia Hall
Date:2000
Size:1 online resource (339 p.)
Note:10.1007/978-1-4471-3657-6
Contents:1 Introduction to Haskell -- 2 Propositional Logic -- 3 Predicate Logic -- 4 Set Theory -- 5 Recursion -- 6 Inductively Defined Sets -- 7 Induction -- 8 Relations -- 9 Functions -- 10 Discrete Mathematics in Circuit Design -- A
Software Tools for Discrete Mathematics -- B Resources on the Web -- C Solutions to Selected Exercises -- C.1 Introduction to Haskell -- C.2 Propositional Logic -- C.3 Predicate Logic -- C.4 Set Theory -- C.5 Recursion -- C.6
Inductively Defined Sets -- C.7 Induction -- C.8 Relations -- C.9 Functions -- C.1O Discrete Mathematics in Circuit Design
ISBN:9781447136576
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Mathematical logic , Mathematics , Mathematics, general , Mathematical Logic and Formal Languages , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1999-9783642602184:ONLINE Show nearby items on shelf
Title:Computer Algebra in Scientific Computing CASC’99 Proceedings of the Second Workshop on Computer Algebra in Scientific Computing, Munich, May 31 – June 4, 1999
Author(s):
Date:1999
Size:1 online resource (511 p.)
Note:10.1007/978-3-642-60218-4
Contents:Solution of Ordinary Differential Equations with MathLie -- Analysis of Stability of Rational Approximations through Computer Algebra -- An Automatic Symbolic-Numeric Taylor Series ODE Solver -- About Normal Form Method -- Computer
Algebra Investigation of Equivalence in 4-node Plane Stress/Strain Finite Elements -- Symmetry Theorems for the Newtonian 4- and 5-body Problems with Equal Masses -- Symbolic Derivation of Different Class of High-order Compact Schemes
for Partial Differential Equations -- Implementation of Aerodynamic Computations with Mathematica -- Completion of Linear Differential Systems to Involution -- Constrained Hamiltonian Systems and Gröbner Bases -- Construction of
Involutive Monomial Sets for Different Involutive Divisions -- Partial Inverse Heuristic for the Approximate Solution of Non-linear Equations -- Computing Cocycles on Simplicial Complexes -- Bifurcations of Maps in the Software Package
CONTENT -- Extending a Java Based Framework for Scientific Software-Components -- Symbolic-numeric Investigations for Stability Analysis of Satellite Systems -- Quantization by Presentation: The Nambu-Goto String in 1+3 Dimensions --
One Algorithm of Finding Solutions for the Systems with First Integrals -- Cohomology of Lie Superalgebras of Hamiltonian Vector Fields: Computer Analysis -- Computer Algebra Tools in Construction of Renormgroup Symmetries 251 -- Where
Numerics Can Benefit from Computer Algebra in Finite Difference Modelling of Fluid Flows -- Effectively Computation of Some Radicals of Submodules of Free Modules -- Computations on Character Tables of Association Schemes --
Investigation of Subgroup Embeddings by the Computer Algebra Package GAP -- An Investigation into Stability of Conservative Mechanical Systems Using Analytic Calculations -- Superfast Computations with Singular Structured Matrices over
Abstract Fields -- From Modeling to Simulation with Symbolic Computation: An Application to Design and Performance Analysis of Complex Optical Devices -- A Symbolic Numeric Environment for Analyzing Measurement Data in Multi-Model
Settings (Extended Abstract) -- Geometric Interpretation of Strong Inconsistency in Knowledge Based Systems -- Indices and Solvability for General Systems of Differential Equations -- Decomposing Systems of Polynomial Equations --
Polynomials with Coefficients of Limited Accuracy -- Localization of Roots of a Polynomial not Represented in Canonical Form -- On Normalization of a Class of Polynomial Hamiltonians: From Ordinary and Inverse Points of View -- On
Multivariate Polynomial Decomposition -- Complexity of Monomial Evaluations and Duality -- On the Simplification of Nonlinear DAE Systems in Analog Circuit Design -- Symbolic Analysis of Computational Algorithms with SYDNA
ISBN:9783642602184
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Mathematics , Algorithms , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1999-9783642181924:ONLINE Show nearby items on shelf
Title:A History of Algorithms From the Pebble to the Microchip
Author(s):
Date:1999
Size:1 online resource (524 p.)
Note:10.1007/978-3-642-18192-4
Contents:1 Algorithms for Arithmetic Operations -- 1.1 Sumerian Division -- 1.2 A Babylonian Algorithm for Calculating Inverses -- 1.3 Egyptian Algorithms for Arithmetic -- 1.4 Tableau Multiplication -- 1.5 Optimising Calculations -- 1.6
Simple Division by Difference on a Counting Board -- 1.7 Division on the Chinese Abacus -- 1.8 Numbers Written as Decimals -- 1.9 Binary Arithmetic -- 1.10 Computer Arithmetic -- 2 Magic Squares -- Squares with Borders -- The Marking
Cells Method -- Proceeding by 2 and by 3 -- Arnauld's Borders Method -- 3 Methods of False Position -- 3.1 Mesopotamia: a Geometric False Position -- 3.2 Egypt: Problem 26 of the Rhind Papyrus -- 3.3 China: Chapter VII of the Jiuzhang
Suanshu -- 3.4 India: Bh?skara and the Rule of Simple False Position -- 3.5 Qust? Ibn L?q?: A Geometric Justification -- 3.6 Ibn al-Bann?: The Method of the Scales -- 3.7 Fibonacci: the Elchatayn rule -- 3.8 Pellos: The Rule of Three
and The Method of Simple False Position -- 3.9 Clavius: Solving a System of Equations -- 4 Euclid's Algorithm -- 4.1 Euclid's Algorithm -- 118 Comparing Ratios -- 4.3 Bézout's Identity -- 4.4 Continued Fractions -- 4.5 The Number of
Roots of an Equation -- 5 From Measuring the Circle to Calculating ? -- Geometric Approaches -- 5.1 The Circumference of the Circle -- 5.2 The Area of the Circle in the Jiuzhang Suanshu -- 5.3 The Method of Isoperimeters -- Analytic
Approaches -- 5.4 Arithmetic Quadrature -- 5.5 Using Series -- 5.6 Epilogue -- 6 Newton's Methods -- The Tangent Method -- 6.1 Straight Line Approximations -- 6.2 Recurrence Formulas -- 6.3 Initial Conditions -- 6.4 Measure of
Convergence -- 6.5 Complex Roots -- Newton's Polygon -- 6.6 The Ruler and Small Parallelograms -- Solving Equations by Successive Approximations -- Extraction of Square Roots -- 7.1 The Method of Heron of Alexandria -- 7.2 The Method
of Theon of Alexandria -- 7.3 Mediaeval Binomial Algorithms -- Numerical Solutions of Equations -- 7.4 Al-T?si’s Tables -- 7.5 Viète's Method -- 7.6 Kepler's Equation -- 7.7 Bernoulli's Method of Recurrent Series -- 7.8 Approximation
by Continued Fractions -- Horner like Transformations of Polynomial Equations -- 7.9 The Ruffini-Budan Schema -- Algorithms in Arithmetic -- Factors and Multiples -- 8.1 The Sieve of Eratosthenes -- 8.2 Criteria For Divisibility -- 8.3
Quadratic Residues -- Tests for Primality -- 8.4 The Converse of Fermat's Theorem -- 8.5 The Lucas Test -- 8.6 Pépin'sTest -- Factorisation Algorithms -- 8.7 Factorisation by the Difference of Two Squares -- 8.8 Factorisation by
Quadratic Residues -- 8.9 Factorisation by Continued Fractions -- The Pell-Fermat Equation -- 8.10 The Arithmetica of Diophantus -- 8.11 The Lagrange Result -- Solving Systems of Linear Equations -- 9.1 Cramer's Rule -- 9.2 The Method
of Least Squares -- 9.3 The Gauss Pivot Method -- 9.4 A Gauss Iterative Method -- 9.5 Jacobi's Method -- 9.6 Seidel's Method -- 9.7 Nekrasov and the Rate of Convergence -- 9.8 Cholesky's Method -- 9.9 Epilogue -- 10 Tables and
Interpolation -- 10.1 Ptolemy's Chord Tables -- 10.2 Briggs and Decimal Logarithms -- 10.3 The Gregory-Newton Formula -- 10.4 Newton's Interpolation Polynomial -- 10.5 The Lagrange Interpolation Polynomial -- 10.6 An Error Upper Bound
-- 10.7 Neville's Algorithm -- Approximate Quadratures -- 11.1 Gregory's Formula -- 11.2 Newton's Three-Eighths Rule -- 11.3 The Newton-Cotes Formulas -- 11.4 Stirling's Correction Formulas -- 11.5 Simpson's Rule -- 11.6 The Gauss
Quadrature Formulas -- 11.7 Chebyshev's Choice -- 11.8 Epilogue -- Approximate Solutions of Differential Equations -- 12.1 Euler's Method -- 12.2 The Existence of a Solution -- 12.3 Runge's Methods -- 12.4 Heun's Methods -- 12.5
Kutta's Methods -- 12.6 John Adams and the Use of Finite Differences -- 12.7 Epilogue -- 13 Approximation of Functions -- Uniform Approximation -- 13.1 Taylor's Formula -- 13.2 The Lagrange Remainder -- 13.3 Chebyshev's Polynomial of
Best Approximation -- 13.4 Spline-Fitting -- Mean Quadratic Approximation -- 13.5 Fourier Series -- 13.6 The Fast Fourier Transform -- 14 Acceleration of Convergence -- 14.1 Stirling's Method for Series -- 14.2 The Euler-Maclaurin
Summation Formula -- 14.3 The Euler Constant -- 14.4 Aitken's Method -- 14.5 Richardson's Extrapolation Method -- 14.6 Romberg's Integration Method -- 15 Towards the Concept of Algorithm -- Recursive Functions and Computable Functions
-- 15.1 The 1931 Definition -- 15.2 General Gödel Recursive Functions -- 15.3 Alonzo Church and Effective Calculability -- 15.4 Recursive Functions in the Kleene Sense -- Machines -- 15.5 The Turing Machine -- 15.6 Post's Machine --
15.7 Conclusion -- Biographies -- General Index -- Index of Names
ISBN:9783642181924
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Computer science , Computer mathematics , History , Number theory , Mathematics , Computational Mathematics and Numerical Analysis , Number Theory , Algorithm Analysis and Problem Complexity , Mathematics of Computing , History of Mathematical Sciences
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1999-9783540492511:ONLINE Show nearby items on shelf
Title:Dynamical Systems, Plasmas and Gravitation Selected Papers from a Conference Held in Orléans la Source, France, 22–24 June 1997
Author(s):
Date:1999
Size:1 online resource (404 p.)
Note:10.1007/BFb0105906
Contents:General introduction -- Honouring marc feix -- Interaction of a ultra-high-intensity electromagnetic pulse with an overdense plasma -- Plasma accelerator simulations using semi-lagrangian 1D and 2D Vlasov code -- 2D vlasov-eulerian
simulations: Extension to the relativistic case -- A limiting case of averaging compactness lemmas motivated by the kinetic formulation of some classical systems of fluid mechanics -- Expansion of a negative ion plasma into vacuum -- A
presentation of the diffusion velocity method -- Finite-difference schemes for the diffusion equation -- 1, 2, 3 plasmas! -- The notion of integrability for time-dependent Hamiltonian systems: Illustration from the relativistic motion
of a charged particle in an electromagnetic field -- Stochastisation of phases in four-wave interaction -- Light bullets propagation in saturating nonlinear optical medium -- The dynamics of some quantum open systems with short-range
nonlinearities -- Global dynamics of fusion plasmas -- The Jeans’ criterion and the gravitational instability -- Recent progress in studies of one-dimensional gravitating systems -- Fluctuations of the kinetic energy and stability of
coherent structures in a one-dimensional gravitating gas: Numerical simulation -- Structure formation in the one-dimensional gravitational gas -- Interaction forces and space symmetry -- Cellular automaton explosion models -- Acoustic
earth imaging by seismic migration -- Integrability and alegbraic solutions for the 2-D lotka-Volterra system -- Isochronous centers of cubic reversible systems -- On the polynomial first integrals of the (a, b, c) Lotka-Volterra
system -- Local integrability for nilpotent critical point -- Lie symmetries of generalized Ermakov systems -- Hamilton’s principal function and integration by quadratures for an N-degree-of-freedom non - autonomous system given N
invertible invariants in involution -- Hierarchies of similarity symmetries and singularity analysis -- Area preserving flows on compact connected surfaces -- A lattice model for tropical rain forests -- Periodic solutions and
associated limit cycle for the generalised Chazy equation -- A branch and bound algorithm for the flow-shop scheduling problem -- On the linear third-order differential equation -- Telecommunication network optimisation and statistical
physics -- A study of the analytical and local semiclassical Wigner distribution -- Quantum transition and irreversibility -- Pioneering in plasma simulation
ISBN:9783540492511
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Lecture Notes in Physics: 518
Keywords: Physics , Gravitation , Fluids , Atoms , Statistical physics , Dynamical systems , Physics , Mathematical Methods in Physics , Numerical and Computational Physics , Fluid- and Aerodynamics , Statistical Physics, Dynamical Systems and Complexity , Atomic, Molecular, Optical and Plasma Physics , Classical and Quantum Gravitation, Relativity Theory
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1999-9781461215561:ONLINE Show nearby items on shelf
Title:Grid Generation and Adaptive Algorithms
Author(s):
Date:1999
Size:1 online resource (189 p.)
Note:10.1007/978-1-4612-1556-1
Contents:hp-finite element procedures on non-uniform geometric meshes: Adaptivity and constrained approximation -- Tetrahedral bisection and adaptive finite elements -- Resolution of boundary layers on triangular meshes -- A general concept of
adaptivity in finite element methods with applications to problems in fluid and structural mechanics -- A solution based H1 norm triangular mesh quality indicator -- Experiments with repartitioning and load balancing adaptive meshes --
Distributed octree data structures and local refinement method for the parallel solution of three-dimensional conservation laws -- Adaptive finite element methods for elastostatic contact problems -- The full domain partition approach
to parallel adaptive refinement -- Adaptive solution of phase change problems over unstructured tetrahedral meshes
ISBN:9781461215561
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:The IMA Volumes in Mathematics and its Applications: 113
Keywords: Mathematics , Algorithms , Combinatorics , Mathematics , Combinatorics , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1999-9781461215165:ONLINE Show nearby items on shelf
Title:Algorithms for Parallel Processing
Author(s):
Date:1999
Size:1 online resource (373 p.)
Note:10.1007/978-1-4612-1516-5
Contents:Models and Mechanisms in Parallel Computation -- A general-purpose shared-memory model for parallel computation -- Supporting a coherent shared address space across SMP nodes: An application-driven investigation -- Single-message vs.
batch communication -- Some simple and practical strategies for parallelism -- Discrete and Combinatorial Algorithms -- Locality in computing connected components -- Routing in optical and wireless networks -- Transparent parallel
transactions on replicated autonomous databases -- Mathematics of Parallelizing Compilers -- Mathematical tools for loop transformations: From systems of uniform recurrence equations to the polytope model -- Numerical Algorithms -- The
scalability of mesh improvement algorithms -- Data parallel performance optimizations using array aliasing -- Coarsening, sampling, and smoothing: Elements of the multilevel method -- Some methods of parallel pseudorandom number
generation -- Performance of parallel sparse triangular solution -- Determining an out-of-core FFT decomposition strategy for parallel disks by dynamic programming -- Parallel Computer Systems and Software -- Enabling department-scale
supercomputing -- Providing uniform dynamic access to numerical software
ISBN:9781461215165
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:The IMA Volumes in Mathematics and its Applications: 105
Keywords: Mathematics , Algorithms , Applied mathematics , Engineering mathematics , Numerical analysis , Combinatorics , Mathematics , Numerical Analysis , Applications of Mathematics , Algorithm Analysis and Problem Complexity , Combinatorics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1998-9781475727937:ONLINE Show nearby items on shelf
Title:Computational Complexity and Feasibility of Data Processing and Interval Computations
Author(s): Vladik Kreinovich
Date:1998
Size:1 online resource (459 p.)
Note:10.1007/978-1-4757-2793-7
Contents:1 Informal Introduction: Data Processing, Interval Computations, and Computational Complexity -- 2 The Notions of Feasibility and NP-Hardness: Brief Introduction -- 3 In the General Case, the Basic Problem of Interval Computations is
Intractable -- 4 Basic Problem of Interval Computations for Polynomials of a Fixed Number of Variables -- 5 Basic Problem of Interval Computations for Polynomials of Fixed Order -- 6 Basic Problem of Interval Computations for
Polynomials with Bounded Coefficients -- 7 Fixed Data Processing Algorithms, Varying Data: Still NP-Hard -- 8 Fixed Data, Varying Data Processing Algorithms: Still Intractable -- 9 What if We only Allow some Arithmetic Operations in
Data Processing? -- 10 For Fractionally-Linear Functions, a Feasible Algorithm Solves the Basic Problem of Interval Computations -- 11 Solving Interval Linear Systems is NP-Hard -- 12 Interval Linear Systems: Search for Feasible
Classes -- 13 Physical Corollary: Prediction is not Always Possible, Even for Linear Systems with Known Dynamics -- 14 Engineering Corollary: Signal Processing is NP-Hard -- 15 Bright Sides of NP-Hardness of Interval Computations I:
NP-Hard Means That Good Interval Heuristics can Solve other Hard Problems -- 16 If Input Intervals are Narrow Enough, Then Interval Computations are Almost Always Easy -- 17 Optimization — a First Example of a Numerical Problem in
which Interval Methods are used: Computational Complexity and Feasibility -- 18 Solving Systems of Equations -- 19 Approximation of Interval Functions -- 20 Solving Differential Equations -- 21 Properties of Interval Matrices I: Main
Results -- 22 Properties of Interval Matrices II: Proofs and Auxiliary Results -- 23 Non-Interval Uncertainty I: Ellipsoid Uncertainty and its Generalizations -- 24 Non-Interval Uncertainty II: Multi-Intervals and Their Generalizations
-- 25 What if Quantities are Discrete? -- 26 Error Estimation for Indirect Measurements: Interval Computation Problem is (Slightly) Harder than a Similar Probabilistic Computational Problem -- A In Case of Interval (Or More General)
Uncertainty, no Algorithm can Choose the Simplest Representative -- B Error Estimation for Indirect Measurements: Case of Approximately Known Functions -- C From Interval Computations to Modal Mathematics -- D Beyond NP: Two Roots
Good, one Root Better -- E Does “NP-Hard”Really Mean “Intractable”? -- F Bright Sides of NP-Hardness of Interval Computations II: Freedom of Will? -- G The Worse, The Better: Paradoxical Computational Complexity of Interval
Computations and Data Processing -- References
ISBN:9781475727937
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Applied Optimization: 10
Keywords: Mathematics , Computers , Applied mathematics , Engineering mathematics , Computer mathematics , Mathematical models , Mathematical optimization , Mathematics , Computational Mathematics and Numerical Analysis , Theory of Computation , Optimization , Mathematical Modeling and Industrial Mathematics , Applications of Mathematics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1998-9781461303077:ONLINE Show nearby items on shelf
Title:Multilevel Optimization: Algorithms and Applications
Author(s):
Date:1998
Size:1 online resource (386 p.)
Note:10.1007/978-1-4613-0307-7
Contents:1 Congested O-D Trip Demand Adjustment Problem: Bilevel Programming Formulation and Optimality Conditions -- 1 Introduction -- 2 Literature Review -- 3 Model Analysis -- 4 Necessary Optimality Conditions of the DAP -- 5 Conclusions --
2 Determining Tax Credits for Converting Nonfood Crops to Biofuels: An Application of Bilevel Programming -- 1 Introduction -- 2 Mathematical Model -- 3 Description of Algorithms -- 4 Computational Results -- 5 Discussion -- 3
Multilevel Optimization Methods in Mechanics -- 1 Introduction -- 2 Presentation of the Multilevel Decomposition Methods -- 3 Large Cable Structures -- 4 Large Elastoplastic Structures -- 5 Validation and Improvements of Simplified
Models -- 6 Extension to other Problems. Decomposition Algorithms for Nonconvex Minimization Problems -- 7 A Multilevel Method for the Approximation of a Nonconvex Minimum Problem by Convex ones -- 8 Multilevel Decomposition into two
Convex Problems -- 9 Structures with Fractal Interfaces -- 4 Optimal Structural Design in Nonsmooth Mechanics -- 1 Introduction -- 2 Parametric Nonsmooth Structural Analysis Problems -- 3 Optimal Design Problems -- 4 Mathematical
Analysis and Algorithms -- 5 Discussion -- References -- 5 Optimizing the Operations of an Aluminium Smelter Using Non-Linear Bi-Level Programming -- 1 Introduction -- 2 The Mathematical Model of the Aluminium Smelter -- 3 The Solution
Algorithm -- 4 The Mathematical Model Representing the Multi-period Operations of the Aluminium Smelter -- 5 Concluding Remarks -- References -- 6 Complexity Issues in Bilevel Linear Programming -- 1 Introduction -- 2 Difficulty in
Approximation -- 3 A Special Case Solvable in Polynomial Time -- 4 Regret Ratio in Decision Analysis -- 5 Future Directions -- References -- 7 The Computational Complexity of Multi-Level Bottleneck Programming Problems -- 1
Introduction -- 2 Problem Statement and Previous Complexity Results -- 3 Hardness Proof for Multi-Level Bottleneck Programs -- 4 Hardness Proof for Multi-Level Linear Programs -- 5 The Complexity of Bi-Level Programs -- 6 Discussion --
References -- 8 On the Linear Maxmin and Related Programming Problems -- 1 Introduction -- 2 Reformulations -- 3 Tools for Resolution -- 4 Solving the Linear Maxmin Problem -- 9 Piecewise Sequential Quadratic Programming for
Mathematical Programs with Nonlinear Complementarity Constraints -- 1 Introduction -- 2 Application to Optimal Design of Mechanical Structures -- 3 The Piecewise Smooth Approach to NCP-MP -- 4 The PSQP Method for NCP-MPEC -- 5
Computational Testing of PSQP -- References -- 10 A New Branch and Bound Method for Bilevel Linear Programs -- 1 Introduction -- 2 The Equivalent Reverse Convex Program -- 3 Solution Method -- 4 Implementation Issues -- 5 Illustrative
Example -- 11 A Penalty Method for Linear Bilevel Programming Problems -- 1 Introduction -- 2 Linear Bilevel Programming Problem -- 3 The Method -- 4 Globalization of the Solution -- 5 Numerical Examples -- 6 Concluding Remarks -- 12
An Implicit Function Approach to Bilevel Programming Problems -- 1 Introduction -- 2 Lipschitz Continuity of Optimal Solutions -- 3 Application of the Bundle Method -- 4 Non-uniquely Solvable Lower Level Problems -- 5 Nonconvex Lower
Level Problems and Coupling Constraints in the Upper Level Problem -- 13 Bilevel Linear Programming, Multiobjective Programming, and Monotonic Reverse Convex Programming -- 1 Introduction -- 2 Optimization over the Efficient Set -- 3
Bilevel Linear Programming -- 4 Basic Properties of (FMRP) -- 5 Different D.C. Approaches to (FMRP) -- 14 Existence of Solutions to Generalized Bilevel Programming Problem -- 1 Introduction -- 2 Notations and Preliminaries -- 3
Parametric Implicit Variational Problem -- 4 Existence Results for Generalized Bilevel Problems -- 5 Final Remarks -- 15 Application of Topological Degree Theory to Complementarity Problems -- 1 Problem Specification and Topological
Degree Theory -- 2 General Complementarity Problem -- 3 Sufficient Conditions for Solution Existence -- 4 Standard Complementarity Problem -- 5 Implicit Complementarity Problem -- 6 General Order Complementarity Problem -- References
-- 16 Optimality and Duality in Parametric Convex Lexicographic Programming -- 1 Introduction -- 2 Orientation -- 3 Continuity -- 4 Global Optimality -- 5 Local Optimality -- 6 Duality -- 7 Bilevel Zermelo’s Problems
ISBN:9781461303077
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Nonconvex Optimization and Its Applications: 20
Keywords: Mathematics , Computers , Algorithms , Mathematical models , Mathematical optimization , Mathematics , Optimization , Algorithms , Mathematical Modeling and Industrial Mathematics , Theory of Computation
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1998-9781461206194:ONLINE Show nearby items on shelf
Title:Modern Graph Theory
Author(s): Béla Bollobás
Date:1998
Size:1 online resource (394 p.)
Note:10.1007/978-1-4612-0619-4
Contents:I Fundamentals -- I.1 Definitions -- I.2 Paths, Cycles, and Trees -- I.3 Hamilton Cycles and Euler Circuits -- I.4 Planar Graphs -- I.5 An Application of Euler Trails to Algebra -- I.6 Exercises -- II Electrical Networks -- II.1
Graphs and Electrical Networks -- II.2 Squaring the Square -- II.3 Vector Spaces and Matrices Associated with Graphs -- II.4 Exercises -- II.5 Notes -- III Flows, Connectivity and Matching -- III.1 Flows in Directed Graphs -- III.2
Connectivity and Menger’s Theorem -- III.3 Matching -- III.4 Tutte’s 1-Factor Theorem -- III.5 Stable Matchings -- III.6 Exercises -- III.7 Notes -- IV Extremal Problems -- IV.1 Paths and Cycles -- IV.2 Complete Subgraphs -- IV.3
Hamilton Paths and Cycles -- W.4 The Structure of Graphs -- IV 5 Szemerédi’s Regularity Lemma -- IV 6 Simple Applications of Szemerédi’s Lemma -- IV.7 Exercises -- IV.8 Notes -- V Colouring -- V.1 Vertex Colouring -- V.2 Edge Colouring
-- V.3 Graphs on Surfaces -- V.4 List Colouring -- V.5 Perfect Graphs -- V.6 Exercises -- V.7 Notes -- VI Ramsey Theory -- VI.1 The Fundamental Ramsey Theorems -- VI.2 Canonical Ramsey Theorems -- VI.3 Ramsey Theory For Graphs -- VI.4
Ramsey Theory for Integers -- VI.5 Subsequences -- VI.6 Exercises -- VI.7 Notes -- VII Random Graphs -- VII.1 The Basic Models-The Use of the Expectation -- VII.2 Simple Properties of Almost All Graphs -- VII.3 Almost Determined
Variables-The Use of the Variance -- VII.4 Hamilton Cycles-The Use of Graph Theoretic Tools -- VII.5 The Phase Transition -- VII.6 Exercises -- VII.7 Notes -- VIII Graphs, Groups and Matrices -- VIII.1 Cayley and Schreier Diagrams --
VIII.2 The Adjacency Matrix and the Laplacian -- VIII.3 Strongly Regular Graphs -- VIII.4 Enumeration and Pólya’s Theorem -- VIII.5 Exercises -- IX Random Walks on Graphs -- IX.1 Electrical Networks Revisited -- IX.2 Electrical
Networks and Random Walks -- IX.3 Hitting Times and Commute Times -- IX.4 Conductance and Rapid Mixing -- IX.5 Exercises -- IX.6 Notes -- X The Tutte Polynomial -- X.1 Basic Properties of the Tutte Polynomial -- X.2 The Universal Form
of the Tutte Polynomial -- X.3 The Tutte Polynomial in Statistical Mechanics -- X.4 Special Values of the Tutte Polynomial -- X.5 A Spanning Tree Expansion of the Tutte Polynomial -- X.6 Polynomials of Knots and Links -- X.7 Exercises
-- X.8 Notes -- Symbol Index -- Name Index
ISBN:9781461206194
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Graduate Texts in Mathematics: 184
Keywords: Mathematics , Algorithms , Computer science , Combinatorics , Mathematics , Combinatorics , Mathematics of Computing , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1997-9783662033388:ONLINE Show nearby items on shelf
Title:Algebraic Complexity Theory With the Collaboration of Thomas Lickteig
Author(s): Peter Bürgisser
Date:1997
Size:1 online resource (618 p.)
Note:10.1007/978-3-662-03338-8
Contents:1. Introduction -- I. Fundamental Algorithms -- 2. Efficient Polynomial Arithmetic -- 3. Efficient Algorithms with Branching -- II. Elementary Lower Bounds -- 4. Models of Computation -- 5. Preconditioning and Transcendence Degree --
6. The Substitution Method -- 7. Differential Methods -- III. High Degree -- 8. The Degree Bound -- 9. Specific Polynomials which Are Hard to Compute -- 10. Branching and Degree -- 11. Branching and Connectivity -- 12. Additive
Complexity -- IV. Low Degree -- 13. Linear Complexity -- 14. Multiplicative and Bilinear Complexity -- 15. Asymptotic Complexity of Matrix Multiplication -- 16. Problems Related to Matrix Multiplication -- 17. Lower Bounds for the
Complexity of Algebras -- 18. Rank over Finite Fields and Codes -- 19. Rank of 2-Slice and 3-Slice Tensors -- 20. Typical Tensorial Rank -- V. Complete Problems -- 21. P Versus NP: A Nonuniform Algebraic Analogue -- List of Notation
ISBN:9783662033388
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Grundlehren der mathematischen Wissenschaften, A Series of Comprehensive Studies in Mathematics: 315
Keywords: Mathematics , Computers , Algorithms , Algebraic geometry , Mathematical logic , Combinatorics , Mathematics , Combinatorics , Theory of Computation , Mathematical Logic and Foundations , Algorithm Analysis and Problem Complexity , Algorithms , Algebraic Geometry
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1997-9783642605390:ONLINE Show nearby items on shelf
Title:Foundations of Computational Mathematics Selected Papers of a Conference Held at Rio de Janeiro, January 1997
Author(s):
Date:1997
Size:1 online resource (441 p.)
Note:10.1007/978-3-642-60539-0
Contents:Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract) -- Essentially Smooth Lipschitz Functions: Compositions and Chain Rules -- Junction Detection and Filtering -- Recognition in Hierarchical Models -- Continuity
?—Algebras (Extended Abstract) -- Condition Number Analysis for Sparse Polynomial Systems -- Residues in the Torus and Toric Varieties -- Piecewise Smooth Orthonormal Factors for Fundamental Solution Matrices -- Algorithms for
computing finite semigroups -- Extended Grzegorczyk Hierarchy in the BSS Model of Computability -- Affine-Invariant Symmetry Sets -- On the Qualitative Properties of Modified Equations -- Numerical Methods on (and off) Manifolds -- On
One Computational Scheme Solving the Nonstationary Schrödinger Equation with Polynomial Nonlinearity -- Newton Iteration Towards a Cluster of Polynomial Zeros -- Szemerédi’s Regularity Lemma for Sparse Graphs -- Questions on Attractors
of 3-Manifolds -- A Trust-Region SLCP Model Algorithm for Nonlinear Programming -- On the height used by additives BSS machines -- The Space Complexity of Elimination Theory: Upper Bounds -- Global Stochastic Recursive Algorithms --
Dynamical Recognizers: Real-time Language Recognition by Analog Computers (Extended Abstract) -- Solving special polynomial systems by using structured matrices and algebraic residues -- Numerical Integration of Differential Equations
on Homogeneous Manifolds -- A Convergence proof of an Iterative Subspace Method for Eigenvalues Problems -- Regularity of Minimizers of the Mumford-Shah Functional -- Tests and Constructions of Irreducible Polynomials over Finite
Fields -- Numerical Linear Algebra in Optical Imaging -- Explicit symplectic integration of rod dynamics -- Toric Laminations, Sparse Generalized Characteristic Polynomials, and a Refinement of Hilbert’s Tenth Problem --
Finite-Dimensional Feedback Control of a Scalar Reaction-Diffusion Equation via Inertial Manifold Theory -- Computational aspects of jacobian matrices -- Rigid body dynamics and measure differential inclusions -- Linear decision lists
and partitioning algorithms for the construction of neural networks -- Ill-Posedness and Finite Precision Arithmetic: A Complexity Analysis for Interior Point Methods -- Iterated Commutators, Lie’s Reduction Method and Ordinary
Differential Equations on Matrix Lie Groups
ISBN:9783642605390
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Algebra , Mathematical analysis , Analysis (Mathematics) , Geometry , Number theory , Topology , Mathematics , Algebra , Number Theory , Geometry , Algorithm Analysis and Problem Complexity , Topology , Analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1997-9783642591181:ONLINE Show nearby items on shelf
Title:Numerical Computation 1 Methods, Software, and Analysis
Author(s): Christoph W Ueberhuber
Date:1997
Size:1 online resource (474 p.)
Note:10.1007/978-3-642-59118-1
Contents:1 Scientific Modeling -- 1.1 Reality Versus Model -- 1.2 The Model Subject and the Model -- 1.3 The Model Subject and Reality -- 1.4 Model Building -- 2 Fundamental Principles of Numerical Methods -- 2.1 From Application Problems to
their Numerical Solution -- 2.2 Numerical Problems -- 2.3 Types of Errors in Numerics -- 2.4 The Condition of Mathematical Problems -- 2.5 The Condition of Application Problems -- 2.6 The Mathematical Elements of Condition Estimation
-- 2.7 Validation of Numerical Computations -- 3 Computers for Numerical Data Processing -- 3.1 Processors -- 3.2 Memory -- 3.3 Performance Quantification -- 3.4 Analytical Performance Assessment -- 3.5 Empirical Performance Assessment
-- 4 Numerical Data and Numerical Operations -- 4.1 Mathematical Data -- 4.2 Numerical Data on Computers -- 4.3 Operations on Numerical Data -- 4.4 Number Systems on Computers -- 4.5 Structure of Floating-Point Systems -- 4.6
Standardization of Floating-Point Number Systems -- 4.7 Arithmetics for Floating-Point Systems -- 4.8 Inquiry Functions and Manipulation of Numbers in Fortran 90 -- 4.9 Operations with Algebraic Data -- 4.10 Operations with Arrays --
4.11 Operations with Analytic Data -- 5 Numerical Algorithms -- 5.1 The Intuitive Notion of an Algorithm -- 5.2 Properties of Algorithms -- 5.3 Existence of Algorithms -- 5.4 Practical Solvability of Problems -- 5.5 Complexity of
Algorithms -- 5.6 Representation of Algorithms -- 5.7 Influence of Rounding Errors on Numerical Algorithms -- 5.8 Case Study: Floating-Point Summation -- 6 Numerical Programs -- 6.1 The Quality of Numerical Programs -- 6.2 Reasons for
Poor Efficiency -- 6.3 The Measurement of Performance Indices -- 6.4 Performance Optimization -- 6.5 Architecture Independent Optimizations -- 6.6 Loop Optimizations -- 6.7 Blocked Memory Access -- 6.8 Case Study: Multiplication of
Matrices -- 7 Available Numerical Software -- 7.1 The Cost of Software -- 7.2 Sources of Numerical Software -- 7.3 Software and the Internet -- 7.4 Interactive Multifunctional Systems -- 7.5 Problem Solving Environments -- 7.6 Case
Study: Software for Elliptic PDEs -- 8 Using Approximation in Mathematical Model Building -- 8.1 Analytic Models -- 8.2 Information and Data -- 8.3 Discrete Approximation -- 8.4 Function Approximation -- 8.5 Choosing a Model Function
-- 8.6 Choice of the Distance Function -- 8.7 Transformation of the Problem -- 9 Interpolation -- 9.1 Interpolation Problems -- 9.2 Mathematical Foundations -- 9.3 Univariate Polynomial Interpolation -- 9.4 Univariate, Piecewise,
Polynomial Interpolation -- 9.5 Polynomial Splines -- 9.6 B-Splines -- 9.7 Cubic Spline Interpolation -- 9.8 Splines Without Undesirable Oscillations -- 9.9 Multivariate Interpolation -- 9.10 Multivariate Polynomial Interpolation --
9.11 Multivariate (Sub-) Spline Interpolation -- 9.12 Related Problems and Methods -- Glossary of Notation -- Author Index
ISBN:9783642591181
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Computer science , Algorithms , Numerical analysis , Computational intelligence , Mathematics , Numerical Analysis , Algorithms , Mathematics of Computing , Computational Intelligence
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1997-9781475726008:ONLINE Show nearby items on shelf
Title:Developments in Global Optimization
Author(s):
Date:1997
Size:1 online resource (348 p.)
Note:10.1007/978-1-4757-2600-8
Contents:NOP — A Compact Input Format for Nonlinear Optimization Problems -- GLOPT — A Program for Constrained Global Optimization -- Global Optimization for Imprecise Problems -- New Results on Gap-Treating Techniques in Extended Interval
Newton Gauss-Seidel Steps for Global Optimization -- Quadratic Programming with Box Constraints -- Evolutionary Approach to the Maximum Clique Problem: Empirical Evidence on a Larger Scale -- Interval and Bounding Hessians -- On Global
Search for Non-Convex Optimal Control Problems -- A Multistart Linkage Algorithm Using First Derivatives -- Convergence Speed of an Integral Method for Computing the Essential Supremum -- Complexity Analysis Integrating Pure Adaptive
Search (PAS) and Pure Random Search (PRS) -- LGO — A Program System for Continuous and Lipschitz Global Optimization -- A Method Using Local Tuning for Minimizing Functions with Lipschitz Derivatives -- Molecular Structure Prediction
by Global Optimization -- Optimal Renewal Policy for Slowly Degrading Systems -- Numerical Prediction of Crystal Structures by Simulated Annealing -- Multidimensional Optimization in Image Reconstruction from Projections -- Greedy
Randomized Adaptive Search for a Location Problem with Economies of Scale -- An Algorithm for Improving the Bounding Procedure in Solving Process Network Synthesis by a B&B Method
ISBN:9781475726008
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Nonconvex Optimization and Its Applications: 18
Keywords: Computer science , Operations research , Decision making , Software engineering , Applied mathematics , Engineering mathematics , Computer mathematics , Algorithms , Mathematical optimization , Computer Science , Software Engineering/Programming and Operating Systems , Optimization , Applications of Mathematics , Computational Mathematics and Numerical Analysis , Algorithms , Operation Research/Decision Theory
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1996-9789401154307:ONLINE Show nearby items on shelf
Title:Maximum Entropy and Bayesian Methods Santa Fe, New Mexico, U.S.A., 1995 Proceedings of the Fifteenth International Workshop on Maximum Entropy and Bayesian Methods
Author(s):
Date:1996
Size:1 online resource (458 p.)
Note:10.1007/978-94-011-5430-7
Contents:Reconstruction of the Probability Density Function Implicit in Option Prices from Incomplete and Noisy Data -- Model Selection and Parameter Estimation for Exponential Signals -- Hierarchical Bayesian Time-Series Models -- Bayesian
time Series: Models and Computations for the Analysis of time Series in the Physical Sciences -- Maxent, Mathematics, and Information Theory -- Bayesian Estimation of the von Mises Concentration Parameter -- A Characterization of the
Dirichlet Distribution with Application to Learning Bayesian Networks -- The Bootstrap is Inconsistent with Probability Theory -- Data-Driven Priors for Hyperparameters in Regularization -- Mixture Modeling to Incorporate Meaningful
Constraints Into Learning -- Maximum Entropy (Maxent) Method in Expert Systems and Intelligent Control: new Possibilities and Limitations -- The De Finetti Transform -- Continuum Models for Bayesian Image Matching -- Mechanical Models
as Priors in Bayesian Tomographic Recontruction -- The Bayes Inference Engine -- A Full Bayesian Approach for Inverse Problem -- Pixon-Based Multiresolution Image Reconstruction and Quantification of Image Information Content --
Bayesian Multimodal Evidence Computation by Adaptive Tempering Mcmc -- Bayesian Inference and the Analytic Continuation of Imaginary-Time Quantum Monte Carlo Data -- Spectral Properties from Quantum Monte Carlo Data: a Consistent
Approach -- An Application of Maximum Entropy Method to Dynamical Correlation Functions at Zero Temperature -- Chebyshev Moment Problems: Maximum Entropy and Kernel Polynomial Methods -- Cluster Expansions and Iterative Scaling for
Maximum- Entropy Language Models -- A Maxent Tomography Method for Estimating fish Densities in a Commercial Fishery -- Toward Optimal Observer Performance of Detection and Discrimination Tasks on Reconstructions from Sparse Data --
Entropies for Dissipative Fluids and Magnetofluids Without Discretization -- On the Importance of a Marginalization in Maximum Entropy -- Quantum Mechanics as an Exotic Probability Theory -- Bayesian Parameter Estimation of
Nuclear-Fusion Confinement time Scaling Laws -- Hierarchical Segmentation of Range and Color Images Based on Bayesian Decision Theory -- Priors on Measures -- Determining Whether two Data Sets are from the Same Distribution -- Occam’s
Razor for Parametric Families and Priors on the Space of Distributions -- Skin and Maximum Entropy: a Hidden Complicity? -- Predicting the Accuracy of Bayes Classifiers -- Maximum Entropy Analysis of Genetic Algorithms -- Data Fusion
in the field of non Destructive Testing -- Dual Statistical Mechanical Theory for Unsupervised and Supervised Learning -- Complex Sinusoid Analysis by Bayesian Deconvolution of the Discrete Fourier Transform -- Statistical Mechanics of
Choice -- Rational Neural Models Based on Information Theory -- A new Entropy Measure with the Explicit Notion of Complexity -- Maximum Entropy States and Coherent Structures in Magnetohydrodynamics -- A Lognormal State of Knowledge --
Pixon-Based Multiresolution Image Reconstruction for Yohkoh’S Hard X-Ray Telescope -- Bayesian Methods for Interpreting Plutonium Urinalysis Data -- The Information Content of Sonar Echoes -- Objective Prior for Cosmological Parameters
-- Meal Estimation: Acceptable-Likelihood Extensions of Maxent -- On Curve Fitting with Two-Dimensional Uncertainties -- Bayesian Inference in Search for the in Vivo T2 Decay-Rate Distribution in Human Brain -- Bayesian Comparison of
fit Parameters: Application to Time-Resolved X-Ray Spectroscopy -- Edge Entropy and Visual Complexity -- Maximum Entropy Tomography -- Bayesian Regularization of Some Seismic Operators -- Multimodality Bayesian Algorithm for Image
Reconstruction in Positron Emission Tomography -- Evidence Integrals
ISBN:9789401154307
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Fundamental Theories of Physics, An International Book Series on The Fundamental Theories of Physics: Their Clarification, Development and Application : 79
Keywords: Mathematics , Probabilities , Physics , Statistical physics , Dynamical systems , Statistics , Electrical engineering , Mathematics , Probability Theory and Stochastic Processes , Physics, general , Statistics, general , Statistical Physics, Dynamical Systems and Complexity , Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Scien , Electrical Engineering
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1996-9789400916067:ONLINE Show nearby items on shelf
Title:Discrete Analysis and Operations Research
Author(s):
Date:1996
Size:1 online resource (344 p.)
Note:10.1007/978-94-009-1606-7
Contents:The Number of Distinct Subwords of Fixed Length in the Morse-Hedlund Sequence -- Locally Isometric Embeddings of Graphs and the Metric Prolongation Property -- Local Complementations of Simple and Directed Graphs -- An Approximation
Algorithm for the Traveling Salesman Problem and Its Probabilistic Analysis -- On Minimum Independent Dominating Sets in Graphs -- Regular Partitions and Cuts in Integer Programming -- Complexity of Coverings of Number Sets by
Arithmetical Progressions -- Circuit Realization of the Sorting Problem -- A Refinement of the Frank-Seb?-Tardos Theorem and Its Applications -- On the Length of the Chinese Postman Tour in Regular Graphs -- An Integer Linear
Programming Algorithm Polynomial in the Average Case -- Projections of the Hypercube on the Line and the Plane -- Canonical Decomposition of Graphs -- Fault Detection in Parts of the Circuits of Functional Elements -- On the External
Stability Number of the Generalized De Bruijn Graphs -- On the Lower Bounds for the Complexity of Serial-Parallel Contact Circuits Realizing Linear Boolean Functions -- Efficient Scheduling in Open Shops -- Nonstrict Vector Summation
in Scheduling Problems -- Worst-Case Analysis of Some Algorithms for Solving the Subset-Sum Problem -- On the Depth of Conditional Tests for Controlling “Negation” Type Faults in Circuits of Functional Gates -- Synthesis of Transitive
Order Relations Compatible with the Power of Criteria
ISBN:9789400916067
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Mathematics and Its Applications : 355
Keywords: Mathematics , Operations research , Decision making , Computers , Computer science , Calculus of variations , Mathematics , Mathematics, general , Discrete Mathematics in Computer Science , Calculus of Variations and Optimal Control Optimization , Operation Research/Decision Theory , Theory of Computation
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1996-9789400901070:ONLINE Show nearby items on shelf
Title:Maximum Entropy and Bayesian Methods Cambridge, England, 1994 Proceedings of the Fourteenth International Workshop on Maximum Entropy and Bayesian Methods
Author(s):
Date:1996
Size:1 online resource (323 p.)
Note:10.1007/978-94-009-0107-0
Contents:Applications -- Flow and diffusion images from Bayesian spectral analysis of motion-encoded NMR data -- Bayesian estimation of MR images from incomplete raw data -- Quantified maximum entropy and biological EPR spectra -- The vital
importance of prior information for the decomposition of ion scattering spectroscopy data -- Bayesian consideration of the tomography problem -- Using MaxEnt to determine nuclear level densities -- A fresh look at model selection in
inverse scattering -- The maximum entropy method in small-angle scattering -- Maximum entropy multi-resolution EM tomography by adaptive subdivision -- High resolution image construction from IRAS survey — parallelization and artifact
suppression -- Maximum entropy performance analysis of spread-spectrum multiple-access communications -- Noise analysis in optical fibre sensing: A study using the maximum entropy method -- Algorithms -- AutoClass — a Bayesian approach
to classification -- Evolution reviews of BayesCalc, a MATHEMATICA package for doing Bayesian calculations -- Bayesian inference for basis function selection in nonlinear system identification using genetic algorithms -- The meaning of
the word “Probability” -- The hard truth -- Are the samples doped — If so, how much? -- Confidence intervals from one observation -- Hypothesis refinement -- Bayesian density estimation -- Scale-invariant Markov models for Bayesian
inversion of linear inverse problems -- Foundations: Indifference, independence and MaxEnt -- The maximum entropy on the mean method, noise and sensitivity -- The maximum entropy algorithm applied to the two-dimensional random packing
problem -- Neural Networks -- Bayesian comparison of models for images -- Interpolation models with multiple hyperparameters -- Density networks and their application to protein modelling -- The cluster expansion: A hierarchical
density model -- The partitioned mixture distribution: Multiple overlapping density models -- Physics -- Generating functional for the BBGKY hierarchy and the N-identical-body problem -- Entropies for continua: Fluids and magnetofluids
-- A logical foundation for real thermodynamics
ISBN:9789400901070
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Fundamental Theories of Physics, An International Book Series on The Fundamental Theories of Physics: Their Clarification, Development and Application : 70
Keywords: Mathematics , Analytical chemistry , Probabilities , Statistical physics , Dynamical systems , Statistics , Mathematics , Probability Theory and Stochastic Processes , Statistical Physics, Dynamical Systems and Complexity , Analytical Chemistry , Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Scien
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1996-9783709194614:ONLINE Show nearby items on shelf
Title:Collegium Logicum
Author(s):
Date:1996
Size:1 online resource (140 p.)
Note:10.1007/978-3-7091-9461-4
Contents:Resolution Games and Non-liftable Resolution Orderings -- A Tableau Calculus for Partial Functions -- MUltlog: an Expert System for Multiple-valued Logics -- A Fundamental Problem of Mathematical Logic -- On the Lengths of Proofs of
Consistency -- The Craig Interpolation Theorem for Schematic Systems -- The Role of Monotonicity in Descriptive Complexity Theory -- Numbers Defined by Turing Machines
ISBN:9783709194614
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Collegium Logicum, Annals of the Kurt-Gödel-Society: 2
Keywords: Mathematics , Computers , Algorithms , Computer logic , Mathematical logic , Physics , Mathematics , Mathematical Logic and Foundations , Theoretical, Mathematical and Computational Physics , Logics and Meanings of Programs , Mathematical Logic and Formal Languages , Computation by Abstract Devices , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1996-9781461334347:ONLINE Show nearby items on shelf
Title:Linear Programming: Mathematics, Theory and Algorithms
Author(s):
Date:1996
Size:1 online resource (498 p.)
Note:10.1007/978-1-4613-3434-7
Contents:1. Introduction and Overview -- 2. Preliminary Mathematics -- 2.1 Vectors in Rn -- 2.2 Rank and Linear Transformations -- 2.3 The Solution Set of a System of Simultaneous Linear Equations -- 2.4 Orthogonal Projections and Least
Squares Solutions -- 2.5 Point-Set Theory: Topological Properties of Rn -- 2.6 Hyperplanes and Half-Planes (-Spaces) -- 2.7 Convex Sets -- 2.8 Existence of Separating and Supporting Hyperplanes -- 2.9 Convex Cones -- 2.10 Basic
Solutions to Linear Equalities -- 2.11 Faces of Polyhedral Convex Sets: Extreme Points, Facets, and Edges -- 2.12 Extreme Point Representation for Polyhedral Convex Sets -- 2.13 Directions for Polyhedral Convex Sets -- 2.14 Combined
Extreme Point and Extreme Direction Representation for Polyhedral Convex Sets -- 2.15 Resolution of Convex Polyhedra. -- 2.16 Simplexes -- 2.18 Linear Functionals -- 3. Introduction to Linear Programming -- 3.1 The Canonical Form of a
Linear Programming Problem -- 3.2 A Graphical Solution to the Linear Programming Problem -- 3.3 The Standard Form of a Linear Programming Problem -- 3.4 Properties of the Feasible Region -- 3.5 Existence and Location of Finite Optimal
Solutions -- 3.6 Basic Feasible and Extreme Point Solutions to the Linear Programming Problem -- 3.7 Solutions and Requirements Spaces -- 4. Duality Theory -- 4.1 The Symmetric Dual -- 4.2 Unsymmetric Duals -- 4.3 Duality Theorems --
5. The Theory of Linear Programming -- 5.1 Finding Primal Basic Feasible Solutions -- 5.2 The Reduced Primal Problem -- 5.3 The Primal Optimality Criterion -- 5.4 Constructing the Dual Solution -- 5.5 The Primal Simplex Method -- 5.6
Degenerate Basic Feasible Solutions -- 5.7 Unbounded Solutions Reexamined -- 5.8 Multiple Optimal Solutions -- 6. Duality Theory Revisited -- 6.1 The Geometry of Duality and Optimality -- 6.2 Lagrangian Saddle Points and Primal
Optimality -- 7. Computational Aspects of Linear Programming -- 7.1 The Primal Simplex Method Reexamined -- 7.2 Improving a Basic Feasible Solution -- 7.3 The Cases of Multiple Optimal, Unbounded, and Degenerate Solutions -- 7.4
Summary of the Primal Simplex Method -- 7.5 Obtaining the Optimal Dual Solution From the Optimal Primal Matrix -- 8. One-Phase, Two-Phase, and Composite Methods of Linear Programming -- 8.1 Artificial Variables -- 8.2 The One-Phase
Method -- 8.3 Inconsistency and Redundancy -- 8.4 Unbounded Solutions to the Artificial Problem -- 8.5 The Two-Phase Method -- 8.6 Obtaining the Optimal Primal Solution from the Optimal Dual Matrix -- 8.7 The Composite Simplex Method
-- 9. Computational Aspects of Linear Programming: Selected Transformations -- 9.1 Minimizing the Objective Function -- 9.2 Unrestricted Variables -- 9.3 Bounded Variables -- 9.4 Interval Linear Programming -- 9.5 Absolute Value
Functionals -- 10. The Dual Simplex, Primal-Dual, and Complementary Pivot Methods -- 10.1 Dual Simplex Method -- 10.2 Computational Aspects of the Dual Simplex Method -- 10.3 Dual Degeneracy -- 10.4 Summary of the Dual Simplex Method
-- 10.5 Generating an Initial Primal-Optimal Basic Solution: The Artificial Constraint Method -- 10.6 Primal-Dual Method -- 10.7 Summary of the Primal-Dual Method -- 10.8 A Robust Primal-Dual Algorithm -- 10.9 The Complementary Pivot
Method -- 11. Postoptimality Analysis I -- 11.1 Sensitivity Analysis -- 11.2 Structural Changes -- 12. Postoptimality Analysis II -- 12.1 Parametric Analysis -- 12.2 The Primal-Dual Method Revisited -- 13. Interior Point Methods --
13.1 Optimization Over a Sphere -- 13.2 An Overview of Karmarkar’s Algorithm -- 13.3 The Projective Transformation T(X) -- 13.4 The Transformed Problem -- 13.5 Potential Function Improvement and Computational Complexity -- 13.6 A
Summary of Karmarkar’s Algorithm -- 13.7 Transforming a General Linear Program to Karmarkar Standard Form -- 13.8 Extensions and Modifications of Karmarkar’s Algorithm -- 13.9 Methods Related to Karmarkar’s Routine: Affine Scaling
Scaling Algorithms -- 13.10 Methods Related to Karmarkar’s Routine: A Path-Following Following Algorithm -- 13.11 Methods Related to Karmarkar’s Routine: Potential Reduction Algorithms -- 13.12 Methods Related to Karmarkar’s Routine: A
Homogeneous and Self-Dual Interior-Point, Method -- 14. Interior Point Algorithms for Solving Linear Complementarity Problems -- 14.1 Introduction -- 14.2 An Interior-Point, Path-Following Algorithm for LCP(q,M) -- 14.3 An
Interior-Point, Potential-Reduction Algorithm for LCP(q,M) -- 14.4 A Predictor-Corrector Algorithm for Solving LCP(q,M) -- 14.5 Large-Step Interior-Point Algorithms for Solving LCP(q,M) -- 14.6 Related Methods for Solving LCP(q, M) --
Appendix A: Updating the Basis Inverse -- Appendix B: Steepest Edge Simplex Methods -- Appendix C: Derivation of the Projection Matrix -- References -- Notation Index
ISBN:9781461334347
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Applied Optimization: 2
Keywords: Mathematics , Operations research , Decision making , Game theory , Mathematical optimization , Economic theory , Mathematics , Optimization , Operation Research/Decision Theory , Economic Theory/Quantitative Economics/Mathematical Methods , Game Theory, Economics, Social and Behav. Sciences
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1996-9781461207238:ONLINE Show nearby items on shelf
Title:Models of Neural Networks III Association, Generalization, and Representation
Author(s):
Date:1996
Size:1 online resource (311 p.)
Note:10.1007/978-1-4612-0723-8
Contents:1. Global Analysis of Recurrent Neural Networks -- 1.1 Global Analysis-Why? -- 1.2 A Framework for Neural Dynamics -- 1.3 Fixed Points -- 1.4 Periodic Limit Cycles and Beyond -- 1.5 Synchronization of Action Potentials -- 1.6
Conclusions -- References -- 2. Receptive Fields and Maps in the Visual Cortex: Models of Ocular Dominance and Orientation Columns -- 2.1 Introduction -- 2.2 Correlation-Based Models -- 2.3 The Problem of Map Structure -- 2.4 The
Computational Significance of Correlatin-Based Rules -- 2.5 Open Questions -- References -- 3. Associative Data Storage and Retrieval in Neural Networks -- 3.1 Introduction and Overview -- 3.1.1 Memory and Representation -- 3.2 Neural
Associatve Memory Models -- 3.3 Analysis of the Retrieval Process -- 3.4 Information Theory of the Memory Process -- 3.5 Model Performance -- 3.6 Discussion -- Appendix 3.1 -- Appendix 3.2 -- References -- 4. Inferences Modeled with
Neural Networks -- 4.1 Introduction -- 4.2 Model for Cognitive Systems and for Experiences -- 4.3 Inductive Inference -- 4.4 External Memory -- 4.5 Limited Use of External Memory -- 4.6 Deductive Inference -- 4.7 Conclusion --
References -- 5. Statistical Mechanics of Generalization -- 5.1 Introduction -- 5.2 General Results -- 5.3 The Perceptron -- 5.4 Geometry in Phase Space and Asymptotic Scaling -- 5.5 Applications to Perceptrons -- 5.6 Summary and
Outlook -- Appendix 5.1: Proof of Sauer’s Lemma -- Appendix 5.2: Order Parameters for ADALINE -- References -- 6. Bayesian Methods for Backpropagation Networks -- 6.1 Probability Theory and Occam’s Razor -- 6.2 Neural Networks as
Probabilistic Models -- 6.3 Setting Regularization Constants ? and ? -- 6.4 Model Comparison -- 6.5 Error Bars and Predictions -- 6.6 Pruning -- 6.7 Automatic Relevance Determination -- 6.8 Implicit Priors -- 6.9 Cheap and Cheerful
Implementations -- 6.10 Discussion -- References -- 7. Penacée: A Neural Net System for Recognizing On-Line Handwriting -- 7.1 Introduction -- 7.2 Description of the Building Blocks -- 7.3 Applications -- 7.4 Conclusion -- References
-- 8. Topology Representing Network in Robotics -- 8.1 Introduction -- 8.2 Problem Description -- 8.3 Topology Representing Network Algorithm -- 8.4 Experimental Results and Discussion -- References
ISBN:9781461207238
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Physics , Statistical physics , Dynamical systems , Physics , Statistical Physics, Dynamical Systems and Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1995-9783709193945:ONLINE Show nearby items on shelf
Title:Collegium Logicum
Author(s):
Date:1995
Size:1 online resource (122 p.)
Note:10.1007/978-3-7091-9394-5
Contents:The Last Months of Gerhard Gentzen in Prague -- Some Issues on Gödel’s Unpubhshed Philosophical Manuscripts -- Vollständigkeit als Ziel historischer Explikation. Eine Fallstudie -- Existenz und Negation in Mathematik und Logik --
Paradoxien der Prognose und der Evaluation: Eine fixpunkttheoretische Analyse -- Automated Deduction and Integer Programming -- Methods of Functional Extension
ISBN:9783709193945
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Collegium Logicum, Annals of the Kurt-Gödel-Society: 1
Keywords: Mathematics , Computers , Algorithms , Computer logic , Mathematical logic , Physics , Mathematics , Mathematical Logic and Foundations , Theoretical, Mathematical and Computational Physics , Logics and Meanings of Programs , Mathematical Logic and Formal Languages , Computation by Abstract Devices , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1995-9783662031827:ONLINE Show nearby items on shelf
Title:Finite Model Theory
Author(s): Heinz-Dieter Ebbinghaus
Date:1995
Size:1 online resource (327 p.)
Note:10.1007/978-3-662-03182-7
Contents:0. Preliminaries -- 1. The Ehrenfeucht-Fraïssé Method -- 2. More on Games -- 3. 0–1 Laws -- 4. Satisfiability in the Finite -- 5. Finite Automata and Logic: A Microcosm of Finite Model Theory -- 6. Descriptive Complexity Theory -- 7.
Logics with Fixed-Point Operators -- 8. Logic Programs -- 9. Optimization Problems -- 10. Quantifiers and Logical Reductions -- References
ISBN:9783662031827
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algorithms , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Algorithm Analysis and Problem Complexity , Mathematical Logic and Formal Languages
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1995-9783642976193:ONLINE Show nearby items on shelf
Title:Solving Problems in Scientific Computing Using Maple and MATLAB®
Author(s): Walter Gander
Date:1995
Edition:Second, Expanded Edition
Size:1 online resource (318 p.)
Note:10.1007/978-3-642-97619-3
Contents:1. The Tractrix and Similar Curves -- 1.1 Introduction -- 1.2 The Classical Tractrix -- 1.3 The Child and the Toy -- 1.4 The Jogger and the Dog -- 1.5 Showing the Motions with Matlab -- References -- 2. Trajectory of a Spinning Tennis
Ball -- 2.1 Introduction -- 2.2 Maple Solution -- 2.3 Matlab Solution -- References -- 3. The Illumination Problem -- 3.1 Introduction -- 3.2 Finding the Minimal Illumination Point on a Road -- 3.3 Varying h2 to Maximize the
Illumination -- 3.4 Optimal Illumination -- 3.5 Conclusion -- References -- 4. Orbits in the Planar Three-Body Problem -- 4.1 Introduction -- 4.2 Equations of Motion in Physical Coordinates -- 4.3 Global Regularization -- 4.4 The
Pythagorean Three-Body Problem -- 4.5 Conclusions -- References -- 5. The Internal Field in Semiconductors -- 5.1 Introduction -- 5.2 Solving a Nonlinear Poisson Equation Using MAPLE -- 5.3 Matlab Solution -- References -- 6. Some
Least Squares Problems -- 6.1 Introduction -- 6.2 Fitting Lines, Rectangles and Squares in the Plane -- 6.3 Fitting Hyperplanes -- References -- 7. The Generalized Billiard Problem -- 7.1 Introduction -- 7.2 The Generalized Reflection
Method -- 7.3 The Shortest Trajectory Method -- 7.4 Examples -- 7.5 Conclusions -- References -- 8. Mirror Curves -- 8.1 The Interesting Waste -- 8.2 The Mirror Curves Created by MAPLE -- 8.3 The Inverse Problem -- 8.4 Examples -- 8.5
Conclusions -- References -- 9. Smoothing Filters -- 9.1 Introduction -- 9.2 Savitzky-Golay Filter -- 9.3 Least Squares Filter -- References -- 10. The Radar Problem -- 10.1 Introduction -- 10.2 Converting Degrees into Radians -- 10.3
Transformation of Geographical into Geocentric Coordinates -- 10.4 The Transformations -- 10.5 Final Algorithm -- 10.6 Practical Example -- References -- 11. Conformai Mapping of a Circle -- 11.1 Introduction -- 11.2 Problem Outline --
11.3 Maple Solution -- References -- 12. The Spinning Top -- 12.1 Introduction -- 12.2 Formulation and Basic Analysis of the Solution -- 12.3 The Numerical Solution -- References -- 13. The Calibration Problem -- 13.1 Introduction --
13.2 The Physical Model Description -- 13.3 Approximation by Splitting the Solution -- 13.4 Conclusions -- References -- 14. Heat Flow Problems -- 14.1 Introduction -- 14.2 Heat Flow through a Spherical Wall -- 14.3 Non Stationary Heat
Flow through an Agriculture Field -- References -- 15. Modeling Penetration Phenomena -- 15.1 Introduction -- 15.2 Short description of the penetration theory -- 15.3 The Tate — Alekseevskii model -- 15.4 The eroding rod penetration
model -- 15.5 Numerical Example -- 15.6 Conclusions -- References -- 16. Heat Capacity of System of Bose Particles -- 16.1 Introduction -- 16.2 Maple Solution -- References -- 17. Free Metal Compression -- 17.1 Introduction -- 17.2
Disk compression -- 17.3 Compression of a metal prism -- 17.4 Conclusions -- References -- 18. Gauss Quadrature -- 18.1 Introduction -- 18.2 Orthogonal Polynomials -- 18.3 Quadrature Rule -- 18.4 Gauss Quadrature Rule -- 18.5
Gauss-Radau Quadrature Rule -- 18.6 Gauss-Lobatto Quadrature Rule -- 18.7 Weights -- 18.8 Quadrature Error -- References -- 19. Symbolic Computation of Explicit Runge-Kutta Formulas -- 19.1 Introduction -- 19.2 Derivation of the
Equations for the Parameters -- 19.3 Solving the System of Equations -- 19.4 The Complete Algorithm -- 19.5 Conclusions -- References -- 20. Transient Response of a Two-Phase Half-Wave Rectifier -- 20.1 Introduction -- 20.2 Problem
Outline -- 20.3 Difficulties in Applying Conventional Codes and Software Packages -- 20.4 Solution by Means of Maple -- References -- 21. Circuits in Power Electronics -- 21.1 Introduction -- 21.2 Linear Differential Equations with
Piecewise Constant Coefficients -- 21.3 Periodic Solutions -- 21.4 A matlab Implementation -- 21.5 Conclusions -- References
ISBN:9783642976193
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Programming languages (Electronic computers) , Algebra , System theory , Algorithms , Numerical analysis , Statistical physics , Dynamical systems , Mathematics , Numerical Analysis , Algebra , Programming Languages, Compilers, Interpreters , Algorithms , Statistical Physics, Dynamical Systems and Complexity , Systems Theory, Control
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1995-9781461335573:ONLINE Show nearby items on shelf
Title:Minimax and Applications
Author(s):
Date:1995
Size:1 online resource (296 p.)
Note:10.1007/978-1-4613-3557-3
Contents:5? -- 3. 15/4? ? ? ? 5? -- 4. 5/2? ? ? < 15/4? -- 5. ? < 2.5? -- References -- A Study of On-Line Scheduling Two-Stage Shops -- 1. Introduction -- 2. Definitions and Preliminaries -- 3. A Lower Bound for O2??max -- 4. An Algorithm for
O2??max -- 5. A Best Algorithm for O2?pmtn??max -- 6. On Flow and Job Shops -- 7. Discussions -- References -- Maxmin Formulation of the Apportionments of Seats to a Parliament -- 1. Introduction -- 2. Concepts and models -- 3.
Illustrative examples -- 4. Discussion -- References -- On Shortest k-Edge Connected Steiner Networks with Rectilinear Distance -- 1. Introduction -- 2. Technical Preliminaries -- 3. Main Results -- References -- Mutually Repellant
Sampling -- 1. Introduction -- 2. Mutually Repellant Sampling -- 3. Max-Min Distance Sampling -- 4. Max-Min-Selection Distance Sampling -- 5. Max-Average Distance Sampling -- 6. Lower Bounds -- 7. Applications and Open Questions --
References -- Geometry and Local Optimality Conditions for Bilevel Programs with Quadratic Strictly Convex Lower Levels -- 1. Introduction -- 2. Problem Statement and Geometry -- 3. Computing the Convex Cones -- 4. Number of Convex
Cones -- 5. Stationary Points and Local Minima -- 6. Conclusions and Future Work -- References -- The Spherical One-Center Problem -- 1. Introduction -- 2. Main Result -- 3. Conclusions -- References -- On Min-max Optimization of a
Collection of Classical Discrete Optimization Problems -- 1. Introduction -- 2. The Min-max Spanning Tree Problem -- 3. The Min-max Resource Allocation Problem -- 4. The Min-max Production Control Problem -- 5. Summary and Extensions
-- References -- Heilbronn Problem for Six Points in a Planar Convex Body -- 1. Introduction -- 2. Prerequisites -- 3. Proof of the Main Theorem -- References -- Heilbronn Problem for Seven Points in a Planar Convex Body -- 1.
Introduction -- 2. Propositions and Proofs for Easier Cases -- 3. Configurations with Stability -- 4. Computing the Smallest Triangle -- 5. Open Problems -- References -- On the Complexity of Min-Max Optimization Problems and Their
Approximation -- 1. Introduction -- 2. Definition -- 3. ?2P-Completeness Results -- 4. Approximation Problems and Their Hardness -- 5. Nonapproximability Results -- 6. Conclusion and Open Questions -- References -- A Competitive
Algorithm for the Counterfeit Coin Problem -- 1. Introduction -- 2. Some Lower Bounds of M(n : d) -- 3. A Competitive Algorithm -- 4. Analysis of Competitiveness -- 5. Conclusion -- References -- A Minimax ?ß Relaxation for Global
Optimization -- 1. Introduction -- 2. Problem Model -- 3. Relaxation Approach -- 4. A General ?ß Relaxation Algorithm -- 5. A Minimax ?ß Relaxation Algorithm for COP -- 6. Experimental Results -- References -- Minimax Problems in
Combinatorial Optimization -- 1. Introduction -- 2. Algorithmic Problems -- 3. Geometric Problems -- 4. Graph Problems -- 5. Management Problems -- 6. Miscellaneous -- Author Index
ISBN:9781461335573
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Nonconvex Optimization and Its Applications: 4
Keywords: Mathematics , Computer science , Computer mathematics , Algorithms , Mathematics , Algorithms , Discrete Mathematics in Computer Science , Computational Mathematics and Numerical Analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1994-9789401583305:ONLINE Show nearby items on shelf
Title:Advances in Optimization and Numerical Analysis
Author(s):
Date:1994
Size:1 online resource (286 p.)
Note:10.1007/978-94-015-8330-5
Contents:1. Analysis of Interior-Point Methods for Linear Programming Problems with Variable Upper Bounds -- 2. On the Complexity of the Simplex Method -- 3. The Linear Complementarity Problem -- 4. A Direct Search Optimization Method that
Models the Objective and Constraint Functions by Linear Interpolation -- 5. A Truncated SQP Algorithm for Large Scale Nonlinear Programming Problems -- 6. Performance of a Multifrontal Scheme for Partially Separable Optimization -- 7.
Towards Second-Order Methods for Structured Nonsmooth Optimization -- 8. Homotopy Methods in Control System Design and Analysis -- 9. How to Properly Relax Delayed Controls -- 10. On Operator Extensions: the Algebraic Theory Approach
-- 11. Global Space-time Finite Element Methods for Time-dependent Convection Diffusion Problems -- 12. Eulerian-Lagrangian Localized Adjoint Methods for Variable-Coefficient Advective-Diffusive-Reactive Equations in Groundwater
Contaminant Transport -- 13. The Communication Patterns of Nested Preconditionings for Massively Parallel Architectures -- 14. Smoothness and Superconvergence for Approximate Solutions to the One Dimensional Monoenergetic Transport
Equation -- 15. Experiments with the Power and Arnoldi Methods for Solving the Two-Group Neutron Diffusion Eigen-value Problem -- 16. Computational Study of a Free-Boundary Model -- 17. Numerical Approximation to a Class of Weakly
Singular Integral Operators -- 18. Directional Second Derivative of the Regularized Function that Smoothes the Min-Max Problem
ISBN:9789401583305
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Mathematics and Its Applications : 275
Keywords: Mathematics , Partial differential equations , Applied mathematics , Engineering mathematics , Mathematical optimization , Fluids , Mathematics , Optimization , Fluid- and Aerodynamics , Applications of Mathematics , Partial Differential Equations
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1994-9781461336327:ONLINE Show nearby items on shelf
Title:Large Scale Optimization State of the Art
Author(s):
Date:1994
Size:1 online resource (456 p.)
Note:10.1007/978-1-4613-3632-7
Contents:Restarting Strategies for the DQA Algorithm -- Mathematical Equivalence of the Auction Algorithm for Assignment and the ?-Relaxation (Preflow-Push) Method for Min Cost Flow -- Preliminary Computational Experience with Modified
Log-Barrier Functions for Large-Scale Nonlinear Programming -- A New Stochastic/Perturbation Method for Large-Scale Global Optimization and its Application to Water Cluster Problems -- Improving the Decomposition of Partially Separable
Functions in the Context of Large-Scale Optimization: a First Approach -- Gradient-Related Constrained Minimization Algorithms in Function Spaces: Convergence Properties and Computational Implications -- Some Reformulations and
Applications of the Alternating Direction Method of Multipliers -- Experience with a Primal Presolve Algorithm -- A Trust Region Method for Constrained Nonsmooth Equations -- On the Complexity of a Column Generation Algorithm for
Convex or Quasiconvex Feasibility Problems -- Identification of the Support of Nonsmoothness -- On Very Large Scale Assignment Problems -- Numerical Solution of Parabolic State Constrained Control Problems using SQP- and
Interior-Point-Methods -- A Global Optimization Method For Weber’s Problem With Attraction and Repulsion -- Large-Scale Diversity Minimization via Parallel Genetic Algorithms -- A Numerical Comparison of Barrier and Modified Barrier
Methods for Large-Scale Bound-Constrained Optimization -- A Numerical Study of Some Data Association Problems Arising in Multitarget Tracking -- Identifying the Optimal Face of a Network Linear Program with a Globally Convergent
Interior Point Method -- Solution of Large Scale Stochastic Programs with Stochastic Decomposition Algorithms -- A Simple, Quadratically Convergent Interior Point Algorithm for Linear Programming and Convex Quadratic Programming -- On
Two Algorithms for Nonconvex Nonsmooth Optimization Problems in Structural Mechanics
ISBN:9781461336327
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Functions of real variables , Computer mathematics , Mathematical models , Geometry , Mathematics , Real Functions , Mathematical Modeling and Industrial Mathematics , Geometry , Computational Mathematics and Numerical Analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1993-9789401582322:ONLINE Show nearby items on shelf
Title:Algorithms: Main Ideas and Applications
Author(s): Vladimir Uspensky
Date:1993
Size:1 online resource (270 p.)
Note:10.1007/978-94-015-8232-2
Contents:Notation and Terminology -- 1.0 Preliminary notions of the theory of algorithms: constructive objects and aggregates local properties and local actions -- 1.1 The general notion of an algorithm as an independent (separate) concept --
1.2 Representative computational models -- 1.3 The general notion of a calculus as an independent (separate) concept -- 1.4 Representative generating models -- 1.5 Interrelations between algorithms and calculuses -- 1.6 Time and Space
as complexities of computation and generation -- 1.7 Computable functions and generable sets decidable sets enumerable sets -- 1.8 The concept of a ?-recursive function -- 1.9 Possibility of an arithmetical and even Diophantine
representation of any enumerable set of natural numbers -- 1.10 Construction of an undecidable generable set -- 1.11 Post’s reducibility problem -- 1.12 The concept of a relative algorithm, or an oracle algorithm -- 1.13 The concept of
a computable operation -- 1.14 The concept of a program programs as objects of computation and generation -- 1.15 The concept of a numbering and the theory of numberings -- 1.16 First steps in the invariant, or machine-independent,
theory of complexity of computations -- 1.17 The theory of complexity and entropy of constructive objects -- 1.18 Convenient computational models -- 2.1 Investigations of mass problems -- 2.2 Applications to the foundations of
mathematics: constructive semantics -- 2.3 Applications to mathematical logic: formalized languages of logic and arithmetic -- 2.4 Computable analysis -- 2.5 Numbered structures -- 2.6 Applications to probability theory: definitions of
a random sequence -- 2.7 Applications to information theory: the algorithmic approach to the concept of quantity of information -- 2.8 Complexity bounds for particular problems -- 2.9 Influence of the theory of algorithms on
algorithmic practice -- Appendix. Probabilistic Algorithms (How the Use of Randomness Makes Computations Shorter) -- A.1 Preliminary remarks -- A.2 Main results -- A.3 Formal definitions -- References -- Author Index
ISBN:9789401582322
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Mathematics and Its Applications : 251
Keywords: Mathematics , Logic , Computers , Mathematical logic , Mathematics , Mathematical Logic and Foundations , Theory of Computation , Logic
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1993-9783662029459:ONLINE Show nearby items on shelf
Title:A Course in Computational Algebraic Number Theory
Author(s): Henri Cohen
Date:1993
Size:1 online resource (536 p.)
Note:10.1007/978-3-662-02945-9
Contents:1. Fundamental Number-Theoretic Algorithms -- 2. Algorithms for Linear Algebra and Lattices -- 3. Algorithms on Polynomials -- 4. Algorithms for Algebraic Number Theory I -- 5. Algorithms for Quadratic Fields -- 6. Algorithms for
Algebraic Number Theory II -- 7. Introduction to Elliptic Curves -- 8. Factoring in the Dark Ages -- 9. Modern Primality Tests -- 10. Modern Factoring Methods -- Appendix A. Packages for Number Theory -- Appendix B. Some Useful Tables
-- B.1. Table of Class Numbers of Complex Quadratic Fields -- B.2. Table of Class Numbers and Units of Real Quadratic Fields -- B.3. Table of Class Numbers and Units of Complex Cubic Fields -- B.4. Table of Class Numbers and Units of
Totally Real Cubic Fields -- B.5. Table of Elliptic Curves
ISBN:9783662029459
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Graduate Texts in Mathematics: 138
Keywords: Mathematics , Computers , Algorithms , Computer science , Algebra , Number theory , Mathematics , Number Theory , Algebra , Theory of Computation , Algorithm Analysis and Problem Complexity , Algorithms , Symbolic and Algebraic Manipulation
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1993-9783642975332:ONLINE Show nearby items on shelf
Title:Solving Problems in Scientific Computing Using Maple and Matlab®
Author(s): Walter Gander
Date:1993
Size:1 online resource (268 p.)
Note:10.1007/978-3-642-97533-2
Contents:1. The Tractrix and Similar Curves -- 1.1 Introduction -- 1.2 The Classical Tractrix -- 1.3 The Child and the Toy -- 1.4 The Jogger and the Dog -- 1.5 Showing the Movements with Matlab -- References -- 2. Trajectory of a Spinning
Tennis Bali -- 2.1 Introduction -- 2.2 Maple Solution -- 2.3 Matlab Solution -- References -- 3. The Illumination Problem -- 3.1 Introduction -- 3.2 Finding the Minimal Illumination Point on a Road -- 3.3 Varying h2 to Maximize the
Illumination -- 3.4 Optimal Illumination -- 3.5 Conclusion -- References -- 4. Orbits in the Planar Three-Body Problem -- 4.1 Introduction -- 4.2 Equations of Motion in Physical Coordinates -- 4.3 Global Regularization -- 4.4 The
Pythagorean Three-Body Problem -- 4.5 Conclusions -- References -- 5. The Internal Field in Semiconductors -- 5.1 Introduction -- 5.2 Solving a Nonlinear Poisson Equation Using Maple -- 5.3 Matlab Solution -- References -- 6. Some
Least Squares Problems -- 6.1 Introduction -- 6.2 Fitting Lines, Rectangles and Squares in the Plane -- 6.3 Fitting Hyperplanes -- References -- 7. The Generalized Billiard Problem -- 7.1 Introduction -- 7.2 The Generalized Reflection
Method -- 7.3 The Shortest Trajectory Method -- 7.4 Examples -- 7.5 Conclusions -- References -- 8. Mirror Curves -- 8.1 The Interesting Waste -- 8.2 The Mirror Curves Created by Maple -- 8.3 The Inverse Problem -- 8.4 Examples -- 8.5
Conclusions -- References -- 9. Smoothing Filters -- 9.1 Introduction -- 9.2 Savitzky-Golay Filter -- 9.3 Least Squares Filter -- References -- 10. The Radar Problem -- 10.1 Introduction -- 10.2 Converting Degrees into Radians -- 10.3
Transformation of Geographical into Geocentric Coordinates -- 10.4 The Transformations -- 10.5 Final Algorithm -- 10.6 Practical Example -- References -- 11. Conformal Mapping of a Circle -- 11.1 Introduction -- 11.2 Problem Outline --
11.3 Maple Solution -- References -- 12. The Spinning Top -- 12.1 Introduction -- 12.2 Formulation and Basic Analysis of the Solution -- 12.3 The Numerical Solution -- References -- 13. The Calibration Problem -- 13.1 Introduction --
13.2 The Physical Model Description -- 13.3 Approximation by Splitting the Solution -- 13.4 Conclusions -- References -- 14. Heat Flow Problems -- 14.1 Introduction -- 14.2 Heat Flow through a Spherical Wall -- 14.3 Non Stationary Heat
Flow through an AgricultureField -- References -- 15. Penetration of a Long Rod into a Semiinfinite Target -- 15.1 Introduction -- 15.2 Short Description of the Penetration Theory -- 15.3 Numerical Example -- 15.4 Conclusions --
References -- 16. Heat Capacity of System of Bose Particles -- 16.1 Introduction -- 16.2 Maple Solution -- References -- 17. Compression of a Metal Disk -- 17.1 Introduction -- 17.2 Mathematical and Physical Model -- 17.3 Parabolic
Perimeter -- 17.4 Maple Solution -- 17.5 Base Radius as Function of Friction -- 17.6 Simplification -- 17.7 Graphics -- 17.8 Conclusions -- References -- 18. Gauss Quadrature -- 18.1 Introduction -- 18.2 Orthogonal Polynomials -- 18.3
Quadrature Rule -- 18.4 Gauss Quadrature Rule -- 18.5 Gauss-Radau Quadrature Rule -- 18.6 Gauss-Lobatto Quadrature Rule -- 18.7 Weights -- 18.8 Quadrature Error -- References -- 19. Symbolic Computation of Explicit Runge-Kutta Formulas
-- 19.1 Introduction -- 19.2 Derivation of the Equations for the Parameters -- 19.3 Solving the System of Equations -- 19.4 The Complete Algorithm -- 19.5 Conclusions -- References
ISBN:9783642975332
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Programming languages (Electronic computers) , Algebra , System theory , Algorithms , Numerical analysis , Statistical physics , Dynamical systems , Mathematics , Numerical Analysis , Algebra , Programming Languages, Compilers, Interpreters , Algorithms , Statistical Physics, Dynamical Systems and Complexity , Systems Theory, Control
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1993-9783642776434:ONLINE Show nearby items on shelf
Title:Motion and Structure from Image Sequences
Author(s): Juyang Weng
Date:1993
Size:1 online resource (444 p.)
Note:10.1007/978-3-642-77643-4
Contents:1. Introduction -- 1.1 Formulation of the Problem -- 1.2 Overview of Recent Progress -- 1.3 Bibliographical Notes -- 2. Image Matching -- 2.1 Approaches to Establishing Correspondences -- 2.2 An Approach to Image Matching -- 2.3
Algorithm -- 2.4 Motion and Structure Computation -- 2.5 Refinements -- 2.6 Examples -- 2.7 Summary -- 2.8 Bibliographical Notes -- 3. Two-View Analysis -- 3.1 Some Basic Issues -- 3.2 An Algorithm -- 3.3 Error Estimation -- 3.4 Error
Analysis -- 3.5 Performance -- 3.6 Summary -- 3.7 Bibliographical Notes -- Appendix 3.A Perturbation of Eigenspace -- Appendix 3.B Quaternions -- Appendix 3.C Alternative Fitting -- 4. Optimization -- 4.1 Motivations -- 4.2 Stability
of Linear Algorithms -- 4.3 Maximum Likelihood Estimation -- 4.4 A Two-Step Approach and Computation -- 4.5 Minimum Variance Estimation -- 4.6 Error Estimation and Error Bounds -- 4.7 Batch and Sequential Methods -- 4.9 Summary -- 4.10
Bibliographical Notes -- Appendix 4.A Decomposability -- Appendix 4.B Weights -- Appendix 4.C Triangulation with Noise -- Appendix 4.D Matrix Derivatives -- Appendix 4.E Cramér-Rao Bound -- 5. Planar Scenes -- 5.1 Planar Scene as a
Degenerate Case -- 5.2 Motion from a Plane -- 5.3 Inherent Uniqueness -- 5.4 Examples -- 5.5 Conclusions -- 5.6 Bibliographical Notes -- Appendix 5.A Conditions on the Rank of A -- Appendix 5.B Two Solutions from F -- Appendix 5.C
Plane-Perceivable Surfaces -- Appendix 5.D Condition on Consistent Normals -- Appendix 5.E Two-View Algorithm -- Appendix 5.F Error Estimation -- 6. From Line Correspondences -- 6.1 Lines as Features -- 6.2 Solution and Algorithm --
6.3 Degeneracy -- 6.4 Optimization -- 6.5 Simulations -- 6.6 Conclusions and Discussions -- 6.7 Bibliographical Notes -- Appendix 6.A Ranks -- Appendix 6.B Unique Consistent Assignment -- Appendix 6.C Degeneracy -- Appendix 6.D
Distinct Locations Are Necessary -- Appendix 6.E Alternative Degeneracy Condition -- 7. Stereo -- 7.1 Stereo Camera Systems -- 7.2 Stereo Triangulation -- 7.3 Closed-Form Solution -- 7.4 Iterative Optimal Solution -- 7.5 Outliers and
Robust Estimators -- 7.6 Examples -- 7.7 Without Stereo Correspondences -- 7.8 Long Image Sequences -- 7.9 Conclusions -- 7.10 Bibliographical Notes -- Appendix 7.A MWCC Theorem -- Appendix 7.B Least-Squares Matrix Fitting -- 8. Motion
Modeling and Prediction -- 8.1 Coherence of Motion -- 8.2 The LCAM Model -- 8.3 Estimation and Prediction -- 8.4 Monocular Vision -- 8.5 Optimization -- 8.6 Experimental Examples -- 8.7 Summary -- 8.8 Bibliographical Notes -- Appendix
8.A Solution of Coefficient Equations -- Appendix 8.B Rotation without Precession -- Appendix 8.C Singularity of the Matrix -- References
ISBN:9783642776434
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Springer Series in Information Sciences: 29
Keywords: Computer science , Image processing , Computer-aided engineering , Physics , Complexity, Computational , Computer Science , Image Processing and Computer Vision , Complexity , Computer-Aided Engineering (CAD, CAE) and Design , Mathematical Methods in Physics , Numerical and Computational Physics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1993-9783642580437:ONLINE Show nearby items on shelf
Title:New Trends in Discrete and Computational Geometry
Author(s):
Date:1993
Size:1 online resource (340 p.)
Note:10.1007/978-3-642-58043-7
Contents:I. Combinatorics and Algorithms of Arrangements -- 1. Introduction -- 2. Arrangements of Curves in the Plane -- 3. Lower Envelopes and Davenport-Schinzel Sequences -- 4. Faces in Arrangements -- 5. Arrangements in Higher Dimensions --
6. Summary -- References -- II. Backwards Analysis of Randomized Geometric Algorithms -- 1. Introduction -- 2. Delaunay Triangulations of Convex Polygons -- 3. Intersecting Line Segments -- 4. Constructing Planar Convex Hulls -- 5.
Backwards Analysis of QUICKSORT -- 6. A Bad Example -- 7. Linear Programming for Small Dimension -- 8. Welzl’s Minidisk Algorithm -- 9. Clarkson’s Backwards Analysis of the Conflict Graph Based on the Convex Hull Algorithm -- 10. Odds
and Ends -- References -- III. Epsilon-Nets and Computational Geometry -- 1. Range Spaces and ?-Nets -- 2. Geometric Range Spaces -- 3. A Sample of Applications -- 4. Removing Logarithms -- 5. Removing the Randomization -- References
-- IV. Complexity of Polytope Volume Computation -- 1. Jumps of the Derivatives -- 2. Exact Volume Computation is Hard -- 3. Volume Approximation -- References -- V. Allowable Sequences and Order Types in Discrete and Computational
Geometry -- 1. Introduction -- 2. Combinatorial Types of Configurations in the Plane and Allowable Sequences -- 3. Arrangements of Lines and Pseudolines -- 4. Applications of Allowable Sequences -- 5. Order Types of Points in Rd and
“Geometric Sorting” -- 6. The Number of Order Types in Rd -- 7. Isotopy and Realizability Questions -- 8. Lattice Realization of Order Types and the Problem of Robustness in Computational Geometry -- References -- VI. Hyperplane
Approximation and Related Topics -- 1. Introduction -- 2. MINSUM Problem: Orthogonal L1-Fit -- 3. MINSUM Problem: Vertical L1-Fit -- 4. MINMAX Problem: Orthogonal L?-Fit -- 5. MINMAX Problem: Vertical L?-Fit -- 6. Related Issues --
References -- VII. Geometric Transversal Theory -- 1. Introduction -- 2. Hadwiger-Type Theorems -- 3. The Combinatorial Complexity of the Space of Transversals -- 4. Translates of a Convex Set -- 5. Transversal Algorithms -- 6. Other
Directions -- References -- VIII. Hadwiger-Levi’s Covering Problem Revisited -- 0. Introduction -- 1. On I0(K) and I?(K) -- 2. On Il(K) and k-fold Illumination -- 3. Some Simple Remarks on H(B) -- 4. On Convex Bodies with Finitely Many
Corner Points -- 5. Solution of Hadwiger-Levi’s Covering Problem for Convex Polyhedra with Affine Symmetry -- References -- IX. Geometric and Combinatorial Applications of Borsuk’s Theorem -- 1. Introduction -- 2. Van Kampen-Flores
Type Results -- 3. The Ham-Sandwich Theorem -- 4. Centrally Symmetric Polytopes -- 5. Kneser’s Conjecture -- 6. Sphere Coverings -- References -- X. Recent Results in the Theory of Packing and Covering -- 1. Introduction -- 2.
Preliminaries and Basic Concepts -- 3. A Review of Some Classical Results in the Plane -- 4. Economical Packing in and Covering of the Plane -- 5. Multiple Packing and Covering -- 6. Some Computational Aspects of Packing and Covering
-- 7. Restrictions on the Number of Neighbors in a Packing -- 8. Selected Topics in 3 Dimensions -- References -- XI. Recent Developments in Combinatorial Geometry -- 1. The Distribution of Distances -- 2. Graph Dimensions -- 3.
Geometric Graphs -- 4. Arrangements of Lines in Space -- References -- XII. Set Theoretic Constructions in Euclidean Spaces -- 0. Introduction -- 1. Simple Transfinite Constructions -- 2. Closed Sets or Better Well-Orderings -- 3.
Extending the Coloring More Carefully -- 4. The Use of the Continuum Hypothesis -- 5. The Infinite Dimensional Case -- 6. Large Paradoxical Sets in Another Sense -- References -- Author Index
ISBN:9783642580437
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Algorithms and Combinatorics: 10
Keywords: Mathematics , Chemometrics , Geometry , Combinatorics , Computational intelligence , Economic theory , Mathematics , Combinatorics , Geometry , Economic Theory/Quantitative Economics/Mathematical Methods , Math. Applications in Chemistry , Computational Intelligence
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1992-9783642581489:ONLINE Show nearby items on shelf
Title:3D Dynamic Scene Analysis A Stereo Based Approach
Author(s): Zhengyou Zhang
Date:1992
Size:1 online resource (300 p.)
Note:10.1007/978-3-642-58148-9
Contents:1. Introduction -- 1.1 Brief Overview of Motion Analysis -- 1.2 Statement of the “Motion from Stereo” Problem -- 1.3 Organization of The Book -- 2. Uncertainty Manipulation and Parameter Estimation -- 2.1 Probability Theory and
Geometric Probability -- 2.2 Parameter Estimation -- 2.3 Summary -- 2.4 Appendix: Least-Squares Techniques -- 3. Reconstruction of 3D Line Segments -- 3.1 Why 3D Line Segments -- 3.2 Stereo Calibration -- 3.3 Algorithm of the
Trinocular Stereovision -- 3.4 Reconstruction of 3D Segments -- 3.5 Summary -- 4. Representations of Geometric Objects -- 4.1 Rigid Motion -- 4.2 3D Line Segments -- 4.3 Summary -- 4.4 Appendix: Visualizing Uncertainty -- 5. A
Comparative Study of 3D Motion Estimation -- 5.1 Problem Statement -- 5.2 Extended Kalman Filter Approaches -- 5.3 Minimization Techniques -- 5.4 Analytical Solution -- 5.5 Kim and Aggarwal’s method -- 5.6 Experimental Results -- 5.7
Summary -- 5.8 Appendix: Motion putation Using the New Line Segment Representation -- 6. Matching and Rigidity Constraints -- 6.1 Matching as a Search -- 6.2 Rigidity Constraint -- 6.3 Completeness of the Rigidity Constraints -- 6.4
Error Measurements inn the Constraints -- 6.5 Other Formalisms Rigidity Constraints -- 6.6 Summary -- 7. Hypothesize-and-Verify Method for Two 3D View Motion Analysis -- 7.1 General Presentation -- 7.2 Generating Hypotheses -- 7.3
Verifying Hypothesis -- 7.4 Matching Noisy Segments -- 7.5 Experimental Results -- 7.6 Summary -- 7.7 Appendix: Transforming a 3D Line Segment -- 8. Further Considerations on Reducing Complexity -- 8.1 Sorting Data Features -- 8.2
“Good-Enough” Method -- 8.3 Speeding Up the Hypothesis Generation Process Through Grouping -- 8.4 Finding Clusters Based on Proximity -- 8.5 Finding Planes -- 8.6 Experimental Results -- 8.6.1 Grouping Results -- 8.6.2 Motion Results
-- 8.7 Conclusion -- 9. Multiple Object Motions -- 9.1 Multiple Object Motions -- 9.2 Influence of Egomotion on Observed Object Motion -- 9.3 Experimental Results -- 9.4 Summary -- 10. Object Recognition and Localization -- 10.1
Model-Based Object Recognition -- 10.2 Adapting the Motion-Determination Algorithm -- 10.3 Experimental Result -- 10.4 Summary -- 11. Calibrating a Mobile Robot and Visual Navigation -- 11.1 The INRIA Mobile Robot -- 11.2 Calibration
Problem -- 11.3 Navigation Problem -- 11.4 Experimental Results -- 11.5 Integrating Motion Information from Odometry -- 11.6 Summary -- 12. Fusing Multiple 3D Frames -- 12.1 System Description -- 12.2 Fusing Segments from Multiple
Views -- 12.3 Experimental Results -- 12.4 Summary -- 13. Solving the Motion Tracking Problem: A Framework -- 13.1 Previous Work -- 13.2 Position of the Problem and Primary Ideas -- 13.3 Solving the Motion Tracking Problem: A Framework
-- 13.4 Splitting or Merging -- 13.5 Handling Abrupt Changes of Motion -- 13.6 Discussion -- 13.7 Summary -- 14. Modeling and Estimating Motion Kinematics -- 14.1 The Classical Kinematic Model -- 14.2 Closed-Form Solutions for Some
Special Motions -- 14.2.1 Motion with Constant Angular and Translational Velocities -- 14.2.2 Motion with Constant Angular Velocity and Constant Translational Acceleration -- 14.2.3 Motion with Constant Angular Velocity and General
Translational Velocity -- 14.2.4 Discussions -- 14.3 Relation with Two-View Motion Analysis -- 14.4 Formulation for the EKF Approach -- 14.5 Linearized Kinematic Model -- 14.6 Summary -- 15. Implementation Details and Experimental
Results -- 15.1 Matching Segments -- 15.2 Support of Existence -- 15.3 Algorithm of the Token Tracking Process -- 15.4 Grouping Tokens into Objects -- 15.5 Experimental Results -- 15.5.1 Synthetic Data -- 15.6 Summary -- 16.
Conclusions and Perspectives -- 16.1 Summary -- 16.2 Perspectives -- Appendix: Vector Manipulation and Differentiation -- A.1 Manipulation of Vectors -- A.2 Differentiation of Vectors -- References
ISBN:9783642581489
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Springer Series in Information Sciences: 27
Keywords: Computer science , Artificial intelligence , Image processing , Pattern recognition , Physics , Complexity, Computational , Computer Science , Pattern Recognition , Image Processing and Computer Vision , Artificial Intelligence (incl. Robotics) , Complexity , Mathematical Methods in Physics , Numerical and Computational Physics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1991-9783642844584:ONLINE Show nearby items on shelf
Title:Dynamical Problems of Rigid-Elastic Systems and Structures IUTAM Symposium, Moscow, USSR May 23–27,1990
Author(s):
Date:1991
Size:1 online resource (236 p.)
Note:10.1007/978-3-642-84458-4
Contents:Oscillations of a Rigid Body with a Cavity Containing a Heterogeneous Fluid -- Sensitivity Analysis for Structural Modeling and Design -- Dynamics of Space Systems Including Elastic Tethers -- Variational Approaches for Dynamics:
Numerical Studies -- On Static Stability of Elastic Nonconservative Systems with Small Damping -- Control of Elastic Robots -- Asymptotic Analysis for Dynamics of Rigid Body Containing Elastic Elements and Viscous Fluid -- Stability of
Vibratory Modes in Moving Media -- A Numerical Integration Algorithm Based on the Introduction of a Constraint Violation Factor -- Stationary Motions of Mechanical Systems with an Infinite Number of Degrees of Freedom -- A Hierarchical
Optimization Procedure for the Modelling of Mechanical Systems -- Mechanics of Multi-body Systems -- Problems of Nonlinear Dynamics for Large Space Structures -- The Dynamics of Broadband Active Vibration Control Systems with
Controllable Damping for Machines and Mechanical Structures -- Response Localization in Disordered Periodic Structures -- Analytical Multi-body Dynamics -- A New Approach to the Problem of Modeling for One-dimensional Elastic Systems
-- Seismically Excited Liquid Waves in Storage Tanks -- Dynamical Simulation of Flexible Multi-body Systems: Applications to Satellites Motions -- The Geometrical Contact between a Pair of Rollers and a Wheelset in a Railway Vehicle
Roller Rig -- Elastic Multibody Theory Applied to Elastic Manipulators -- Inverse Problems and Global Optimization of the Oscillatory Systems -- Simulation and Animation of Multibody Systems -- Contributions to Kinematics, Statics and
Dynamics of Multibody Systems Solvable in Linear Computational Complexity
ISBN:9783642844584
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Physics , Mechanics , Buildings , Building , Construction , Engineering, Architectural , Physics , Mechanics , Building Construction
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1991-9781461244424:ONLINE Show nearby items on shelf
Title:Numerical Mathematics
Author(s): Günther Hämmerlin
Date:1991
Size:1 online resource (425 p.)
Note:10.1007/978-1-4612-4442-4
Contents:1 Computing -- §1. Numbers and Their Representation -- §2. Floating Point Arithmetic -- §3. Error Analysis -- §4. Algorithms -- 2. Linear Systems of Equations -- §1. Gauss Elimination -- §2. The Cholesky Decomposition -- §3. The QR
Decomposition of Householder -- §4. Vector Norms and Norms of Matrices -- §5. Error Bounds -- §6. III-Conditioned Problems -- 3. Eigenvalues -- §1. Reduction to Tridiagonal or Hessenberg Form -- §2. The Jacobi Rotation and Eigenvalue
Estimates -- §3. The Power Method -- §4. The QR Algorithm -- 4. Approximation -- §1. Preliminaries -- §2. The Approximation Theorems of Weierstrass -- §3. The General Approximation Problem -- §4. Uniform Approximation -- §5.
Approximation in Pre-Hilbert Spaces -- §6. The Method of Least Squares -- 5. Interpolation -- §1. The Interpolation Problem -- §2. Interpolation Methods and Remainders -- §3. Equidistant Interpolation Points -- §4. Convergence of
Interpolating Polynomials -- §5. More on Interpolation -- §6. Multidimensional Interpolation -- 6. Splines -- §1. Polynomial Splines -- §2. Interpolating Splines -- §3. B-splines -- §4. Computing Interpolating Splines -- §5. Error
Bounds and Spline Approximation -- §6. Multidimensional Splines -- 7. Integration -- §1. Interpolatory Quadrature -- §2. Extrapolation -- §3. Gauss Quadrature -- §4. Special Quadrature Methods -- §5. Optimality and Convergence -- §6.
Multidimensional Integration -- 8. Iteration -- §1. The General Iteration Method -- §2. Newton’s Method -- §3. Iterative Solution of Linear Systems of Equations -- §4. More on Convergence -- 9. Linear. Optimization -- §1. Introductory
Examples and the General Problem -- §2. Polyhedra -- §3. The Simplex Method -- §4. Complexity Analysis -- References -- Symbols
ISBN:9781461244424
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Numerical analysis , Mathematics , Numerical Analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1991-9780817648442:ONLINE Show nearby items on shelf
Title:Linear Programming
Author(s): Howard Karloff
Date:1991
Edition:1
Size:1 online resource (144 p.)
Note:10.1007/978-0-8176-4844-2
Contents:The Basics -- The Simplex Algorithm -- Duality -- The Ellipsoid Algorithm -- Karmarkar’s Algorithm
ISBN:9780817648442
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Computer science , Computer programming , Programming languages (Electronic computers) , Algorithms , Computer science , Applied mathematics , Engineering mathematics , Computer mathematics , Computer Science , Programming Techniques , Applications of Mathematics , Programming Languages, Compilers, Interpreters , Math Applications in Computer Science , Computational Mathematics and Numerical Analysis , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1990-9783540469933:ONLINE Show nearby items on shelf
Title:Stable Homotopy Groups of Spheres A Computer-Assisted Approach
Author(s): Stanley O Kochman
Date:1990
Size:1 online resource (334 p.)
Note:10.1007/BFb0083795
Contents:Toda brackets -- Low dimensional computations -- The image of J -- The Japanese stems (?N, 9?N?31) -- The Chicago stem (?S N, 32?N?45) -- The new stems (?S N, 46?N?64) -- The elements of arf invariant one
ISBN:9783540469933
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Lecture Notes in Mathematics: 1423
Keywords: Mathematics , Algorithms , Algebraic topology , Mathematics , Algebraic Topology , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1990-9781461234623:ONLINE Show nearby items on shelf
Title:Realization and Modelling in System Theory Proceedings of the International Symposium MTNS-89, Volume I
Author(s):
Date:1990
Size:1 online resource (594 p.)
Note:10.1007/978-1-4612-3462-3
Contents:Invited Papers -- Questioning the classic state-space description via circuit examples -- Noncausal estimation for discrete Gauss-Markov random fields -- Process models for discrete event systems -- A framework for the study of
dynamical systems -- Correspondence of internal and external stability — Realization functions and complex analysis -- Transformations and Representations of Systems -- State-space and polynomial approaches to rational interpolation --
The Kähler structure of the total least squares problem, Brockett’s steepest descent equations, and constrained flows -- Some canonical properties of nonlinear systems -- Differential algebraic modelling of nonlinear systems --
Transformation issues in linear system theory -- Another look at the Brayton-Moser network equations -- Input/ output equations and realizability -- Balancing general quadratic measures on external signals -- The Topology of Linear
Systems -- Lie algebraic generalizations of Hessenberg matrices and the topology of Hessenberg varieties -- The moduli space of controllable singular systems under restricted system equivalence -- A note on the geometry of partial
realization -- The numerical stability of observability -- Algebraic Geometry and Linear Systems -- On BC S-rings and the pole shifting problem for linear systems -- Matching via measurement feedback -- Algebraic-geometric techniques
for linear periodic discrete-time systems -- Zeros at infinity for infinite dimensional systems -- The pole module of a feedback compensator system is contained in the zero module of the resulting feedback system -- On stabilization
and the existence of coprirne factorizations -- Continuous pole shifting for parametric families of systems -- The Riccati fiow near the edge -- Singular Systems -- Reachability and controllability subspaces for singular systems: A
matrix pencil characterization -- Classification of subspaces of singular systems: A number theoretic approach -- A classification of minimal bases for singular systems -- Some useful aspects of the infinite structure in singular
systems -- On infinite zeros for generalized linear systems -- Non-Standard Models in System Theory -- Multiscale statistical signal processing: Stochastic processes indexed by trees -- Realization theory for deterministic
boundary-value descriptor systems -- Two-Dimensional Systems -- An algebraic test for internal stability of 2-D discrete systems -- On some algebraic aspects of 2D dynamic feedback control -- Recursive reconstruction of image from
noisy and blurred multiframes -- Computation of the fundamental matrix sequence and the Cay ley-Hamilton theorem in singular 2-D systems -- A state representation for 2-D systems -- Markovian properties for 2-D systems -- 2D transfer
functions and stability tests for discrete linear multipass processes -- Bilinear Systems -- Constant feedback stabilizability of bilinear systems -- The parameter sensitivity of bilinear dynamical systems -- Approximate bilinear
realizations: an application to diffusion processes -- Approximate Realization -- Interpolation and Fourier coefficients in the Hardy space H2 -- Approximation of linear systems under the constraint of steady-state values of the step
responses -- Canonical variate modelling and approximation of linear systems -- Experimental analysis of robust solutions to three problems related to the partial realization problem -- System Identification -- Structural
identifiability conditions for systems operating in closed loop -- A Imost sure asymptotics of Rissanen’s predictive stochastic complexity -- System identifiability for the procedure of most powerful unfalsified modeling --
Identification in H-infinity: A robustly convergent nonlinear algorithm -- Identification/prediction algorithms for ARMAX models with relaxed positive real conditions -- An identification procedure for linear continuous time systems
with jump parameters -- On discriminable model sets in residual-based system identification -- Stochastic Dynamical Systems and Statistical Physics -- Stochastic differential equations as dynamical systems -- On the Markov processes of
Schroedinger, the Feynman-Kac formula and stochastic control -- Hamiltonian models of classical and quantum stochastic processes -- Stochastic aggregation of linear Hamiltonian systems with microcanonical distribution -- A stochastic
integral representation for functional of diffusions on manifolds -- Discrete Event Systems -- Reachability of LSFC Nets -- On controllable languages in supervisory control of discrete event systems -- Petri-net-based fairness concepts
for discrete event systems -- Discrete event systems and deadlock -- Hydrology and Hydraulics -- Simplified adaptive Kalman filtering for large-scale geophysical models -- The calibration of 2-D shallow water flow models -- Domain
decomposition for data assimilation in flow forecasting models
ISBN:9781461234623
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Progress in Systems and Control Theory : 3
Keywords: Science , Science, general , Science, general
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1990-9781461233527:ONLINE Show nearby items on shelf
Title:Sequences Combinatorics, Compression, Security, and Transmission
Author(s):
Date:1990
Size:1 online resource (549 p.)
Note:10.1007/978-1-4612-3352-7
Contents:Combinatorial Algorithms -- Fast Parallel and Serial Multidimensional Approximate Array Matching -- Context-Dependent String Matching -- Constant-Space String-Matching -- Matching Patterns in Strings Subject to Multi-Linear
Transformations -- Efficient Algorithms with Applications to Molecular Biology -- A Survey of Approximation Algorithms for the Permanent -- On Optimal Parallel Computations for Sequences of Brackets -- Combinatorics -- Universal
Sequences and Graph Cover Times: A Short Survey -- Fibonacci Facts and Formulas -- On the Influence of Single Participant in Coin Flipping Schemes -- Zero-Error Capacities and Very Different Sequences -- Sequences of Lyndon Words -- A
Note on Addition Chains and Some Related Conjectures -- Some Applications of Probability Methods to Number Theory. Successes and Limitations -- On Pseudo-Random Arrays Constructed from Patterns with Distinct Differences --
Combinatorial Designs Derived from Costas Arrays -- Algorithms for Determining Relative Star-Height and Star-Height -- Eigenwords and Periodic Behaviors -- Infinite Words and a Problem in Semigroup Theory -- Some Combinatorial
Properties of Factorial Languages -- A Conjecture on Rational Sequences -- Sequences Defined by Iterated Morphisms -- Encoding the Vertices of a Graph with Binary Edge Labels -- Compression -- Applications of DAWGs to Data Compression
-- Coding and Complexity -- Compression of Pictures by Finite State Encoders -- Lossy On-Line Dynamic Data Compression -- A Comparison of Text Compression Algorithms -- Compression, Tests for Randomness and Estimating the Statistical
Model of an Individual Sequence -- Security -- Removing Interaction from Zero-Knowledge Proofs -- Protecting Against Abuses of Cryptosystems in Particular in the Context of Verification of Peace Treaties -- The Information Dispersal
Algorithm and Its Applications -- Three Types of Perfection in Shannon-Theoretic Cryptography -- Transmission -- Codes for Certain Sofic Systems -- Simple Combinatorial Decoding of the [23,12,7] Golay Code -- Flag Encodings Related to
the Zeckendorf Representation of Integers -- Immutable Codes -- Unison in Distributed Networks -- Sequence Transmission: Coding in the Frequency Domain -- On the Maximality of the Group Theoretic Single Error Correcting and All
Unidirectional Error Detecting (SEC-AUED) Codes -- Coding Sequences with Constraints -- Robust Error Control Sequences for Efficient Software Implementation -- Author Index
ISBN:9781461233527
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Coding theory , Computers , Numerical analysis , Mathematical models , Combinatorics , Applied mathematics , Engineering mathematics , Mathematics , Mathematical Modeling and Industrial Mathematics , Numerical Analysis , Theory of Computation , Coding and Information Theory , Combinatorics , Appl.Mathematics/Computational Methods of Engineering
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1990-9780817647292:ONLINE Show nearby items on shelf
Title:Mathematics for the Analysis of Algorithms
Author(s): Daniel H Greene
Date:1990
Edition:Third Edition
Size:1 online resource (132 p.)
Note:10.1007/978-0-8176-4729-2
Contents:Binomial Identities -- Recurrence Relations -- Operator Methods -- Asymptotic analysis
ISBN:9780817647292
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Progress in Computer Science and Applied Logic (PCS) : 1
Keywords: Computer science , Algorithms , Computer science , Computer mathematics , Numerical analysis , Computer Science , Algorithm Analysis and Problem Complexity , Algorithms , Numerical Analysis , Computational Mathematics and Numerical Analysis , Mathematics of Computing
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1988-9783642730122:ONLINE Show nearby items on shelf
Title:Radon and Projection Transform-Based Computer Vision Algorithms, A Pipeline Architecture, and Industrial Applications
Author(s): Jorge L. C Sanz
Date:1988
Size:1 online resource (123 p.)
Note:10.1007/978-3-642-73012-2
Contents:1. Introduction -- 1.1 Machine Vision Architectures -- 1.2 The Radon Transform and the PPPE Architecture -- 2. Model and Computation of Digital Projections -- 2.1 Representation of Digital Lines -- 2.2 Generation of Projection Data --
2.3 Noise Considerations -- 3. Architectures -- 3.1 The Contour Image Generator -- 3.2 The Projection Data Collector -- 3.3 Additional Hardware -- 3.4 Putting It All Together: P3E -- 3.5 Implementation in Commercially Available
Pipelines -- 4. Projections Along General Contours -- 5. P3E-Based Image Analysis Algorithms and Techniques -- 5.1 Computing Convex Hulls, Diameters, Enclosing Boxes, Principal Components, and Related Features -- 5.2 Computing Hough
Transforms for Line and Curve Detection -- 5.3 Generating Polygonal Masks -- 5.4 Generating Multi-Colored Masks -- 5.5 Non-Linear Masks -- 6. P3E-Based Image Processing Algorithms and Techniques -- 6.1 Non-iterative Reconstruction --
6.2 Iterative Reconstruction -- 6.3 Two-Dimensional Convolution -- 6.4 Rotation and Translation -- 6.5 Computerized Tomography Reconstruction -- 6.6 Autocorrelation -- 6.7 Polar Fourier Transform and Object Classification -- 7. Radon
Transform Theory for Random Fields and Optimum Image Reconstruction from Noisy Projections -- 7.1 Radon Transform Theory of Random Fields -- 7.2 Optimum Reconstruction from Noisy Projections -- 8. Machine Vision Techniques for Visual
Inspection -- 9. Conclusion
ISBN:9783642730122
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Springer Series in Information Sciences: 16
Keywords: Computer science , Algorithms , Computer Science , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1987-9789400937895:ONLINE Show nearby items on shelf
Title:Multivariate Data Analysis
Author(s): Fionn Murtagh
Date:1987
Size:1 online resource (224 p.)
Note:10.1007/978-94-009-3789-5
Contents:1 Data Coding and Initial Treatment -- 1.1 The Problem -- 1.2 Mathematical Description -- 1.3 Examples and Bibliography -- 2 Principal Components Analysis -- 2.1 The Problem -- 2.2 Mathematical Description -- 2.3 Examples and
Bibliography -- 2.4 Software and Sample Implementation -- 3 Cluster Analysis -- 3.1 The Problem -- 3.2 Mathematical Description -- 3.3 Examples and Bibliography -- 3.4 Software and Sample Implementation -- 4 Discriminant Analysis --
4.1 The Problem -- 4.2 Mathematical Description -- 4.3 Examples and Bibliography -- 4.4 Software and Sample Implementation -- 5 Other Methods -- 5.1 The Problems -- 5.2 Correspondence Analysis -- 5.3 Principal Coordinates Analysis --
5.4 Canonical Correlation Analysis -- 5.5 Regression Analysis -- 5.6 Examples and Bibliography -- 6 Case Study: IUE Low Dispersion Spectra -- 6.1 Presentation -- 6.2 The IUE Satellite and its Data -- 6.3 The Astrophysical Context --
6.4 Selection of the Sample -- 6.5 Definition of the Variables -- 6.6 Spectral Features -- 6.7 Multivariate Analyses -- 7 Conclusion: Strategies for Analysing Data -- 7.1 Objectives of Multivariate Methods -- 7.2 Types of Input Data --
7.3 Strategies of Analysis -- General References
ISBN:9789400937895
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Astrophysics and Space Science Library, A Series of Books on the Recent Developments of Space Science and of General Geophysics and Astrophysics Published in Connection with the Journal Space Science Reviews: 131
Keywords: Statistics , Algorithms , Astronomy , Astrophysics , Cosmology , Statistics , Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Scien , Astronomy, Astrophysics and Cosmology , Algorithm Analysis and Problem Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1987-9781461318811:ONLINE Show nearby items on shelf
Title:Foundations of Data Organization
Author(s):
Date:1987
Size:1 online resource (650 p.)
Note:10.1007/978-1-4613-1881-1
Contents:Databases for Advanced Applications -- Statistics Metadata: Linear Regression Analysis -- Dynamic PATRICIA -- Design of an Integrated DBMS to Support Advanced Applications -- Use of the Relational Model for Data Representation in a
Deductively Augmented Database Management System -- Hashing -- Hash-Based File Organization Utilizing Large Capacity Main Memory -- Trie Hashing: Further Properties and Performance -- The Study of A Letter Oriented Minimal Perfect
Hashing Scheme -- Consecutive Retrieval Property -- On the Relaxed Consecutive Retrieval Property in File Organization -- Consecutive Retrieval Organization as a File Allocation Scheme on Multiple Disk Systems -- TRACER: Transposed
File Organization Scheme with Consecutive Retrieval Property and Its Application to Statistical Database System -- Multiple Query Processing in Local Area Database System -- File Allocation and Distributed Databases -- Management of
Table Partitioning and Replication in a Distributed Relational Database System -- On Strict Optimality Property of Allocating Binary Cartesian Product Files on Multiple Disk Systems -- On the Complexity of File Allocation Problem -- A
Quantitative Evaluation of Scheduling Systems for the Physical Locking Scheme in a Database System -- Allocation of Documents in Two Level Memory for Information Retrieval Systems -- Mathematical File Organization and Computational
Geometry -- Further Results on Hyperclaw Decomposition and Balanced Filing Schemes -- Placing Tiles in the Plane -- Mixed-Type Multiple-Valued Filing Scheme of Order One and Two -- Space Partitioning and Its Application to Generalized
Retrieval Problems -- On Computing and Updating Triangulations -- Database Machines -- VLSI Trees for File Organization -- The Inverted File Tree Machine: Efficient Multi-Key Retrieval for VLSI -- Multidimensional Clustering Techniques
for Large Relational Database Machines -- A Method for Realistic Comparisons of Sorting Algorithms for VLSI -- Database Models -- Update Propagation in the IFO Database Model -- Computation-tuple Sequences and Object Histories:
Extended Abstract -- Projection of Object Histories -- Functional Entity Relationship Model and Update Operations (Extended Abstract) -- An Algebra for an Entity-Relationship Model and Its Application to Graphical Query Processing --
Structures and Performance of Physical Database Models -- Record-to-Area Mapping in the CODASYL Environment -- An Optimal Trie Construction Algorithm for Partial-Match Queries -- FOPES: File Organization Performance Estimation System
-- Empirical Comparison of Associative File Structures -- Hybrid Sorting Techniques in Grid Structures -- CAD/VLSI Databases -- A Model and Storage Technique for Versions of VLSI CAD Objects -- Storage and Access Structures for
Geometric Data Bases -- A Conceptual Basis for Graphics-Based Data Management (Extended Abstract) -- Semantic Data Organization on a Generalized Data Management System -- Frequency Separation Analysis for Object Oriented Databases --
Query Processing and Physical Structures for Relational Databases -- Index Selection in Relational Databases -- A Physical Structure for Efficient Processing of Relational Queries -- A Hash Join Technique for Relational Database
Systems -- Data Organization Method for the Parallel Execution of Relational Operations -- Implementation of Inferential Relational Database System -- Database Theory -- Towards a Basic Relational NF2 Algebra Processor -- Two Classes
of Easily Tested Integrity Constraints: Complacent and FD-complacent Integrity Constraints -- Semantic Constraints of Network Model (Extended Abstract) -- Join-Decomposition of MVD-Constraints Using the Characterization by “Bases” -An
Introductive Study- -- Database Research and Development in the Pacific Area Countries -- Database Research and Development in Taiwan -- Database Research and Development in Korea -- Database Research and Development in Australia --
Database Research and Development in Japan: Its Past, Present and Future -- Database Research and Development in China -- Database Research and Development in Singapore -- Author index
ISBN:9781461318811
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Physics , Astrophysics , Statistics , Physics , Astrophysics and Astroparticles , Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Scien
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-1985-9783642932878:ONLINE Show nearby items on shelf
Title:Mathematics in Biology and Medicine Proceedings of an International Conference held in Bari, Italy, July 18–22, 1983
Author(s):
Date:1985
Size:1 online resource (528 p.)
Note:10.1007/978-3-642-93287-8
Contents:I. — Population Genetics and Ecology -- Invited Papers -- The role of diffusion in mathematical population biology: Skellam revisited -- The dynamics of structured populations: some examples -- Mathematical problems in the description
of age structured populations -- Contributed Papers -- Models for mutual attraction and aggregation of motile individuals -- A problem on invariant manifolds arising in population genetics -- On a mathematical problem arising in cell
population biology -- The external memory of intertidal molluscs:a theoretical study of trail-following -- Stationary distributions for populations subject to random catastrophes -- A nonlinear diffusion equation in phytoplankton
dynamics with self—shading effects -- A model of aphid population with age structure -- On two-population models with switching depletion -- On some nonlinear diffusion models in population dynamics -- Reduction of the gene Flow of a
“neutral” linked gene due to the partial sterility of heterozygotes for a chromosome mutation -- Predator-mediated coexistence of competing species in a Volterra model -- On a nonlinear problem arising from interaction of algae with
light -- II. — Epidemics -- Invited Papers -- Congenital rubella syndrome (C.R.S.): models of disease control by vaccination -- A simulation model for the control of helminth diseases by chemotherapy -- Models for endemic diseases --
Stochastic epidemics as point processes -- Contributed Papers -- A computer simulation program for the assessment of multistate epidemiological models of infectious diseases -- Mathematical model of hepatitis B -- Models of the
interaction of host genotypes and infectious disease -- On the general epidemic model in discrete time -- Control of virus transmission in age-structured populations -- Parameter estimation and validation for an epidemic model -- Local
stability in epidemic models for heterogeneous populations -- III. — Resource Management -- Invited Papers -- Bayesian methods in ecology and resource management -- Contributed Papers -- Stochastic differential equation models of
fisheries in an uncertain world: extinction probabilities, optimal fishing effort, and parameter estimation -- IV. — Physiology and Medicine -- Invited Papers -- Experiment designs identification of simple and complex models of
endocrine-metabolic systems -- A mathematical model for cardiac electric sources and related potential fields -- Mathematical analysis of immobilized enzyme systems -- Contributed Papers -- Modeling controls and variability of the cell
cycle -- The phase resetting characteristics of endogenously active neurones -- Theory of DNA superhelicity -- Determination of DNA synthesis rate in cell populations with locally exponential S-phase influx -- A numerical study for a
cell system -- Experimental validation of a mathematical procedure for the analysis of flow cytometric data -- A stochastic model for describing the space-time evolution of the extreme values of cardiac potentials on the chest surface
-- Statistical analysis of the coding capacity of complementary DNA strands -- Mass transport across multimembrane systems: a general analysis -- Time hierarchy in oscillating metabolic systems -- Modeling of the interaction between
ligands and cell membrane receptors in the presence of exogenous electric fields -- Balance of growth models of cell populations: the significance of simple mathematical considerations -- The age structure of populations of cells
reproducing by asymmetric division -- Numerical simulation of reentry of the activation wave in the heart hiss bundle -- Hopf bifurcation and the repetitive activity of excitable cells -- Nonlinear evolution equations with a
convolution term involved in some neurophysiological models -- Investigation of rapid metabolic reactions in whole organs by multiple pulse Labelling -- Cross-linking of identical particles by multiple ligand-types -- Enumeration of
RNA secondary structures by complexity -- Growth of cell populations -- V. — Compartmental Analysis -- Invited Papers -- A staging process with applications in biology and medicine -- On the use of residence time moments in the
statistical analysis of age-dependent stochastic compartmental systems -- An algorithm for reconstruction of count rate curves from total counts -- Contributed Papers -- On identifiability of linear compartmental systems: some results
obtained by means of structural properties of the associated graph -- Compartmental vs, noncompartmental modeling of ketone body kinetics -- Identifiability of compartmental models: on characterization of two extremal types of
input-output experiments -- VI. — General Mathematical Methods -- Invited Papers -- Estimation techniques for transport equations -- Stability of delay differential equations with applications in biology and medicine -- Existence of
quasi-solutions of systems of nonlinear elliptic BVP’s suggested by biochemical reactions -- Diffusion approximations and first passage time problems in population biology and neurobiology -- Contributed Papers -- The role of
exchangeability in biology, genetics and medicine -- Cyclic chemical systems: an asymptotic stability criterion -- On existence, uniqueness and attractivity of stationary solutions to some quasilinear parabolic systems -- Asymptotic
estimates for principal eigenvalues -- Remarks on the connection between positive feedback and instability in regard to model selection in population biology -- Lyapunov methods for a wide class of stochastic models in biology --
Existence and uniqueness for a non linear Cauchy problem of hyperbolic type -- Catastrophe theory in biology -- S-system analysis of biological systems
ISBN:9783642932878
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Lecture Notes in Biomathematics: 57
Keywords: Mathematics , Algebra , Applied mathematics , Engineering mathematics , Biomathematics , Mathematics , Applications of Mathematics , Algebra , Mathematical and Computational Biology
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Return to the Fermilab Library catalog