Clever Algorithms : Nature-Inspired Programming Recipes

Clever Algorithms -Nature-Inspired Programming Recipes

TOC
I Background
1 Introduction

2 Stochastic Algorithms
2.1 Overview
2.2 Random Search
2.3 Adaptive Random Search
2.4 Stochastic Hill Climbing
2.5 Iterated Local Search
2.6 Guided Local Search
2.7 Variable Neighborhood Search
2.8 Greedy Randomized Adaptive Search
2.9 Scatter Search
2.10 Tabu Search
2.11 Reactive Tabu Search

3 Evolutionary Algorithms
3.2 Genetic Algorithm
3.3 Genetic Programming
3.4 Evolution Strategies
3.5 Differential Evolution
3.6 Evolutionary Programming
3.7 Grammatical Evolution
3.8 Gene Expression Programming
3.9 Learning Classifier System
3.10 Non-dominated Sorting Genetic Algorithm
3.11 Strength Pareto Evolutionary Algorithm

4 Physical Algorithms
4.1 Overview
4.2 Simulated Annealing
4.3 Extremal Optimization
4.4 Harmony Search
4.5 Cultural Algorithm
4.6 Memetic Algorithm

5 Probabilistic Algorithms
5.2 Population-Based Incremental Learning
5.3 Univariate Marginal Distribution Algorithm
5.4 Compact Genetic Algorithm
5.5 Bayesian Optimization Algorithm
5.6 Cross-Entropy Method

6 Swarm Algorithms
6.2 Particle Swarm Optimization
6.3 Ant System
6.4 Ant Colony System
6.5 Bees Algorithm
6.6 Bacterial Foraging Optimization Algorithm

7 Immune Algorithms
7.2 Clonal Selection Algorithm
7.3 Negative Selection Algorithm
7.4 Artificial Immune Recognition System
7.5 Immune Network Algorithm
7.6 Dendritic Cell Algorithm

8 Neural Algorithms
8.2 Perceptron
8.3 Back-propagation
8.4 Hopfield Network
8.5 Learning Vector Quantization
8.6 Self-Organizing Map

III Extensions
9 Advanced Topics
9.1 Programming Paradigms
9.2 Devising New Algorithms
9.3 Testing Algorithms
9.4 Visualizing Algorithms
9.5 Problem Solving Strategies
9.6 Benchmarking Algorithms

Download From

Link1

Beej’s Guide to Network Programming – Using Internet Socket

 Beej’s Guide to Network Programming – Using Internet Socket

Contents :

1. Intro

2. What is a socket?
2.1. Two Types of Internet Sockets
2.2. Low level Nonsense and Network Theory

3. IP Addresses, structs, and Data Munging
3.1. IP Addresses, versions 4 and 6
3.2. Byte Order
3.3. structs
3.4. IP Addresses, Part Deux

4. Jumping from IPv4 to IPv6

5. System Calls or Bust
5.1. getaddrinfo()—Prepare to launch!
5.2. socket()—Get the File Descriptor!
5.3. bind()—What port am I on?
5.4. connect()—Hey, you!
5.5. listen()—Will somebody please call me?
5.6. accept()—”Thank you for calling port 3490.”
5.7. send() and recv()—Talk to me, baby!
5.8. sendto() and recvfrom()—Talk to me, DGRAM-style
5.9. close() and shutdown()—Get outta my face!
5.10. getpeername()—Who are you?
5.11. gethostname()—Who am I?

6. Client-Server Background
6.1. A Simple Stream Server
6.2. A Simple Stream Client
6.3. Datagram Sockets

7. Slightly Advanced Techniques
7.1. Blocking
7.2. select()—Synchronous I/O Multiplexing
7.3. Handling Partial send()s
7.4. Serialization—How to Pack Data
7.5. Son of Data Encapsulation
7.6. Broadcast Packets—Hello, World!

8. Common Questions

9. Man Pages
9.1. accept()
9.2. bind()
9.3. connect()
9.4. close()
9.5. getaddrinfo(), freeaddrinfo(), gai_strerror()
9.6. gethostname()
9.7. gethostbyname(), gethostbyaddr()
9.8. getnameinfo()
9.9. getpeername()
9.10. errno
9.11. fcntl()
9.12. htons(), htonl(), ntohs(), ntohl()
9.13. inet_ntoa(), inet_aton(), inet_addr
9.14. inet_ntop(), inet_pton()
9.15. listen()
9.16. perror(), strerror()
9.17. poll()
9.18. recv(), recvfrom()
9.19. select()
9.20. setsockopt(), getsockopt()
9.21. send(), sendto()
9.22. shutdown()
9.23. socket()
9.24. struct sockaddr and pals

