1  20
Next
 Description
 Book
 Online
Media Center
Media Center  Status 

Find it Microfiche collection  
440211  Inlibrary use 
 Novak, Erich, author.
 Zuerich, Switzerland : European Mathematical Society Publishing House, 2010.
 Description
 Book — 1 online resource (675 pages). Digital: text file; PDF.
 Summary

This threevolume set is a comprehensive study of the tractability of multivariate problems. The present second volume deals with algorithms using standard information consisting of function values for the approximation of linear and selected nonlinear functionals. An important example is numerical multivariate integration. The proof techniques used in volumes I and II are quite different. It is especially hard to establish meaningful lower error bounds for the approximation of functionals by using finitely many function values. Here, the concept of decomposable reproducing kernels is helpful, allowing it to find matching lower and upper error bounds for some linear functionals. It is then possible to conclude tractability results from such error bounds. Tractability results even for linear functionals are very rich in variety. There are infinitedimensional Hilbert spaces for which the approximation with an arbitrarily small error of all linear functionals requires only one function value. There are Hilbert spaces for which all nontrivial linear functionals suffer from the curse of dimensionality. This holds for unweighted spaces, where the role of all variables and groups of variables is the same. For weighted spaces one can monitor the role of all variables and groups of variables. Necessary and sufficient conditions on the decay of the weights are given to obtain various notions of tractability. The text contains extensive chapters on discrepancy and integration, decomposable kernels and lower bounds, the Smolyak/sparse grid algorithms, lattice rules and the CBC (componentbycomponent) algorithms. This is done in various settings. Path integration and quantum computation are also discussed. The book is of interest for researchers working in computational mathematics, especially in approximation of highdimensional problems. It is also well suited for graduate courses and seminars. 61 open problems...
3. Tractability of Multivariate Problems [electronic resource] : Volume I: Linear Information [2008]
 Novak, Erich, author.
 Zuerich, Switzerland : European Mathematical Society Publishing House, 2008.
 Description
 Book — 1 online resource (395 pages). Digital: text file; PDF.
 Summary

Multivariate problems occur in many applications. These problems are defined on spaces of dvariate functions and d can be huge – in the hundreds or even in the thousands. Some highdimensional problems can be solved efficiently to within ε, i.e., the cost increases polynomially in ε−1 and d. However, there are many multivariate problems for which even the minimal cost increases exponentially in d. This exponential dependence on d is called intractability or the curse of dimensionality. This is the first of a threevolume set comprising a comprehensive study of the tractability of multivariate problems. It is devoted to algorithms using linear information consisting of arbitrary linear functionals. The theory for multivariate problems is developed in various settings: worst case, average case, randomized and probabilistic. A problem is tractable if its minimal cost is not exponential in ε−1 and d. There are various notions of tractability, depending on how we measure the lack of exponential dependence. For example, a problem is polynomially tractable if its minimal cost is polynomial in ε−1 and d. The study of tractability was initiated about 15 years ago. This is the first research monograph on this subject. Many multivariate problems suffer from the curse of dimensionality when they are defined over classical (unweighted) spaces. But many practically important problems are solved today for huge d in a reasonable time. One of the most intriguing challenges of theory is to understand why this is possible. Multivariate problems may become tractable if they are defined over weighted spaces with properly decaying weights. In this case, all variables and groups of variables are moderated by weights. The main purpose of this book is to study weighted spaces and to obtain conditions on the weights that are necessary and sufficient to achieve various notions of tractability. The book is of interes...
Online 4. Models of LCF. [1973]
 Description
 Book
 Digital collection
 Stanford Artificial Intelligence Laboratory records, 19632009 Stanford University, Department of Computer Science, Technical Reports
 Also online at
Media Center, SAL3 (offcampus storage), Special Collections
Media Center  Status 

Find it Microfiche collection  
024332  Inlibrary use 
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
024332  Available 
Special Collections  Status 

University Archives  Request via Aeon (opens in new tab) 
024332  Inlibrary use 
Online 5. Fast approximation algorithms for multicommodity flow problems [1991]
 August 1991.
 Description
 Book — 28 p.
 Digital collection
 Stanford University, Department of Computer Science, Technical Reports
 Also online at

Media Center, SAL3 (offcampus storage), Special Collections
Media Center  Status 

Find it Microfiche collection  
025375  Inlibrary use 
025375  Inlibrary use 
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
025375  Available 
Special Collections  Status 

University Archives  Request via Aeon (opens in new tab) 
025375  Inlibrary use 
Online 6. Polynomial dual network simplex algorithms [1991]
 Description
 Book — 25 p.
 Summary

