Search Results - (((((((kant OR cantee) OR canton) OR wanting) OR cantor) OR anne) OR start) OR partes) algorithms.

Network Routing : Fundamentals, Applications, and Emerging Technologies. by Misra, Sudip

Table of Contents: “…s Algorithm -- 5.7 Random Races Algorithm -- References -- Abbreviations/Terminologies -- Questions -- Exercises -- Part III: Routing on the Internet -- 6 Interior Gateway Protocols -- 6.1 Introduction -- 6.2 Distance Vector Protocols -- 6.3 Link State Protocols -- References -- Abbreviations/Terminologies -- Questions -- Exercises -- 7 Exterior Gateway Protocol -- 7.1 Introduction -- 7.2 Exterior Gateway Protocol -- 7.3 Border Gateway Protocol -- References…”
Full text (MFA users only)

Java Deep Learning Projects : Implement 10 Real-World Deep Learning Applications Using Deeplearning4j and Open Source APIs. by Karim, Rezaul

Table of Contents: “…; Artificial Neural Networks; Biological neurons; A brief history of ANNs; How does an ANN learn?; ANNs and the backpropagation algorithm; Forward and backward passes; Weights and biases; Weight optimization; Activation functions.…”
Full text (MFA users only)

Financial instrument pricing using C++ by Duffy, Daniel J.

Table of Contents: “…A tour of C++ and environs -- New and improved C++ fundamentals -- Modelling functions in C++ -- Advanced c++ template programming -- Tuples in c++ and their applications -- Type traits, advanced lambdas and multiparadigm design in C++ -- Multiparadigm design in C++ -- C++ numerics, IEEE754 and boost C++ multiprecision -- An introduction to unified software design (USD) -- New data types, containers and algorithms in C++ and boost C++ libraries -- Lattice models fundamental data structures and algorithms -- Lattice models applications to computational finance -- Numerical linear algebra : tridiagonal systems and applications -- Data visualisation in Excel -- Univariate statistical distributions -- Bivariate statistical distributions and two-asset option pricing -- STL algorithms in detail -- STL algorithms part II -- An introduction to optimisation and the solution of nonlinear equations -- The finite difference method for PDEs mathematical background -- Software framework for one-factor option models -- Extending the software framework -- A PDE software framework in C++11 for a class of path-dependent options -- Ordinary differential equations and their numerical approximation -- Advanced ordinary differential equations and method of lines (MOL) -- Random number generation and distributions -- Microsoft .net, C# and C++11 interoperability -- C++ concurrency, Part I Threads -- C++ concurrency, part II Tasks -- Parallel patterns language (PPL) -- Monte Carlo simulation, Part I -- Monte Carlo simulation, Part II -- Bibliography -- Appendix -- Index.…”
Full text (MFA users only)

Media technologies : essays on communication, materiality, and society

Table of Contents: “…Bowker -- "What Do We Want?" "Materiality!" "When Do We Want It?" "Now!" …”
Full text (MFA users only)

Agent-based computing

Table of Contents: “…Analysis of Algorithm -- 2.1.1. Chain-Like Agent Structure -- 2.1.2. …”
Full text (MFA users only)

Topographical Tools for Filtering and Segmentation 2 : Flooding and Marker-Based Segmentation on Node- or Edge-weighted Graphs. by Meyer, Fernand

Full text (MFA users only)

Advanced Machine Learning with Python. by Hearty, John

Table of Contents: “…Cover; Copyright; Credits; About the Author; About the Reviewers; www.PacktPub.com; Table of Contents; Preface; Chapter 1: Unsupervised Machine Learning; Principal component analysis; PCA -- a primer; Employing PCA; Introducing k-means clustering; Clustering -- a primer; Kick-starting clustering analysis; Tuning your clustering configurations; Self-organizing maps; SOM -- a primer; Employing SOM; Further reading; Summary; Chapter 2: Deep Belief Networks; Neural networks -- a primer; The composition of a neural network; Network topologies; Restricted Boltzmann Machine; Introducing the RBM.…”
Full text (MFA users only)

Comprehensive Ruby Programming. by Hudgens, Jordan

Table of Contents: “…Implementing a prime number counting algorithm -- How to code the power digit sum algorithm -- Implementing a humanize counting algorithm -- Implementing a date algorithm -- How to code a Fibonacci digit counter -- Implementing a permutation algorithm -- Implementing an amicable number algorithm -- Implementing a factorial algorithm -- Implementing an even Fibonacci number algorithm -- Implementing the least common multiple -- Summary -- Chapter 19: Machine Learning -- Big data analysis -- Basic decision tree implementation -- Addition of attributes -- Addition of training data and its values -- Calling the ID3 method -- Function of the train method -- Addition of the test method -- Setting up decision variables -- Print the results out -- Testing the program -- Advantage of decision trees over if ... else statements -- How to develop a big data analysis application in Ruby -- Summary -- Index.…”
Full text (MFA users only)

