Search Results - (((((((ant OR kwanta) OR wants) OR markant) OR cantor) OR anne) OR share) OR hints) algorithms.

Handbook of operations research in natural resources

Full text (MFA users only)

Compressed sensing : theory and applications

Full text (MFA users only)

Information Networking in Asia

Full text (MFA users only)

Lead generation for dummies by Rothman, Dayna

Table of Contents: “…Creating an Internal Blogging ProgramChapter 9: Creating Lasting Relationships Through Social Media; Sharing on Social Media; Getting the Most out of Facebook; Leveraging Twitter; Engaging Through LinkedIn; Building Your Google+ Presence; Getting Visual with Pinterest; Attracting Attention with SlideShare; Chapter 10: Getting Found Through Search Engine Optimization; Maximizing Different Traffic Sources; Knowing Your Search Engines; Making the Most out of Google Algorithm Updates; Choosing Your Keywords; Perfecting On-Page SEO; Utilizing Links in a Natural Way.…”
Full text (MFA users only)

Global optimization methods in geophysical inversion by Sen, Mrinal K.

Table of Contents: “…5.6 Multimodal fitness functions, genetic drift, GA with sharing, and repeat (parallel) GA -- 5.7 Uncertainty estimates -- 5.8 Evolutionary programming -- a variant of GA -- 5.9 Summary -- 6 Other stochastic optimization methods -- 6.1 The neighborhood algorithm (NA) -- 6.1.1 Voronoi diagrams -- 6.1.2 Voronoi diagrams in SA and GA -- 6.1.3 Neighborhood sampling algorithm -- 6.2 Particle swarm optimization (PSO) -- 6.3 Simultaneous perturbation stochastic approximation (SPSA) -- 7 Geophysical applications of simulated annealing and genetic algorithms -- 7.1 1D seismic waveform inversion -- 7.1.1 Application of heat bath SA -- 7.1.2 Application of GAs -- 7.1.3 Real-data examples -- 7.1.4 Hybrid GA/LI inversion using different measures of fitness -- 7.1.5 Hybrid VFSA inversion using different strategies -- 7.2 Prestack migration velocity estimation -- 7.2.1 1D earth structure -- 7.2.2 2D earth structure -- 7.2.3 Multiple and simultaneous VFSA for imaging -- 7.3 Inversion of resistivity sounding data for 1D earth models -- 7.3.1 Exact parameterization -- 7.3.2 Overparameterization with smoothing -- 7.4 Inversion of resistivity profiling data for 2D earth models -- 7.4.1 Inversion of synthetic data -- 7.4.2 Inversion of field data -- 7.5 Inversion of magnetotelluric sounding data for 1D earth models -- 7.6 Stochastic reservoir modeling -- 7.7 Seismic deconvolution by mean field annealing (MFA) and Hopfield network -- 7.7.1 Synthetic example -- 7.7.2 Real-data example -- 7.8 Joint inversion -- 7.8.1 Joint travel time and gravity inversion -- 7.8.2 Time-lapse (4D) seismic and well production joint inversion -- 8 Uncertainty estimation -- 8.1 Methods of numerical integration -- 8.1.1 Grid search or enumeration -- 8.1.2 Monte Carlo integration -- 8.1.3 Importance sampling -- 8.1.4 Multiple MAP estimation -- 8.2 Simulated annealing: the Gibbs sampler.…”
Full text (MFA users only)

Limits, Limits Everywhere : the Tools of Mathematical Analysis by Applebaum, David, 1956-

Table of Contents: “…Continued Fractions; 9.1 Euclid's Algorithm; 9.2 Rational and Irrational Numbers as Continued Fractions; 10. …”
Full text (MFA users only)

Legitimate applications of peer to peer networks by Verma, Dinesh C.

