Numerical Simulations and Case Studies Using Visual C++.Net

by Salleh, Shaharuddin; Zomaya, Albert Y.; Olariu, Stephan; Sanugi, Bahrom

• ISBN13: 9780471694618
• ISBN10: 0471694614
• Edition: 1st
• Format: Hardcover
• Copyright: 2005-06-23
• Publisher: Wiley-Interscience

Summary

Readers learn how to master the numerical simulation process required to design, test and support mobile and parallel computing systems. By presenting a series of straightforward program examples as a foundation, the authors show how problems in numerical methods and simulations are skillfully solved with the aid of Visual C++.

Author Biography

SHAHARUDDIN SALLEH, PhD, is Associate Professor, Computational Mathematics Department, Universiti Teknologi Malaysia. He has widely published research articles and books in parallel computing algorithms, mobile computing, intelligent systems, and numerical/combinatorial optimization problems. <p>ALBERT Y. ZOMAYA, PhD, is CISCO Systems Chair Professor of Internetworking, School of Information Technologies, The University of Sydney. His research interests include high-performance computing, parallel algorithms, mobile computing, networking, and bioinformatics. He is a Fellow of the IEEE. <p>STEPHAN OLARIU, PhD, is Professor, Computer Science, Old Dominion University. His research focuses on image processing and machine vision, parallel architectures, design and analysis of parallel algorithms, computational graph theory, computational geometry, and mobile computing. <p>BAHROM SANUGI, PhD, is Professor, Numerical Analysis and Computing, Universiti Teknologi Malaysia. His research interests include neural networks and numerical algorithms.

Table of Contents