Business Hack : the Wealth Dragon Way to Build a Successful Business in the Digital Age. by Lee, John

Table of Contents: “…Cover; Title Page; Copyright; Contents; Preface; Acknowledgments; About the Author; Introduction: My Business Journey; Part I The Old Rules; Chapter 1 Your Business and Products; What is Your Business?…”
Full text (MFA users only)

Advances in Knowledge-Based and Intelligent Engineering and Information Systems by Frydman, Claudia

Full text (MFA users only)

Biomedical image analysis recipes in MATLAB : for life scientists and engineers by Reyes-Aldasoro, Constantino Carlos

Full text (MFA users only)

Future Farming. by Shukla, Praveen Kumar

Table of Contents: “…PROPOSED METHODOLOGY -- Pre-processing -- Leaf Image from Plants -- Segmentation Model Using Improved Canny Algorithm -- Steps of Improved Canny Algorithm -- Leaf Image Feature Selection Using Hybrid Black Widow Optimization Algorithm with Mayfly Optimization Algorithm (BWO-MA) -- Pseudo-Code of the Hybrid (BWO-MA) Algorithm -- Output: Objective Function's -RMSE -- Leaf Image Classification Using (BWO-MA) with ANN -- Hyper-Parameter Tuning With (BWO-MA) -- RESULT AND DISCUSSION -- Dataset Description -- Evaluation & Results -- CONCLUSION -- REFERENCES…”
Full text (MFA users only)

Rough fuzzy image analysis : foundations and methodologies

Table of Contents: “…1. Cantor, fuzzy, near, and rough sets in image analysis / James F. …”
Full text (MFA users only)

Energy-efficient Urban Sensing. by Schweizer, Immanuel

Table of Contents: “…Abstract; Zusammenfassung; Acknowledgments; Contents; List of Tables; List of Algorithms; Part I. Introduction; Part II. Related Work; Part III. …”
Full text (MFA users only)

Structured Matrices in Mathematics, Computer Science, and Engineering. by Olshevsky, Vadim

Table of Contents: “…Contents -- Foreword -- Part V. Fast Algorithms -- The Schur algorithm for matrices with Hessenberg displacement structure -- Fast inversion algorithms for a class of block structured matrices -- A fast and stable solver for recursively semi-separable systems of linear equations -- Part VI. …”
Full text (MFA users only)
Full text (MFA users only)

The Complete Rust Programming Reference Guide : Design, Develop, and Deploy Effective Software Systems Using the Advanced Constructs of Rust. by Sharma, Rahul

Table of Contents: “…Chapter 1: Getting Started with Rust -- Chapter 2: Managing Projects with Cargo -- Chapter 3: Tests, Documentation, and Benchmarks -- Chapter 4: Types, Generics, and Traits -- Chapter 5: Memory Management and Safety -- Chapter 6: Error Handling -- Chapter 7: Advanced Concepts -- Chapter 8: Concurrency -- Chapter 9: Metaprogramming with Macros -- Chapter 10: Unsafe Rust and Foreign Function Interfaces -- Chapter 11: Logging -- Chapter 12: Network Programming in Rust -- Chapter 13: Building Web Applications with Rust -- Chapter 14: Lists, Lists, and More Lists -- Chapter 15: Robust Trees -- Chapter 16: Exploring Maps and Sets -- Chapter 17: Collections in Rust -- Chapter 18: Algorithm Evaluation -- Chapter 19: Ordering Things -- Chapter 20: Finding Stuff -- Chapter 21: Random and Combinatorial -- Chapter 22: Algorithms of the Standard Library.…”
Full text (MFA users only)

Understanding Artificial Intelligence. by Sabouret, Nicolas

Table of Contents: “…: Understanding What a Computer, an Algorithm, a Program, and, in Particular, an Artificial Intelligence Program Are -- Computer Science and Computers -- Computers and Algorithms -- Algorithms and Computer Science -- The All-Purpose Machine -- Programs that Make Programs -- And Where Does Artificial Intelligence Fit in All This? …”
Full text (MFA users only)

Differential and Differential-Algebraic Systems for the Chemical Engineer : Solving Numerical Problems. by Buzzi-Ferraris, Guido