10. More References

Read Online

Link1

Android Programming with Tutorials from the anddev.org-Community

Android Programming with Tutorials from the anddev.org-Community

This document was written for developers who have worked with Java™ before and want to start developing for the Android Platform. I tried to make this as much “hands on” as possible, placing example codes everywhere it fit. Also I tried to insert as many picture as possible, because they liven up the learning process and relax the reader’s eyes.
But unfortunately coding is not everything; one has to learn about some basic facts of the Android Platform to fully understand. That is what is described on the first ~XXX pages. It is not necessary to read all those describing pages, but it is preferable. You could decide to treat it as a kind of reference. What you would read there is also explained when it occurs during the “hands on”-process. So you could directly start at Hello World – The Android Way.

Download From

Link1

Programming VB .NET: A Guide for Experienced Programmers By Gary Cornell, Jonath

Programming VB .NET: A Guide for Experienced Programmers By Gary Cornell, Jonath

In Programming VB .NET: A Guide for  Experienced Programmers, authors Gary Cornell and Jonathan Morrison  carefully explain the exciting new features of Visual Basic .NET. Since VB  .NET is, for all practical purposes, a whole new language even for the  most experienced Visual Basic programmers, developers need to think  differently about many familiar topics. Cornell and Morrison are there  to help you with careful discussions of each topic.

All experienced programmers wishing to take advantage of the amazing new powers of VB  .NET will benefit from this books careful treatment of fundamental  topics, including inheritance, interfaces, and exception handling, as  well as all the powerful new features, such as stream-based I/O and true  multithreading.

Cornell and Morrison write from the point of view of the experienced  programmer, with constant references to the changes from earlier  versions of VB. Developers learn how to use VB .NET for database programming through ADO.NET and web programming through ASP.NET. After reading Programming VBVB .NET language and its uses in creating powerful .NET applications.      .NET: A Guide for Experienced Programmers, developers will have a firm grasp of the exciting new

Download From

Link1

Java Network Programming By Elliotte Rusty Harold

 

Java Network Programming By Elliotte Rusty Harold

Java Network Programming, 2nd Edition, is a complete introduction to developing network programs (both applets and applications) using Java, covering everything from Networking fundamentals to remote method invocation (RMI). It includes chapters on TCP and UDP sockets, multicasting protocol and content handlers, and servlets. This second edition also includes coverage of Java 1.1, 1.2 and 1.3. New chapters cover multithreaded network programming, I/O, HTML parsing and display, the Java Mail API, the Java Secure Sockets Extension, and more.

Download From

Link1

Link2

 

A Primer on Scientific Programming with Python

A Primer on Scientific Programming with Python

Don’t be fooled by the title or the first chapter, this book provides a solid introduction for using Python in scientific applications. The main application areas covered are calculating the value of functions, both built in and user supplied, plotting data, finding the roots of equations, difference equations, numerical differentiation, numerical integration and the solution to differential equations by numerical methods.

Along the way you will learn how to use lists, tuples, dictionaries, loops, list comprehension, lambda functions, Numpy arrays, file I/O and Python Classes for programming scientific applications. Two main highlights of the book are the thorough explanations the author provides on how to use most of the features of Python and the copious number of examples with answers. Other features are an example on how to extract data from a Web Page and scitools. Scitools provides a Matlab type of interface to gnuplot. About the only thing missing is a summary on how to install Numpy, Scipy, Scitools, gunplot, and gnuplotpy.

Download A Primer on Scientific Programming with Python Link 1
Download A Primer on Scientific Programming with Python Link 2

Linear Programming : Foundations and Extensions – Lecture Notes

 

Linear Programming : Foundations and Extensions – Lecture Notes

TOC

Part 1: Basic Theory – The Simplex Method and Duality
1. Introduction
2. The Simplex Method
3. Degeneracy
4. Efficiency of the Simplex Method
5. Duality Theory
6. The Simplex Method in Matrix Notation
7. Sensitivity and Parametric Analyses
8. Implementation Issues
9. Problems in General Form
10. Convex Analysis
11. Game Theory
12. Regression


Part 2: Network-Type Problems
13. Network Flow Problems
14. Applications
15. Structural Optimization

Part 3: Interior-Point Methods
16. The Central Path
17. A Path-Following Method
18. The KKT System
19. Implementation Issues
20. The Affine-Scaling Method
21. The Homogeneous Self-Dual Method

Part 4: Extensions
22. Integer Programming
23. Quadratic Programming
24. Convex Programming

Download          :           link