Table of Contents: “…-- Organization of the Book -- 1 The Peer-to-Peer Architecture -- 1.1 Distributed Applications -- 1.1.1 A Distributed Computing Example -- 1.1.2 Client-Server Architecture -- 1.1.3 Peer-to-Peer Architecture -- 1.2 The Peer-to-Peer Software Structure -- 1.2.1 Base Overlay Layer -- 1.2.2 Middleware Functions -- 1.2.3 Application Layer -- 1.3 Comparison of Architectures -- 1.3.1 Ease of Development -- 1.3.2 Manageability -- 1.3.3 Scalability -- 1.3.4 Administrative Domains -- 1.3.5 Security -- 1.3.6 Reliability -- 2 Peer Discovery and Overlay Formation -- 2.1 Discovery -- 2.1.1 Static Configuration -- 2.1.2 Centralized Directory -- 2.1.3 Using the Domain Name Service -- 2.1.4 Member Propagation Techniques with Initial Member Discovery -- 2.2 Overlay Formation -- 2.2.1 Creating an Overlay Link -- 2.3 Topology Selection -- 2.3.1 Random Mesh Formation -- 2.3.2 Tiered Formation -- 2.3.3 Ordered Lattices -- 3 Application-Layer Multicast -- 3.1 General Multicast Techniques -- 3.1.1 Group Addressing -- 3.1.2 Group Maintenance -- 3.1.3 Message Forwarding Scheme -- 3.1.4 Multicast Routing -- 3.1.5 Secure Multicast -- 3.1.6 Reliable Multicast -- 3.1.7 Multicast Flow and Congestion Control -- 3.2 Network-Layer Multicast"IP Multicast -- 3.2.1 Problems with IP-Layer Multicast -- 3.3 Application-Layer Multicast -- 3.3.1 Broadcast Mechanisms in Peer-to-Peer Networks -- 3.3.2 Multicast in Peer-to-Peer Overlays -- 4 File-Sharing Applications -- 4.1 File-Sharing Overview -- 4.1.1 Disk Space Management -- 4.1.2 File Indexing -- 4.1.3 File Search/Retrieval -- 4.1.4 Access Control and Security -- 4.1.5 Anonymous File Retrieval -- 4.1.6 Search Acceleration Techniques -- 4.1.7 Digital Rights Management -- 4.2 Usage of File-Sharing Applications -- 4.2.1 Limitations of File-Sharing Applications -- 4.3 Preventing Unauthorized File Sharing -- 4.3.1 Firewall-Based Techniques -- 4.3.2 Asset Inventory -- 4.3.3 Port Scanning -- 4.3.4 Usage-Based Rate Control -- 4.3.5 Malicious Participation -- 5 File Storage Service -- 5.1 Handle Management -- 5.2 Retrieving Files with Handles -- 5.2.1 Circular Ring Routing -- 5.2.2 Plaxton Scheme -- 5.2.3 CAN Routing Algorithm -- 5.2.4 Modified Network Routing Schemes -- 5.2.5 Modified Broadcast -- 5.3 Miscellaneous Functions -- 5.3.1 Access Control -- 5.3.2 Availability and Reliability -- 5.4 Usage Scenarios -- 5.4.1 Distributed File Systems -- 5.4.2 Anonymous Publishing -- 6 Data Backup Service -- 6.1 The Traditional Data Management System -- 6.2 The Peer-to-Peer Data Management System -- 6.2.1 The Backup/Restore Manager -- 6.2.2 The Peer Searcher -- 6.2.3 The File Searcher -- 6.2.4 The Properties Manager -- 6.2.5 The Data Manager -- 6.2.6 The Schedule Manager -- 6.3 Security Issues -- 6.4 Hybrid Data Management Approach -- 6.5 Feasibility of Peer-to-Peer Data Backup Service -- 7 Peer-to-Peer Directory System -- 7.1 LDAP Dir.…”
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: “…; Disrupting the Market; The Power of Algorithms; Beyond the Digital Age; Chapter 12 Don't Become a Human Bot!…”
Full text (MFA users only)

Sentient Enterprise The Evolution of Business Decision-making.

Full text (MFA users only)

Microbiological sensors for the drinking water industry

Full text (MFA users only)

Artificial intelligence with Python : build real-world artificial intelligence applications with Python to intelligently interact with the world around you by Joshi, Prateek

Full text (MFA users only)

Multicriteria decision aid and artificial intelligence : links, theory and applications by Doumpos, Michael

Full text (MFA users only)

Regression Analysis with Python. by Massaron, Luca, Boschetti, Alberto

Full text (MFA users only)

Hack proofing your network