We show how to use polynomial and strongly polynomial capacity scaling algorithms for the transshipment problem to design a polynomial dual network simplex pivot rule. Our best pivoting strategy leads to an O(m2 log n) bound on the number of pivots, where n and m denotes the number of nodes and arcs in the input network. If the demands are integral and at most B, we also give an O(m(m + n log n) min(log nB, m log n))time implementation of a strategy that requires somewhat more pivots.
 Digital collection
 Stanford University, Department of Computer Science, Technical Reports
 Also online at

Media Center, SAL3 (offcampus storage), Special Collections
Media Center  Status 

Find it Microfiche collection  
025374  Inlibrary use 
025374  Inlibrary use 
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
025374  Available 
Special Collections  Status 

University Archives  Request via Aeon (opens in new tab) 
025374  Inlibrary use 
 Eklund, Patrik, author.
 Cham, Switzerland : Springer, 2018.
 Description
 Book — 1 online resource Digital: text file.PDF.
 Summary

 Introduction. 1 Foundations. 2 Fundamentals of Quantales. 3 Module Theory in Sup. Appendix. References. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Description
 Book
 Digital collection
 Stanford Artificial Intelligence Laboratory records, 19632009 Stanford University, Department of Computer Science, Technical Reports
 Also online at
Media Center, Special Collections
Media Center  Status 

Find it Microfiche collection  
024808  Inlibrary use 
024808  Inlibrary use 
Special Collections  Status 

University Archives  Request via Aeon (opens in new tab) 
024808  Inlibrary use 
 Newcastle upon Tyne : Cambridge Scholars, 2011.
 Description
 Book — 1 online resource (xvii, 343 pages) : illustrations
 Summary

 Experiments using semantics for learning language comprehension and production / Dana Agnluin and Leonor BecerraBonache
 Adaptable grammars for noncontextfree languages / Henning Christiansen
 On a new class of bracketed contextual grammars / Lakshmanan Kuppusamy, Anand Mahendran and Eric de la Clergerie
 Reference, coreference and antecedentanaphora in the type theory of acyclic recursion / Roussanka Loukanova
 Semantics with the language of acyclic recursion in constraintbased grammar / roussanka Loukanova
 Linguistic power of permutation languages by regular help / Benedek Nagy
 On the correspondence between parallel communicating grammar systems and restarting automata / Dana Pardubská, Martin Plátek and Friedrich Otto
 About a new variant of HNEPs: obligatory hybrid networks of evolutionary processors / Artiom Alhazov, Gemma BelEnguix, and Yurii Rogozhin
 Modeling concepts and relations through property grammars / Veronica Dahl, Baohua Gu and Erez Maharshak
 P/T petri net controlled grammars / Jürgen Dassow and Sherzod Turaev
 Some steps towards the automatic design of splicing systems / Marina de la Cruz Echeandía and Alfonso Ortega de la Puente
 Synalysis: a dual processing scheme for both human and biological languages / Veronica Dahl and Erez Maharshak
 Evolutionary algorithms for parsing tree adjoining grammars / AdrianHoria Dediu and Cǎtǎlin Ionuţ Tîrnǎucǎ
 PNEPs, NEPs extension to parse context free languages / Alfonso Ortega [and others].
(source: Nielsen Book Data)
 Sergeyev, Yaroslav D., 1963 author.
 New York, NY : Springer, [2017]
 Description
 Book — 1 online resource : illustrations Digital: text file; PDF.
 Summary

 1. Lipschitz global optimization.
 2. Onedimensional algorithms and their accleration.
 3. Diagonal approach and efficient paritioning strategies.
 4. Global optimization algorithms based on the nonredundant partitions. References.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Tripuraneni, Subhashini, author
 Birmingham : Packt Publishing, Limited, 2019
 Description
 Book — 1 online resource (vi, 412 pages) : black and white illustrations
 Summary

 Table of Contents Introduction to Artificial Intelligence on AWS Anatomy of an Modern AI Application Detecting and Translating Text with AWS Rekognition and AWS Translate Performing speechtotext and Viceversa with AWS Transcribe and AWS Polly Extracting Information from Text with AWS Comprehend Building a Voice Chatbot with AWS Lex Working with Amazon SageMaker Creating Machine Learning Inference Pipelines with Amazon SageMaker Discovering Topics in Text Collections using Amazon SageMaker Classifying Images using Amazon SageMaker Sales Forecasting with Deep Learning and Auto Regression Model Accuracy Degradation and Feedback Loop What's Next.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Justesen, Jørn author.
 Zuerich, Switzerland : European Mathematical Society Publishing House, 2017.
 Description
 Book — 1 online resource (226 pages). Digital: text file; PDF.
 Summary

