Search Results - (((((((kant OR kkants) OR wanti) OR maket) OR cantor) OR anne) OR share) OR hints) algorithms.

Theory of randomized search heuristics : foundations and recent developments

Full text (MFA users only)

Algorithmic Puzzles. by Levitin, Anany, Levitin, Maria

Table of Contents: “…-- General strategies for algorithm design -- Analysis techniques -- Easier puzzles (#1 to #50) -- Puzzles of medium difficulty (#51 to #110) -- Harder puzzles (#111 to #150) -- Hints -- Solutions -- References -- Design stragety and analysis index.…”
Full text (MFA users only)

Algorithms for Dummies. by Mueller, John Paul

Table of Contents: “…Intro -- Title Page -- Copyright Page -- Table of Contents -- Introduction -- About This Book -- Foolish Assumptions -- Icons Used in This Book -- Beyond the Book -- Where to Go from Here -- Part 1 Getting Started with Algorithms -- Chapter 1 Introducing Algorithms -- Describing Algorithms -- The right way to make toast: Defining algorithm uses -- Finding algorithms everywhere -- Using Computers to Solve Problems -- Getting the most out of modern CPUs and GPUs -- Working with special-purpose chips -- Networks: Sharing is more than caring -- Leveraging available data…”
Full text (MFA users only)

Algorithmic composition : a guide to composing music with Nyquist by Simoni, Mary Hope

Full text (MFA users only)

Permutation Group Algorithms by Seress, kos

Full text (MFA users only)

Nature-inspired optimization algorithms by Yang, Xin-She

Full text (MFA users only)

Algorithms in invariant theory by Sturmfels, Bernd, 1962-

Full text (MFA users only)

Introduction to cryptography by Padhye, Sahadeo, Sahu, Rajeev A., Saraswat, Vishal

Table of Contents: “…<P></P><P></P><B><P>Preface </P><P></P><P>Overview of Cryptography</P></B><P>Introduction </P><P>Goals of Cryptography<B> </P></B><P>Classification of Cryptosystem</P><P>Practically Useful Cryptosystem</P><P>Cryptanalysis</P><B><P></P><P>Basic Algebra</P></B><P>Group</P><P>Ring</P><P>Field</P><P>Exercise</P><P></P><B><P>Number Theory</P></B><P>Introduction</P><P>Prime Numbers</P><P>Cardinality of Primes</P><P>Extended Euclidean Algorithm</P><P>Primality Testing</P><P>Factorization and Algorithms for it</P><P>Congruences</P><P>Quadratic Congruence</P><P>Exponentiation and Logarithm</P><P>Discrete Logarithm Problem and Algorithms for it</P><P>Exercise</P><P></P><B><P>Probability and Perfect Secrecy</P></B><P>Basic Concept of Probability </P><P>Birthday Paradox</P><P>Perfect Secrecy</P><P>Vernam One Time Pad</P><P>Random Number Generation</P><P>Pseudo-random Number Generator</P><P>Exercise</P><P></P><B><P>Complexity Theory </P></B><P>Running Time and Size of Input </P><P>Big-O Notation </P><P>Types of algorithm</P><P>Complexity Classes</P><P>Exercise</P><P></P><B><P>Classical Cryptosystems</P></B><P>Classification of Classical Cryptosystem</P><P>Block Cipher</P><P>Stream Cipher</P><P>Cryptanalysis of Cryptosystems</P><P>Exercise</P><P></P><P> </P><B><P>Block Ciphers</P></B><P>Introduction</P><P>Modes of Operation</P><P>Padding</P><P>Design Considerations </P><P>Data Encryption Standard </P><P>Advanced Encryption Standard</P><P>Exercise </P><P></P><B><P>Hash Function </P></B><P>Compression and Hash Functions </P><P>Hash function for cryptography </P><P>Random Oracle Model </P><P>Cryptographic Hash Functions</P><P>Exercise</P><B><P>Public Key Cryptosystem</P></B><P>Introduction </P><P>Diffie-Hellman Key Exchange Protocol </P><P>RSA Cryptosystem</P><P>Rabin Cryptosystem</P><P>ElGamal Cryptosystem</P><P>Elliptic Curve Cryptosystem</P><P>Exercises </P><P></P><B><P>Digital Signature</P></B><P>Formal Definitions </P><P>Attack Goals for Digital Signature</P><P>Digital Signature in Practice</P><P>Some Popular Digital Signatures </P><P>Exercises</P><P></P><B><P>Research Directions in Cryptography </P></B><P>Pairing-Based Cryptography</P><P>Zero-knowledge Proof System</P><P>Authenticated Group Key Exchange</P><P>Attribute-Based Cryptography</P><P>Homomorphic Encryption </P><P>Secure Multi-party Computation</P><P>Secret Sharing</P><P>Post-Quantum Cryptography </P><P>Side-Channel Analysis</P><P>References</P><P>Index</P>…”
Full text (MFA users only)

The Sharing Economy : Implications for the Future of Hospitality and Tourism. by Okumus, Fevzi

Table of Contents: “…Chaos and complexity in tourismStudy tenets -- The sharing economy and tourism -- Peer-to-peer accommodation in Greece -- Methods -- Participants -- Sample determination and collection -- Measures -- Implementation of fuzzy-set qualitative comparative analysis algorithms -- Results -- Sufficient complex statements -- Discussion -- Confirmation of tenets -- Fuzzy-set qualitative comparative analysis versus regression and Cramerâ#x80;#x99;s V -- Fit and predictive validity -- Managerial implications -- Limitations and future research -- References…”
Full text (MFA users only)

Pathway modeling and algorithm research

Table of Contents: “…PATHWAY MODELING AND ALGORITHM RESEARCH; PATHWAY MODELING AND ALGORITHM RESEARCH; Contents; Preface; Biological Pathways and Their Modeling; Abstract; 1. …”
Full text (MFA users only)

Parallel Computing Using the Prefix Problem. by Lakshmivarahan, S.

Table of Contents: “…Preface; Acknowledgments; Part One -- Getting Started; Chapter 1 -- The Prefix Problem And Its Applications; 1.1 The Prefix Problem; 1.2 Why Prefix Problem; 1.3 Exercises; 1.4 Notes and References; Chapter 2 -- Parallel Machines And Models -- An Overview; 2.1 The Need for Parallelism; 2.2 A Classification of Parallel Computers; 2.3 Parallel Models; 2.4 Performance Measures; 2.5 A Parallel Complexity Class; 2.6 Brent's Inequality; 2.7 A Simple Lower Bound; 2.8 Exercises; 2.9 Notes and References; Part Two -- Algorithms For Shared Memory Models.…”
Full text (MFA users only)

Concurrency by Malkhi, Dahlia

Table of Contents: “…TECHNICAL PERSPECTIVES ON LAMPORT'SWORK -- 1. Shared Memory and the Bakery Algorithm -- 2. The Notions of Time and Global State in a Distributed System -- 3. …”
Full text (MFA users only)

An Introduction to Algorithmic Trading : Basic to Advanced Strategies. by Leshik, Edward, Cralle, Jane

Full text (MFA users only)

Structural geology algorithms : vectors and tensors by Allmendinger, Richard Waldron, Cardozo, Nestor, Fisher, Donald M., 1961-

Full text (MFA users only)

Pattern Recognition. by Theodoridis, Sergios

Table of Contents: “…Chapter 13 Clustering Algorithms II: Hierarchical AlgorithmsChapter 14 Clustering Algorithms III: Schemes Based on Function Optimization; Chapter 15 Clustering Algorithms IV; Chapter 16 Cluster Validity; Appendix A Hints from Probability and Statistics; Appendix B Linear Algebra Basics; Appendix C Cost Function Optimization; Appendix D Basic Definitions from Linear Systems Theory; Index.…”
Full text (MFA users only)

Signal processing for 5G : algorithms and implementations

Table of Contents: “…An Introduction to Modulations and Waveforms for 5G Networks / Stefano Buzzi, Alessandro Ugolini, Alessio Zappone, Giulio Colavolpe -- Faster-than-Nyquist Signaling for 5G Communication / John B Anderson -- From OFDM to FBMC: Principles and Comparisons / Wei Jiang, Thomas Kaiser -- Filter Bank Multicarrier for Massive MIMO / Arman Farhang, Nicola Marchetti, Behrouz Farhang-Boroujeny -- Bandwidth-compressed Multicarrier Communication: SEFDM / Izzat Darwazeh, Tongyang Xu, Ryan C Grammenos -- Non-orthogonal Multi-User Superposition and Shared Access / Yifei Yuan -- Non-Orthogonal Multiple Access (NOMA): Concept and Design / Anass Benjebbour, Keisuke Saito, Anxin Li, Yoshihisa Kishiyama, Takehiro Nakamura -- Major 5G Waveform Candidates: Overview and Comparison / Hao Lin, Pierre Siohan -- NEW SPATIAL SIGNAL PROCESSING FOR 5G. …”
Full text (MFA users only)

Graph algorithms and applications 3

Full text (MFA users only)

Optimization of Computer Networks : Modeling and Algorithms: a Hands-On Approach. by Pavón Mariño, Pablo

Table of Contents: “…7.1 Introduction -- 7.2 Node Location Problems -- 7.3 Full Topology Design Problems -- 7.4 Multilayer Network Design -- 7.5 Notes and Sources -- 7.6 Exercises -- References -- Part Two: Algorithms -- Chapter 8: Gradient Algorithms in Network Design -- 8.1 Introduction -- 8.2 Convergence Rates -- 8.3 Projected Gradient Methods -- 8.4 Asynchronous and Distributed Algorithm Implementations -- 8.5 Non-Smooth Functions -- 8.6 Stochastic Gradient Methods -- 8.7 Stopping Criteria -- 8.8 Algorithm Design Hints -- 8.9 Notes and Sources -- 8.10 Exercises -- References…”
Full text (MFA users only)

Introduction to programming : learn to program in Java with data structures, algorithms, and logic by Samoylov, Nick

Full text (MFA users only)

Network and discrete location : models, algorithms, and applications by Daskin, Mark S., 1952-

Full text (MFA users only)