Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Combinatorics and Complexity of Partition Functions / / by Alexander Barvinok
| Combinatorics and Complexity of Partition Functions / / by Alexander Barvinok |
| Autore | Barvinok Alexander |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (304 pages) : illustrations |
| Disciplina | 510 |
| Collana | Algorithms and Combinatorics |
| Soggetto topico |
Algorithms
Combinatorial analysis Computer science—Mathematics Statistical physics Dynamics Approximation theory Mathematics of Algorithmic Complexity Combinatorics Discrete Mathematics in Computer Science Complex Systems Approximations and Expansions |
| ISBN | 3-319-51829-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter I. Introduction -- Chapter II. Preliminaries -- Chapter III. Permanents -- Chapter IV. Hafnians and Multidimensional Permanents -- Chapter V. The Matching Polynomial -- Chapter VI. The Independence Polynomial -- Chapter VII. The Graph Homomorphism Partition Function -- Chapter VIII. Partition Functions of Integer Flows -- References -- Index. |
| Record Nr. | UNINA-9910254078803321 |
Barvinok Alexander
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A Course in Topological Combinatorics / / by Mark de Longueville
| A Course in Topological Combinatorics / / by Mark de Longueville |
| Autore | Longueville Mark de |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (244 p.) |
| Disciplina | 514.2 |
| Collana | Universitext |
| Soggetto topico |
Combinatorial analysis
Convex geometry Discrete geometry Graph theory Game theory Algorithms Combinatorics Convex and Discrete Geometry Graph Theory Game Theory, Economics, Social and Behav. Sciences Mathematics of Algorithmic Complexity |
| ISBN | 1-4419-7910-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- List of Symbols and Typical Notation -- 1 Fair-Division Problems -- 2 Graph-Coloring Problems -- 3 Evasiveness of Graph Properties -- 4 Embedding and Mapping Problems -- A Basic Concepts from Graph Theory -- B Crash Course in Topology -- C Partially Ordered Sets, Order Complexes, and Their Topology -- D Groups and Group Actions -- E Some Results and Applications from Smith Theory -- References -- Index. |
| Record Nr. | UNINA-9910437865703321 |
|
Longueville Mark de
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The Developments and the Applications of the Numerical Algorithms in Simulating the Incompressible Magnetohydrodynamics with Complex Boundaries and Free Surfaces / / by Jie Zhang
| The Developments and the Applications of the Numerical Algorithms in Simulating the Incompressible Magnetohydrodynamics with Complex Boundaries and Free Surfaces / / by Jie Zhang |
| Autore | Zhang Jie |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Singapore : , : Springer Singapore : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XV, 145 p. 95 illus., 81 illus. in color.) |
| Disciplina | 620.1064 |
| Collana | Springer Theses, Recognizing Outstanding Ph.D. Research |
| Soggetto topico |
Fluid mechanics
Mechanics Algorithms Engineering Fluid Dynamics Classical Mechanics Mathematics of Algorithmic Complexity |
| ISBN | 981-10-6340-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Governing Equations -- Numerical schemes -- The validations of the numerical methodology -- The argon bubble rising in the liquid GaInSn under the influence of a vertical magnetic field -- The argon bubble rising in the liquid GaInSn under the influence of a horizontal magnetic field. . |
| Record Nr. | UNINA-9910337461403321 |
|
Zhang Jie
|
||
| Singapore : , : Springer Singapore : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Elderly Health Services and Remote Health Monitoring [[electronic resource] /] / by Lumin Chen, Yihao Li, Lina Han, Liang Yuan, Yuxiang Sun, Xiaolu Tang
| Elderly Health Services and Remote Health Monitoring [[electronic resource] /] / by Lumin Chen, Yihao Li, Lina Han, Liang Yuan, Yuxiang Sun, Xiaolu Tang |
| Autore | Chen Lumin |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (X, 81 p. 73 illus., 59 illus. in color.) |
| Disciplina | 617.03 |
| Collana | SpringerBriefs in Applied Sciences and Technology |
| Soggetto topico |
System theory
Mathematical models Computer science—Mathematics Computer mathematics Algorithms Systems Theory, Control Mathematical Modeling and Industrial Mathematics Mathematical Applications in Computer Science Mathematics of Algorithmic Complexity |
| ISBN | 981-15-7154-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Simulation and Experimental Analysis of Auxiliary Lower Extremity Exoskeleton -- Simulation and Research of Upper Limb Rehabilitation Evaluation System based on Micro Inertial Sensor Network -- Generative Design and Simulation of the Exoskeleton -- Design and Simulation of Controllable Soft Driver for Exoskeleton Robot -- Design and Simulation Analysis of Rigid-flexible Hybrid Upper Limb Rehabilitation mechanism -- Classification and Treatment System for Facial Acne Vulgaris based on Image Recognition -- Comparative Analysis Soft Kinematics of Hand Rehabilitation Robot Powered by Pneumatic Muscles. . |
| Record Nr. | UNISA-996418254903316 |
|
Chen Lumin
|
||
| Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Elderly Health Services and Remote Health Monitoring / / by Lumin Chen, Yihao Li, Lina Han, Liang Yuan, Yuxiang Sun, Xiaolu Tang
| Elderly Health Services and Remote Health Monitoring / / by Lumin Chen, Yihao Li, Lina Han, Liang Yuan, Yuxiang Sun, Xiaolu Tang |
| Autore | Chen Lumin |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (X, 81 p. 73 illus., 59 illus. in color.) |
| Disciplina | 617.03 |
| Collana | SpringerBriefs in Applied Sciences and Technology |
| Soggetto topico |
System theory
Mathematical models Computer science—Mathematics Computer science - Mathematics Algorithms Systems Theory, Control Mathematical Modeling and Industrial Mathematics Mathematical Applications in Computer Science Mathematics of Algorithmic Complexity |
| ISBN | 981-15-7154-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Simulation and Experimental Analysis of Auxiliary Lower Extremity Exoskeleton -- Simulation and Research of Upper Limb Rehabilitation Evaluation System based on Micro Inertial Sensor Network -- Generative Design and Simulation of the Exoskeleton -- Design and Simulation of Controllable Soft Driver for Exoskeleton Robot -- Design and Simulation Analysis of Rigid-flexible Hybrid Upper Limb Rehabilitation mechanism -- Classification and Treatment System for Facial Acne Vulgaris based on Image Recognition -- Comparative Analysis Soft Kinematics of Hand Rehabilitation Robot Powered by Pneumatic Muscles. . |
| Record Nr. | UNINA-9910483629303321 |
|
Chen Lumin
|
||
| Singapore : , : Springer Singapore : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Fundamentals of Parameterized Complexity / / by Rodney G. Downey, Michael R. Fellows
| Fundamentals of Parameterized Complexity / / by Rodney G. Downey, Michael R. Fellows |
| Autore | Downey Rodney G |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | London : , : Springer London : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XXX, 763 p. 83 illus.) |
| Disciplina | 005.1 |
| Collana | Texts in Computer Science |
| Soggetto topico |
Algorithms
Algorithm Analysis and Problem Complexity Mathematics of Algorithmic Complexity |
| ISBN | 1-4471-5559-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Part I: Parameterized Tractability -- Preliminaries -- The Basic Definitions -- Part II: Elementary Positive Techniques -- Bounded Search Trees -- Kernelization -- More on Kernelization -- Iterative Compression, and Measure and Conquer, for Minimization Problems -- Further Elementary Techniques -- Colour Coding, Multilinear Detection, and Randomized Divide and Conquer -- Optimization Problems, Approximation Schemes, and Their Relation to FPT -- Part III: Techniques Based on Graph Structure -- Treewidth and Dynamic Programming -- Heuristics for Treewidth -- Automata and Bounded Treewidth -- Courcelle's Theorem -- More on Width-Metrics: Applications and Local Treewidth -- Depth-First Search and the Plehn-Voigt Theorem -- Other Width Metrics -- Part IV: Exotic Meta-Techniques -- Well-Quasi-Orderings and the Robertson-Seymour Theorems -- The Graph Minor Theorem -- Applications of the Obstruction Principle and WQOs -- Part V: Hardness Theory -- Reductions -- The Basic Class W[1] and an Analog of Cook's Theorem -- Other Hardness Results -- The W-Hierarchy -- The Monotone and Antimonotone Collapses -- Beyond W-Hardness -- k-Move Games -- Provable Intractability: The Class XP -- Another Basis -- Part VI: Approximations, Connections, Lower Bounds -- The M-Hierarchy, and XP-optimality -- Kernelization Lower Bounds -- Part VII: Further Topics -- Parameterized Approximation -- Parameterized Counting and Randomization -- Part VIII: Research Horizons -- Research Horizons -- Part IX Appendices -- Appendix 1: Network Flows and Matchings -- Appendix 2: Menger's Theorems. |
| Record Nr. | UNINA-9910437564403321 |
|
Downey Rodney G
|
||
| London : , : Springer London : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Generalized network improvement and packing problems / / by Michael Holzhauser
| Generalized network improvement and packing problems / / by Michael Holzhauser |
| Autore | Holzhauser Michael |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Wiesbaden : , : Springer Fachmedien Wiesbaden : , : Imprint : Springer Spektrum, , 2016 |
| Descrizione fisica | 1 online resource (XVI, 213 p. 26 illus.) |
| Disciplina | 519.6 |
| Soggetto topico |
Mathematical optimization
Algorithms Discrete Optimization Mathematics of Algorithmic Complexity |
| ISBN | 9783658168124 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Fractional Packing and Parametric Search Frameworks -- Budget-Constrained Minimum Cost Flows: The Continuous Case -- Budget-Constrained Minimum Cost Flows: The Discrete Case -- Generalized Processing Networks -- Convex Generalized Flows. |
| Record Nr. | UNINA-9910158670503321 |
|
Holzhauser Michael
|
||
| Wiesbaden : , : Springer Fachmedien Wiesbaden : , : Imprint : Springer Spektrum, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Generalized Rough Sets [[electronic resource] ] : Hybrid Structure and Applications / / by Anjan Mukherjee
| Generalized Rough Sets [[electronic resource] ] : Hybrid Structure and Applications / / by Anjan Mukherjee |
| Autore | Mukherjee Anjan |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | New Delhi : , : Springer India : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIII, 160 p. 1 illus.) |
| Disciplina | 511.322 |
| Collana | Studies in Fuzziness and Soft Computing |
| Soggetto topico |
Computational intelligence
Computational complexity Algorithms Computational Intelligence Complexity Mathematics of Algorithmic Complexity |
| ISBN | 81-322-2458-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction to Fuzzy Sets, Rough Sets and Soft Sets -- On Generalised Interval-Valued Intuitionistic Fuzzy Soft Sets -- Soft Rough Intuitionistic Fuzzy Sets -- Interval-Valued Intuitionistic Fuzzy Soft Rough Sets -- Interval Valued Intuitionistic Fuzzy Soft Topological Spaces -- Interval Valued Intuitionistic Fuzzy Soft Multi-sets and their Relations -- Interval Valued Neutrosophic Soft Sets -- Topological Structure formed by Soft Multi Sets and Soft Multi Compact Spaces -- Soft Interval Valued Intuitionistic Fuzzy Rough Sets -- IF Parameterized Intuitionistic Fuzzy Soft Set Theories On Decisions-Making. |
| Record Nr. | UNINA-9910299827003321 |
|
Mukherjee Anjan
|
||
| New Delhi : , : Springer India : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Limits of Computation : From a Programming Perspective / / by Bernhard Reus
| Limits of Computation : From a Programming Perspective / / by Bernhard Reus |
| Autore | Reus Bernhard |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVIII, 348 p. 80 illus.) |
| Disciplina | 001.642 |
| Collana | Undergraduate Topics in Computer Science |
| Soggetto topico |
Algorithms
Algorithm Analysis and Problem Complexity Mathematics of Algorithmic Complexity |
| ISBN | 3-319-27889-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Foreword -- Preface -- For Tutors -- Acknowledgements -- Contents -- 1 Limits? What Limits? -- 1.1 Physical Limits of Computation -- 1.1.1 Fundamental Engineering Constraints to Semiconductor Manufacturing and Scaling -- 1.1.2 Fundamental Limits to Energy Efficiency -- 1.1.3 Fundamental Physical Constraints on Computing in General -- 1.2 The Limits Addressed -- 1.2.1 Computability Overview -- 1.2.2 Complexity Overview -- References -- Part I Computability -- 2 Problems and Effective Procedures -- 2.1 On Computability -- 2.1.1 Historical Remarks -- 2.1.2 Effective Procedures -- 2.2 Sets, Relations and Functions -- 2.2.1 Sets -- 2.2.2 Relations -- 2.2.3 Functions -- 2.2.4 Partial Functions -- 2.2.5 Total Functions -- 2.3 Problems -- 2.3.1 Computing Solutions to Problems -- References -- 3 The WHILE-Language -- 3.1 The Data Type of Binary Trees -- 3.2 WHILE-Syntax -- 3.2.1 Expressions -- 3.2.2 Commands -- 3.2.3 Programs -- 3.2.4 A Grammar for WHILE -- 3.2.5 Layout Conventions and Brackets -- 3.3 Encoding Data Types as Trees -- 3.3.1 Boolean Values -- 3.3.2 Lists and Pairs -- 3.3.3 Natural Numbers -- 3.3.4 Finite Words -- 3.4 Sample Programs -- 3.4.1 Addition -- 3.4.2 List Reversal -- 3.4.3 Tail Recursion -- 3.4.4 Analysis of Algorithms -- References -- 4 Semantics of WHILE -- 4.1 Stores -- 4.2 Semantics of Programs -- 4.3 Semantics of Commands -- 4.4 Semantics of Expressions -- References -- 5 Extensions of WHILE -- 5.1 Equality -- 5.2 Literals -- 5.2.1 Number Literals -- 5.2.2 Boolean Literals -- 5.3 Adding Atoms -- 5.4 List Constructor -- 5.5 Macro Calls -- 5.6 Switch Statement -- References -- 6 Programs as Data Objects -- 6.1 Interpreters Formally -- 6.2 Abstract Syntax Trees -- 6.3 Encoding of WHILE-ASTs in mathbbD -- Reference -- 7 A Self-interpreter for WHILE -- 7.1 A Self-interpreter for WHILE -Programs with One Variable.
7.1.1 General Tree Traversal for ASTs -- 7.1.2 The STEP Macro -- 7.2 A Self-interpreter for WHILE -- 7.2.1 Store Manipulation Macros -- References -- 8 An Undecidable (Non-computable) Problem -- 8.1 WHILE-Computability and Decidability -- 8.2 The Halting Problem for WHILE -- 8.3 Diagonalisation and the Barber ``Paradox'' -- 8.4 Proof of the Undecidability of the Halting Problem -- References -- 9 More Undecidable Problems -- 9.1 Semi-decidability of the Halting Problem -- 9.2 Rice's Theorem -- 9.3 The Tiling Problem -- 9.4 Problem Reduction -- 9.5 Other (Famous) Undecidable Problems -- 9.6 Dealing with Undecidable Problems -- 9.7 A Fast-Growing Non-computable Function -- References -- 10 Self-referencing Programs -- 10.1 The S-m-n Theorem -- 10.2 Kleene's Recursion Theorem -- 10.3 Recursion Elimination -- References -- 11 The Church-Turing Thesis -- 11.1 The Thesis -- 11.2 Semantic Framework for Machine-Like Models -- 11.3 Turing Machines TM -- 11.4 GOTO-Language -- 11.5 Register Machines RAM and SRAM -- 11.6 Counter Machines CM -- 11.7 Cellular Automata -- 11.7.1 2D: Game of Life -- 11.7.2 1D: Rule 110 -- 11.8 Robustness of Computability -- 11.8.1 The Crucial Role of Compilers -- 11.8.2 Equivalence of Models -- References -- Part II Complexity -- 12 Measuring Time Usage -- 12.1 Unit-Cost Time Measure -- 12.2 Time Measure for WHILE -- 12.3 Comparing Programming Languages Considering Time -- References -- 13 Complexity Classes -- 13.1 Runtime Bounds -- 13.2 Time Complexity Classes -- 13.3 Lifting Simulation Properties to Complexity Classes -- 13.4 Big-O and Little-o -- References -- 14 Robustness of P -- 14.1 Extended Church--Turing Thesis -- 14.2 Invariance or Cook's Thesis -- 14.2.1 Non-sequential Models -- 14.2.2 Evidence for Cook's Thesis -- 14.2.3 Linear Time -- 14.3 Cobham--Edmonds Thesis -- References -- 15 Hierarchy Theorems. 15.1 Linear Time Hierarchy Theorems -- 15.2 Beyond Linear Time -- 15.3 Gaps in the Hierarchy -- References -- 16 Famous Problems in P -- 16.1 Decision Versus Optimisation Problems -- 16.2 Predecessor Problem -- 16.3 Membership Test for a Context Free Language -- 16.4 Primality Test -- 16.5 Graph Problems -- 16.5.1 Reachability in a Graph -- 16.5.2 Shortest Paths in a Graph -- 16.5.3 Maximal Matchings -- 16.5.4 Min-Cut and Max-Flow -- 16.5.5 The Seven Bridges of Königsberg -- 16.6 Linear Programming -- References -- 17 Common Problems Not Known to Be in P -- 17.1 The Travelling Salesman Problem (TSP) -- 17.2 The Graph Colouring Problem -- 17.3 Max-Cut Problem -- 17.4 The 0-1 Knapsack Problem -- 17.5 Integer Programming Problem -- 17.6 Does Not Being in P Matter? -- References -- 18 The One-Million-Dollar Question -- 18.1 The Complexity Class NP -- 18.2 Nondeterministic Programs -- 18.2.1 Time Measure of Nondeterministic Programs -- 18.2.2 Some Basic Facts About NP -- 18.3 Robustness of NP -- 18.4 Problems in NP -- 18.5 The Biggest Open Problem in (Theoretical) Computer Science -- References -- 19 How Hard Is a Problem? -- 19.1 Reminder: Effective Reductions -- 19.2 Polynomial Time Reduction -- 19.3 Hard Problems -- References -- 20 Complete Problems -- 20.1 A First NP-complete Problem -- 20.2 More NP-complete Problems -- 20.3 Puzzles and Games -- 20.3.1 Chess -- 20.3.2 Sudoku -- 20.3.3 Tile-Matching Games -- 20.4 Database Queries -- 20.5 Policy Based Routing -- 20.6 ``Limbo'' Problems -- 20.7 Complete Problems in Other Classes -- 20.7.1 P-complete -- 20.7.2 RE-complete -- References -- 21 How to Solve NP-Complete Problems -- 21.1 Exact Algorithms -- 21.2 Approximation Algorithms -- 21.3 Parallelism -- 21.4 Randomization -- 21.4.1 The Class RP -- 21.4.2 Probabilistic Algorithms -- 21.5 Solving the Travelling Salesman Problem -- 21.5.1 Exact Solutions. 21.5.2 Approximative Solutions -- 21.6 When Bad Complexity is Good News -- References -- 22 Molecular Computing -- 22.1 The Beginnings of DNA Computing -- 22.2 DNA Computing Potential -- 22.3 DNA Computing Challenges -- 22.4 Abstract Models of Molecular Computation -- 22.4.1 Chemical Reaction Networks (CRN) -- 22.4.2 CRNs as Effective Procedures -- 22.4.3 Are CRNs Equivalent to Other Notions of Computation? -- 22.4.4 Time Complexity for CRNs -- 22.4.5 Implementing CRNs -- References -- 23 Quantum Computing -- 23.1 Molecular Electronics -- 23.2 The Mathematics of Quantum Mechanics -- 23.3 Quantum Computability and Complexity -- 23.4 Quantum Algorithms -- 23.4.1 Shor's Algorithm -- 23.4.2 Grover's Algorithm -- 23.5 Building Quantum Computers -- 23.6 Quantum Computing Challenges -- 23.7 To Boldly Go -- References -- Further Reading-Computabilityand Complexity Textbooks -- Glossary -- Index. |
| Record Nr. | UNINA-9910254981403321 |
|
Reus Bernhard
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Models, Methods and Applications / / edited by Abul Hasan Siddiqi, Pammy Manchanda, Rashmi Bhardwaj
| Mathematical Models, Methods and Applications / / edited by Abul Hasan Siddiqi, Pammy Manchanda, Rashmi Bhardwaj |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Singapore : , : Springer Singapore : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (309 p.) |
| Disciplina | 511.8 |
| Collana | Industrial and Applied Mathematics |
| Soggetto topico |
Mathematical models
Algorithms Mathematical optimization Geometry Mathematical Modeling and Industrial Mathematics Mathematics of Algorithmic Complexity Optimization |
| ISBN | 981-287-973-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cryptography Based Chaos via Geometric Undersampling of Ring-Coupled Attractors -- Soft Computing Techniques and Their Applications -- Integral Geometry and Mathematical Problems of Image Reconstruction -- Microlocal Analysis of Some Synthetic Aperture Radar Imaging Problems -- Cubic Spline Approximation for Two Dimensional Non-linear Elliptic Boundary Value Problems -- Pricing of Path Dependent European Type Options Using Monte-Carlo Simulation -- On the Finite Element Approximation of the Impulse Control Quasivariational Inequality -- The Periodic Petrol Station Replenishment Problem: An Overview -- Nanotechnology and Mathematics: Study of Non-linear Dynamic Vibration in Single Walled Carbon Nanotubes(SWNTs) -- Generalized Monotone Mapping with Applications -- Wavelet and Fractal Methods with Environmental Applications -- A Novel Algorithm by Context Modeling of Medical Image Compression with Discrete Wavelet Transform -- Srinivasa Ramanujan: A Creative Genius -- Estimation of Longitudinal Diffusivity in Laminar/Turbulent flow through curved channels with absorbing boundaries using Method of Moments -- Recent Advances in Compressive Sensing -- Emergence of Shearlets and its Applications -- Application of CAS wavelets in Numerical Evaluation of Hankel Transforms Arising in Seismology. |
| Record Nr. | UNINA-9910300254103321 |
| Singapore : , : Springer Singapore : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