This book, updated and enlarged for the second edition, is written as a text for a course aimed at 3rd or 4th year students. Only some familiarity with elementary linear algebra and probability is directly assumed, but some maturity is required. The students may specialize in discrete mathematics, computer science, or communication engineering. The book is also a suitable introduction to coding theory for researchers from related fields or for professionals who want to supplement their theoretical basis. The book gives the coding basics for working on projects in any of the above areas, but material specific to one of these fields has not been included. The chapters cover the codes and decoding methods that are currently of most interest in research, development, and application. They give a relatively brief presentation of the essential results, emphasizing the interrelations between different methods and proofs of all important results. A sequence of problems at the end of each chapter serves to review the results and give the student an appreciation of the concepts. In addition, some problems and suggestions for projects indicate direction for further work. The presentation encourages the use of programming tools for studying codes, implementing decoding methods, and simulating performance. Specific examples of programming exercises are provided on the book's home page.
 Kumar, Rahul.
 Birmingham : Packt Publishing Ltd, 2019.
 Description
 Book — 1 online resource (283 pages)
 Summary

 Table of Contents Quantifying Learning Algorithms Evaluating Kernel Learning Performance in Ensemble Learning Training Neural Networks TimeSeries Analysis Natural Language Processing Temporal and Sequential Pattern Discovery Probabilistic Graphical Models Selected Topics in Deep Learning Causal Inference Advanced Methods.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Neri, Ferrante, author.
 Switzerland : Springer, 2016.
 Description
 Book — 1 online resource (xxii, 464 pages) : illustrations Digital: text file; PDF.
 Summary

 Basic Mathematical Thinking
 Matrices
 Systems of Linear Equations
 Geometric Vectors
 Complex Numbers and Polynomials
 An Introduction to Geometric Algebra and Conics
 An Overview of Algebraic Structures
 Vector Spaces
 Linear Mappings
 An Introduction to Computational Complexity
 Graph Theory
 Applied Linear Algebra: Electrical Networks
 A nonlinear Algebra: An Introduction to Boolean Algebra
 Proofs of Theorems that Require Further Knowledge of Mathematics.
15. Principal bundles : the classical case [2015]
 Sontz, S. B., author.
 Cham : Springer, 2015.
 Description
 Book — 1 online resource (xv, 280 pages) Digital: text file.PDF.
 Summary

 Introduction
 Basics of Manifolds
 Vector Bundles
 Vectors and Covectors
 Differential Forms
 Lie Derivatives
 Lie Groups
 Frobenius Theorem
 Principle Bundles
 Connections on Principle Bundles
 Curvature of a Connection
 Classical Electromagnetism
 YangMills Theory
 Gauge Theory
 The Dirac Monopole
 Instantons
 What Next?
 Discussion of the Exercises.
