Search Results - (((((((ant OR wantin) OR mantis) OR when) OR cantor) OR anne) OR shared) OR hints) algorithms.

Chases and escapes : the mathematics of pursuit and evasion by Nahin, Paul J.

Full text (MFA users only)

Data management in the semantic web

Table of Contents: “…Single-RelationalNetworkAlgorithms; 3.3.1. ShortestPath; 3.3.2. Eccentricity, Radius, and Diameter; 3.3.3. …”
Full text (MFA users only)

Trading the Measured Move : a Path to Trading Success in a World of Algos and High Frequency Trading. by Halsey, David

Full text (MFA users only)

Coding as literacy : metalithikum IV

Table of Contents: “…III From Particular to Genericand the Concept of "Error"; VI Pre-Specific Modeling: Models based on Concrete Universals; VI .I Dedekind Cut: When a Particular Object is Represented by the Negation of Its Complement.…”
Full text (MFA users only)

Blockchain and the Digital Economy : The Socio-Economic Impact of Blockchain Technology. by Steinmetz, Fred

Full text (MFA users only)

Arithmetic, Geometry, Cryptography and Coding Theory. by Bassa, Alp

Full text (MFA users only)

Indoor Geolocation Science and Technology : At the Emergence of Smart World and IoT. by Pahlavan, Kaveh, 1951-

Full text (MFA users only)

Choice modelling : the state-of-the-art and the state-of-practice : proceedings from the inaugural International Choice Modelling Conference

Table of Contents: “…On estimation of hybrid choice models / Denis Bolduc, Ricardo Alvarez-Daziano -- A model of travel happiness and mode switching / Maya Abou-Zeid, Moshe Ben-Akiva -- On path generation algorithms for route choice models / Emma Frejinger, Michel Bierlaire -- Mode choice endogeneity in value of travel time estimation / Stefan L. …”
Full text (MFA users only)

Great Myths of Personality. by Donnellan, M. Brent

Table of Contents: “…Cover -- Title Page -- Copyright Page -- Contents -- Introduction -- Research methods 101 -- Organization of chapters -- Foundational material -- Biological aspects of personality -- Personality assessment -- Personality development -- Well-being/happiness -- Applications of personality -- Basic vocabulary -- References -- Chapter 1 Situational Factors Overwhelm Personality When Predicting Behavior -- Defining personality -- Personality and assessment -- Responding to personality and assessment -- References…”
Full text (MFA users only)

Theory and application of special functions : proceedings of an advanced seminar sponsored by the Mathematics Research Center, the University of Wisconsin-Madison, March 31-April 2...

Table of Contents: “…Nonlinear recurrence algorithms for elliptic integrals and elliptic functions; 4. …”
Full text (MFA users only)

Beginning software engineering by Stephens, Rod, 1961-

Table of Contents: “…WhatWhen; Where; Why; How; Study Users; Refining Requirements; Copy Existing Systems; Clairvoyance; Brainstorm; Recording Requirements; UML; User Stories; Use Cases; Prototypes; Requirements Specification; Validation and Verification; Changing Requirements; Summary; CHAPTER 5: HIGH-LEVEL DESIGN; The Big Picture; What to Specify; Security; Hardware; User Interface; Internal Interfaces; External Interfaces; Architecture; Monolithic; Client/Server; Component-Based; Service-Oriented; Data-Centric; Event-Driven; Rule-Based; Distributed; Mix and Match; Reports; Other Outputs; Database; Audit Trails.…”
Full text (MFA users only)

Securing SQL server : protecting Your database from attackers by Cherry, Denny

Table of Contents: “…; Personally Identifiable Information; When should security objectives been identified?; How to identify security objectives?…”
Full text (MFA users only)

Mathematics of evolution and phylogeny