Table of Contents: “…</br><br> Knowing What To Expect in the Rest of This Book</br><br> Understanding the Current Legal Climate</br><br> Summary</br><br> Frequently Asked Questions</br><br>Chapter 2 The Laws of Security</br><br> Introduction</br><br> Knowing the Laws of Security</br><br> Client-Side Security Doesn't Work</br><br> You Cannot Securely Exchange Encryption Keys without a Shared Piece of Information</br><br> Malicious Code Cannot Be 100 Percent Protected against</br><br> Any Malicious Code Can Be Completely Morphed to Bypass Signature Detection</br><br> Firewalls Cannot Protect You 100 Percent from Attack</br><br> Social Engineering</br><br> Attacking Exposed Servers</br><br> Attacking the Firewall Directly</br><br> Client-Side Holes</br><br> Any IDS Can Be Evaded</br><br> Secret Cryptographic Algorithms Are Not Secure</br><br> If a Key Is Not Required, You Do Not Have Encryption-You Have Encoding</br><br> Passwords Cannot Be Securely Stored on the Client Unless There Is Another Password to Protect Them</br><br> In Order for a System to Begin to Be Considered Secure, It Must Undergo an Independent Security Audit</br><br> Security through Obscurity Does Not Work</br><br> Summary </br><br> Solutions Fast Track</br><br> Frequently Asked Questions</br><br>Chapter 3 Classes of Attack</br><br> Introduction</br><br> Identifying and Understanding the Classes of Attack </br><br> Denial of Service</br><br> Information Leakage</br><br> Regular File Access</br><br> Misinformation</br><br> Special File/Database Access</br><br> Remote Arbitrary Code Execution</br><br> Elevation of Privileges</br><br> Identifying Methods of Testing for Vulnerabilities</br><br> Proof of Concept</br><br> Standard Research Techniques</br><br> Summary</br><br> Solutions Fast Track</br><br> Frequently Asked Questions</br><br>Chapter 4 Methodology</br><br> Introduction</br><br> Understanding Vulnerability Research Methodologies</br><br> Source Code Research</br><br> Binary Research</br><br> The Importance of Source Code Reviews</br><br> Searching Error-Prone Functions</br><br> Reverse Engineering Techniques</br><br> Disassemblers, Decompilers, and Debuggers</br><br> Black Box Testing</br><br> Chips</br><br> Summary</br><br> Solutions Fast Track</br><br> Frequently Asked Questions</br><br>Chapter 5 Diffing</br><br> Introduction</br><br> What Is Diffing?…”
Full text (MFA users only)

Insight into Theoretical and Applied Informatics : Introduction to Information Technologies and Computer Science. by Yatsko, Andrzej

Full text (MFA users only)

Automatic Modeling and Fault Diagnosis of Timed Concurrent Discrete Event Systems : Automatische Modellierung und Fehlerdiagnose Zeitlicher Nebenläufiger Ereignisdiskreter Systeme.... by Schneider, Stefan

Table of Contents: “…3.3.3 Precision and Completeness Properties3.3.4 Identification Parameters; 3.4 Timed Distributed Modeling; 3.5 Identification of Timed Distributed Models; 3.5.1 Timed Distributed Identification Approach; 3.5.2 Precision and Completeness Properties; 3.5.3 Discussion on Shared I/Os; 3.6 Identification of Timed Distributed BMS Models; 3.6.1 Data Collection; 3.6.2 Timed Distributed Identification; 4 Partitioning of DES Models; 4.1 Preliminaries; 4.2 Causal Partitioning; 4.2.1 Distance and Causality; 4.2.2 Causal Partitioning Algorithm; 4.3 Optimal Partitioning; 4.3.1 Optimization Approach.…”
Full text (MFA users only)

Combinatorial and Computational Mathematics : Present and Future.

Table of Contents: “…2 LIST OF APPLICABLE MATHEMATICS IN SOCIAL SCIENCE3 SOCIAL WELFARE FUNCTIONS (SWF); 4 PROSPECTS; 5 OPEN PROBLEMS; References; Twelve Views of Matroid Theory; INTRODUCTION; 1 LINEAR DEPENDENCE WITHOUT SCALARS; 2 BASIS EXCHANGE PROPERTIES; 3 GEOMETRIC LATTICES; 4 GRAPH THEORY WITHOUT VERTICES; 5 GRAPH THEORY AND LEAN LINEAR ALGEBRA; 6 VARIETIES OF FINITE MATROIDS; 7 SECRET-SHARING MATROIDS; 8 GREEDY ALGORITHMS, MATROID INTERSECTION, AND MATROID PARTITION; 9 MATRIX MULTIPLICATION AND THE CAUCHY-BINET IDENTITY; 10 BASIS GENERATING FUNCTIONS AND THE MATRIX-TREE THEOREM…”
Full text (MFA users only)

Language, vision, and music : selected papers from the 8th International Workshop on the Cognitive Science of Natural Language Processing, Galway, Ireland, 1999

Full text (MFA users only)

Applied Artificial Intelligence : Proceedings of the 7th International FLINS Conference. by Arena, Paolo, Fortuna, Luigi

Table of Contents: “…An extended branch-and-bound algorithm for fuzzy linear bilevel programming / G. …”
Full text (MFA users only)

Biological systematics : principles and applications by Brower, Andrew V. Z. (Andrew Van Zandt), 1962-, Schuh, Randall T.

Full text (MFA users only)