Resultado de la búsqueda
45 búsqueda de la palabra clave 'Computation'
Refinar búsqueda Generar rss de la búsqueda
Link de la búsqueda
Título : The Pillars of Computation Theory : State, Encoding, Nondeterminism Tipo de documento: documento electrónico Autores: Rosenberg, Arnold L ; SpringerLink (Online service) Editorial: New York, NY : Springer New York Fecha de publicación: 2010 Colección: Universitext, ISSN 0172-5939 Número de páginas: XVIII, 326 p. 49 illus Il.: online resource ISBN/ISSN/DL: 978-0-387-09639-1 Idioma : Inglés (eng) Palabras clave: Computer science Computers Algorithms Mathematical logic Mathematics Science Theory of Computation Computing Algorithm Analysis and Problem Complexity Logic Foundations by Abstract Devices Formal Languages Clasificación: 51 Matemáticas Resumen: Computation theory is a discipline that strives to use mathematical tools and concepts in order to expose the nature of the activity that we call “computation” and to explain a broad range of observed computational phenomena. Why is it harder to perform some computations than others? Are the differences in difficulty that we observe inherent, or are they artifacts of the way we try to perform the computations? Even more basically: how does one reason about such questions? This book strives to endow upper-level undergraduate students and lower-level graduate students with the conceptual and manipulative tools necessary to make Computation theory part of their professional lives. The author tries to achieve this goal via three stratagems that set this book apart from most other texts on the subject. (1) The author develops the necessary mathematical concepts and tools from their simplest instances, so that the student has the opportunity to gain operational control over the necessary mathematics. (2) He organizes the development of the theory around the three “pillars” that give the book its name, so that the student sees computational topics that have the same intellectual origins developed in physical proximity to one another. (3) He strives to illustrate the “big ideas” that computation theory is built upon with applications of these ideas within “practical” domains that the students have seen elsewhere in their courses, in mathematics, in computer science, and in computer engineering Nota de contenido: PROLEGOMENA -- Mathematical Preliminaries -- STATE -- Online Automata: Exemplars of #x201C;State#x201D; -- Finite Automata and Regular Languages -- Applications of the Myhill#x2013;Nerode Theorem -- Enrichment Topics -- ENCODING -- Countability and Uncountability: The Precursors of #x201C;Encoding#x201D; -- Enrichment Topic: #x201C;Efficient#x201D; Pairing Functions, with Applications -- Computability Theory -- NONDETERMINISM -- Nondeterministic Online Automata -- Nondeterministic FAs -- Nondeterminism in Computability Theory -- Complexity Theory En línea: http://dx.doi.org/10.1007/978-0-387-09639-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33493 The Pillars of Computation Theory : State, Encoding, Nondeterminism [documento electrónico] / Rosenberg, Arnold L ; SpringerLink (Online service) . - New York, NY : Springer New York, 2010 . - XVIII, 326 p. 49 illus : online resource. - (Universitext, ISSN 0172-5939) .
ISBN : 978-0-387-09639-1
Idioma : Inglés (eng)
Palabras clave: Computer science Computers Algorithms Mathematical logic Mathematics Science Theory of Computation Computing Algorithm Analysis and Problem Complexity Logic Foundations by Abstract Devices Formal Languages Clasificación: 51 Matemáticas Resumen: Computation theory is a discipline that strives to use mathematical tools and concepts in order to expose the nature of the activity that we call “computation” and to explain a broad range of observed computational phenomena. Why is it harder to perform some computations than others? Are the differences in difficulty that we observe inherent, or are they artifacts of the way we try to perform the computations? Even more basically: how does one reason about such questions? This book strives to endow upper-level undergraduate students and lower-level graduate students with the conceptual and manipulative tools necessary to make Computation theory part of their professional lives. The author tries to achieve this goal via three stratagems that set this book apart from most other texts on the subject. (1) The author develops the necessary mathematical concepts and tools from their simplest instances, so that the student has the opportunity to gain operational control over the necessary mathematics. (2) He organizes the development of the theory around the three “pillars” that give the book its name, so that the student sees computational topics that have the same intellectual origins developed in physical proximity to one another. (3) He strives to illustrate the “big ideas” that computation theory is built upon with applications of these ideas within “practical” domains that the students have seen elsewhere in their courses, in mathematics, in computer science, and in computer engineering Nota de contenido: PROLEGOMENA -- Mathematical Preliminaries -- STATE -- Online Automata: Exemplars of #x201C;State#x201D; -- Finite Automata and Regular Languages -- Applications of the Myhill#x2013;Nerode Theorem -- Enrichment Topics -- ENCODING -- Countability and Uncountability: The Precursors of #x201C;Encoding#x201D; -- Enrichment Topic: #x201C;Efficient#x201D; Pairing Functions, with Applications -- Computability Theory -- NONDETERMINISM -- Nondeterministic Online Automata -- Nondeterministic FAs -- Nondeterminism in Computability Theory -- Complexity Theory En línea: http://dx.doi.org/10.1007/978-0-387-09639-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=33493 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar Mathematics and Computation, a Contemporary View / SpringerLink (Online service) ; Hans Munthe Kaas ; Brynjulf Owren (2008)
Título : Mathematics and Computation, a Contemporary View : The Abel Symposium 2006 Proceedings of the Third Abel Symposium, Alesund, Norway, May 25–27, 2006 Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Hans Munthe Kaas ; Brynjulf Owren Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2008 Colección: Abel Symposia, ISSN 2193-2808 num. 3 Número de páginas: XIV, 127 p Il.: online resource ISBN/ISSN/DL: 978-3-540-68850-1 Idioma : Inglés (eng) Palabras clave: Mathematics Software engineering Computers Computer science mathematics Numerical analysis Analysis Engineering/Programming and Operating Systems Theory of Computation Computational Computing Clasificación: 51 Matemáticas Resumen: The 2006 Abel symposium is focusing on contemporary research involving interaction between computer science, computational science and mathematics. In recent years, computation has been affecting pure mathematics in fundamental ways. Conversely, ideas and methods of pure mathematics are becoming increasingly important within computational and applied mathematics. At the core of computer science is the study of computability and complexity for discrete mathematical structures. Studying the foundations of computational mathematics raises similar questions concerning continuous mathematical structures. There are several reasons for these developments. The exponential growth of computing power is bringing computational methods into ever new application areas. Equally important is the advance of software and programming languages, which to an increasing degree allows the representation of abstract mathematical structures in program code. Symbolic computing is bringing algorithms from mathematical analysis into the hands of pure and applied mathematicians, and the combination of symbolic and numerical techniques is becoming increasingly important both in computational science and in areas of pure mathematics. We are witnessing a development where a focus on computability, computing and algorithms is contributing towards a unification of areas of computer science, applied and pure mathematics. The 2006 Abel symposium brought together some of the leading international researchers working in these areas, presented a snapshot of current state of the art, and raised questions about future research directions Nota de contenido: Geometric Methods in Engineering Applications -- Boundary Integral Equations for the Laplace-Beltrami Operator -- Numerical Study of Nearly Singular Solutions of the 3-D Incompressible Euler Equations -- Energy-Preserving and Stable Approximations for the Two-Dimensional Shallow Water Equations -- A Conjecture about Molecular Dynamics -- The Dynamics of Transition to Turbulence in Plane Couette Flow En línea: http://dx.doi.org/10.1007/978-3-540-68850-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34319 Mathematics and Computation, a Contemporary View : The Abel Symposium 2006 Proceedings of the Third Abel Symposium, Alesund, Norway, May 25–27, 2006 [documento electrónico] / SpringerLink (Online service) ; Hans Munthe Kaas ; Brynjulf Owren . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2008 . - XIV, 127 p : online resource. - (Abel Symposia, ISSN 2193-2808; 3) .
ISBN : 978-3-540-68850-1
Idioma : Inglés (eng)
Palabras clave: Mathematics Software engineering Computers Computer science mathematics Numerical analysis Analysis Engineering/Programming and Operating Systems Theory of Computation Computational Computing Clasificación: 51 Matemáticas Resumen: The 2006 Abel symposium is focusing on contemporary research involving interaction between computer science, computational science and mathematics. In recent years, computation has been affecting pure mathematics in fundamental ways. Conversely, ideas and methods of pure mathematics are becoming increasingly important within computational and applied mathematics. At the core of computer science is the study of computability and complexity for discrete mathematical structures. Studying the foundations of computational mathematics raises similar questions concerning continuous mathematical structures. There are several reasons for these developments. The exponential growth of computing power is bringing computational methods into ever new application areas. Equally important is the advance of software and programming languages, which to an increasing degree allows the representation of abstract mathematical structures in program code. Symbolic computing is bringing algorithms from mathematical analysis into the hands of pure and applied mathematicians, and the combination of symbolic and numerical techniques is becoming increasingly important both in computational science and in areas of pure mathematics. We are witnessing a development where a focus on computability, computing and algorithms is contributing towards a unification of areas of computer science, applied and pure mathematics. The 2006 Abel symposium brought together some of the leading international researchers working in these areas, presented a snapshot of current state of the art, and raised questions about future research directions Nota de contenido: Geometric Methods in Engineering Applications -- Boundary Integral Equations for the Laplace-Beltrami Operator -- Numerical Study of Nearly Singular Solutions of the 3-D Incompressible Euler Equations -- Energy-Preserving and Stable Approximations for the Two-Dimensional Shallow Water Equations -- A Conjecture about Molecular Dynamics -- The Dynamics of Transition to Turbulence in Plane Couette Flow En línea: http://dx.doi.org/10.1007/978-3-540-68850-1 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34319 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Advances in Automatic Differentiation Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Christian H. Bischof ; H. Martin Bücker ; Paul Hovland ; Uwe Naumann ; Jean Utke Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2008 Colección: Lecture Notes in Computational Science and Engineering, ISSN 1439-7358 num. 64 Número de páginas: XVIII, 368 p. 111 illus Il.: online resource ISBN/ISSN/DL: 978-3-540-68942-3 Idioma : Inglés (eng) Palabras clave: Mathematics Computers Computer science mathematics Mathematical optimization Electrical engineering Computational Science and Engineering Optimization Theory of Computation Numerical Analysis Computing Clasificación: 51 Matemáticas Resumen: This collection covers advances in automatic differentiation theory and practice. Computer scientists and mathematicians will learn about recent developments in automatic differentiation theory as well as mechanisms for the construction of robust and powerful automatic differentiation tools. Computational scientists and engineers will benefit from the discussion of various applications, which provide insight into effective strategies for using automatic differentiation for inverse problems and design optimization Nota de contenido: Reverse Automatic Differentiation of Linear Multistep Methods -- Call Tree Reversal is NP-Complete -- On Formal Certification of AD Transformations -- Collected Matrix Derivative Results for Forward and Reverse Mode Algorithmic Differentiation -- A Modification of Weeks’ Method for Numerical Inversion of the Laplace Transform in the Real Case Based on Automatic Differentiation -- A Low Rank Approach to Automatic Differentiation -- Algorithmic Differentiation of Implicit Functions and Optimal Values -- Using Programming Language Theory to Make Automatic Differentiation Sound and Efficient -- A Polynomial-Time Algorithm for Detecting Directed Axial Symmetry in Hessian Computational Graphs -- On the Practical Exploitation of Scarsity -- Design and Implementation of a Context-Sensitive, Flow-Sensitive Activity Analysis Algorithm for Automatic Differentiation -- Efficient Higher-Order Derivatives of the Hypergeometric Function -- The Diamant Approach for an Efficient Automatic Differentiation of the Asymptotic Numerical Method -- Tangent-on-Tangent vs. Tangent-on-Reverse for Second Differentiation of Constrained Functionals -- Parallel Reverse Mode Automatic Differentiation for OpenMP Programs with ADOL-C -- Adjoints for Time-Dependent Optimal Control -- Development and First Applications of TAC++ -- TAPENADE for C -- Coping with a Variable Number of Arguments when Transforming MATLAB Programs -- Code Optimization Techniques in Source Transformations for Interpreted Languages -- Automatic Sensitivity Analysis of DAE-systems Generated from Equation-Based Modeling Languages -- Index Determination in DAEs Using the Library indexdet and the ADOL-C Package for Algorithmic Differentiation -- Automatic Differentiation for GPU-Accelerated 2D/3D Registration -- Robust Aircraft Conceptual Design Using Automatic Differentiation in Matlab -- Toward Modular Multigrid Design Optimisation -- Large Electrical Power Systems Optimization Using Automatic Differentiation -- On the Application of Automatic Differentiation to the Likelihood Function for Dynamic General Equilibrium Models -- Combinatorial Computation with Automatic Differentiation -- Exploiting Sparsity in Jacobian Computation via Coloring and Automatic Differentiation: A Case Study in a Simulated Moving Bed Process -- Structure-Exploiting Automatic Differentiation of Finite Element Discretizations -- Large-Scale Transient Sensitivity Analysis of a Radiation-Damaged Bipolar Junction Transistor via Automatic Differentiation En línea: http://dx.doi.org/10.1007/978-3-540-68942-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34320 Advances in Automatic Differentiation [documento electrónico] / SpringerLink (Online service) ; Christian H. Bischof ; H. Martin Bücker ; Paul Hovland ; Uwe Naumann ; Jean Utke . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2008 . - XVIII, 368 p. 111 illus : online resource. - (Lecture Notes in Computational Science and Engineering, ISSN 1439-7358; 64) .
ISBN : 978-3-540-68942-3
Idioma : Inglés (eng)
Palabras clave: Mathematics Computers Computer science mathematics Mathematical optimization Electrical engineering Computational Science and Engineering Optimization Theory of Computation Numerical Analysis Computing Clasificación: 51 Matemáticas Resumen: This collection covers advances in automatic differentiation theory and practice. Computer scientists and mathematicians will learn about recent developments in automatic differentiation theory as well as mechanisms for the construction of robust and powerful automatic differentiation tools. Computational scientists and engineers will benefit from the discussion of various applications, which provide insight into effective strategies for using automatic differentiation for inverse problems and design optimization Nota de contenido: Reverse Automatic Differentiation of Linear Multistep Methods -- Call Tree Reversal is NP-Complete -- On Formal Certification of AD Transformations -- Collected Matrix Derivative Results for Forward and Reverse Mode Algorithmic Differentiation -- A Modification of Weeks’ Method for Numerical Inversion of the Laplace Transform in the Real Case Based on Automatic Differentiation -- A Low Rank Approach to Automatic Differentiation -- Algorithmic Differentiation of Implicit Functions and Optimal Values -- Using Programming Language Theory to Make Automatic Differentiation Sound and Efficient -- A Polynomial-Time Algorithm for Detecting Directed Axial Symmetry in Hessian Computational Graphs -- On the Practical Exploitation of Scarsity -- Design and Implementation of a Context-Sensitive, Flow-Sensitive Activity Analysis Algorithm for Automatic Differentiation -- Efficient Higher-Order Derivatives of the Hypergeometric Function -- The Diamant Approach for an Efficient Automatic Differentiation of the Asymptotic Numerical Method -- Tangent-on-Tangent vs. Tangent-on-Reverse for Second Differentiation of Constrained Functionals -- Parallel Reverse Mode Automatic Differentiation for OpenMP Programs with ADOL-C -- Adjoints for Time-Dependent Optimal Control -- Development and First Applications of TAC++ -- TAPENADE for C -- Coping with a Variable Number of Arguments when Transforming MATLAB Programs -- Code Optimization Techniques in Source Transformations for Interpreted Languages -- Automatic Sensitivity Analysis of DAE-systems Generated from Equation-Based Modeling Languages -- Index Determination in DAEs Using the Library indexdet and the ADOL-C Package for Algorithmic Differentiation -- Automatic Differentiation for GPU-Accelerated 2D/3D Registration -- Robust Aircraft Conceptual Design Using Automatic Differentiation in Matlab -- Toward Modular Multigrid Design Optimisation -- Large Electrical Power Systems Optimization Using Automatic Differentiation -- On the Application of Automatic Differentiation to the Likelihood Function for Dynamic General Equilibrium Models -- Combinatorial Computation with Automatic Differentiation -- Exploiting Sparsity in Jacobian Computation via Coloring and Automatic Differentiation: A Case Study in a Simulated Moving Bed Process -- Structure-Exploiting Automatic Differentiation of Finite Element Discretizations -- Large-Scale Transient Sensitivity Analysis of a Radiation-Damaged Bipolar Junction Transistor via Automatic Differentiation En línea: http://dx.doi.org/10.1007/978-3-540-68942-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34320 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : COMPSTAT 2008 : Proceedings in Computational Statistics Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Paula Brito Editorial: Heidelberg : Physica-Verlag HD Fecha de publicación: 2008 Número de páginas: XVII, 573 p Il.: online resource ISBN/ISSN/DL: 978-3-7908-2084-3 Idioma : Inglés (eng) Palabras clave: Mathematics Computers Mathematical statistics Information storage and retrieval Computer mathematics Probabilities Statistics Probability Theory Stochastic Processes Computational Numerical Analysis of Computation Computing/Statistics Programs Storage Retrieval in Science Clasificación: 51 Matemáticas Nota de contenido: Keynote -- Nonparametric Methods for Estimating Periodic Functions, with Applications in Astronomy -- Advances on Statistical Computing Environments -- Back to the Future: Lisp as a Base for a Statistical Computing System -- Computable Statistical Research and Practice -- Implicit and Explicit Parallel Computing in R -- Classification and Clustering of Complex Data -- Probabilistic Modeling for Symbolic Data -- Monothetic Divisive Clustering with Geographical Constraints -- Comparing Histogram Data Using a Mahalanobis–Wasserstein Distance -- Computation for Graphical Models and Bayes Nets -- Iterative Conditional Fitting for Discrete Chain Graph Models -- Graphical Models for Sparse Data: Graphical Gaussian Models with Vertex and Edge Symmetries -- Parameterization and Fitting of a Class of Discrete Graphical Models -- Computational Econometrics -- Exploring the Bootstrap Discrepancy -- On Diagnostic Checking Time Series Models with Portmanteau Test Statistics Based on Generalized Inverses and -- New Developments in Latent Variable Models: Non-linear and Dynamic Models -- Computational Statistics and Data Mining Methods for Alcohol Studies -- Estimating Spatiotemporal Effects for Ecological Alcohol Systems -- A Directed Graph Model of Ecological Alcohol Systems Incorporating Spatiotemporal Effects -- Spatial and Computational Models of Alcohol Use and Problems -- Finance and Insurance -- Optimal Investment for an Insurer with Multiple Risky Assets Under Mean-Variance Criterion -- Inhomogeneous Jump-GARCH Models with Applications in Financial Time Series Analysis -- The Classical Risk Model with Constant Interest and Threshold Strategy -- Estimation of Structural Parameters in Crossed Classification Credibility Model Using Linear Mixed Models -- Information Retrieval for Text and Images -- A Hybrid Approach for Taxonomy Learning from Text -- Image and Image-Set Modeling Using a Mixture Model -- Strategies in Identifying Issues Addressed in Legal Reports -- Knowledge Extraction by Models -- Sequential Automatic Search of a Subset of Classifiers in Multiclass Learning -- Possibilistic PLS Path Modeling: A New Approach to the Multigroup Comparison -- Models for Understanding Versus Models for Prediction -- Posterior Prediction Modelling of Optimal Trees -- Model Selection Algorithms -- Selecting Models Focussing on the Modeller’s Purpose -- A Regression Subset-Selection Strategy for Fat-Structure Data -- Fast Robust Variable Selection -- Models for Latent Class Detection -- Latent Classes of Objects and Variable Selection -- Modelling Background Noise in Finite Mixtures of Generalized Linear Regression Models -- Clustering via Mixture Regression Models with Random Effects -- Multiple Testing Procedures -- Testing Effects in ANOVA Experiments: Direct Combination of All Pair-Wise Comparisons Using Constrained Synchronized Permutations -- Multiple Comparison Procedures in Linear Models -- Inference for the Top-k Rank List Problem -- Random Search Algorithms -- Monitoring Random Start Forward Searches for Multivariate Data -- Generalized Differential Evolution for General Non-Linear Optimization -- Statistical Properties of Differential Evolution and Related Random Search Algorithms -- Robust Statistics -- Robust Estimation of the Vector Autoregressive Model by a Least Trimmed Squares Procedure -- The Choice of the Initial Estimate for Computing MM-Estimates -- Metropolis Versus Simulated Annealing and the Black-Box-Complexity of Optimization Problems -- Signal Extraction and Filtering -- Filters for Short Nonstationary Sequences: The Analysis of the Business Cycle -- Estimation of Common Factors Under Cross-Sectional and Temporal Aggregation Constraints: Nowcasting Monthly GDP and Its Main Components En línea: http://dx.doi.org/10.1007/978-3-7908-2084-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34427 COMPSTAT 2008 : Proceedings in Computational Statistics [documento electrónico] / SpringerLink (Online service) ; Paula Brito . - Heidelberg : Physica-Verlag HD, 2008 . - XVII, 573 p : online resource.
ISBN : 978-3-7908-2084-3
Idioma : Inglés (eng)
Palabras clave: Mathematics Computers Mathematical statistics Information storage and retrieval Computer mathematics Probabilities Statistics Probability Theory Stochastic Processes Computational Numerical Analysis of Computation Computing/Statistics Programs Storage Retrieval in Science Clasificación: 51 Matemáticas Nota de contenido: Keynote -- Nonparametric Methods for Estimating Periodic Functions, with Applications in Astronomy -- Advances on Statistical Computing Environments -- Back to the Future: Lisp as a Base for a Statistical Computing System -- Computable Statistical Research and Practice -- Implicit and Explicit Parallel Computing in R -- Classification and Clustering of Complex Data -- Probabilistic Modeling for Symbolic Data -- Monothetic Divisive Clustering with Geographical Constraints -- Comparing Histogram Data Using a Mahalanobis–Wasserstein Distance -- Computation for Graphical Models and Bayes Nets -- Iterative Conditional Fitting for Discrete Chain Graph Models -- Graphical Models for Sparse Data: Graphical Gaussian Models with Vertex and Edge Symmetries -- Parameterization and Fitting of a Class of Discrete Graphical Models -- Computational Econometrics -- Exploring the Bootstrap Discrepancy -- On Diagnostic Checking Time Series Models with Portmanteau Test Statistics Based on Generalized Inverses and -- New Developments in Latent Variable Models: Non-linear and Dynamic Models -- Computational Statistics and Data Mining Methods for Alcohol Studies -- Estimating Spatiotemporal Effects for Ecological Alcohol Systems -- A Directed Graph Model of Ecological Alcohol Systems Incorporating Spatiotemporal Effects -- Spatial and Computational Models of Alcohol Use and Problems -- Finance and Insurance -- Optimal Investment for an Insurer with Multiple Risky Assets Under Mean-Variance Criterion -- Inhomogeneous Jump-GARCH Models with Applications in Financial Time Series Analysis -- The Classical Risk Model with Constant Interest and Threshold Strategy -- Estimation of Structural Parameters in Crossed Classification Credibility Model Using Linear Mixed Models -- Information Retrieval for Text and Images -- A Hybrid Approach for Taxonomy Learning from Text -- Image and Image-Set Modeling Using a Mixture Model -- Strategies in Identifying Issues Addressed in Legal Reports -- Knowledge Extraction by Models -- Sequential Automatic Search of a Subset of Classifiers in Multiclass Learning -- Possibilistic PLS Path Modeling: A New Approach to the Multigroup Comparison -- Models for Understanding Versus Models for Prediction -- Posterior Prediction Modelling of Optimal Trees -- Model Selection Algorithms -- Selecting Models Focussing on the Modeller’s Purpose -- A Regression Subset-Selection Strategy for Fat-Structure Data -- Fast Robust Variable Selection -- Models for Latent Class Detection -- Latent Classes of Objects and Variable Selection -- Modelling Background Noise in Finite Mixtures of Generalized Linear Regression Models -- Clustering via Mixture Regression Models with Random Effects -- Multiple Testing Procedures -- Testing Effects in ANOVA Experiments: Direct Combination of All Pair-Wise Comparisons Using Constrained Synchronized Permutations -- Multiple Comparison Procedures in Linear Models -- Inference for the Top-k Rank List Problem -- Random Search Algorithms -- Monitoring Random Start Forward Searches for Multivariate Data -- Generalized Differential Evolution for General Non-Linear Optimization -- Statistical Properties of Differential Evolution and Related Random Search Algorithms -- Robust Statistics -- Robust Estimation of the Vector Autoregressive Model by a Least Trimmed Squares Procedure -- The Choice of the Initial Estimate for Computing MM-Estimates -- Metropolis Versus Simulated Annealing and the Black-Box-Complexity of Optimization Problems -- Signal Extraction and Filtering -- Filters for Short Nonstationary Sequences: The Analysis of the Business Cycle -- Estimation of Common Factors Under Cross-Sectional and Temporal Aggregation Constraints: Nowcasting Monthly GDP and Its Main Components En línea: http://dx.doi.org/10.1007/978-3-7908-2084-3 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34427 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Título : Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration Tipo de documento: documento electrónico Autores: SpringerLink (Online service) ; Torsten Möller ; Bernd Hamann ; Russell, Robert D Editorial: Berlin, Heidelberg : Springer Berlin Heidelberg Fecha de publicación: 2009 Colección: Mathematics and Visualization, ISSN 1612-3786 Número de páginas: X, 350 p. 183 illus., 134 illus. in color Il.: online resource ISBN/ISSN/DL: 978-3-540-49926-8 Idioma : Inglés (eng) Palabras clave: Computer science Computers Mathematics graphics Application software mathematics Science Applications Theory of Computation Computational and Numerical Analysis Graphics Computing Engineering Clasificación: 51 Matemáticas Resumen: Visualization is one of the most active and exciting areas of Mathematics and Computing Science, and indeed one which is only beginning to mature. Current visualization algorithms break down for very large data sets. While present approaches use multi-resolution ideas, future data sizes will not be handled that way. New algorithms based on sophisticated mathematical modeling techniques must be devised which will permit the extraction of high-level topological structures that can be visualized. For these reasons a workshop was organized at the Banff International Research Station, focused specifically on mathematical issues. A primary objective of the workshop was to gather together a diverse set of researchers in the mathematical areas relevant to the recent advances in order to discuss the research challenges facing this field in the next several years. The workshop was organized into five different thrusts: - Topology and Discrete Methods - Signal and Geometry Processing - Partial Differential Equations - Data Approximation Techniques - Massive Data Applications This book presents a summary of the research ideas presented at this workshop Nota de contenido: Maximizing Adaptivity in Hierarchical Topological Models Using Cancellation Trees -- The TOPORRERY: computation and presentation of multi-resolution topology -- Isocontour based Visualization of Time-varying Scalar Fields -- DeBruijn Counting for Visualization Algorithms -- Topological Methods for Visualizing Vortical Flows -- Stability and Computation of Medial Axes - a State-of-the-Art Report -- Local Geodesic Parametrization: an Ant’s Perspective -- Tensor-Fields Visualization Using a Fabric-like Texture Applied to Arbitrary Two-dimensional Surfaces -- Flow Visualization via Partial Differential Equations -- Iterative Twofold Line Integral Convolution for Texture-Based Vector Field Visualization -- Constructing 3D Elliptical Gaussians for Irregular Data -- From Sphere Packing to the Theory of Optimal Lattice Sampling -- Reducing Interpolation Artifacts by Globally Fairing Contours -- Time- and Space-efficient Error Calculation for Multiresolution Direct Volume Rendering -- Massive Data Visualization: A Survey -- Compression and Occlusion Culling for Fast Isosurface Extraction from Massive Datasets -- Volume Visualization of Multiple Alignment of Large Genomic DNA -- Model-based Visualization - Computing Perceptually Optimal Visualizations En línea: http://dx.doi.org/10.1007/b106657 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34006 Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration [documento electrónico] / SpringerLink (Online service) ; Torsten Möller ; Bernd Hamann ; Russell, Robert D . - Berlin, Heidelberg : Springer Berlin Heidelberg, 2009 . - X, 350 p. 183 illus., 134 illus. in color : online resource. - (Mathematics and Visualization, ISSN 1612-3786) .
ISBN : 978-3-540-49926-8
Idioma : Inglés (eng)
Palabras clave: Computer science Computers Mathematics graphics Application software mathematics Science Applications Theory of Computation Computational and Numerical Analysis Graphics Computing Engineering Clasificación: 51 Matemáticas Resumen: Visualization is one of the most active and exciting areas of Mathematics and Computing Science, and indeed one which is only beginning to mature. Current visualization algorithms break down for very large data sets. While present approaches use multi-resolution ideas, future data sizes will not be handled that way. New algorithms based on sophisticated mathematical modeling techniques must be devised which will permit the extraction of high-level topological structures that can be visualized. For these reasons a workshop was organized at the Banff International Research Station, focused specifically on mathematical issues. A primary objective of the workshop was to gather together a diverse set of researchers in the mathematical areas relevant to the recent advances in order to discuss the research challenges facing this field in the next several years. The workshop was organized into five different thrusts: - Topology and Discrete Methods - Signal and Geometry Processing - Partial Differential Equations - Data Approximation Techniques - Massive Data Applications This book presents a summary of the research ideas presented at this workshop Nota de contenido: Maximizing Adaptivity in Hierarchical Topological Models Using Cancellation Trees -- The TOPORRERY: computation and presentation of multi-resolution topology -- Isocontour based Visualization of Time-varying Scalar Fields -- DeBruijn Counting for Visualization Algorithms -- Topological Methods for Visualizing Vortical Flows -- Stability and Computation of Medial Axes - a State-of-the-Art Report -- Local Geodesic Parametrization: an Ant’s Perspective -- Tensor-Fields Visualization Using a Fabric-like Texture Applied to Arbitrary Two-dimensional Surfaces -- Flow Visualization via Partial Differential Equations -- Iterative Twofold Line Integral Convolution for Texture-Based Vector Field Visualization -- Constructing 3D Elliptical Gaussians for Irregular Data -- From Sphere Packing to the Theory of Optimal Lattice Sampling -- Reducing Interpolation Artifacts by Globally Fairing Contours -- Time- and Space-efficient Error Calculation for Multiresolution Direct Volume Rendering -- Massive Data Visualization: A Survey -- Compression and Occlusion Culling for Fast Isosurface Extraction from Massive Datasets -- Volume Visualization of Multiple Alignment of Large Genomic DNA -- Model-based Visualization - Computing Perceptually Optimal Visualizations En línea: http://dx.doi.org/10.1007/b106657 Link: https://biblioteca.cunef.edu/gestion/catalogo/index.php?lvl=notice_display&id=34006 Ejemplares
Signatura Medio Ubicación Sub-localización Sección Estado ningún ejemplar
Permalink
PermalinkPermalink
PermalinkPermalink