Table of Contents: “…List of Contributors -- 1 The minimum evolution distance-based approach of phylogenetic inference -- 1.1 Introduction -- 1.2 Tree metrics -- 1.2.1 Notation and basics -- 1.2.2 Three-point and four-point conditions -- 1.2.3 Linear decomposition into split metrics -- 1.2.4 Topological matrices -- 1.2.5 Unweighted and balanced averages -- 1.2.6 Alternate balanced basis for tree metrics -- 1.2.7 Tree metric inference in phylogenetics -- 1.3 Edge and tree length estimation -- 1.3.1 The LS approach -- 1.3.2 Edge length formulae -- 1.3.3 Tree length formulae -- 1.3.4 The positivity constraint -- 1.3.5 The balanced scheme of Pauplin -- 1.3.6 Semple and Steel combinatorial interpretation -- 1.3.7 BME: a WLS interpretation -- 1.4 The agglomerative approach -- 1.4.1 UPGMA and WPGMA -- 1.4.2 NJ as a balanced minimum evolution algorithm -- 1.4.3 Other agglomerative algorithms -- 1.5 Iterative topology searching and tree building -- 1.5.1 Topology transformations.; 1.5.2 A fast algorithm for NNIs with OLS -- 1.5.3 A fast algorithm for NNIs with BME -- 1.5.4 Iterative tree building with OLS -- 1.5.5 From OLS to BME -- 1.6 Statistical consistency -- 1.6.1 Positive results -- 1.6.2 Negative results -- 1.6.3 Atteson's safety radius analysis -- 1.7 Discussion -- Acknowledgements -- 2 Likelihood calculation in molecular phylogenetics -- 2.1 Introduction -- 2.2 Markov models of sequence evolution -- 2.2.1 Independence of sites -- 2.2.2 Setting up the basic model -- 2.2.3 Stationary distribution -- 2.2.4 Time reversibility -- 2.2.5 Rate of mutation -- 2.2.6 Probability of sequence evolution on a tree -- 2.3 Likelihood calculation: the basic algorithm -- 2.4 Likelihood calculation: improved models -- 2.4.1 Choosing the rate matrix -- 2.4.2 Among site rate variation -- 2.4.3 Site-specific rate variation -- 2.4.4 Correlated evolution between sites -- 2.5 Optimizing parameters -- 2.5.1 Optimizing continuous parameters -- 2.5.2 Searching for the optimal tree.; 2.5.3 Alternative search strategies -- 2.6 Consistency of the likelihood approach -- 2.6.1 Statistical consistency -- 2.6.2 Identifiability of the phylogenetic models -- 2.6.3 Coping with errors in the model -- 2.7 Likelihood ratio tests -- 2.7.1 When to use the asymptotic x2 distribution -- 2.7.2 Testing a subset of real parameters -- 2.7.3 Testing parameters with boundary conditions -- 2.7.4 Testing trees -- 2.8 Concluding remarks -- Acknowledgements -- 3 Bayesian inference in molecular phylogenetics -- 3.1 The likelihood function and maximum likelihood estimates -- 3.2 The Bayesian paradigm -- 3.3 Prior -- 3.4 Markov chain Monte Carlo -- 3.4.1 Metropolis-Hastings algorithm -- 3.4.2 Single-component Metropolis-Hastings algorithm -- 3.4.3 Gibbs sampler -- 3.4.4 Metropolis-coupled MCMC -- 3.5 Simple moves and their proposal ratios -- 3.5.1 Sliding window using uniform proposal -- 3.5.2 Sliding window using normally distributed proposal.; 3.5.3 Sliding window using normal proposal in multidimensions -- 3.5.4 Proportional shrinking and expanding -- 3.6 Monitoring Markov chains and processing output -- 3.6.1 Diagnosing and validating MCMC algorithms -- 3.6.2 Gelman and Rubin's potential scale reduction statistic -- 3.6.3 Processing output -- 3.7 Applications to molecular phylogenetics -- 3.7.1 Estimation of phylogenies -- 3.7.2 Estimation of species divergence times -- 3.8 Conclusions and perspectives -- Acknowledgements -- 4 Statistical approach to tests involving phylogenies -- 4.1 The statistical approach to phylogenetic inference -- 4.2 Hypotheses testing -- 4.2.1 Null and alternative hypotheses -- 4.2.2 Test statistics -- 4.2.3 Significance and power -- 4.2.4 Bayesian hypothesis testing -- 4.2.5 Questions posed as function of the tree parameter -- 4.2.6 Topology of treespace -- 4.2.7 The data -- 4.2.8 Statistical paradigms -- 4.2.9 Distributions on treespace -- 4.3 Different types of tests involving phylogenies.; 4.3.1 Testing t1 versus t2 -- 4.3.2 Conditional tests -- 4.3.3 Modern Bayesian hypothesis testing -- 4.3.4 Bootstrap tests -- 4.4 Non-parametric multivariate hypothesis testing -- 4.4.1 Multivariate con.dence regions -- 4.5 Conclusions: there are many open problems -- Acknowledgements -- 5 Mixture models in phylogenetic inference -- 5.1 Introduction: models of gene-sequence evolution -- 5.2 Mixture models -- 5.3 Defining mixture models -- 5.3.1 Partitioning and mixture models -- 5.3.2 Discrete-gamma model as a mixture model -- 5.3.3 Combining rate and pattern-heterogeneity -- 5.4 Digression: Bayesian phylogenetic inference -- 5.4.1 Bayesian inference of trees via MCMC -- 5.5 A mixture model combining rate and pattern-heterogeneity -- 5.5.1 Selected simulation results -- 5.6 Application of the mixture model to inferring the phylogeny of the mammals -- 5.6.1 Model testing -- 5.7 Results -- 5.7.1 How many rate matrices to include in the mixture model?…”
Full text (MFA users only)

