Trends in Communication Technologies and Engineering Science (eBook)

Preface 6
Contents 7
Contributors 10
Survivable Architecture with Dynamic Wavelength and Bandwidth Allocation Scheme in WDM-EPON 15
1.1 Introduction 15
1.2 Related Work 17
1.3 The Proposed CFT-WDM-EPON Architecture 19
1.4 The Proposed Dynamic Wavelength and Bandwidth Allocation 20
1.4.1 PFEBR Scheme with Early DBA Mechanism 21
1.4.1.1 The Operation of Early DBA Mechanism 21
1.4.1.2 PFEBR Scheme 22
1.4.2 Dynamic Wavelength Allocation 23
1.5 Performance Analysis 24
1.5.1 End-to-End Delay 25
1.5.2 EF Jitter Performance 26
1.6 Conclusion 27
Evaluation on Data Modeling Languages for Standardization of NETCONF-Based Network Management: Application of an Evaluation Framework for Data Modeling Languages in Network Management Domain 29
2.1 Introduction 29
2.2 Proposed Evaluation Framework 30
2.2.1 Modeling Approaches 30
2.2.2 Interoperability 31
2.2.2.1 Protocol Independence 31
2.2.2.2 Naming Independence 31
2.2.3 Readability 31
2.2.3.1 Human Readability 32
2.2.3.2 Machine Readability 32
2.2.4 Data Representation 32
2.2.4.1 Diversity of Data Types 32
2.2.4.2 Specification of Configuration Data, State Data and Statistics Data 33
2.2.5 Conformance 33
2.2.5.1 Backward Compatibility 33
2.2.5.2 Versioning 33
2.2.5.3 Definition of Event Notification Messages 33
2.2.5.4 Definition of Error Messages 34
2.2.6 Extensibility 34
2.2.6.1 Extensibility of Data Structures 34
2.2.6.2 Extensibility of Data Types 34
2.2.6.3 Extensibility of Elements and Attributes 34
2.2.7 Security Considerations 34
2.2.7.1 Granularity of Access Control 35
2.2.7.2 Lock Mechanism 35
2.3 Language Presentation 35
2.3.1 Structure of Management Information 35
2.3.2 Managed Object Format/Common Information Model 36
2.3.3 Structure of Management Information, Next Generation 36
2.4 Validation 36
2.4.1 Comparison 37
2.4.2 Summary 38
2.5 NETCONF-Based Data Modeling 38
2.5.1 XML Schema 38
2.5.2 Yang 39
2.6 Application of Proposed Framework to NETCONF-Based Data Modeling 39
2.7 Conclusions and Future Work 41
Ad Hoc Multiple Source Routing 43
3.1 Introduction 43
3.2 Related Works 44
3.3 The Protocol 45
3.4 Performance Evaluation 48
3.5 Conclusion 52
Efficient BER Improvement Mechanism for Wireless E1/E1 ATM Links 54
4.1 Introduction 54
4.2 Theoretical Background on RS Coding 55
4.3 Description of the Architecture and Design 56
4.3.1 Block Synchronization Design Issues 57
4.3.2 Calculation of Probability of Occurrence of False Alarm 58
4.3.3 Idle Cell Removal 59
4.3.4 Implementation 59
4.4 Test Results 60
4.4.1 Theoretical Calculations 60
4.4.2 Functional Testing 61
4.4.3 Performance Tests 62
4.5 Conclusions 64
Performance of Ad Hoc Routing Protocols in Mobile WiMAX Environment 65
5.1 Introduction 65
5.2 Ad Hoc Routing Protocols 66
5.2.1 Ad Hoc On-Demand Distance Vector (AODV) 66
5.2.1.1 Route Discovery 67
5.2.1.2 Route Maintenance 68
5.2.2 Dynamic Source Routing (DSR) 68
5.2.2.1 Route Discovery 68
5.2.2.2 Route Maintenance 69
5.2.3 Optimized Link State Routing (OLSR) 70
5.2.3.1 Neighbor Sensing 70
5.2.3.2 Multipoint Relay Station 70
5.2.3.3 MPR Information Declaration 71
5.2.4 Zone Routing Protocol (ZRP) 71
5.2.4.1 Intrazone Routing Protocol (IARP) 72
5.2.4.2 Interzone Routing Protocol (IERP) 72
5.3 Simulation Environment 73
5.4 Simulation Results 74
5.5 Conclusion 76
Predictive Mobility Management with Delay Optimizations in 802.11 Infrastructure Networks 78
6.1 Introduction 78
6.2 Related Works and Technologies 79
6.3 Mobility Management Architecture 79
6.4 Analysis of Mobility Prediction 81
6.5 Analysis of Delay Management and Resource Management 82
6.5.1 Delay Management 83
6.5.2 Resource Reservation Management 84
6.6 Performance Simulation Results 84
6.7 Conclusion 90
Decomposition of SQuaRE - Based Requirements for the Needs of SOA Applications 92
7.1 Introduction 92
7.2 Motivating Scenario 93
7.3 Related Work 94
7.4 Decomposition 96
7.4.1 SQuaRE -- Based SOA Quality Ontology 96
7.4.2 SWS QoS Ontology 98
7.4.3 Decomposition Model/Mappings 100
7.4.4 Example 101
7.5 Summary 104
Utilizing Web Directories for Translation Disambiguation inCross-Language Information Retrieval 106
8.1 Introduction 106
8.2 Related Work 107
8.3 Cross-Language Information Retrieval Using Web Directories 108
8.3.1 Method of Category Merging 109
8.3.2 Preprocessing Phase 109
8.3.3 Retrieval Phase 110
8.3.3.1 Relevant Category Selection 111
8.3.3.2 Query Translation 111
8.3.3.3 Retrieval of Documents 112
8.4 Experiments 112
8.4.1 Method of Experiments 112
8.4.2 Lower Bound of Feature Term in the Category 114
8.4.3 Result of Experiments 114
8.4.4 Discussion 116
8.4.4.1 Effectiveness of Proposed Method 116
8.4.4.2 Translation for Using Category Level 116
8.4.4.3 Appropriate Level of Using Category 116
8.5 Conclusion 117
Ontology Based Improvement of Response Time and Reliability of Web Service Repositories 119
9.1 Introduction 119
9.1.1 Why a Semantic Search Engine? 120
9.1.2 Traditional System 120
9.1.3 Semantic Web 120
9.1.4 Ontology 122
9.2 Previous Works in This Direction 122
9.3 The New Enhanced Search Engine 123
9.4 Structure of Major Subsystems 124
9.4.1 Service Retrieval Subsystem 125
9.4.2 Periodic Availability Checking 125
9.5 Experimental Evaluation 125
9.5.1 Improvement in Response Time 126
9.5.2 Automatic Availability Checking 127
9.6 Conclusion 129
9.7 Appendix: Ontology Building Tools 129
Protégé 130
OntoBuilder 130
Quad-Tree Based Adaptive Wavelet Packet Image Coding 132
10.1 Introduction 132
10.2 Background: Wavelet Transform and Wavelet Packet Transform 134
10.3 Wavelet Image Coding 135
10.3.1 The SPIHT Algorithm 136
10.4 Adaptive Wavelet Packet Image Coding 137
10.4.1 Rearrangement of Wavelet Packet Coefficients 137
10.4.2 Quad-Tree Based Adaptive Wavelet Packet Tree 138
10.4.3 The SPIAWPT Algorithm 140
10.5 Experiments of the Coding Algorithms 141
10.6 Conclusion 144
Plaque Boundary Extraction in Intravascular Ultrasound Image in Conjunction with Image Separability and Fuzzy Inference 148
11.1 Introduction 148
11.2 Intravascular Ultrasound (IVUS) Image and Conventional Boundary Extraction Method 149
11.2.1 IVUS Image 149
11.2.2 Conventional Boundary Extraction Method by Using Spline Function 150
11.3 Proposed Boundary Extraction Method Based on Fuzzy Inference 150
11.3.1 B-Mode Image 151
11.3.2 Separability for Boundary Extraction 151
11.3.3 Proposed Boundary Extraction by Applying Fuzzy Inference 152
11.4 Experimental Results 155
11.5 Conclusion 158
Dedicated Hardware for Hybrid Evolutionary Computation 160
12.1 Introduction 160
12.2 Preliminaries 161
12.2.1 Genetic Algorithm and Simulated Annealing 161
12.2.2 Previous Work 162
12.3 Architecture Methodology 162
12.4 Circuits 163
12.4.1 Hardware of Genetic Algorithm 164
12.4.1.1 Selection Operator 164
12.4.1.2 Crossover Operator 165
12.4.1.3 Mutation Operator 166
12.4.2 Hardware of Simulated Annealing 167
12.4.3 GA and SA Architecture 169
12.5 Experiments 169
12.6 Conclusion 169
Efficient Design of Arbitrary Complex Response Continuous-Time IIR Filter 171
13.1 Introduction 171
13.2 Vector Fitting 172
13.2.1 Problem Formulation 173
13.2.2 Pole Calculation 174
13.2.3 Building the Rational Function 175
13.3 Remarks 175
13.3.1 Numerical Consideration 176
13.3.2 Frequency Band Weighting 177
13.3.3 Stability Margin 177
13.4 Numerical Examples 177
13.4.1 Example 1 177
13.4.2 Example 2 179
13.5 Conclusions 183
Fixed Structure Robust Loop Shaping Controller for a Buck-Boost Converter Using Evolutionary Algorithm 185
14.1 Introduction 185
14.2 Converter Modeling 187
14.3 H8 Loop Shaping Control and Proposed Technique 188
14.4 Simulation and Experimental Results 191
14.5 Conclusion 195
Ant Colony Optimization (ACO) Technique in Economic Power Dispatch Problems 198
15.1 Introduction 198
15.2 Economic Dispatch Problem Formulation 199
15.2.1 Objective Function 199
15.2.2 Constraint Equations 200
15.2.3 Line Flow Constraints 201
15.2.4 Objective Function and Feasible Region 201
15.2.5 Parameter Setting 201
15.3 Ant Colony Optimization Technique 201
15.4 Ant Colony Optimization (ACO) Algorithm 202
15.5 Results And Discussion 207
15.6 Conclusion 209
Direction of Arrival Estimation Using a Phase Array Antenna 211
16.1 Introduction 211
16.2 Sensor Array System 212
16.3 Root-Music Algorithm 214
16.4 Computer Simulation Results 216
16.5 Sensor Spacing And Phase Sensitivity 220
16.6 Conclusion 223
Grid Computing for Ubiquitous Computing Environment (GCUCE) Mobility Model 226
17.1 Introduction 226
17.2 Architecture 227
17.2.1 Grid Layer 227
17.2.2 Context-Aware Layer 228
17.2.3 Ubiquitous Main Layer 229
17.3 Enterprise Model in GCUCE 229
17.3.1 Enterprise Model 230
17.3.2 Demand Model 231
17.3.3 Gain Maximization 233
17.4 Automata Model for Mobility in GCUCE 234
17.5 Experiment 234
17.6 Conclusion 237
A Novel Fault-Tolerant Multi-EPON System with Sharing Protection Scheme 240
18.1 Introduction 240
18.2 Literature Review 241
18.3 Proposed Novel Fault-Tolerant Multi-EPON System 243
18.3.1 Fault-Tolerant Architecture 243
18.3.2 Minimum Hop Count Relay Path Main Algorithm 244
18.3.2.1 Information Sending Phase 245
18.3.2.2 Waiting Information Phase 245
18.3.2.3 Deciding Relay Path Phase 246
18.3.2.4 Calculating Available Bandwidth Phase 246
18.3.3 Relay Mechanism and Local DBA 246
18.3.3.1 Relay Window Mechanism 246
18.3.3.2 Two DBA Schemes for Local ONUs 247
18.4 Performance Evaluation 250
18.4.1 Average End-to-End Delay 251
18.4.2 MAX End-to-End Delay 251
18.4.3 EF Jitter Performance 252
18.5 Conclusion 253
Design and Performance Evaluation of Knuth-BendixMulti-Completion System Using Boolean Constrained Reduction Orders 255
19.1 Introduction 255
19.2 Multi-Completion 257
19.3 Multi-Completion for Boolean Constrained Reduction Orders 259
19.3.1 Abstract Boolean Encoding 259
19.3.2 MKBOOL 260
19.4 Encoding for Recursive Path Orders 262
19.4.1 Basic Definitions 262
19.4.2 Encoding for Precendence and Status 263
19.4.3 Encoding for RPO 265
19.5 Implementation and Experiments 266
19.6 Conclusion 266
Generating Distributed Code from Cola Models 268
20.1 Introduction 268
20.2 Automated Code Generation 270
20.3 Running the Generated Code 277
20.3.1 Inter-Cluster Communication 277
20.3.2 Interfacing Sensors and Actuators 278
20.4 Case Study 279
20.4.1 Functionality of the Demonstrator 280
20.5 Conclusions 280
Outlining a Risk-Driven Development Model (RDD) 283
21.1 Introduction 283
21.2 Method 284
21.3 Commonalities in Agile and Risk Management Process Models 285
21.3.1 Risk Definition 285
21.3.2 Organizational Levels and Stakeholders Involved 286
21.3.2.1 Pre-implementation Stage 286
21.3.2.2 Implementation Stage 286
21.3.2.3 Organizational Levels in the Process Models Studied 287
21.3.3 Stakeholders Involved 287
21.4 Process Integration Practice 288
21.4.1 Risk Definition and Identification 288
21.4.2 Organizational Levels and Stakeholders Involved 288
21.4.3 Integration Problems 290
21.5 RDD 290
21.5.1 Risk Definition and Identification 291
21.5.2 Organizational Levels and Stakeholders Involved 291
21.5.3 Stakeholders Involved 292
21.5.4 Communication Channels 293
21.5.5 Process Aspects 293
21.6 Epilogue 294
Mining Frequent Itemsets in Distributed Environment 297
22.1 Introduction 297
22.1.1 Notation and Problem Definition 299
22.2 Previous Work 299
22.2.1 The Apriori Algorithm 299
22.2.2 The Trie-Based Apriori 300
22.2.3 The FDM Algorithm 301
22.3 Our Implementation 301
22.3.1 The DTFIM Algorithm 301
22.3.2 The Revised DTFIM 302
22.4 Experimental Results 303
22.5 Conclusion 305
A Study on the Inequalities for Fast Similarity Search in Metric Spaces 308
23.1 Previous Works on Metric Search 310
23.1.1 Similarity Search in Metric Spaces 310
23.1.2 AESA 310
23.1.3 LAESA 311
23.1.4 Other Metric Search Algorithms 311
23.2 New Lower Bounds 312
23.2.1 Embedding of the Metric Space 312
23.2.2 New Bounds on the Unknown Distances 314
23.2.3 Extending to Generic Metric Spaces 315
23.3 Search Algorithms 315
23.3.1 PAESA 315
23.3.2 LPAESA 316
23.3.3 Pivot Selection 317
23.4 Experiments 317
23.5 Concluding Remarks 321
Discovering Knowledge of Association Using Coherent Rules 323
24.1 Introduction 323
24.2 Previous Work 324
24.3 Coherent Rules Framework 325
24.4 Coherent Rules Measure of Interest 327
24.4.1 Property of Coherent Rules Measure of Interest H 329
24.5 Mining Coherent Rules 329
24.6 Experiments and Discussions 331
24.7 Conclusion 333
Particle Swarm Optimization with Diversive Curiosity and Its Identification 335
25.1 Introduction 335
25.2 Overview of EPSO 337
25.2.1 Basic EPSO 337
25.2.2 Fitness Functions 338
25.2.3 Convergence Speed 339
25.3 PSO/DC 339
25.3.1 Curiosity 339
25.3.2 Internal Indicator 340
25.3.3 Procedure of PSO/DC 341
25.4 Computer Experiments 342
25.4.1 Experimental Conditions 342
25.4.2 Results of EPSO 342
25.4.3 Results of PSO/DC 344
25.4.4 Feature of EPSO 345
25.5 Conclusions 347