Table of Contents: “…2.14.1 Control of the Local Error2.14.2 Change the Integration Step; 2.14.3 Changing the Method Order; 2.14.4 Strategy for Step and Order Selection; 2.14.5 Initializing a Multivalue Method; 2.14.6 Selecting the First Integration Step; 2.14.7 Selecting the Multivalue Algorithms; 2.14.7.1 Adams-Moulton Algorithms; 2.14.7.2 Gear Algorithms; 2.14.8 Nonlinear System Solution; 2.15 Multivalue Algorithms for Nonstiff Problems; 2.16 Multivalue Algorithms for Stiff Problems; 2.16.1 Robustness in Stiff Problems; 2.16.1.1 Eigenvalues with a Very Large Imaginary Part.…”
Full text (MFA users only)

Evolutionary optimization

Table of Contents: “…Cover -- Contents -- Preface -- Contributing Authors -- Part I Introduction -- 1 Conventional Optimization Techniques -- 1 Classifying Optimization Models -- 2 Linear Programming -- 3 Goal Programming -- 4 Integer Programming -- 5 Nonlinear Programming -- 6 Simulation -- 7 Further Reading -- 2 Evolutionary Computation -- 1 What Is Evolutionary Computation -- 2 A Brief Overview of Evolutionary Computation -- 3 Evolutionary Algorithm and Generate-and-Test Search Algorithm -- 4 Search Operators -- 5 Summary -- Part II Single Objective Optimization -- 3 Evolutionary Algorithms and Constrained Optimization -- 1 Introduction -- 2 General considerations -- 3 Numerical optimization -- 4 Final Remarks -- 4 Constrained Evolutionary Optimization -- 1 Introduction -- 2 The Penalty Function Method -- 3 Stochastic Ranking -- 4 Global Competitive Ranking -- 5 How Penalty Methods Work -- 6 Experimental Study -- 7 Conclusion -- Appendix: Test Function Suite -- Part III Multi-Objective Optimization -- 5 Evolutionary Multiobjective Optimization -- 1 Introduction -- 2 Definitions -- 3 Historical Roots -- 4 A Quick Survey of EMOO Approaches -- 5 Current Research -- 6 Future Research Paths -- 7 Summary -- 6 MEA for Engineering Shape Design -- 1 Introduction -- 2 Multi-Objective Optimization and Pareto-Optimality -- 3 Elitist Non-dominated Sorting GA (NSGA-II) -- 4 Hybrid Approach -- 5 Optimal Shape Design -- 6 Simulation Results -- 7 Conclusion -- 7 Assessment Methodologies for MEAs -- 1 Introduction -- 2 Assessment Methodologies -- 3 Discussion -- 4 Comparing Two Algorithms: An Example -- 5 Conclusions and Future Research Paths -- Part IV Hybrid Algorithms -- 8 Hybrid Genetic Algorithms -- 1 Introduction -- 2 Hybridizing GAs with Local Improvement Procedures -- 3 Adaptive Memory GA's -- 4 Summary -- 9 Combining choices of heuristics -- 1 Introduction -- 2 GAs and parameterised algorithms -- 3 Job Shop Scheduling -- 4 Scheduling chicken catching -- 5 Timetabling -- 6 Discussion and future directions -- 10 Nonlinear Constrained Optimization -- 1 Introduction -- 2 Previous Work -- 3 A General Framework to look for SPdn -- 4 Experimental Results -- 5 Conclusions -- Part V Parameter Selection in EAs -- 11 Parameter Selection -- 1 Introduction -- 2 Parameter tuning vs. parameter control -- 3 An example -- 4 Classification of Control Techniques -- 5 Various forms of control -- 6 Discussion -- Part VI Application of EAs to Practical Problems -- 12 Design of Production Facilities -- 1 Introduction -- 2 Design for Material Flow When the Number of I/O Points is Unconstrained -- 3 Design for Material Flow for a Single I/O Point -- 4 Considering Intradepartmental Flow -- 5 Material Handling System Design -- 6 Concluding Remarks -- 13 Virtual Population and Acceleration Techniques -- 1 Introduction -- 2 Concept of Virtual Population -- 3 Solution Acceleration Techniques -- 4 Accelerated GA and Acceleration Sche.…”
Full text (MFA users only)

Domain Decomposition Methods in Science and Engineering. by Quarteroni, Alfio

Table of Contents: “…Application to domain decomposition methods; Part II: Algorithms; Invited Lectures.…”
Full text (MFA users only)