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 TREES *END*INIT* use /tmp/qspiwww.webspi1/31624.5 QRY 131.225.70.96 . find keyword trees ( in books using www Cover
Image
Call number:9783319475516:ONLINE Show nearby items on shelf
Title:A Combinatorial Perspective on Quantum Field Theory
Author(s): Karen Yeats
Date:2017
Size:1 online resource (IX, 120 p. 16 illus p.)
Contents:Part I Preliminaries -- Introduction -- Quantum field theory set up -- Combinatorial classes and rooted trees -- The Connes-Kreimer Hopf algebra -- Feynman graphs -- Part II Dyson-Schwinger equations -- Introduction to Dyson-Schwinger
equations -- Sub-Hopf algebras from Dyson-Schwinger equations -- Tree factorial and leading log toys -- Chord diagram expansions -- Differential equations and the (next-to)m leading log expansion -- Part III Feynman periods -- Feynman
integrals and Feynman periods -- Period preserving graph symmetries -- An invariant with these symmetries -- Weight -- The c2 invariant -- Combinatorial aspects of some integration algorithms -- Index
ISBN:9783319475516
Series:eBooks
Series:Springer eBooks
Series:Springer 2017 package
Keywords: Physics , Discrete mathematics , Mathematical physics , Quantum field theory , String theory , Physics , Quantum Field Theories, String Theory , Mathematical Physics , Discrete 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:9783319463315:ONLINE Show nearby items on shelf
Title:Agent-Based Modeling of Sustainable Behaviors
Author(s):
Date:2017
Size:1 online resource (XVII, 257 p. 86 illus., 67 illus. in color p.)
Contents:Psychologically Plausible Models in Agent-Based Simulations of Sustainable Behavior -- Modelling Everyday Pro-Environmental Norm Transmission and Diffusion in Workplace Networks -- Empirically-Derived Behavioral Rules in Agent-Based
Models Using Decision Trees Learned From Questionnaire Data -- The Implementation of the Theory of Planned Behavior in an Agent-Based Model for Waste Recycling: A Review and a Proposal -- Social Simulations Through an Agent-Based
Platform, Location Data and 3D Models -- An Intersection-Centric Auction-Based Traffic Signal Control Framework -- Agentdrive: Agent-Based Simulator for Intelligent Cars and its Application for Development of a Lane-Changing Assistant
-- City Parking Allocations as a Bundle of Society-Aware Deals -- Sustainable Farming Behaviours: an Agent Based Modelling and LCA Perspective -- Agent-Based Simulation of Electricity Markets: Risk Management and Contracts for
Difference -- Energy Management in the Smart Grids via Intelligent Storage Systems
ISBN:9783319463315
Series:eBooks
Series:Springer eBooks
Series:Springer 2017 package
Keywords: Physics , Artificial intelligence , Game theory , Sustainable development , Economic sociology , Physics , Data-driven Science, Modeling and Theory Building , Game Theory, Economics, Social and Behav. Sciences , Organizational Studies, Economic Sociology , Artificial Intelligence (incl. Robotics) , Sustainable Development
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:9783319434766:ONLINE Show nearby items on shelf
Title:Discrete Probability Models and Methods Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding
Author(s): Pierre Brémaud
Date:2017
Size:1 online resource (XIV, 559 p. 92 illus p.)
Contents:Introduction -- 1.Events and probability -- 2.Random variables -- 3.Bounds and inequalities -- 4.Almost-sure convergence -- 5.Coupling and the variation distance -- 6.The probabilistic method -- 7.Codes and trees -- 8.Markov chains --
9.Branching trees -- 10.Markov fields on graphs -- 11.Random graphs -- 12.Recurrence of Markov chains -- 13.Random walks on graphs -- 14.Asymptotic behaviour of Markov chains -- 15.Monte Carlo sampling -- 16. Convergence rates --
Appendix -- Bibliography
ISBN:9783319434766
Series:eBooks
Series:Springer eBooks
Series:Springer 2017 package
Keywords: Mathematics , Computer communication systems , Coding theory , Mathematical statistics , Probabilities , Graph theory , Mathematics , Probability Theory and Stochastic Processes , Probability and Statistics in Computer Science , Graph Theory , Coding and Information Theory , Computer Communication Networks
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:1905209304:ONLINE Show nearby items on shelf
Title:Fault Trees
Author(s): Limnios
Date:2007
Publisher:Wiley-ISTE
Size:1 online resource (151 p.)
ISBN:9781905209309
Series:eBooks
Series:Wiley Online Library
Series:Wiley 2016 package purchase
Keywords: Electrical & Electronics 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:047110793X:ONLINE Show nearby items on shelf
Title:Detection, Estimation, and Modulation Theory, Part III: Radar-Sonar Signal Processing and Gaussian Signals in Noise
Author(s): Van Trees
Date:2001
Publisher:Wiley-Interscience
Size:1 online resource (649 p.)
ISBN:9780471107934
Series:eBooks
Series:Wiley Online Library
Series:Wiley 2016 package purchase
Keywords: Electrical & Electronics 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:0471095176:ONLINE Show nearby items on shelf
Title:Detection, Estimation, and Modulation Theory, Part I
Author(s): Van Trees
Date:2001
Publisher:Wiley-Interscience
Size:1 online resource (717 p.)
ISBN:9780471095170
Series:eBooks
Series:Wiley Online Library
Series:Wiley 2016 package purchase
Keywords: Electrical & Electronics 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:0471093904:ONLINE Show nearby items on shelf
Title:Optimum Array Processing: Part 4 of Detection, Estimation, and Modulation Theory
Author(s): Van Trees
Date:2002
Publisher:Wiley-Interscience
Size:1 online resource (1473 p.)
ISBN:9780471093909
Series:eBooks
Series:Wiley Online Library
Series:Wiley 2016 package purchase
Keywords: Electrical & Electronics 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

Call number:TK7835.V369 Show nearby items on shelf
Title:Synthesis of optimum nonlinear control systems.
Author(s): Harry L. Van Trees
Date:1962
Publisher:M.I.T. Press, Cambridge, Mass
Size:102
Series:M.I.T. Press research monographs 22-23
Keywords: Feedback (Electronics)
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.
Location: MAIN

Cover
Image
Call number:TK5105.875.I57::2007 Show nearby items on shelf
Title:Programming collective intelligence: building smart web 2.0 applications
Author(s): Toby Segaran
Date:2007
Publisher:O'Reilly
Size:334 p
Contents:Introduction to collective intelligence -- Making recommendations -- Discovering groups -- Searching and ranking -- Optimization -- Document filtering -- Modeling with decision trees -- Building price models -- Advanced classification : kernel metho ds and SVMs -- Finding independent features -- Evolving intelligence -- Algorithm summary.
ISBN:9780596529321
Keywords: Information technology, Social aspects, Programming
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
Location: MAIN

Cover Image This book is only available through interlibrary loan. (email library@fnal.gov if you would like this title added to the Library collection.)
Call number:TK5102.5.V3 Show nearby items on shelf
Title:Detection, estimation, and modulation theory
Author(s): Harry L. Van Trees
Date:1968
Publisher:Wiley, New York
Size:3
ISBN:04718995772
Keywords: Signal theory (Telecommunication)
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
Location: ILL

Cover
Image
Call number:SPRINGER-2016-9789811005190:ONLINE Show nearby items on shelf
Title:Recent Advances in Mathematical Sciences Selected Papers from ICREM7 2015
Author(s):
Date:2016
Size:1 online resource (109 p.)
Note:10.1007/978-981-10-0519-0
Contents:Chapter 1: Counting Trees and Rooted Trees with Applications -- Chapter 2: Boundedness and Stability of Leslie-Gower Model with Sokol-Howell Functional Response -- Chapter 3: Fifth order Four Stage Explicit Trigonometrically-fitted Runge–Kutta– Nystrӧm Methods -- Chapter 4: Modified Homotopy Perturbation Method For Fredholm-Volterra Integro-Differential Equation -- Chapter 5: Simultaneous Effects of Soret and Dufour on the Unsteady Stagnation Point Flow of Micropolar Fluid towards a Permeable S tretching Sheet -- Chapter 6: One-Step Implicit Hybrid Method for Solving Semi-Explicit Index-1 Differential Algebraic Equations -- Chapter 7: An Artificial Intelligence Strategy for the Prediction of Wind Speed and Direction in Sarawak for Wind Energy Ma pping -- Chapter 8: Stability Analysis of Dengue Disease Using Host – Vector Model -- Chapter 9: Simple Motion Evasion Differential Game of One Pursuer and One Evader.
ISBN:9789811005190
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algebra , Mathematical analysis , Analysis (Mathematics) , Game theory , Geometry , Operations research , Management science , Mathematical physics , Mathematics , Analysis , Mathematical Physics , Algebra , Geometry , Operations Research, Management Science , 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-2016-9783319242989:ONLINE Show nearby items on shelf
Title:Recent Trends in Combinatorics
Author(s):
Date:2016
Size:1 online resource (14 p.)
Note:10.1007/978-3-319-24298-9
Contents:Section 1: Extremal and Probabilistic Combinatorics -- Problems Related to Graph Indices in Trees -- The edit distance in graphs: methods, results and generalizations -- Repetitions in graphs and sequences -- On Some Extremal Problems for Cycles in Graphs -- A survey of Turan problems for expansions -- Survey on matching, packing and Hamilton cycle problems on hypergraphs -- Rainbow Hamilton cycles in random graphs and hypergraphs -- Further applications of the Container Method -- Independent transv ersals and hypergraph matchings - an elementary approach -- Giant components in random graphs -- Infinite random graphs and properties of metrics -- Nordhaus-Gaddum Problems for Colin de Verdière Type Parameters, Variants of Tree-width, and Related Param eters -- Algebraic aspects of the normalized Laplacian -- Poset-free Families of Subsets.- Mathematics of causal sets -- Section 2: Additive and Analytic Combinatorics -- Lectures on Approximate groups and Hilbert's 5th Problem -- Character
sums and arithmetic combinatorics -- On sum-product problem -- Ajtai-Szemerédi Theorems over quasirandom groups -- Section 3: Enumerative and Geometric Combinatorics -- Moments of orthogonal polynomials and combinatorics -- The combinatorics of kno t invariants arising from the study of Macdonald polynomials -- Some algorithmic applications of partition functions in combinatorics -- Partition Analysis, Modular Functions, and Computer Algebra -- A survey of consecutive patterns in permutations -- Uni modality Problems in Ehrhart Theory -- Face enumeration on simplicial complexes -- Simplicial and Cellular Trees -- Parametric Polyhedra with at least k Lattice Points: Their Semigroup Structure and the k-Frobenius Problem.- Dynamical Algebraic Combinator ics and the Homomesy Phenomenon
ISBN:9783319242989
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:The IMA Volumes in Mathematics and its Applications: 159
Keywords: Mathematics , Dynamics , Ergodic theory , Functional analysis , Convex geometry , Discrete geometry , Combinatorics , Biomathematics , Mathematics , Combinatorics , Convex and Discrete Geometry , Dynamical Systems and Ergodic Theory , Functional Analysis , Genetics and Population Dynamics
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-2016-9781493937837:ONLINE Show nearby items on shelf
Title:An Introduction to Mathematical Finance with Applications Understanding and Building Financial Intuition
Author(s): Arlie O Petters
Date:2016
Size:1 online resource (12 p.)
Note:10.1007/978-1-4939-3783-7
Contents:Preface -- 1. Preliminaries and Financial Markets -- 2. The Time Value of Money -- 3. Markowitz Portfolio Theory -- 4. Capital Market Theory and Portfolio Risk Measures -- 5. Binomial Trees and Security Pricing Modeling -- 6. Stochastic Calculus an d Geometric Brownian Motion Model -- 7. Derivatives: Forwards, Futures, Swaps and Options -- 8. The BSM Model and European Option Pricing -- Index.
ISBN:9781493937837
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Economics, Mathematical , Actuarial science , Mathematical models , Probabilities , Mathematics , Quantitative Finance , Mathematical Modeling and Industrial Mathematics , Probability Theory and Stochastic Processes , Actuarial 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-2014-9783642540752:ONLINE Show nearby items on shelf
Title:Upper and Lower Bounds for Stochastic Processes [electronic resource] : Modern Methods and Classical Problems
Author(s): Michel Talagrand
Date:2014
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:The book develops modern methods and in particular the generic chaining to bound stochastic processes. This methods allows in particular to get optimal bounds for Gaussian and Bernoulli processes. Applications are given tostable processes, infinitely divisible processes, matching theorems, the convergence of random Fourier series, of orthogonal series, and to functional analysis. The complete solution of a number of classical problems is given incomplete detail, and an ambitious program for future re search is laid out
Contents:0. Introduction
1. Philosophy and Overview of the Book
2. Gaussian Processes and the Generic Chaining
3. Random Fourier Series and Trigonometric Sums, I
4. Matching Theorems I
5. Bernouilli Processes
6. Trees and the Art of Lower Bounds
7. Random Fourier Series and Trigonometric Sums, II
8. Processes Related to Gaussian Processes
9. Theory and Practice of Empirical Processes
10. Partition Scheme for Families of Distances
11. Infinitely Divisible Processes
12. The Fundamental Conjectures
13. Convergence of Orthogonal Series Majorizing Measures
14. Matc
ISBN:9783642540752
Series:eBooks
Series:SpringerLink
Series:Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge / A Series of Modern Surveys in Mathematics, 0071-1136 : v60
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Functional analysis , Distribution (Probability 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-2014-9783642405235:ONLINE Show nearby items on shelf
Title:An Introduction to Markov Processes [electronic resource]
Author(s): Daniel W Stroock
Date:2014
Edition:2nd ed. 2014
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:This book provides a rigorous but elementary introduction to the theory of Markov Processes on a countable state space. It should be accessible to students with a solid undergraduate background in mathematics, including studentsfrom engineering, econ omics, physics, and biology. Topics covered are: Doeblin's theory, general ergodic properties, and continuous time processes.Applications are dispersed throughout the book. In addition, a whole chapter isdevoted to reversible processes and the use of thei r associated Dirichlet forms to estimate the rate of convergence to equilibrium. These results are then applied to the analysis of the Metropolis (a.k.a simulated annealing) algorithm.The corrected and enlarged 2nd edition contains a new chapter in which the author develops computational methods for Markov chains on a finite state space. Most intriguing isthe section with a new technique for computing stationarymeasures, which is applied to derivations of Wilson's algorithm and Kirchoff's formula for span ning trees in a connected graph
Contents:Preface
Random Walks, a Good Place to Begin
Doeblin's Theory for Markov Chains
Stationary Probabilities
More about the Ergodic Theory of Markov Chains
Markov Processes in Continuous Time
Reversible Markov Processes
A minimal Introduction to Measure Theory
Notation
References
Index
ISBN:9783642405235
Series:eBooks
Series:SpringerLink
Series:Graduate Texts in Mathematics, 0072-5285 : v230
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Differentiable dynamical systems , Distribution (Probability 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-2014-9781493907427:ONLINE Show nearby items on shelf
Title:Clusters, Orders, and Trees: Methods and Applications [electronic resource] : In Honor of Boris Mirkin's 70th Birthday
Author(s): Fuad Aleskerov
Boris Goldengorin
Panos M Pardalos
Date:2014
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkins ground breaking contributions in various fields of decision making anddata analysis have marke d the fourth quarter of the 20th century and beyond.Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hiddenstructuresfirst of all, clusters, orderings, and hier archiesin multivariate and/or network data. This volume contains a collection of papers reflecting recent developments rooted inMirkin's fundamental contribution to thestate-of-the-art in group choice, ordering, clustering, data mining, and knowledge disc overy. Researchers, students, and software engineers will benefit from new knowledge discovery techniques and application directions
Contents:Three and One Questions to Dr. B. Mirkin about Complexity Statistics (I. Mandel)
Section 1
A Polynomial Algorithm for a Class of 0
1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (P. Hansen, C. Meyer)
Experiments with a Non
Convex Variance
Based Clustering Criterion (R.F. Toso, E.V. Bauman, C.A. Kulikowski, I.B. Muchnik)
Strategy
Proof Location Functions on Finite Graphs (F.R. McMorris, H.M. Mulder, F.S. Roberts)
A Pseudo
Boolean Approach to the Market Graph Analysis by Means of the p
Median Model (B. Goldengorin, A. Ko
ISBN:9781493907427
Series:eBooks
Series:SpringerLink
Series:Springer Optimization and Its Applications, 1931-6828 : v92
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computational complexity , Electronic data processing
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-9781461488545:ONLINE Show nearby items on shelf
Title:Set Theory [electronic resource] : With an Introduction to Real Point Sets
Author(s): Abhijit Dasgupta
Date:2014
Publisher:New York, NY : Springer New York : Imprint: Birkhuser
Size:1 online resource
Note:What is a number? What is infinity? What is continuity? What is order? Answers to these fundamental questions obtained by late nineteenth-century mathematicians such as Dedekind and Cantor gave birth to set theory. This textbookpresents classical set theory in an intuitive but concrete manner. To allow flexibility of topic selection in courses, the book is organized into four relatively independent parts with distinct mathematical flavors. Part I begins withthe DedekindPeano axioms and ends with the construction of the real numbers. The core CantorDedekind theory of cardinals, orders, and ordinals appears in Part II. Part III focuses on the real continuum. Finally, foundationalissues and formal axioms are introduced in Part IV. Each part ends with a postscript chapter discussing topics beyond the scope of the main text, ranging from philosophical remarks to glimpses into landmark results of modern set theorysuch as the resolution of Lusin's problems on projective sets using determinacy of infinite ga mes and large cardinals. Separating the metamathematical issues into an optional fourth part at the end makes this textbook suitable forstudents interested in any field of mathematics, not just for those planning to specialize in logic or foundations. The re is enough material in the text for a year-long course at the upper-undergraduate level. For shorter one-semesteror one-quarter courses, a variety of arrangements of topics are possible. The book will be a useful resource for both experts working in a r elevant or adjacent area and beginners wanting to learn set theory via self-study
Contents:1 Preliminaries: Sets, Relations, and Functions
Part I Dedekind: Numbers
2 The DedekindPeano Axioms
3 Dedekinds Theory of the Continuum
4 Postscript I: What Exactly Are the Natural Numbers?
Part II Cantor: Cardinals, Order, and Ordinals
5 Cardinals: Finite, Countable, and Uncountable
6 Cardinal Arithmetic and the Cantor Set
7 Orders and Order Types
8 Dense and Complete Orders
9 Well
Orders and Ordinals
10 Alephs, Cofinality, and the Axiom of Choice
11 Posets, Zorns Lemma, Ranks, and Trees
12 Postscript II: Innitary Combinatorics
Part III Re
ISBN:9781461488545
Series:eBooks
Series:SpringerLink
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Logic , Algebra , Global analysis (Mathematics) , Logic, Symbolic and mathematical , Topology
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-9788847028715:ONLINE Show nearby items on shelf
Title:Complex Models and Computational Methods in Statistics [electronic resource]
Author(s): Matteo Grigoletto
Francesco Lisi
Sonia Petrone
Date:2013
Publisher:Milano : Springer Milan : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:The use of computational methods in statistics to face complex problems and highly dimensional data, as well as the widespread availability of computer technology, is no news. The range of applications, instead, is unprecedented.As often occurs, new and complex data types require new strategies, demanding for the development of novel statistical methods and suggesting stimulating mathematical problems. This book is addressed to researchers working at theforefront of the statistical analysis of comple x systems and using computationally intensive statistical methods
Note:Springer eBooks
Contents:A new unsupervised classification technique through nonlinear non parametric mixed effects models
Estimation approaches for the apparent diffusion coefficient in Rice
distributed MR signals
Longitudinal patterns of financial product ownership: a latent growth mixture approach
Computationally efficient inference procedures for vast dimensional realized covariance models
A GPU software library for likelihood
based inference of environmental models with large datasets
Theoretical Regression Trees: a tool for multiple structural
change models analysis
Some contributions to the th
ISBN:9788847028715
Series:e-books
Series:SpringerLink (Online service)
Series:Contributions to Statistics, 1431-1968
Series:Mathematics and Statistics (Springer-11649)
Keywords: Statistics , Statistical methods , Mathematical statistics , Economics
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-9788132210535:ONLINE Show nearby items on shelf
Title:Combinatorial Matrix Theory and Generalized Inverses of Matrices [electronic resource]
Author(s): Ravindra B Bapat
Steve J Kirkland
K. Manjunatha Prasad
Simo Puntanen
Date:2013
Publisher:India : Springer India : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book consists of eighteen articles in the area of `Combinatorial Matrix Theory' and `Generalized Inverses of Matrices'. Original research and expository articles presented in this publication are written by leadingMathematicians and Statistician s working in these areas. The articles contained herein are on the following general topics: `matrices in graph theory', `generalized inverses of matrices', `matrix methods in statistics' and `magicsquares'. In the area of matrices and graphs, speci_c top ics addressed in this volume include energy of graphs, q-analog, immanants of matrices and graph realization of product of adjacency matrices. Topics in the book from `MatrixMethods in Statistics' are, for example, the analysis of BLUE via eigenvalues of covariance matrix, copulas, error orthogonal model, and orthogonal projectors in the linear regression models. Moore-Penrose inverse of perturbedoperators, reverse order law in the case of inde_nite inner product space, approximation numbers, condition nu mbers, idempotent matrices, semiring of nonnegative matrices, regular matrices over incline and partial order of matrices arethe topics addressed under the area of theory of generalized inverses. In addition to the above traditional topics and a report on CMTGIM 2012 as an appendix, we have an article on old magic squares from India
Note:Springer eBooks
Contents:Skew Spectrum of the Cartesian Product of an Oriented Graph with an Oriented Hypercube
Notes on Explicit Block Diagonalization
The Third Immanant of q
Laplacian Matrices of Trees and Laplacians of Regular Graphs
Matrix Product of Graphs
Determinant of the Laplacian Matrix of Weighted Directed Graphs
From Multivariate Skewed Distributions to Copulas
Revisiting the BLUE in a Linear Model via Proper Eigenvectors
Inference in Error Orthogonal Models
On the Entries of Orthogonal Projection Matrices
Moore
Penrose Inverse of Perturbed Operators on Hilbert Spaces
The Rev
ISBN:9788132210535
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Matrix theory , Mathematical statistics
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-9783642333057:ONLINE Show nearby items on shelf
Title:Stochastic Geometry, Spatial Statistics and Random Fields [electronic resource] : Asymptotic Methods
Author(s): Evgeny Spodarev
Date:2013
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This volume provides a modern introduction to stochastic geometry, random fields and spatial statistics at a (post)graduate level. It is focused on asymptotic methods in geometric probability including weak and strong limittheorems for random spatial structures (point processes, sets, graphs, fields) with applications to statistics. Written as a contributed volume of lecture notes, it will be useful not only for students but also for lecturers andresearchers interested in geometric probability and re lated subjects
Note:Springer eBooks
Contents:1 Foundations of stochastic geometry and theory of random sets
2 Introduction into integral geometry and stereology
3 Spatial point patterns models and statistics
4 Asymptotic methods in statistics of random point processes
5 Random tessellations and Cox processes
6 Asymptotic methods for random tessellations
7 Random polytopes
8 Limit theorems in discrete stochastic geometry
9 Introduction to random fields
10 Central limit theorems for weakly dependent random fields
11 Strong limit theorems for increments of random fields
12 Geometry of large random trees:
ISBN:9783642333057
Series:e-books
Series:SpringerLink (Online service)
Series:Lecture Notes in Mathematics, 0075-8434 : v2068
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Discrete groups , Distribution (Probability theory) , Mathematical statistics
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-9783642322785:ONLINE Show nearby items on shelf
Title:Graphs, Networks and Algorithms [electronic resource]
Author(s): Dieter Jungnickel
Date:2013
Edition:4th ed. 2013
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:From the reviews of the previous editions .... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, andresearchers in this area. The aut hor finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does notremain helpless solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ... K.Engel, Mathematical Reviews 2002 The substantial developmenteffort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation,comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate orlow-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to ex ercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons,Zentralblatt fr Mathematik2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-comp leteness (especially on dominating sets), a section on the Gallai-Edmondsstructure theory for matchings, and about a dozen additional exercises as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the moregeneral Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added
Note:Springer eBooks
Contents:Prefaces
Basic Graph Theory
Algorithms and Complexity
Shortest Paths
Spanning Trees
The Greedy Algorithm
Flows
Combinatorial Applications
Connectivity and Depth First Search
Colorings
Circulations
The Network Simplex Algorithm
Synthesis of Networks
Matchings
Weighted Matchings
A Hard Problem: The TSP
Appendix A: Some NP
Complete Problems
Appendix B: Solutions
Appendix C: List of Symbols
References
Index
ISBN:9783642322785
Series:e-books
Series:SpringerLink (Online service)
Series:Algorithms and Computation in Mathematics, 1431-1550 : v5
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer science , 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-2013-9783642310461:ONLINE Show nearby items on shelf
Title:Space-Filling Curves [electronic resource] : An Introduction with Applications in Scientific Computing
Author(s): Michael Bader
Date:2013
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:The present book provides an introduction to using space-filling curves (SFC) as tools in scientific computing. Special focus is laid on the representation of SFC and on resulting algorithms. For example, grammar-basedtechniques are introduced for tr aversals of Cartesian and octree-type meshes, and arithmetisation of SFC is explained to compute SFC mappings and indexings. The locality properties of SFC are discussed in detail, together with theirimportance for algorithms. Templates for parallelisatio n and cache-efficient algorithms are presented to reflect the most important applications of SFC in scientific computing. Special attention is also given to the interplay ofadaptive mesh refinement and SFC, including the structured refinement of triangula r and tetrahedral grids. For each topic, a short overview is given on the most important publications and recent research activities
Note:Springer eBooks
Contents:Two Motivating Examples
How to Construct Space
Filling Curves
Grammar
Based Description of Space
Filling Curves
Arithmetic Representation of Space
Filling Curves
Approximating Polygons
Sierpinski Curves
Further Space
Filling Curves
Space
Filling Curves in 3D
Refinement Trees and Space
Filling Curves
Parallelisation with Space
Filling Curves
Locality Properties of Space
Filling Curves
Sierpinski Curves on Triangular and Tetrahedral Meshes
Case Study: Cache Efficient Algorithms for Matrix Operations
Case Study: Numerical Simulation on Spacetree Grids Using
ISBN:9783642310461
Series:e-books
Series:SpringerLink (Online service)
Series:Texts in Computational Science and Engineering, 1611-0994 : v9
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer science , 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-2013-9783319008882:ONLINE Show nearby items on shelf
Title:Markov's Theorem and 100 Years of the Uniqueness Conjecture [electronic resource] : A Mathematical Journey from Irrational Numbers to Perfect Matchings
Author(s): Martin Aigner
Date:2013
Publisher:Heidelberg : Springer International Publishing : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book takes the reader on a mathematical journey, from a number-theoretic point of view, to the realm of Markovs theorem and the uniqueness conjecture, gradually unfolding many beautiful connections until everything fallsinto place in the proof o f Markovs theorem.What makes the Markov theme so attractive is that it appears in an astounding variety of different fields, from number theory to combinatorics, from classical groups and geometry to theworld of graphs and words. On the way, there are als o introductory forays into some fascinating topics that do not belong to the standard curriculum, such as Farey fractions, modular and free groups, hyperbolic planes, and algebraicwords. The book closes with a discussion of the current state of knowledge about the uniqueness conjecture, which remains an open challenge to this day. All the material should be accessible to upper-level undergraduates with somebackground in number theory, and anything beyond this level is fully explained in the text. This is not a monograph in the usual sense concentrating on a specific topic. Instead, it narrates in five parts Numbers, Trees, Groups,Words, Finale the story of a discovery in one field and its many manifestations in others, as a tribute to a great mathematic al achievement and as an intellectual pleasure, contemplating the marvellous unity of all mathematics
Note:Springer eBooks
Contents:Approximation of IrrationalNumbers
Markov's Theorem and the Uniqueness Conjecture
The Markov Tree
The Cohn Tree
The Modular Group SL(2,Z)
The Free Group F2
Christoffel Words
Sturmian Words
Proof of Markov's Theorem
The Uniqueness Conjecture.
ISBN:9783319008882
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Group theory , Combinatorics , Number 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-2013-9783034806091:ONLINE Show nearby items on shelf
Title:Towards a General Theory of Classifications [electronic resource]
Author(s): Daniel Parrochia
Pierre Neuville
Date:2013
Publisher:Basel : Springer Basel : Imprint: Birkhuser
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book is an essay on the epistemology of classifications. Its main purpose is not to provide an exposition of an actual mathematical theory of classifications, that is, a general theory which would be available to any kind ofthem: hierarchical or non-hierarchical, ordinary or fuzzy, overlapping or non-overlapping, finite or infinite, and so on, establishing a basis for all possible divisions of the real world. For the moment, such a theory remains nothingbut a dream. Instead, the authors essentia lly put forward a number of key questions. Their aim is rather to reveal the state of art of this dynamic field and the philosophy one may eventually adopt to go further. To this end theypresent some advances made in the course of the last century, discus s a few tricky problems that remain to be solved, and show the avenues open to those who no longer wish to stay on the wrong track. Researchers and professionalsinterested in the epistemology and philosophy of science, library science, logic and set theor y, order theory or cluster analysis will find this book a comprehensive, original and progressive introduction to the main questions in thisfield
Note:Springer eBooks
Contents:Foreword
1 Philosophical problems
2 Information data structures
3 Empirical Clustering and classic hierarchies
4 Algebra of trees
5 Generalized Classifications
6 Topology of generalized classifications
7 Meta
classification
8 For an axiomatic theory of classifications
9 Alternative theories and higher infinite
10 Postscript
Bibliography.
ISBN:9783034806091
Series:e-books
Series:SpringerLink (Online service)
Series:Studies in Universal Logic
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Logic , Information storage and retrieval systems , Algebra , Logic, Symbolic and mathematical
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-9781461485292:ONLINE Show nearby items on shelf
Title:Mathematics in the Real World [electronic resource]
Author(s): W.D Wallis
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Birkhuser
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Mathematics in the Real World is a self-contained, accessible introduction to the world of mathematics for non-technical majors. With a focus on everyday applications and context, the topics in this textbook build in difficultyand are presented seque ntially, starting with a brief review of sets and numbers followed by an introduction to elementary statistics, models, and graph theory. Data and identification numbers are then covered, providing the pathwayto voting and finance. Each subject is covered in a concise and clear fashion through the use of real-world applications and the introduction of relevant terminology. Many sample problems both writing exercises and multiple-choicequestions are included to help develop students level of understandin g and to offer a variety of options to instructors. Covering six major units and outlining a one-semester course, Mathematics in the Real World is aimed atundergraduate liberal art students fulfilling the mathematics requirement in their degree program. T his introductory text will be an excellent resource for such courses, and will show students where mathematics arises in their everydaylives
Note:Springer eBooks
Contents:Preface
Part IIntroduction
Math is Everywhere
Numbers and Sets
Counting
Part IIStatistical Ideas
Collecting Data
Measuring Data
Normal
Sampling, Predicting
Multivariate Situations
Probability
Part IIIGraph Models
Euler
Hamilton
Trees
Scheduling, Critical Paths
Coloring, Handshakes
Part IVData
Identification Numbers
Data Transmission
Encryption The Hat Game
Part V Voting
Voting Systems
Messing with Systems
Electing a President
Part VI The Exponential World
Finance
Populations and Radioactivity.
ISBN:9781461485292
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: 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-2013-9781461469988:ONLINE Show nearby items on shelf
Title:Algebraic Combinatorics [electronic resource] : Walks, Trees, Tableaux, and More
Author(s): Richard P Stanley
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:Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians. The combination of the authors extensiveknowledge of combinatori cs and classical and practical tools from algebra will inspire motivated students to delve deeply into the fascinating interplay between algebra and combinatorics. Readers will be able to apply their newfoundknowledge to mathematical, engineering, and bus iness models. The text is primarily intended for use in a one-semester advanced undergraduate course in algebraic combinatorics, enumerative combinatorics, or graph theory.Prerequisites include a basic knowledge of linear algebra over a field, existence of finite fields, and rudiments of group theory. The topics in each chapter build on one another and include extensive problem sets as well as hints toselected exercises. Key topics include walks on graphs, cubes and the Radon transform, the MatrixTree Th eorem, de Bruijn sequences, the Erds-Moser conjecture, electrical networks, and the Sperner property. There are also threeappendices on purely enumerative aspects of combinatorics related to the chapter material: the RSK algorithm, plane partitions, and t he enumeration of labeled trees. Richard Stanley is currently professor of Applied Mathematics atthe Massachusetts Institute of Technology. Stanley has received several awards including the George Plya Prize in applied combinatorics, the Guggenheim Fello wship, and the Leroy P. Steele Prize for mathematical exposition. Also bythe author: Combinatorics and Commutative Algebra, Second Edition, Birkhuser
Note:Springer eBooks
Contents:Preface
Notation
1. Walks in graphs
2. Cubes and the Radon transform
3. Random walks
4. The Sperner property
5. Group actions on boolean algebras
6. Young diagrams and q
binomial coefficients
7. Enumeration under group action
8. A glimpse of Young tableaux
Appendix. The RSK algorithm
Appendix. Plane partitions
9. The MatrixTree Theorem
Appendix. Three elegant combinatorial proofs
10. Eulerian diagraphs and oriented trees
11. Cycles, bonds, and electrical networks
12. Miscellaneous gems of algebraic combinatorics
Hints
References
ISBN:9781461469988
Series:e-books
Series:SpringerLink (Online service)
Series:Undergraduate Texts in Mathematics, 0172-6056
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , 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-2013-9781461465256:ONLINE Show nearby items on shelf
Title:Total Domination in Graphs [electronic resource]
Author(s): Michael A Henning
Anders Yeo
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:Total Domination in Graphs gives a clear understanding of this topic to any interested reader who has a modest background in graph theory. This book provides and explores the fundamentals of total domination in graphs. Some ofthe topics featured incl ude the interplay between total domination in graphs and transversals in hypergraphs, and the association with total domination in graphs and diameter-2-critical graphs. Several proofs are included in this textwhich enables readers to acquaint themselves with a toolbox of proof techniques and ideas with which to attack open problems in the field. This work is an excellent resource for students interested in beginning their research in thisfield. Additionally, established researchers will find the book val uable to have as it contains the latest developments and open problems
Note:Springer eBooks
Contents:1. Introduction
2. Properties of Total Dominating Sets and General Bounds
3. Complexity and Algorithmic Results
4.Total Domination in Trees
5.Total Domination and Minimum Degree
6. Total Domination in Planar Graphs
7. Total Domination and Forbidden Cycles
8. Relating the Size and Total Domination Number
9. Total Domination in Claw
Free Graphs
10. Total Domination Number versus Matching Number
11. Total Domination Critical Graphs
12. Total Domination and Graph Products
13. Graphs with Disjoint Total Dominating Sets
14. Total Domination in Graphs with Diame
ISBN:9781461465256
Series:e-books
Series:SpringerLink (Online service)
Series:Springer Monographs in Mathematics, 1439-7382
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Global analysis (Mathematics) , Number 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-2013-9781461449096:ONLINE Show nearby items on shelf
Title:Matrix-Analytic Methods in Stochastic Models [electronic resource]
Author(s): Guy Latouche
Vaidyanathan Ramaswami
Jay Sethuraman
Karl Sigman
Mark S Squillante
David Yao
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:Matrix-analytic and related methods have become recognized as an important and fundamental approach for the mathematical analysis of general classes of complex stochastic models. Research in the area of matrix-analytic andrelated methods seeks to dis cover underlying probabilistic structures intrinsic in such stochastic models, develop numerical algorithms for computing functionals (e.g., performance measures) of the underlying stochastic processes, andapply these probabilistic structures and/or compu tational algorithms within a wide variety of fields. This volume presents recent research results on: the theory, algorithms and methodologies concerning matrix-analytic and relatedmethods in stochastic models and the application of matrix-analytic and re lated methods in various fields, which includes but is not limited to computer science and engineering, communication networks and telephony, electrical andindustrial engineering, operations research, management science, financial and risk analysis, and b io-statistics. These research studies provide deep insights and understanding of the stochastic models of interest from amathematicsandapplications perspective, as well as identify directions for future research
Note:Springer eBooks
Contents:Factorization properties for a MAP
modulated fluid flow model under server vacation policies
A compressed cyclic reduction for QBDs with low rank upper and lower transitions
Bilateral matrix
exponential distribution
AutoCAT: Automated Product
Form Solution of Stochastic Models
Markovian trees subject to catastrophes: Would they survive forever?
Majorization and Extremal PH
Distributions
Acceptance
rejection methods for generating random variates from matrix exponential distributions and rational arrival processes
Revisit to the tail asymptotics of the double QBD process: R
ISBN:9781461449096
Series:e-books
Series:SpringerLink (Online service)
Series:Springer Proceedings in Mathematics & Statistics, 2194-1009 : v27
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Numerical analysis , Distribution (Probability 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-2013-9780817683917:ONLINE Show nearby items on shelf
Title:Magic Graphs [electronic resource]
Author(s): Alison M Marr
W.D Wallis
Date:2013
Edition:2nd ed. 2013
Publisher:New York, NY : Springer New York : Imprint: Birkhuser
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Magic squares are among the more popular mathematical recreations. Over the last 50 years, many generalizations of magic ideas have been applied to graphs. Recently there has been a resurgence of interest in magiclabelings due to a number of results that have applications to the problem of decomposing graphs into trees. Key features of this second edition include: a new chapter on magic labeling of directed graphs applications of theorems from graph theory and interesting counting arguments new res earch problems and exercises covering a range of difficulties a fully updated bibliographyand index This concise, self-contained exposition is unique in its focus on the theory of magic graphs/labelings. It may serve as a graduate or advanced undergradua te text for courses in mathematics or computer science, and asreference for the researcher
Note:Springer eBooks
Contents:Preface
List of Figures
Preliminaries
Edge
Magic Total Labelings
Vertex
Magic Total Labelings
Totally Magic Labelings
Magic Type Labeling of Digraphs
Notes on the Research Problems
References
Bibliography
Answers to Selected Exercises
Index
ISBN:9780817683917
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computational 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-2012-9783642303623:ONLINE Show nearby items on shelf
Title:Algebraic Operads [electronic resource]
Author(s): Jean-Louis Loday
Bruno Vallette
Date:2012
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:In many areas of mathematics some higher operations are arising. These have become so important that several research projects refer to such expressions. Higher operations form new types of algebras. The key tounderstanding and comparing them, to cre ating invariants of their action is operad theory. This is a point of view that is 40 years old in algebraic topology, but the new trend is its appearance in several other areas, such asalgebraic geometry, mathematical physics, differential geometry, and combinatorics. The present volume is the first comprehensive and systematic approach to algebraic operads. An operad is an algebraic device that serves to study allkinds of algebras (associative, commutative, Lie, Poisson, A-infinity, etc.) from a concept ual point of view. The book presents this topic with an emphasis on Koszul duality theory. After a modern treatment of Koszul duality forassociative algebras, the theory is extended to operads. Applications to homotopy algebra are given, for instance the HomotopyTransfer Theorem. Although the necessary notions of algebra are recalled, readers areexpected to be familiarwith elementary homological algebra. Each chapter ends with a helpful summary and exercises. A full chapter is devoted to examples, and num erous figures are included. After an elementary chapter on classical algebra, accessible toundergraduate students,the level increases gradually through the book. However, the authors have done their best to make it suitable for graduate students: three ap pendices review the basic results needed in order to understand thevarious chapters. Since higher algebra is becoming essential in several research areas like deformation theory, algebraic geometry, representation theory, differential geometry, algebraic combinatorics, and mathematical physics, thebook can also be used as a reference work by researchers.
Note:Springer eBooks
Contents:Preface
1.Algebras, coalgebras, homology
2.Twisting morphisms
3.Koszul duality for associative algebras
4.Methods to prove Koszulity of an algebra
5.Algebraic operad
6 Operadic homological algebra
7.Koszul duality of operads
8.Methods to prove Koszulity of an operad
9.The operads As and A\infty
10.Homotopy operadic algebras
11.Bar and cobar construction of an algebra over an operad
12.(Co)homology of algebras over an operad
13.Examples of algebraic operads
Apendices: A.The symmetric group
B.Categories
C.Trees
References
Index
List of Not
ISBN:9783642303623
Series:e-books
Series:SpringerLink (Online service)
Series:Grundlehren der mathematischen Wissenschaften, A Series of Comprehensive Studies in Mathematics, 0072-7830 : v346
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Algebra , Algebraic topology , Cell aggregation 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-2012-9783642278754:ONLINE Show nearby items on shelf
Title:Sparsity [electronic resource] : Graphs, Structures, and Algorithms
Author(s): Jaroslav Neetil
Patrice Ossona de Mendez
Date:2012
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This is the first book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authorsdevised an unifying clas sification of general classes of structures. This approach is very robust and it has many remarkable properties. For example the classification is expressible in many different ways involving most extremalcombinatorial invariants. This study of sparse str uctures found applications in such diverse areas as algorithmic graph theory, complexity of algorithms, property testing, descriptive complexity and mathematical logic (homomorphismpreservation,fixed parameter tractability and constraint satisfaction prob lems). It should be stressed that despite of its generality this approach leads to linear (and nearly linear) algorithms. Jaroslav Neetil is a professor atCharles University, Prague Patrice Ossona de Mendez is a CNRS researcher et EHESS, Paris. This book is related to the material presented by the first author at ICM 2010
Note:Springer eBooks
Contents:Part I Presentation: 1. Introduction
2. A Few Problems
3. Commented Contents
Part II. The Theory: 4. Prolegomena
5. Measuring Sparsity
6. Classes and their Classification
7. Bounded Height Trees and Tree
Depth
8. Decomposition
9. Independence
10. First
Order Constraint Satisfaction Problems and Homomorphism Dualities
11. Restricted Homomorphism Dualities
12. Counting
13. Back to Classes
Part III Applications: 14. Classes with Bounded Expansion Examples
15. Property Testing, Hyperfiniteness and Separators
16. Algorithmic Applications
17. Other
ISBN:9783642278754
Series:e-books
Series:SpringerLink (Online service)
Series:Algorithms and Combinatorics, 0937-5511 : v28
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer software , Computational complexity , Combinatorics , Discrete groups , Logic, Symbolic and mathematical
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-2012-9783642274619:ONLINE Show nearby items on shelf
Title:Sminaire de Probabilits XLIV [electronic resource]
Author(s): Catherine Donati-Martin
Antoine Lejay
Alain Rouault
Date:2012
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:As usual, some of the contributions to this 44th Sminaire de Probabilits were presented during the Journes de Probabilits held in Dijon in June 2010. The remainder were spontaneous submissions or were solicited by theeditors. The traditional and hist orical themes of the Sminaire are covered, such as stochastic calculus, local times and excursions, and martingales. Some subjects already touched on in the previous volumes are still here: freeprobability, rough paths, limit theorems for general processe s (here fractional Brownian motion and polymers), and large deviations. Lastly, this volume explores new topics, including variable length Markov chains and peacocks. We hopethat the whole volume is a good sample of the main streams of current research on probability and stochastic processes, in particular those active in France
Note:Springer eBooks
Contents:Context trees, variable length Markov chains and dynamical sources
Martingale property of generalized stochastic exponentials
Some classes of proper integrals and generalized Ornstein
Uhlenbeck processes
Martingale representations for diffusion processes and backward stochastic differential equations
Quadratic Semimartingale BSDEs Under an Exponential Moments Condition
The derivative of the intersection local time of Brownian motion through Wiener chaos
On the occupation times of Brownian excursions and Brownian loops
Discrete approximation to solution flows of Tanakas
ISBN:9783642274619
Series:e-books
Series:SpringerLink (Online service)
Series:Lecture Notes in Mathematics, 0075-8434 : v2046
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Distribution (Probability 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-2012-9783642244889:ONLINE Show nearby items on shelf
Title:Combinatorial Optimization [electronic resource] : Theory and Algorithms
Author(s): Bernhard Korte
Jens Vygen
Date:2012
Edition:5th ed. 2012
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorialoptimization and speciali zed topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds toadvanced and recent topics, some of which have no t appeared in a textbook before. Throughout,it contains complete but concise proofs, and also provides numerousexercises and references. This fifth edition has again been updated,revised, and significantlyextended, with more than 60 new exercises and new material on varioustopics, including Cayley's formula, blocking flows, fasterb-matching separation, multidimensional knapsack, multicommoditymax-flowmin-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimiza tion. From the reviews of the previous editions: This book on combinatorial optimization is a beautiful example of the idealtextbook. Operations Research Letters 33 (2005) ..... this very recommendable book documents the relevant knowledge on combinatoria l optimization and records those problems and algorithms that define this discipline today. To readthis is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization. OR News 19 (2003) ... has become a s tandard textbook in the field. Zentralblatt MATH 1099.90054 ...givesan excellent comprehensive view of the exciting field of combinatorial optimization. Zentralblatt MATH 1149.90126
Note:Springer eBooks
Contents:1 Introduction
2 Graphs
3 Linear Programming
4 Linear Programming Algorithms
5 Integer Programming
6 Spanning Trees and Arborescences
7 Shortest Paths
8 Network Flows
9 Minimum Cost Flows
10 Maximum Matchings
11 Weighted Matching
12 b
Matchings and T
Joins
13 Matroids
14 Generalizations of Matroids
15 NP
Completeness
16 Approximation Algorithms
17 The Knapsack Problem
18 Bin
Packing
19 Multicommodity Flows and Edge
Disjoint Paths
20 Network Design Problems
21 The Traveling Salesman Problem
22 Facility Location
Indices
ISBN:9783642244889
Series:e-books
Series:SpringerLink (Online service)
Series:Algorithms and Combinatorics, 0937-5511 : v21
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer science , 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-2012-9783034802635:ONLINE Show nearby items on shelf
Title:Spectral Theory, Function Spaces and Inequalities [electronic resource] : New Techniques and Recent Trends
Author(s): B. Malcolm Brown
Jan Lang
Ian G Wood
Date:2012
Publisher:Basel : Springer Basel
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This is a collection of contributed papers which focus on recent results in areas of differential equations, function spaces, operator theoryand interpolation theory.In particular, itcovers current work on measures ofnon-compactness and real interpol ation, sharp Hardy-Littlewood-Sobolev inequalites,the HELP inequality, error estimates and spectral theory of elliptic operators, pseudo differential operators with discontinuous symbols, variableexponent spaces andentropy numbers. These paperscontribute toareas of analysis which have been and continue to be heavily influenced by the leading British analysts David Edmunds and Des Evans. This book marks their respective80th and 70th birthdays
Note:Springer eBooks
Contents:Preface
David Edmunds' Mathematical Work
Desmond Evans' mathematical work
Generalised Meissner Equations with an Eigenvalue
inducing Interface
On the HELP Inequality for Hill Operators on Trees
Measure of Non
compactness of Operators Interpolated by Limiting Real Methods
A New, Rearrangement
free Proof of the Sharp HardyLittlewoodSobolev Inequality
Dichotomy in Muckenhoupt Weighted Function Space: A Fractal Example
Lavrentiev's Theorem and Error Estimation in Elliptic Inverse Problems
Two
weighted Norm Inequalities for the Double Hardy Transforms and Strong Fra
ISBN:9783034802635
Series:e-books
Series:SpringerLink (Online service)
Series:Operator Theory: Advances and Applications : v219
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Operator 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-2012-9781461445296:ONLINE Show nearby items on shelf
Title:A Textbook of Graph Theory [electronic resource]
Author(s): R Balakrishnan
K Ranganathan
Date:2012
Edition:2nd ed. 2012
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:Graph theory experienced a tremendous growth in the 20th century. One of the main reasons for this phenomenon is the applicability of graph theory in other disciplines such as physics, chemistry, psychology, sociology, andtheoretical computer science . This textbook provides a solid background in the basic topics of graph theory, and is intended for an advanced undergraduate or beginning graduate course in graph theory. This second edition includestwo new chapters: one on domination in graphs and the other on the spectral properties of graphs, the latterincluding a discussion on graph energy. The chapter on graph colorings has been enlarged, covering additional topics suchas homomorphisms and colorings and the uniqueness of the Mycielskian up to isom orphism. This book also introduces several interesting topics such as Dirac's theorem on k-connected graphs, Harary-Nashwilliam's theorem on thehamiltonicity of line graphs, Toida-McKee's characterization of Eulerian graphs, the Tutte matrix of a graph, F ournier's proof of Kuratowski's theorem on planar graphs, the proof of the nonhamiltonicity of the Tutte graph on 46vertices, and a concrete application of triangulated graphs
Note:Springer eBooks
Contents:Preface to the Second Edition
Preface to the First Edition
1 Basic Results
2 Directed Graphs
3 Connectivity
4 Trees
5 Independent Sets and Matchings
6 Eulerian and Hamiltonian Graphs
7 Graph Colorings
8 Planarity
9 Triangulated Graphs
10 Domination in Graphs
11 Spectral Properties of Graphs
Bibliography
Index
ISBN:9781461445296
Series:e-books
Series:SpringerLink (Online service)
Series:Universitext, 0172-5939
Series:Mathematics and Statistics (Springer-11649)
Keywords: 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-2012-9781461442202:ONLINE Show nearby items on shelf
Title:Graph Energy [electronic resource]
Author(s): Xueliang Li
Yongtang Shi
Ivan Gutman
Date:2012
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:This book is about graph energy. The authors have included many of the important results on graph energy, such as the complete solution to the conjecture on maximal energy of unicyclic graphs, the Wagner-Heubergers result onthe energy of trees, the e nergy of random graphsor the approach to energy using singular values. It contains an extensive coverage of recent results and a gradual development of topics and the inclusion of complete proofs from mostof the important recent results in the area. The l atter fact makes it a valuable reference for researchers looking to get into the field of graph energy, further stimulating it with occasional inclusion of open problems. The bookprovides a comprehensive survey of all results and common proof methods obta ined in this field with an extensive reference section. The book is aimed mainly towards mathematicians, both researchers and doctoral students, with interestin the field of mathematical chemistry
Note:Springer eBooks
Contents:Preface
Introduction
The Chemical Connection
The Coulson Integral Formula
Common Proof Methods
Bounds for the Energy of Graphs
The Energy of Random Graphs
Graphs Extremal with with Regard to Energy
Hypernergetic and Equienergetic Graphs
Miscellaneous
Other Graph Energies
Bibliography
Index
ISBN:9781461442202
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Chemistry Mathematics , Algebra
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-2012-9781461419396:ONLINE Show nearby items on shelf
Title:Spectra of Graphs [electronic resource]
Author(s): Andries E Brouwer
Willem H Haemers
Date:2012
Publisher:New York, NY : Springer New York
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book provides an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. It covers standard topics such as bounds on the sizes of cliques and cocliques, chromaticnumber and Shannon capac ity, the connection between randomness and the 'eigenvalue gap', and applications. It continues with a presentation of some new material on trees, strongly regular graphs, two-graphs, association schemes,p-ranks of configurations and similar topics. Exerc ises at the end of each chapter provide practice and vary from easy yet interesting applications of the treated theory, to little excursions into related topics. Tables, referencesat the end of the book, an author and subject index enrich the text. Spect ra of Graphs is written for researchers, teachers and students interested in graph spectra. The reader is assumed to be familiar with basic linear algebra andeigenvalues, although some more advanced topics in linear algebra, like the Perron-Frobenius theo rem and eigenvalue interlacing are included
Note:Springer eBooks
Contents:Graph spectrum
Linear algebra
Eigenvalues and eigenvectors of graphs
The second largest eigenvalue
Trees
Groups and graphs
Topology
Euclidean representations
Strongly regular graphs
Regular two
graphs
Association schemes
Distance regular graphs
p
ranks
Spectral characterizations
Graphs with few eigenvalues
References
Author Index
Subject Index
ISBN:9781461419396
Series:e-books
Series:SpringerLink (Online service)
Series:Universitext, 0172-5939
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Geometry, algebraic , Group 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-2011-9788847017818:ONLINE Show nearby items on shelf
Title:PDE and Martingale Methods in Option Pricing [electronic resource]
Author(s): Andrea Pascucci
Date:2011
Publisher:Milano : Springer Milan
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book offers an introduction to the mathematical, probabilistic and numerical methods used in the modern theory of option pricing. The text is designed for readers with a basic mathematical background. The first part containsa presentation of the arbitrage theory in discrete time. In the second part, the theories of stochastic calculus and parabolic PDEs are developed in detail and the classical arbitrage theory is analyzed in a Markovian setting by meansof of PDEs techniques. After the martingal e representation theorems and the Girsanov theory have been presented, arbitrage pricing is revisited in the martingale theory optics. General tools from PDE and martingale theories are alsoused in the analysis of volatility modeling. The book also contai ns an Introduction to Lvy processes and Malliavin calculus. The last part is devoted to the description of the numerical methods used in option pricing: Monte Carlo,binomial trees, finite differences and Fourier transform
Note:Springer eBooks
ISBN:9788847017818
Series:e-books
Series:SpringerLink (Online service)
Series:Bocconi & Springer Series, 2039-1471
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Finance , Distribution (Probability 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-2011-9783642219191:ONLINE Show nearby items on shelf
Title:Factors and Factorizations of Graphs [electronic resource] : Proof Techniques in Factor Theory
Author(s): Jin Akiyama
Mikio Kano
Date:2011
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book chronicles the development of graph factors and factorizations. It pursues a comprehensive approach, addressing most of the important results from hundreds of findings over the last century. One of the main themes is theobservation that man y theorems can be proved using only a few standard proof techniques. This stands in marked contrast to the seemingly countless, complex proof techniques offered by the extant body of papers and books. In addition tocovering the history and development of this area, the book offers conjectures and discusses open problems. It also includes numerous explanatory figures that enable readers to progressively and intuitively understand the mostimportant notions and proofs in the area of factors and factorization
Note:Springer eBooks
Contents:1 Basic Terminology
2 Matchings and 1
Factors
3 Regular Factors and f
Factors
4 (g, f)
Factors and [a, b]
Factors
5 [a, b]
Factorizations
6 Parity Factors
7 Component Factors
8 Spanning Trees
ISBN:9783642219191
Series:e-books
Series:SpringerLink (Online service)
Series:Lecture Notes in Mathematics, 0075-8434 : v2031
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer 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-2011-9783642213991:ONLINE Show nearby items on shelf
Title:Harmonic Functions and Potentials on Finite or Infinite Networks [electronic resource]
Author(s): Victor Anandam
Date:2011
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Random walks, Markov chains and electrical networks serve as an introduction to the study of real-valued functions on finite or infinite graphs, with appropriate interpretations using probability theory and current-voltage laws.The relation between t his type of function theory and the (Newton) potential theory on the Euclidean spaces is well-established. The latter theory has been variously generalized, one example being the axiomatic potential theory onlocally compact spaces developed by Brelot, wit h later ramifications from Bauer, Constantinescu and Cornea. A network is a graph with edge-weights that need not be symmetric. This book presents an autonomous theory of harmonicfunctions and potentials defined on a finite or infinite network, on the lin es of axiomatic potential theory. Random walks and electrical networks are important sources for the advancement of the theory
Note:Springer eBooks
Contents:1 Laplace Operators on Networks and Trees
2 Potential Theory on Finite Networks
3 Harmonic Function Theory on Infinite Networks
4 Schrdinger Operators and Subordinate Structures on Infinite Networks
5 Polyharmonic Functions on Trees
ISBN:9783642213991
Series:e-books
Series:SpringerLink (Online service)
Series:Lecture Notes of the Unione Matematica Italiana, 1862-9113 : v12
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Functions of complex variables , Differential equations, partial , Potential theory (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-2011-9783642212161:ONLINE Show nearby items on shelf
Title:Markov Paths, Loops and Fields [electronic resource] : cole d't de Probabilits de Saint-Flour XXXVIII 2008
Author(s): Yves Le Jan
Date:2011
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:The purpose of these notes is to explore some simple relations between Markovian path and loop measures, the Poissonian ensembles of loops they determine, their occupation fields, uniform spanning trees, determinants, and GaussianMarkov fields such a s the free field. These relations are first studied in complete generality for the finite discrete setting, then partly generalized to specific examples in infinite and continuous spaces
Note:Springer eBooks
Contents:1 Symmetric Markov processes on finite spaces
2 Loop measures
3 Geodesic loops
4 Poisson process of loops
5 The Gaussian free field
6 Energy variation and representations
7 Decompositions
8 Loop erasure and spanning trees
9 Reflection positivity
10 The case of general symmetric Markov processes
ISBN:9783642212161
Series:e-books
Series:SpringerLink (Online service)
Series:Lecture Notes in Mathematics, 0075-8434 : v2026
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Potential theory (Mathematics) , Distribution (Probability 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-2011-9781461403111:ONLINE Show nearby items on shelf
Title:Mathematical Aspects of Network Routing Optimization [electronic resource]
Author(s): Carlos A.S Oliveira
Panos M Pardalos
Date:2011
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:Mathematical Aspects of Network Routing Optimization provides a thorough introduction to the subject of algorithms for network routing and focuses on multicast and wireless ad hoc systems. The modern world is connected throughlarge-scale, computation al networked systems such as the Internet and because of the ever-advancing technology of networking, efficient algorithms have become increasingly necessary to solve some of the problems developing in thisarea. This work focuses on computational issues arising from the process of optimizing network routes, such as the quality of resulting links and their reliability. Algorithms are key to understanding the protocols underlyingmulticast routing. The main objective in the text is to derive efficient algor ithms, with or without the guarantee of approximation, that can be applied to address these problems. Notes have been provided for basic topics such as graphtheory and linear programming to assist those who are not fully acquainted with the mathematical t opics presented throughout the book. This book is designed for graduate students, researchers, and professionals interested inunderstanding the algorithmic and mathematical ideas behind routing in computer networks and network algorithms
Note:Springer eBooks
Contents:Preface
1. Unicast Routing Algorithms
2. Multicast Routing
3. Steiner Trees and Multicast
4. Online Multicast Routing
5. Distributed Algorithms for Multicast Routing
6. Center
Based Trees and Multicast Packing
7. Metaheuristics for Multicast Routing
8. The Point
to
Point Connection Problem
9. Streaming Cache Placement
10. Algorithms for Cache Placement
11. Distributed Routing on Ad Hoc Networks
12. Power
Aware Routing in MANETs
Appendix
References
Index
ISBN:9781461403111
Series:e-books
Series:SpringerLink (Online service)
Series:Springer Optimization and Its Applications, 1931-6828 : v53
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer Communication Networks , Computer software , Algorithms , 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-2011-9781441998903:ONLINE Show nearby items on shelf
Title:Data Mining with Rattle and R [electronic resource] : The Art of Excavating Data for Knowledge Discovery
Author(s): Graham Williams
Date:2011
Publisher:New York, NY : Springer New York
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Data mining is the art and science of intelligent data analysis. By building knowledge from information, data mining adds considerable value to the ever increasing stores of electronic data that abound today. In performing datamining many decisions n eed to be made regarding the choice of methodology, the choice of data, the choice of tools, and the choice of algorithms. Throughout this book the reader is introduced to the basic concepts and some of the morepopular algorithms of data mining. With a fo cus on the hands-on end-to-end process for data mining, Williams guides the reader through various capabilities of the easy to use, free, and open source Rattle Data Mining Software built onthe sophisticated R Statistical Software. The focus on doing data mining rather than just reading about data mining is refreshing. The book covers data understanding, data preparation, data refinement, model building, modelevaluation, and practical deployment. The reader will learn to rapidly deliver a data mining proj ect using software easily installed for free from the Internet. Coupling Rattle with R delivers a very sophisticated data miningenvironment with all the power, and more, of the many commercial offerings
Note:Springer eBooks
Contents:Introduction
Getting Started
Working with Data
Loading Data
Exploring Data
Interactive Graphics
Transforming Data
Descriptive and Predictive Analytics
Cluster Analysis
Association Analysis
Decision Trees
Random Forests
Boosting
Support Vector Machines
Model Performance Evaluation
Deployment
ISBN:9781441998903
Series:e-books
Series:SpringerLink (Online service)
Series:Use R
Series:Mathematics and Statistics (Springer-11649)
Keywords: Statistics
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-2011-9781441977991:ONLINE Show nearby items on shelf
Title:Discovery of Single Top Quark Production [electronic resource]
Author(s): Dag Gillberg
Date:2011
Publisher:New York, NY : Springer New York
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This original, outstanding thesis presents the first discovery of single top quark production and documents one of the flagship measurements of the D0 experiment, a collaboration of more than 600 particle physicists from aroundthe world. It describes the first observation of a physical process known as single top quark production, which had been sought for more than 10 years before its eventual discovery in 2009. This thesis describes, in detail, aninnovative approach of using Boosted Decision Trees, a machine-learning technique, to observe the tiny single top signal within an otherwise overwhelming background. The final result was published in August 2009 in Physical ReviewLetters, the most prestigious journal in the field of experimental particle p hysics. It was further made an editors choice in that publication and was highlighted in the journal Physics as one of the most interesting andsignificant results published in all of physics at that time
Note:Springer eBooks
Contents:Introduction
Theoretical Background
Experimental Setup
Event Reconstruction
Analysis: Event Selection
Analysis: Decision Trees
Analysis: Measurements
Summary
ISBN:9781441977991
Series:e-books
Series:SpringerLink (Online service)
Series:Springer Theses
Series:Physics and Astronomy (Springer-11651)
Keywords: Nuclear physics , Quantum 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-2010-9783834893291:ONLINE Show nearby items on shelf
Title:Discrete Mathematics in Statistical Physics [electronic resource] : Introductory Lectures
Author(s): Martin Loebl
Date:2010
Publisher:Wiesbaden : Vieweg+Teubner
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:The book first describes connections between some basic problems and technics of combinatorics and statistical physics. The discrete mathematics and physics terminology are related to each other. Using the establishedconnections, some exciting activi ties in one field are shown from a perspective of the other field. The purpose of the book is to emphasize these interactions as a strong and successful tool. In fact, this attitude has been a strongtrend in both research communities recently. It also nat urally leads to many open problems, some of which seem to be basic. Hopefully, this book will help making these exciting problems attractive to advanced students and researchers.Basic concepts - Introduction to Graph Theory - Trees and electrical networks Matroids - Geometric representations of graphs - Game of dualities - The zeta function and graph polynomials Knots - 2D Ising and dimer models -Advanced Graduate Students in Mathematics, Physics and Computer Sciences - Researchers Prof. Dr. Martin Loeb l, Dept. of Mathematics, Charles University, Prague
Note:Springer eBooks
ISBN:9783834893291
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Algebra
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-2010-9783790825985:ONLINE Show nearby items on shelf
Title:Recent Developments in Applied Probability and Statistics [electronic resource] : Dedicated to the Memory of Jrgen Lehn
Author(s): Luc Devroye
Blent Karaszen
Michael Kohler
Ralf Korn
Date:2010
Publisher:Heidelberg : Physica-Verlag HD
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book presents surveys on recent developments in applied probability and statistics. The contributions include topics such as nonparametric regression and density estimation, option pricing, probabilistic methods formultivariate interpolation, ro bust graphical modelling and stochastic differential equations. Due to its broad coverage of different topics the book offers an excellent overview of recent developments in applied probability andstatistics
Note:Springer eBooks
Contents:On Exact Simulation Algorithms for Some Distributions Related to Brownian Motion and Brownian Meanders
A Review on Regression
based Monte Carlo Methods for Pricing American Options
Binomial Trees in Option Pricing
History, Practical Applications and Recent Developments
Uncertainty in Gaussian Process Interpolation
On the Inversive Pseudorandom Number Generator
Strong and Weak Approximation Methods for Stochastic Differential Equations Some Recent Developments
On Robust Gaussian Graphical Modelling
Strong Laws of Large Numbers and Nonparametric Estimation
Institute
ISBN:9783790825985
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer science , Distribution (Probability theory) , Mathematical statistics
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-2010-9783642140075:ONLINE Show nearby items on shelf
Title:Lvy Matters I [electronic resource] : Recent Progress in Theory and Applications: Foundations, Trees and Numerical Issues in Finance
Author(s): Thomas Duquesne
Oleg Reichmann
Ken-iti Sato
Christoph Schwab
Ole E Barndorff-Nielsen
Jean Bertoin
Jean Jacod
Claudia Klppelberg
Date:2010
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Springer eBooks
ISBN:9783642140075
Series:e-books
Series:SpringerLink (Online service)
Series:Lecture Notes in Mathematics, 0075-8434 : v2001
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Distribution (Probability 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-2010-9783642136948:ONLINE Show nearby items on shelf
Title:Numerical Solution of Stochastic Differential Equations with Jumps in Finance [electronic resource]
Author(s): Eckhard Platen
Nicola Bruti-Liberati
Date:2010
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:In financial and actuarial modeling and other areas of application, stochastic differential equations with jumps have been employed to describe the dynamics of various state variables. The numerical solution of such equations ismore complex than that of those only driven by Wiener processes, described in Kloeden & Platen: Numerical Solution of Stochastic Differential Equations (1992). The present monograph builds on the above-mentioned work and provides anintroduction to stochastic differential equat ions with jumps, in both theory and application, emphasizing the numerical methods needed to solve such equations. It presents many new results on higher-order methods for scenario and MonteCarlo simulation, including implicit, predictor corrector, extrap olation, Markov chain and variance reduction methods, stressing the importance of their numerical stability. Furthermore, it includes chapters on exact simulation,estimation and filtering. Besides serving as a basic text on quantitative methods, it offers ready access to a large number of potential research problems in an area that is widely applicable and rapidly expanding. Finance is chosen asthe area of application because much of the recent research on stochastic numerical methods has been driven by c hallenges in quantitative finance. Moreover, the volume introduces readers to the modern benchmark approach that provides ageneral framework for modeling in finance and insurance beyond the standard risk-neutral approach. It requires undergraduate backgro und in mathematical or quantitative methods, is accessible to a broad readership, including those whoare only seeking numerical recipes, and includes exercises that help the reader develop a deeper understanding of the underlying mathematics
Note:Springer eBooks
Contents:Stochastic Differential Equations with Jumps
Exact Simulation of Solutions of SDEs
Benchmark Approach to Finance and Insurance
Stochastic Expansions
to Scenario Simulation
Regular Strong Taylor Approximations with Jumps
Regular Strong It Approximations
Jump
Adapted Strong Approximations
Estimating Discretely Observed Diffusions
Filtering
Monte Carlo Simulation of SDEs
Regular Weak Taylor Approximations
Jump
Adapted Weak Approximations
Numerical Stability
Martingale Representations and Hedge Ratios
Variance Reduction Techniques
Trees and Markov
ISBN:9783642136948
Series:e-books
Series:SpringerLink (Online service)
Series:Stochastic Modelling and Applied Probability, 0172-4568 : v64
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Finance , Distribution (Probability theory) , Economics Statistics
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-2010-9783642135804:ONLINE Show nearby items on shelf
Title:Fete of Combinatorics and Computer Science [electronic resource]
Author(s): Gyula O. H Katona
Alexander Schrijver
Tams Sznyi
Gbor Sgi
Date:2010
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of thepersons who particularly co ntributed to building bridges between these and many other areas is Lszl Lovsz, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number offriends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating Lovsz' 60th birthday. It was a real fete of combinatorics and computer science. Some ofthese plenary speakers submitted their research or survey papers prior to the confer ences. These are included in the volume Building Bridges. The other speakers were able to finish their contribution only later, these are collectedin the present volume
Note:Springer eBooks
Contents:High Degree Graphs Contain Large
Star Factors
Iterated Triangle Partitions
PageRank and Random Walks on Graphs
Solution of Peter Winklers Pizza Problem*
Tight Bounds for Embedding Bounded Degree Trees
Betti Numbers are Testable*
Rigid and Globally Rigid Graphs with Pinned Vertices
Noise Sensitivity and Chaos in Social Choice Theory
Coloring Uniform Hypergraphs with Small Edge Degrees
Extremal Graphs and Multigraphs with Two Weighted Colours
Regularity Lemmas for Graphs
Edge Coloring Models as Singular Vertex Coloring Models
List Total Weighting of Grap
ISBN:9783642135804
Series:e-books
Series:SpringerLink (Online service)
Series:Bolyai Society Mathematical Studies, 1217-4696 : v20
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer science , Computational complexity , Combinatorics , Number 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-2010-9783642046117:ONLINE Show nearby items on shelf
Title:Geometric Description of Images as Topographic Maps [electronic resource]
Author(s): Vicent Caselles
Pascal Monasse
Date:2010
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This volume discusses the basic geometric contents of an image and presents a tree data structure to handle those contents efficiently. The nodes of the tree are derived from connected components of level sets of the intensity,while the edges represe nt inclusion information. Grain filters, morphological operators simplifying these geometric contents, are analyzed and several applications to image comparison and registration, and to edge and corner detection,are presented. The mathematically inclined reader may be most interested in Chapters 2 to 6, which generalize the topological Morse description to continuous or semicontinuous functions, while mathematical morphologists may moreclosely consider grain filters in Chapter 3. Computer scientists will find algorithmic considerations in Chapters 6 and 7, the full justification of which may be found in Chapters 2 and 4 respectively. Lastly, all readers can learnmore about the motivation for this work in the image processing applications presented in Chap ter 8
Note:Springer eBooks
Contents:1 Introduction
2 The Tree of Shapes of an Image
3 Grain Filters
4 A Topological Description of the Topographic Map
5 Merging the Component Trees
6 Computation of the Tree of Shapes of a Digital Image
7 Computation of the Tree of Bilinear Level Lines
8 Applications
ISBN:9783642046117
Series:e-books
Series:SpringerLink (Online service)
Series:Lecture Notes in Mathematics, 0075-8434 : v1984
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Visualization , 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

Return to the Fermilab Library catalog