Models and simulations of all kinds are tools for dealing with reality. Humans have always used mental models to better understand the world around them: to make plans, to consider different possibilities, to share ideas with others, to test changes, and to determine whether or not the development of an idea is feasible. The book Modeling and Simulation uses exactly the same approach except that the traditional mental model is translated into a computer model, and the simulations of alternative outcomes under varying conditions are programmed on the computer. The advantage of this method is that the computer can track the multitude of implications and consequences in complex relationships much more quickly and reliably than the human mind. This unique interdisciplinary text not only provides a self contained and complete guide to the methods and mathematical background of modeling and simulation software (SIMPAS) and a collection of 50 systems models on an accompanying diskette. Students from fields as diverse as ecology and economics will find this clear interactive package an instructive and engaging guide.

Simulation overview; Evolution of modern computer simulation; Simulation in the real world; Six symptoms of a sick simulation; The professional simulation analyst; Building a simulation the right way; Learning a simulation language; Simple queuing systems; Advanced topics; Applying the process.

​​​​​​​​​​​​​​​​​Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.​

Techniques in Protein Chemistry VI, an invaluable bench-top reference source for protein chemists, highlights current methods in the following areas: - Protein sequencing and amino acid analysis - Mass spectral analysis of peptides and proteins - Posttranslational processing - High-sensitivity protein and peptide separations - Protein folding and NMR - Analysis of protein interactions - Protein design and engineeringTechniques in Protein Chemistry VI, an invaluable bench-top reference source for protein chemists, highlights current methods in the following areas: - Protein sequencing and amino acid analysis - Mass spectral analysis of peptides and proteins - Posttranslational processing - High-sensitivity protein and peptide separations - Protein folding and NMR - Analysis of protein interactions - Protein design and engineering