Preface	xi
1 Developing Applications Using Visual C++.Net	1	(18)
1.1 Object-Oriented Approach to Visual C++.Net	1	(2)
Managed Extension Features	2	(1)
1.2 MFC Fundamental Features	3	(3)
Graphics Device Interface	4	(1)
GDI Functions	5	(1)
Numerical Functions	6	(1)
1.3 Writing Applications Using MFC	6	(3)
Creating a New Project	7	(1)
Creating a Window	8	(1)
1.4 Writing the First Nonwizard Program	9	(7)
1.5 Discussion	16	(1)
Windows Creation Process	16	(1)
1.6 Summary and Conclusion	17	(1)
Bibliography	17	(2)
2 Interfaces for Numerical Problems	19	(38)
2.1 Visualizing a Numerical Problem	19	(3)
The Art of Visualization	20	(2)
2.2 Handling Arrays	22	(2)
Dynamic Memory Allocation	23	(1)
2.3 Finding the Root of a Nonlinear Equation	24	(7)
Code2A: Bisection Iterative Method	26	(5)
2.4 Solving a System of Linear Equations	31	(17)
Code2B: Manual Approach to the SLE Problem	33	(5)
Code2C: Resource File Approach for SLE	38	(10)
2.5 Summary and Conclusion	48	(1)
Bibliography	49	(1)
Code Listings	49	(8)
Code2A: Bisection Method	49	(2)
Code2B: Solving a System of Linear Equations	51	(2)
Code2C: Resource File Approach to the SLE Problem	53	(4)
3 Matrix Operations Using Wizard	57	(36)
3.1 Document/View Architecture Using Wizard	57	(1)
3.2 Matrix Algebra	58	(15)
Data Passing Between Functions	59	(1)
Matrix Multiplication	60	(1)
Finding the Inverse of a Matrix	61	(2)
Code3A: Matrix Operations	63	(10)
3.3 System of Linear Equations Problem Revisited	73	(11)
Code3B: Solving the SLE Problem Using Wizard	74	(9)
Code3B: Discussion	83	(1)
3.4 Summary and Conclusion	84
Bibliography	83	(1)
Code Listings	84	(9)
Code3AView: Matrix Operations	84	(5)
Code3BView: System of Linear Equations	89	(4)
4 Differential Equations Problems	93	(30)
4.1 Differential Equations	93	(1)
4.2 Ordinary Differential Equatipns	94	(7)
Fourth-order Runge-Kutta Method (RK4)	95	(1)
Code4A: Small Window for Displaying Large Amounts of Data	96	(5)
4.3 Partial Differential Equations	101	(13)
Poisson Equation: Finite Difference Method	102	(5)
Code4B: Solving the Poisson Equation	107	(7)
4.4 Summary and Conclusion	114	(1)
Bibliography	115	(1)
Code Listings	115	(8)
Code4A: Runge-Kutta Method for ODE	115	(3)
Code4B: Poisson Equation Using the Finite Difference Method	118	(5)
5 Drawing Curves	123	(34)
5.1 Windows Graphics Representation	123	(2)
Windows Coordinates System	124	(1)
5.2 MFC Functions for Displaying Graphics	125	(4)
Color Schemes	126	(1)
Selecting an Object	127	(1)
Filling a Rectangular Area with a Color	127	(1)
Plotting a Point	128	(1)
Drawing a Line	128	(1)
Drawing an Object	129	(1)
5.3 Drawing a Curve	129	(10)
Code5A: Mathematical Curves	130	(4)
Drawing a Polynomial	134	(1)
Drawing a Lemniscate	135	(2)
Drawing Creative Net	137	(2)
5.4 Cubic Spline Interpolation	139	(8)
Code5B: Constructing a Cubic Spline	141	(6)
5.5 Summary and Conclusion	147	(1)
Bibliography	148	(1)
Code Listings	148	(9)
Code5A: Mathematical Curves	148	(4)
Code5B: Natural Cubic Spline	152	(5)
6 Working with Images	157	(22)
6.1 Handling Images	157	(1)
6.2 Bitmap File Format	158	(8)
Raster Operations Involving Bit Shifting	159	(2)
Code6A: Demonstrating Bit Shifting	161	(5)
6.3 Edge-Detection Problem	166	(7)
Sobel Filtering Method	168	(1)
Laplacian Filtering Method	169	(1)
Code6B: Detecting the Edges of an Image	170	(3)
6.4 Summary and Conclusion	173	(1)
Bibliographical Note	173	(1)
Code Listings	173	(6)
Code6A: Working with Colors	173	(2)
Code6B: Edge Detection Problem	175	(4)
7 Visualizing a Graph	179	(34)
7.1 Elementary Graph Concepts	179	(4)
7.2 Graph Visualization Model	183	(8)
Code7A: Drawing a Graph	183	(8)
7.3 Minimum Spanning Tree Problem	191	(12)
Kruskal's Algorithm	193	(1)
Prim's Algorithm	194	(1)
Code7B: Visualizing the Minimum Spanning Tree	195	(8)
7.4 Summary and Conclusion	203	(1)
Bibliography	204	(1)
Code Listings	204	(9)
Code7A: Drawing a Graph	204	(4)
Code7B: Minimum Spanning Tree	208	(5)
8 Graph Applications	213	(34)
8.1 Graph-Network Relationship	213	(1)
8.2 Shortest-Path Problem	214	(13)
Dijkstra's Algorithm	215	(1)
Thd Floyd-Warshall Algorithm	216	(1)
Code8A: Shortest-Path Visualization	217	(10)
8.3 Mesh Network Application	227	(7)
Code8B: Shortest Path on a Mesh Network	229	(5)
8.4 Summary and Conclusion	234	(1)
Bibliography	235	(1)
Code Listings	235	(12)
Code8A: Shortest Path in a Graph	235	(5)
Code8B: Shortest Paths in a Mesh Network	240	(7)
9 Multiprocessor Scheduling Problem	247	(34)
9.1 Parallel Computing Systems	247	(2)
9.2 Task Scheduling Problem	249	(5)
Task Scheduling Concepts	252	(1)
Path Maximum Magnitude Scheduling Model	253	(1)
9.3 Task Scheduling Visualization Model	254	(16)
9.4 Summary and Conclusion	270	(1)
Bibliography	271	(1)
Code Listings	271	(10)
Code9: Task Scheduling Using Four Processors	271	(10)
10 Discrete-Event Simulation	281	(40)
10.1 Concepts of Simulation	281	(1)
10.2 Simulation Model Development	282	(1)
10.3 Discrete-Event System Simulations	283	(3)
10.4 Multicounter System with Blocking	286	(9)
Our Scheduling Model	286	(2)
Code10A: Simulating Multicounter Systems	288	(7)
10.5 Queueing Systems	295	(13)
M/M/1 Queueing System	295	(2)
M/M/C Queueing System	297	(2)
Code10B: Simulating the M/M/C System	299	(9)
10.6 Summary and Conclusion	308	(1)
Bibliography	309	(1)
Code Listings	309	(12)
Code10A: Discrete-Event Simulation with Blocking	309	(4)
Code10B: M/M/C Queuing without Blocking	313	(8)
11 Modeling Wireless Networks	321	(34)
11.1 Wireless Cellular Networks	321	(2)
11.2 Channel-Assignment Problem	323	(2)
11.3 Channel Assignments: Discrete Model	325	(11)
Code11A: Channels for Mobile Users	326	(10)
11.4 Solving the Channel-Assignment Problem	336	(6)
Code11B: Solving the Channel-Assignment Problem	336	(6)
11.5 Summary and Conclusion	342	(1)
Bibliography	343	(1)
Code Listings	343	(12)
Code11A: Channel Assignments to Mobile Users	343	(6)
Code11B: Channel-Assignment Problem	349	(6)
Index	355