16. Reality and measurement in algebraic quantum theory : NWW 2015, Nagoya, Japan, March 913 [2018]
 Nagoya Winter Workshop: Reality and Measurement in Algebraic Quantum Theory (2015 : Nagoya, Japan)
 Singapore : Springer, 2018.
 Description
 Book — 1 online resource (viii, 396 pages) : illustrations (some color) Digital: text file.PDF.
 Summary

 Part I Quantum Reality: Sarah Cannon and Andreas Doring, A Generalisation of Stone Duality to Orthomodular Lattices. G'abor HoferSzab'o, Bell's Local Causality is a dSeparation Criterion. Yuichiro Kitajima, Local Operations and Completely Positive Maps in Algebraic Quantum Field Theory. Klaas Landsman and Bert Lindenhovius, Symmetries in Exact Bohrification. Mikl'os R'edei, Categorial Local Quantum Physics. Part II Quantum Information: Francesco Buscemi, Reverse DataProcessing Theorems and Computational Second Laws:. Michael J. W. Hall, TrustFree Verification of Steering: Why You Can't Cheat a Quantum Referee. Holger F. Hofmann, Dynamics and Statistics in the Operator Algebra of Quantum Mechanics. Keiji Matsumoto, A New Quantum Version of f Divergence. Part III Quantum Measurement: Jeremy Butterfield, Peaceful Coexistence: Examining Kent's Relativistic Solution to the Quantum Measurement Problem. Yuji Hasegawa, Relations Inherent in Successive 1=2??Spin Measurements. Jasper van Heugten and Sander Wolters, Obituary for a Flea. Kazuya Okamura, Measuring Processes and the Heisenberg Picture.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Menshawy, Ahmed, author.
 Birmingham, UK : Packt Publishing, 2018.
 Description
 Book — 1 online resource (1 volume) : illustrations Digital: data file.
 Summary

 Table of Contents Data science: Bird'seye view Data Modeling in Action  The Titanic Example Feature Engineering and Model Complexity  The Titanic Example Revisited Get Up and Running with TensorFlow Tensorflow in Action  Some Basic Examples Deep Feedforward Neural Networks  Implementing Digit Classification Introduction to Convolutional Neural Networks Object Detection  CIFAR10 Example Object Detection  Transfer Learning with CNNs RecurrentType Neural Networks  Language modeling Representation Learning  Implementing Word Embeddings Neural sentiment Analysis Autoencoders  Feature Extraction and Denoising Generative Adversarial Networks in Action  Generating New Images Face Generation and Handling Missing Labels Appendix  Implementing Fish Recognition.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 International Frontiers of Algorithmics Workshop (11th : 2017 : Chengdu, China)
 Cham, Switzerland : Springer, 2017.
 Description
 Book — 1 online resource (x, 281 pages) : illustrations Digital: text file.PDF.
 Summary

 On the Complexity of Minimizing the Total Calibration Cost. On the FixedParameter Tractability of Some Matching Problems Under the ColorSpanning Model.  The complexity of finding (approximate sized) distance d dominating sets in tournaments. On Computational Aspects of Greedy Partitioning of Graphs. Maximum Edge Bicliques in Tree Convex Bipartite Graphs. Complete Submodularity Characterization in the Comparative Independent Cascade Model. A Riskreward Model for Online Financial Leasing Problem with an Interest Rate. Designing and Implementing Algorithms for the Closest String Problem. The BrokenTriangle Property with Adjoint Values. Online Knapsack Problem under Concave Functions. Fluctuated Fitting under the L1metric. Optimal Partitioning Which Maximizes the Weighted Sum of Products. Modularwidth: An Auxiliary Parameter for Parameterized Parallel Complexity. Online Strategies for Evacuating from a Convex Region in the Plane. A further analysis of the dynamic dominant resource fairness mechanism. A 42k Kernel for the Complementary Maximal Strip Recovery Problem. Online Scheduling with a Monotonous Subsequence Constraint. A 1.4Approximation Algorithm For Twosided Scaffold Filling. FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters. A Constant Amortized Time Algorithm for Generating LeftChild Sequences in Lexicographic Order. Geodectic Contraction Games on Trees. On Approximation Algorithms for TwoStage Scheduling Problems. A New Lower Bound for Positive Zero Forcing. Phase Transition for Maximum NotAllEqual Satisfiability. .
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Workshop on Coalgebraic Methods in Computer Science (14th : 2018 : Thessalonikē , Greece)
 Cham, Switzerland : Springer, 2018.
 Description
 Book — 1 online resource (ix, 235 pages) : illustrations Digital: text file.PDF.
 Summary

 Relating Structure and Power: Comonadic Semantics for Computational Resources. Coalgebraic Logics and Duality. Intuitionistic PodelskiRybalchenko Theorem and Equivalence between Inductive Definitions and Cyclic Proofs. Undecidability of Equality for Codata Types. Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. LongTerm Values in Markov Decision Processes, (Co)Algebraically. (In)finite Trace Equivalence of Probabilistic Transition Systems. Steps and Traces. On Algebras with Effectful Iteration. Monoidal computer III: A coalgebraic view of computability and complexity. Fibrational Bisimulations and Quantitative Reasoning. Categorical Buchi and Parity Conditions via Alternating Fixed Points of Functors.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Workshop on Coalgebraic Methods in Computer Science (15th : 2020 : Online)
 Cham, Swizterland : Springer, 2020.
 Description
 Book — 1 online resource Digital: text file.PDF.
 Summary

 The Theory of Universal Graphs for Games: Past and Future. Approximate coalgebra homomorphisms and approximate solutions. Duality for Instantial Neighbourhood Logic via Coalgebra. Freealgebra functors from a coalgebraic perspective. Learning Automata with SideEffects. De Finetti's Construction as a Categorical Limit. Injective Objects and Fibered Codensity Liftings. Explaining NonBisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas. A categorical approach to secure compilation. Semantics for rstorder a ne inductive datatypes via slice categories.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.