Biological computation by Lamm, Ehud

Full text (MFA users only)

Minor Surgery at a Glance. by Mohan, Helen

Table of Contents: “…Part 3 Core surgical knowledge -- 17 Skin incisions -- Scalpels -- Holding the scalpel to make an incision -- Basic principles for incision -- Minor surgical incisions -- Techniques for a good scar -- Electrodissection to incise -- 18 Principles of wound closure -- Plan the skin incision -- Choosing the suture size -- Choosing the suture material -- Suture placement -- Technique for simple interrupted sutures -- When should I use a different suturing technique? …”
Full text (MFA users only)

The SMART CYBER ECOSYSTEM FOR SUSTAINABLE DEVELOPMENT.

Full text (MFA users only)

A primer on experiments with mixtures by Cornell, John A., 1941-

Table of Contents: “…QuestionsAppendix 2A: Least-Squares Estimation Formula for the Polynomial Coefficients and Their Variances: Matrix Notation; Appendix 2B: Cubic and Quartic Polynomials and Formulas for the Estimates of the Coefficients; Appendix 2C: The Partitioning of the Sources in the Analysis of Variance Table When Fitting the Scheffé Mixture Models; 3. Multiple Constraints on the Component Proportions; 3.1 Lower-Bound Restrictions on Some or All of the Component Proportions; 3.2 Introducing L-Pseudocomponents; 3.3 A Numerical Example of Fitting An L-Pseudocomponent Model.…”
Full text (MFA users only)

Missing Data Methods : Cross-Sectional Methods and Applications. by Drukker, David M.

Table of Contents: “…NotesAcknowledgment; References; Orthogonality in the single index model; On the estimation of selection models when participation is endogenous and misclassified; Introduction; The model and estimator; Sampling algorithm; Simulated data example; Summary and conclusions; Notes; Acknowledgments; References; summary tables for additional simulations; Process for simulating non -- normal errors; Efficient probit estimation with partially missing covariates; Introduction; Model Specification; Efficient estimators and variances; Testing assumptions and possible modifications; Other models.…”
Full text (MFA users only)

A Primer on Machine Learning Applications in Civil Engineering by Deka, Paresh Chandra

Table of Contents: “…Cover -- Half Title -- Title Page -- Copyright Page -- Dedication -- Contents -- Preface -- Acknowledgments -- A Primer on Machine Learning Applications in Civil Engineering -- Author -- 1: Introduction -- 1.1 Machine Learning -- 1.2 Learning from Data -- 1.3 Research in Machine Learning: Recent Progress -- 1.4 Artificial Neural Networks -- 1.5 Fuzzy Logic (FL) -- 1.6 Genetic Algorithms -- 1.7 Support Vector Machine (SVM) -- 1.8 Hybrid Approach (HA) -- Bibliography -- 2: Artificial Neural Networks -- 2.1 Introduction to Fundamental Concepts and Terminologies -- 2.2 Evolution of Neural Networks -- 2.3 Models of ANN -- 2.4 McCulloch-Pitts Model -- 2.5 Hebb Network -- 2.6 Summary -- 2.7 Supervised Learning Network -- 2.7.1 Perceptron Network -- 2.7.2 Adaptive Linear Neuron -- 2.7.3 Back-Propagation Network -- 2.7.4 Radial Basis Function Network -- 2.7.5 Generalized Regression Neural Networks -- 2.7.6 Summary -- 2.8 Unsupervised Learning Networks -- 2.8.1 Introduction -- 2.8.2 Kohonen Self-Organizing Feature Maps -- 2.8.3 Counter Propagation Network -- 2.8.4 Adaptive Resonance Theory Network -- 2.8.5 Summary -- 2.9 Special Networks -- 2.9.1 Introduction -- 2.9.2 Gaussian Machine -- 2.9.3 Cauchy Machine -- 2.9.4 Probabilistic Neural Network -- 2.9.5 Cascade Correlation Neural Network -- 2.9.6 Cognitive Network -- 2.9.7 Cellular Neural Network -- 2.9.8 Optical Neural Network -- 2.9.9 Summary -- 2.10 Working Principle of ANN -- 2.10.1 Introduction -- 2.10.2 Types of Activation Function -- 2.10.3 ANN Architecture -- 2.10.4 Learning Process -- 2.10.5 Feed-Forward Back Propagation -- 2.10.6 Strengths of ANN -- 2.10.7 Weaknesses of ANN -- 2.10.8 Working of the Network -- 2.10.9 Summary -- Bibliography -- 3: Fuzzy Logic -- 3.1 Introduction to Classical Sets and Fuzzy Sets -- 3.1.1 Classical Sets -- 3.1.2 Fuzzy Sets -- 3.1.3 Summary.…”
Full text (MFA users only)

Moments, Positive Polynomials And Their Applications.

Full text (MFA users only)