|
Part I Practical Applications of Modern Heuristic Methods |
|
|
|
1 Data Mining Approach for Decision and Classification Systems Using Logic Synthesis Algorithms |
|
|
3 | (22) |
|
|
|
3 | (2) |
|
1.2 Information Systems and Decision Systems |
|
|
5 | (1) |
|
1.3 Indiscernibility and Compatibility Relation |
|
|
6 | (3) |
|
|
9 | (5) |
|
1.4.1 Redundancy of Information System |
|
|
9 | (2) |
|
1.4.2 Redundancy of Decision System |
|
|
11 | (3) |
|
1.5 Induction of Decision Rules |
|
|
14 | (1) |
|
1.6 Algorithm of Complementation |
|
|
15 | (3) |
|
1.7 Hierarchical Decision-Making |
|
|
18 | (7) |
|
|
21 | (4) |
|
2 Fast Algorithm of Attribute Reduction Based on the Complementation of Boolean Function |
|
|
25 | (18) |
|
|
|
|
25 | (2) |
|
|
27 | (2) |
|
2.3 Elimination of Input Variables |
|
|
29 | (2) |
|
2.4 Computing Minimal Sets of Attributes Using COMPLEMENT Algorithm |
|
|
31 | (5) |
|
2.4.1 Unate Complementation |
|
|
33 | (3) |
|
|
36 | (2) |
|
|
38 | (5) |
|
|
39 | (4) |
|
3 Multi-GPU Tabu Search Metaheuristic for the Flexible Job Shop Scheduling Problem |
|
|
43 | (18) |
|
|
|
|
|
43 | (1) |
|
|
44 | (3) |
|
|
45 | (1) |
|
3.2.2 Combinatorial Model |
|
|
46 | (1) |
|
3.3 Flexible Job Shop Problem |
|
|
47 | (4) |
|
3.3.1 Problem Formulation |
|
|
47 | (2) |
|
|
49 | (2) |
|
3.4 Determination of the Cost Function |
|
|
51 | (2) |
|
|
53 | (2) |
|
|
55 | (3) |
|
3.6.1 GPU Implementation Details |
|
|
55 | (1) |
|
3.6.2 Computational Experiments |
|
|
56 | (2) |
|
|
58 | (3) |
|
|
59 | (2) |
|
4 Stable Scheduling with Random Processing Times |
|
|
61 | (18) |
|
|
|
|
|
61 | (1) |
|
4.2 Problem Definition and Method of Its Solution |
|
|
62 | (1) |
|
4.2.1 Single Machine Scheduling Problem |
|
|
62 | (1) |
|
4.3 Problem Description and Preliminaries |
|
|
63 | (7) |
|
4.3.1 The Tabu Search Method |
|
|
67 | (1) |
|
4.3.2 Movement and Neighborhood |
|
|
68 | (1) |
|
4.3.3 The Tabu Moves List |
|
|
69 | (1) |
|
4.4 Stochastic Processing Times |
|
|
70 | (3) |
|
4.4.1 Normal Distribution |
|
|
71 | (1) |
|
4.4.2 The Erlang's Distribution |
|
|
72 | (1) |
|
4.5 The Algorithms' Stability |
|
|
73 | (1) |
|
4.6 The Calculation Experiments |
|
|
74 | (2) |
|
|
76 | (3) |
|
|
76 | (3) |
|
5 Neural Networks Based Feature Selection in Biological Data Analysis |
|
|
79 | (16) |
|
|
|
|
|
79 | (2) |
|
5.2 Unsupervised Clustering and Matching Factor |
|
|
81 | (3) |
|
5.2.1 Matching Factor Calculation |
|
|
82 | (1) |
|
|
83 | (1) |
|
5.3 Feature Selection System |
|
|
84 | (2) |
|
5.3.1 Cross Feature Selection Method |
|
|
84 | (2) |
|
5.3.2 Classifier in Feature Space |
|
|
86 | (1) |
|
|
86 | (5) |
|
|
88 | (3) |
|
5.5 Results and Conclusion |
|
|
91 | (4) |
|
|
93 | (2) |
|
6 On the Identification of Virtual Tumor Markers and Tumor Diagnosis Predictors Using Evolutionary Algorithms |
|
|
95 | (28) |
|
|
|
|
|
|
|
|
6.1 Introduction and Research Goals |
|
|
96 | (2) |
|
6.1.1 Identification of Virtual Tumor Markers |
|
|
96 | (1) |
|
6.1.2 Identification of. Tumor Diagnosis Estimators |
|
|
97 | (1) |
|
6.1.3 Organization of This Chapter |
|
|
98 | (1) |
|
|
98 | (3) |
|
|
101 | (6) |
|
|
102 | (1) |
|
|
102 | (1) |
|
6.3.3 Artificial Neural Networks |
|
|
103 | (1) |
|
6.3.4 Support Vector Machines |
|
|
103 | (1) |
|
6.3.5 Hybrid Modeling Using Machine Learning Algorithms and Evolutionary Algorithms for Parameter Optimization and Feature Selection |
|
|
103 | (2) |
|
6.3.6 Genetic Programming |
|
|
105 | (2) |
|
6.4 Empirical Study: Identification of Models for Tumor Markers |
|
|
107 | (6) |
|
|
107 | (1) |
|
6.4.2 Test Series and Results |
|
|
108 | (5) |
|
6.5 Empirical Study: Identification of Models for Tumor Diagnoses |
|
|
113 | (5) |
|
|
113 | (1) |
|
6.5.2 Test Series and Results |
|
|
113 | (5) |
|
|
118 | (5) |
|
|
119 | (4) |
|
7 Affinity Based Slotting in Warehouses with Dynamic Order Patterns |
|
|
123 | (22) |
|
|
|
|
|
|
123 | (1) |
|
7.2 Introduction to Slotting |
|
|
124 | (5) |
|
|
126 | (1) |
|
7.2.2 Slotting by Turnover Based Metrics |
|
|
126 | (1) |
|
7.2.3 Slotting by Affinity |
|
|
126 | (1) |
|
7.2.4 Pick Frequency / Part Affinity Score |
|
|
127 | (2) |
|
7.3 Multi-period Warehouse Slotting |
|
|
129 | (3) |
|
|
130 | (1) |
|
|
131 | (1) |
|
7.3.3 M-SLAP: Optimization and Evaluation |
|
|
131 | (1) |
|
7.4 M-SLAP Benchmark Data |
|
|
132 | (2) |
|
7.5 Experimental Setup and Results |
|
|
134 | (7) |
|
|
134 | (1) |
|
|
135 | (6) |
|
7.6 Conclusion and Outlook |
|
|
141 | (4) |
|
|
142 | (3) |
|
8 Technological Infrastructure and Business Intelligence Strategies for the EDEVITALZH eHealth Delivery System |
|
|
145 | (20) |
|
|
|
|
|
|
146 | (2) |
|
8.2 EDEVITALZH Clinical Environment |
|
|
148 | (13) |
|
8.2.1 EDEVITALZH Systems Tier |
|
|
149 | (6) |
|
8.2.2 EDEVITALZH Databases Tier |
|
|
155 | (1) |
|
8.2.3 Presentation Tier: User Interfaces (PT-UI) |
|
|
156 | (3) |
|
8.2.4 Integration Mechanisms |
|
|
159 | (2) |
|
|
161 | (4) |
|
|
163 | (2) |
|
9 Correlation of Problem Hardness and Fitness Landscapes in the Quadratic Assignment Problem |
|
|
165 | (32) |
|
|
|
|
|
165 | (1) |
|
|
166 | (1) |
|
9.3 Fitness Landscape Analysis |
|
|
167 | (4) |
|
|
167 | (2) |
|
|
169 | (2) |
|
|
171 | (1) |
|
9.4 Quadratic Assignment Problem |
|
|
171 | (4) |
|
|
172 | (1) |
|
9.4.2 Problem Specific Measures |
|
|
172 | (3) |
|
|
175 | (1) |
|
9.5.1 Robust Taboo Search |
|
|
175 | (1) |
|
9.5.2 Simulated Annealing |
|
|
176 | (1) |
|
|
176 | (1) |
|
|
176 | (5) |
|
9.6.1 Hardness Measurement |
|
|
180 | (1) |
|
|
181 | (10) |
|
9.7.1 Simple Correlations |
|
|
182 | (4) |
|
|
186 | (5) |
|
|
191 | (6) |
|
|
192 | (5) |
|
10 Architecture and Design of the Heuristic Lab Optimization Environment |
|
|
197 | (68) |
|
|
|
|
|
|
|
|
|
|
|
|
|
198 | (4) |
|
|
199 | (1) |
|
|
200 | (1) |
|
10.1.3 Structure and Content |
|
|
201 | (1) |
|
10.2 User Groups and Requirements |
|
|
202 | (6) |
|
|
202 | (3) |
|
|
205 | (3) |
|
10.3 Architecture and Design |
|
|
208 | (20) |
|
|
208 | (2) |
|
|
210 | (4) |
|
|
214 | (12) |
|
10.3.4 Analysis and Comparison |
|
|
226 | (2) |
|
|
228 | (12) |
|
|
228 | (5) |
|
10.4.2 Modeling Genetic Algorithms |
|
|
233 | (4) |
|
10.4.3 Modeling Simulated Annealing |
|
|
237 | (3) |
|
|
240 | (17) |
|
10.5.1 Quadratic Assignment Problem |
|
|
241 | (2) |
|
10.5.2 Simulation-Based Optimization |
|
|
243 | (3) |
|
10.5.3 Genetic Programming |
|
|
246 | (11) |
|
|
257 | (8) |
|
|
259 | (6) |
|
Part II Network Management Essential Problems |
|
|
|
11 A Biomimetic SANET Middleware Infrastructure for Guiding and Maneuvering Autonomous Land-Yacht Vessels |
|
|
265 | (20) |
|
|
|
|
265 | (1) |
|
11.2 A Sailing Vessel as a Actor-Based Process |
|
|
266 | (1) |
|
11.3 Heuristic Analysis for Autonomous Sailing Craft |
|
|
267 | (8) |
|
11.3.1 Application of Tensor Analysis for Trajectory Mapping |
|
|
268 | (2) |
|
11.3.2 Developmental Approach and Methodology |
|
|
270 | (5) |
|
11.4 Evaluation of the Tensor Analysis Framework |
|
|
275 | (7) |
|
11.4.1 Experiment of Heuristics |
|
|
275 | (1) |
|
11.4.2 Analysis and Further Work |
|
|
276 | (5) |
|
11.4.3 Providing Representation and Context to Land-Yacht Systems |
|
|
281 | (1) |
|
|
282 | (3) |
|
|
282 | (3) |
|
12 Improvement of Spatial Routing in WSN Based on LQI or RSSI Indicator |
|
|
285 | (14) |
|
|
|
|
|
|
285 | (1) |
|
12.2 Relation Based Spatial Routing |
|
|
286 | (3) |
|
12.3 Constructing Neighborhoods in WSN |
|
|
289 | (4) |
|
12.4 Ordering the Neighborhood Using LQI or RSSI Indicator |
|
|
293 | (2) |
|
|
295 | (4) |
|
|
296 | (3) |
|
13 Centralized and Distributed CRRM in Heterogeneous Wireless Networks |
|
|
299 | (16) |
|
|
|
|
|
299 | (2) |
|
|
301 | (2) |
|
13.2.1 Efficient Utilization of Radio Resources |
|
|
301 | (1) |
|
13.2.2 Reduce Blocking and Dropping Probability |
|
|
302 | (1) |
|
13.2.3 Improve Network Reliability and Stability |
|
|
302 | (1) |
|
13.2.4 Allow Network Operators' to Gain Maximum Revenue |
|
|
302 | (1) |
|
13.2.5 Guarantee Required QoS across Different RATS |
|
|
302 | (1) |
|
13.2.6 Consider Users' Preferences and Increase Their Satisfactions |
|
|
303 | (1) |
|
13.3 Heterogeneous Wireless Networks with and without CRRM Algorithm |
|
|
303 | (2) |
|
13.4 RRM and CRRM Interactions |
|
|
305 | (3) |
|
|
306 | (1) |
|
|
306 | (1) |
|
13.4.3 Very Tight Coupling |
|
|
307 | (1) |
|
|
308 | (1) |
|
13.5 Distributing RRM and CRRM Entities among CN, RAT and UTs |
|
|
308 | (2) |
|
|
308 | (1) |
|
|
308 | (2) |
|
|
310 | (1) |
|
|
310 | (1) |
|
13.6 Distributed vs. Centralized CRRM Algorithms |
|
|
311 | (1) |
|
13.7 Conclusion and Future Works |
|
|
312 | (3) |
|
|
312 | (3) |
|
14 An Intelligent Model for Distributed Systems in Next Generation Networks |
|
|
315 | (20) |
|
|
|
|
|
|
315 | (3) |
|
14.2 The Needs of Distributed Systems |
|
|
318 | (2) |
|
14.2.1 Change of Traffic Patterns |
|
|
319 | (1) |
|
14.2.2 The Consumerization of IT |
|
|
319 | (1) |
|
14.2.3 The Rise of Cloud Services |
|
|
320 | (1) |
|
14.2.4 Huge Data Demand More Bandwidth |
|
|
320 | (1) |
|
14.3 Network Structure Paradigms |
|
|
320 | (5) |
|
14.3.1 Centralized Network Structure |
|
|
320 | (2) |
|
14.3.2 Hybrid Network Structure |
|
|
322 | (1) |
|
14.3.3 Distributed Structure Network |
|
|
323 | (2) |
|
14.4 Software-Defined Networking (SDN) |
|
|
325 | (2) |
|
14.5 Distributed Active Information Model (DAIM) |
|
|
327 | (3) |
|
14.6 Implementing DAIM Model in OpenFlow: A Case Study |
|
|
330 | (2) |
|
14.7 Conclusion and Future Works |
|
|
332 | (3) |
|
|
332 | (3) |
|
15 The Study of the OFDM and MIMO-OFDM Networks Compatibility --- Measurements and Simulations |
|
|
335 | (16) |
|
|
|
|
|
335 | (1) |
|
|
336 | (1) |
|
15.3 The Measurement Procedure |
|
|
337 | (3) |
|
|
340 | (2) |
|
15.5 The Results of the Simulations vs. Measurements |
|
|
342 | (2) |
|
15.6 The Measure of Convergence between the Simulation and the Measurement Results |
|
|
344 | (2) |
|
|
346 | (5) |
|
|
346 | (5) |
|
Part III Intelligent System Applications |
|
|
|
16 EMC between WIMAX 1.5GHz and WLAN 2.4GHz Systems Operating in the Same Area |
|
|
351 | (16) |
|
|
|
|
|
|
351 | (1) |
|
16.2 Wireless Communications in Mine Excavation |
|
|
352 | (2) |
|
16.3 Reverberation Chamber |
|
|
354 | (3) |
|
|
357 | (1) |
|
|
358 | (1) |
|
|
359 | (4) |
|
16.6.1 Reference Measurements |
|
|
360 | (1) |
|
16.6.2 Measurement Results for WiMAX System |
|
|
361 | (1) |
|
16.6.3 Measurement Results for WLAN System |
|
|
361 | (2) |
|
|
363 | (4) |
|
|
363 | (4) |
|
17 An Anticipatory SANET Environment for Training and Simulation of Laparoscopic Surgical Procedures |
|
|
367 | (20) |
|
|
|
|
367 | (1) |
|
17.2 Modeling of Laparoscopic Surgery Using an Agent-Based Process |
|
|
368 | (3) |
|
17.2.1 Applying BDI Principles a Knowledge-Based System |
|
|
370 | (1) |
|
17.3 Application of Heuristics in a Laparoscopic Surgical Domain |
|
|
371 | (7) |
|
17.3.1 Extended Kohonen Map (EKM) Techniques |
|
|
372 | (1) |
|
17.3.2 BDI Agent Integration Process |
|
|
373 | (3) |
|
17.3.3 Distributed Processing by Integrating JADEX with EKM Heuristics |
|
|
376 | (2) |
|
17.4 Evaluation of the SANET Middleware Environment |
|
|
378 | (6) |
|
17.4.1 Heuristic Experiment |
|
|
378 | (3) |
|
17.4.2 Analysis and Further Work |
|
|
381 | (2) |
|
17.4.3 Enabling Multi-dimensional Heuristic Contexts for Laparoscopic Surgical Simulations |
|
|
383 | (1) |
|
|
384 | (3) |
|
|
384 | (3) |
|
18 Towards Ubiquitous and Pervasive Healthcare |
|
|
387 | (18) |
|
|
|
|
|
388 | (6) |
|
18.1.1 Definitions of Terms |
|
|
388 | (6) |
|
|
394 | (6) |
|
18.2.1 Body Sensor Networks as Special WSNs |
|
|
394 | (1) |
|
18.2.2 A Brief History of Body Sensor Networks |
|
|
395 | (1) |
|
18.2.3 BSN Integration into Connected Healthcare System |
|
|
396 | (1) |
|
18.2.4 Sensors and Actuators for BSNs |
|
|
396 | (1) |
|
18.2.5 Wireless Technologies for BSNs |
|
|
397 | (2) |
|
18.2.6 Connectivity Models for BSNs |
|
|
399 | (1) |
|
18.3 Challenges for Ubiquitous and Pervasive Healthcare |
|
|
400 | (2) |
|
18.4 Conclusion and Future Work |
|
|
402 | (3) |
|
|
403 | (2) |
Index |
|
405 | |