2.3 Dynamic Interconnection Networks

Total Page:16

File Type:pdf, Size:1020Kb

2.3 Dynamic Interconnection Networks Efficient Load Balancing Algorithms for Parallel and Distributed Systems A Thesis Submitted in the partial fulfillment of the requirements for the award of the degree of Doctor of Philosophy Submitted By Jahangir Alam (Registration No. 90603504) Under Supervision and Guidance of Dr. Rajesh Kumar (Professor, CSED, TU Patiala) Department of Computer Science & Engineering Thapar University, Patiala - 147004 (Punjab), India. July, 2016 iii Dedicated to My Parents, Wife and Kids Abstract Parallel and Distributed computing is essential for modern research as the demand for more and more computing power is continuously increasing. A number of aspects within parallel and distributed computing have been explored in recent years, however two of the most pertinent issues relate to the design of scalable interconnection network topology and task allocation for load balancing. This work addresses these two problems. The first part of the thesis presents the design and evaluation of a highly scal- able and economical interconnection network topology known as the STH (Seri- ally Twisted Hypercube). It begins with a brief survey of various interconnection network topologies proposed in literature followed by the design principles on which the proposed STH interconnection network will be based upon. Various properties of the proposed topology are derived and then compared with other topologies on a number of interconnection networks evaluation parameters. The second part of the thesis deals with the task allocation problem taking into account load balancing. Exploiting the full potential of a parallel and distributed system requires efficient allocation of the program tasks to the diversely capable machines within the system. If the task allocation strategy is not properly framed, machines in the system may spend most of their time waiting for each other in- stead of performing useful computations. This part of the thesis focuses on static task allocation considering load balancing in heterogeneous distributed comput- ing systems sometimes also referred to as heterogeneous multicomputer systems (HMS). The thesis first presents a brief literature survey on the proposed solutions and then classifies them according to the solution techniques. It then presents two mathematical models based on fuzzy logic to solve the task allocation problem. Finally based on the proposed models the the thesis presents two algorithms to solve the aforementioned problem. The algorithms are coded in C and the pro- posed models are verified by executing the corresponding programs with several sets of randomly generated data. Experimental results prove that the algorithms successfully allocate tasks to the machines whilst balancing the allocated task load. vi Analysis of the proposed method also proves that its complexity is low compared to similar existing approaches. Declaration The work in this thesis is based on research jointly carried out at University Women’s Polytechnic, Faculty of Engineering & Technology, Aligarh Muslim Uni- versity, Aligarh (India) and Department of Computer Science & Engineering, Tha- par University Patiala, Patiala (India). No part of this thesis has been submitted elsewhere for any other degree or qualification and it is all my own work unless referenced to the contrary in the text. Copyright c 2015 by JAHANGIR ALAM. “The copyright of this thesis rests with the author. No quotations from it should be published without the author’s prior written consent and information derived from it should be acknowledged”. vii Acknowledgements First of all, I thank ALLAH (SWT), the Lord Almighty, for giving me the health, strength, ability to complete this work and for blessing me with supportive super- visor, family and friends. I wish to express my deepest appreciation to my supervisor, Dr. Rajesh Kumar for his idea, support, enthusiasm, and patience. I have learnt an enormous amount from working with him. I would also like to thank the Hon’ble Director, Thapar University for giving me the opportunity to attend research programme at Thapar University, Patiala. I would like to express my profound gratitude to my doctoral committee mem- bers: Prof. Rakesh Sharma, Dr. Maninder Singh, Dr. Deepak Garg and Dr. Rajesh Kumar for their enlightening suggestions from time to time. I am forever indebted to my employer Aligarh Muslim University (India) and to Dr. Salma Shaheen, Principal, University Women’s Polytechnic, AMU, Aligarh for extending me the facilities required to complete this work. I express my sincere thanks to Dr. Mohhmad Athar Ali, Associate Professor, Dept. of Computer Engg., AMU Aligarh for English corrections, which helped improve all my writings. Life would be harder without the support of many good relatives and friends. Thanks to Prof. Shamim Ahmad (for being such a wonderful mentor), Mr. Far- rukh Shamim, Dr. Abdus Samad, Dr. Parveen Beg, Mr. M. Abdul Qadeer, Mr. Misbahurrahman Siddiqui, Mr. Tariq Ahmed, Mr. Wajid Ali, Mr. Rahat Mahmood, Mr. Gulsanover and Mr. Mohd. Hanzala. Thank you to all my friends at AMU Aligarh and Thapar University, Patiala. viii ix Finally, I thank to all my family members for their love, patience and uncount- able supports. Contents Abstract iv Declaration vi Acknowledgements vii 1 Introduction 1 1.1 Parallel Processing . .1 1.2 Need for Parallel Processing . .2 1.3 Taxonomy of Computer Architectures . .3 1.3.1 Single Instruction Single Data (SISD) . .3 1.3.2 Single Instruction Multiple Data (SISD) . .4 1.3.3 Multiple Instruction Single Data (MISD) . .5 1.3.4 Multiple Instruction Multiple Data (MIMD) . .6 1.3.5 Hybrid Architecture . 10 1.4 Parallel and Distributed Systems Addressed in This Thesis . 11 1.5 Motivations . 11 1.5.1 Scalable and Economical Interconnection Network . 12 1.5.2 Static Load Balancing Task Allocation . 13 1.5.3 Heterogeneous Multicomputer Systems . 14 1.5.4 No Task Duplication . 15 1.5.5 Problem Complexity . 16 1.6 Contributions . 16 1.6.1 An Economical and scalable topology for PDS . 16 x Contents xi 1.6.2 Routing and Broadcasting Procedures for ST H Topology . 17 1.6.3 Load Balancing Task Allocation Models . 17 1.6.4 Fuzzy Expected Time to Compute (F ET C) Matrix Genera- tion Algorithm . 18 1.6.5 Efficient Allocation Algorithms . 18 1.7 Thesis Organization . 18 2 Interconnection Networks and Hybrid Topologies 22 2.1 Criteria Used for Classification of INs . 22 2.1.1 Mode of Operation . 23 2.1.2 Control Strategy . 23 2.1.3 Switching Techniques . 24 2.1.4 Topology . 24 2.2 Topology Based Classification for INs . 24 2.3 Dynamic Interconnection Networks . 25 2.3.1 Bus Based Dynamic Interconnection Networks . 25 2.3.2 Switched Based Interconnection Networks . 27 2.3.3 Blocking and Non-Blocking Networks . 37 2.4 Static Interconnection Networks . 37 2.4.1 Completely Connected Networks . 40 2.5 Limited Connection Networks . 41 2.6 Hybrid Interconnection Networks . 45 2.7 Cross Product as Net. Synthesizing Operator . 46 2.7.1 Topological Properties of Product Networks . 47 2.7.2 Significance of Cross Product . 48 2.7.3 Routing on Product Networks: . 49 2.7.4 Broadcasting on Product Networks . 49 2.7.5 Performance Issues of Product Networks . 51 2.8 Network Topology and Load Balancing . 51 Contents xii 3 The Design and Analysis of STH Interconnection Network 54 3.1 Related Work . 54 3.2 Preliminaries and Graph Theoretic Definitions . 57 3.3 Design of Scalable Twisted Hypercube . 58 3.3.1 Topological Properties of STH . 62 3.3.2 Routing on ST H Network . 66 3.3.3 Broadcasting On ST H Network . 72 3.4 ST H Analysis and Comparative Study . 72 4 Taxonomy of Task Allocation Models and Related Work 90 4.1 The Task Allocation Problem . 91 4.2 Task Allocation and Load Balancing . 94 4.3 Taxonomy of Task Allocation Models . 98 4.3.1 Exact Algorithms . 98 4.3.2 Approximate Algorithms . 98 4.3.3 Mathematical Programming Techniques . 100 4.3.4 Graph Theoretic Techniques . 104 4.3.5 State Space Search Techniques . 108 4.3.6 Heuristic Techniques . 110 5 Fuzzy Load Balancing Task Allocation Models 120 5.1 Related Work . 121 5.2 Problem Statement . 122 5.3 Brief Overview of Fuzzy Logic . 123 5.3.1 Fuzzy Sets . 123 5.3.2 Fuzzy Numbers . 123 5.3.3 Triangular Fuzzy Numbers . 124 5.3.4 Linguistic Variables . 124 5.3.5 Defuzzification . 126 5.4 Fuzzy Load Balancing Task Allocation Model - I . 127 5.4.1 Assumptions . 127 Contents xiii 5.4.2 Task Execution Time and Execution Cost . 128 5.4.3 Task Precedence Constraints and Priorities . 130 5.4.4 Communication Cost . 133 5.4.5 Load Balancing . 135 5.4.6 System Reliability . 135 5.4.7 The Task Allocation Algorithm . 136 5.4.8 Experimental Setup and Implementation of FLBTA - I . 138 5.4.9 Performance Evaluation of F LBT A − I ........... 165 5.4.10 Load Balancing . 167 5.4.11 Comparative Study . 167 5.5 Fuzzy Load Balancing Task Allocation Model - II . 170 5.5.1 Selecting Best Machine to Execute the Task . 172 5.5.2 Link Reliability . 174 5.5.3 Modified Allocation Algorithm . 175 5.5.4 Experimental Setup and Implementation of FLBTA - II . 175 6 Conclusions and Future Directions 185 6.1 Summary of Contributions . 186 6.1.1 Literature Reviews . 187 6.1.2 Development of Mathematical Models . 187 6.1.3 Algorithms . 188 6.2 Concluding Remarks . 189 6.3 Future Research . 190 6.3.1 Task Partitioning . 190 6.3.2 Estimation on Communication Cost . 190 6.3.3 Designing Suitable Multicomputer Architecture . 191 6.3.4 Improving the Allocation Models for Network Contention . 191 6.3.5 Designing a Dynamic Task Allocator . 191 List of Publications . 192 References 193 List of Figures 1.1 SISD architecture . .4 1.2 SIMD architecture .
Recommended publications
  • Data Envelopment Analysis with Fuzzy Parameters: an Interactive Approach
    International Journal of Operations Research and Information Systems, 2(3), 39-53, July-September 2011 39 Data Envelopment Analysis with Fuzzy Parameters: An Interactive Approach Adel Hatami-Marbini, Universite Catholique de Louvain, Belgium Saber Saati, Islamic Azad University, Iran Madjid Tavana, La Salle University, USA ABSTRACT Data envelopment analysis (DEA) is a methodology for measuring the relative efficiencies of a set of deci- sion making units (DMUs) that use multiple inputs to produce multiple outputs. In the conventional DEA, all the data assume the form of specific numerical values. However, the observed values of the input and output data in real-life problems are sometimes imprecise or vague. Previous methods have not considered the preferences of the decision makers (DMs) in the evaluation process. This paper proposes an interactive evaluation process for measuring the relative efficiencies of a set of DMUs in fuzzy DEA with consideration of the DMs’ preferences. The authors construct a linear programming (LP) model with fuzzy parameters and calculate the fuzzy efficiency of the DMUs for different α levels. Then, the DM identifies his or her most preferred fuzzy goal for each DMU under consideration. A modified Yager index is used to develop a ranking order of the DMUs. This study allows the DMs to use their preferences or value judgments when evaluating the performance of the DMUs. Keywords: Data Envelopment Analysis, Efficiency Evaluation, Fuzzy Mathematical Programming, Interactive Solution, Preference Modeling INTRODUCTION efficiency. A DMU is considered efficient when no other DMU can produce more outputs using The changing economic conditions have chal- an equal or lesser amount of inputs.
    [Show full text]
  • Fuzzy Integer Linear Programming with Fuzzy Decision Variables
    Applied Mathematical Sciences, Vol. 4, 2010, no. 70, 3493 - 3502 Fuzzy Integer Linear Programming with Fuzzy Decision Variables C. Sudhagar1 Department of Mathematics and Applied Sciences Middle East College of Information Technology, Muscat, Oman [email protected] K. Ganesan Department of Mathematics, SRM University, Chennai, India gansan [email protected] Abstract In this paper a new method for dealing with Fuzzy Integer Linear Programming Problems (FILPP) has been proposed. FILPP with fuzzy variables model was taken for solution. This solution method is based on the fuzzy ranking method. The proposed method can serve deci- sion makers by providing the reasonable range of values for the fuzzy variable, which is comparatively better than the currently available solu- tions. Numerical examples demonstrate the effectiveness and accuracy of the proposed method. Mathematics Subject Classification: 65K05, 90C10, 90C70, 90C90 Keywords: Fuzzy numbers, Ranking, Fuzzy integer linear programming 1 Introduction Linear Programming Problems(LPP) have an outstanding relevance in the field of Decision making, Artificial intelligence, Control theory, Management sciences, Job placement interventions etc. In many practical applications the available information in the system under consideration are not precise. In such situations, it is more appropriate to use the fuzzy LPP. 1Corresponding author 3494 C. Sudhagar and K. Ganesan The concept of fuzzy linear programming problems was first introduced by Tanaka et al.,[13, 12] After his work, several kinds of fuzzy linear programming problems have appeared in the literature and different methods have been proposed to solve such problems. Numerous methods for comparison of fuzzy numbers have been suggested in the literature. In Campos Verdegay paper[2] linear programming problems with fuzzy constraints and fuzzy coefficients in both matrix and right hand side of the constraint set are considered.
    [Show full text]
  • Connes on the Role of Hyperreals in Mathematics
    Found Sci DOI 10.1007/s10699-012-9316-5 Tools, Objects, and Chimeras: Connes on the Role of Hyperreals in Mathematics Vladimir Kanovei · Mikhail G. Katz · Thomas Mormann © Springer Science+Business Media Dordrecht 2012 Abstract We examine some of Connes’ criticisms of Robinson’s infinitesimals starting in 1995. Connes sought to exploit the Solovay model S as ammunition against non-standard analysis, but the model tends to boomerang, undercutting Connes’ own earlier work in func- tional analysis. Connes described the hyperreals as both a “virtual theory” and a “chimera”, yet acknowledged that his argument relies on the transfer principle. We analyze Connes’ “dart-throwing” thought experiment, but reach an opposite conclusion. In S, all definable sets of reals are Lebesgue measurable, suggesting that Connes views a theory as being “vir- tual” if it is not definable in a suitable model of ZFC. If so, Connes’ claim that a theory of the hyperreals is “virtual” is refuted by the existence of a definable model of the hyperreal field due to Kanovei and Shelah. Free ultrafilters aren’t definable, yet Connes exploited such ultrafilters both in his own earlier work on the classification of factors in the 1970s and 80s, and in Noncommutative Geometry, raising the question whether the latter may not be vulnera- ble to Connes’ criticism of virtuality. We analyze the philosophical underpinnings of Connes’ argument based on Gödel’s incompleteness theorem, and detect an apparent circularity in Connes’ logic. We document the reliance on non-constructive foundational material, and specifically on the Dixmier trace − (featured on the front cover of Connes’ magnum opus) V.
    [Show full text]
  • Decision Analysis in the UK Energy Supply Chain Risk Management: Tools Development and Application
    Decision Analysis in the UK Energy Supply Chain Risk Management: Tools Development and Application by Amin Vafadarnikjoo Registration number: 100166891 Thesis submitted to The University of East Anglia for the Degree of Doctor of Philosophy (PhD) August 2020 Norwich Business School “This copy of the thesis has been supplied on condition that anyone who consults it is understood to recognise that its copyright rests with the author and that use of any information derived therefrom must be in accordance with current UK Copyright Law. In addition, any quotation or extract must include full attribution.” 1 Abstract Large infrastructures like electricity supply networks are widely presumed to be crucial for the functioning of societies as they create conditions for essential economic activities. There has always been a continuing concern and complexity around risks in the field of energy security and particularly power grids within energy supply chain. Drawing on this complexity and a need for useful tools, this research contributes to developing and utilising proper decision-making tools (i.e. methods and models) to deal with the risk identification and mitigation in the UK energy supply chain as a compound networked system. This thesis is comprised of four study phases (Figure I.A.). It is aimed at developing decision-making tools for risk identification, risk interdependency analysis, risk prioritisation, and long-term risk mitigation strategy recommendations. The application of the tools has focused on the UK power supply chain. The five new tools which are introduced and applied in this thesis are: (1) Proposed Expert Selection Model (ESM) and its application under hesitant fuzzy environment (i.e.
    [Show full text]
  • Global Journal of Science Frontier Research: F Mathematics & Decision Sciences
    Online ISSN : 2249-4626 Print ISSN : 0975-5896 DOI : 10.17406/GJSFR SolvingGraphFunctionProblem ModulestotheApplicationAreas FuzzyNumbersDescriptorSystems CliffordianHamiltonianFormulation VOLUME20ISSUE1VERSION1.0 Global Journal of Science Frontier Research: F Mathematics & Decision Sciences Global Journal of Science Frontier Research: F Mathematics & Decision Sciences Volume 20 Issue 1 (Ver. 1.0) Open Association of Research Society Global Journals Inc. © Global Journal of Science (A Delaware USA Incorporation with “Good Standing”; Reg. Number: 0423089) Frontier Research. 2020 . Sponsors:Open Association of Research Society Open Scientific Standards All rights reserved. This is a special issue published in version 1.0 Publisher’s Headquarters office of “Global Journal of Science Frontier Research.” By Global Journals Inc. Global Journals ® Headquarters All articles are open access articles distributed 945th Concord Streets, under “Global Journal of Science Frontier Research” Framingham Massachusetts Pin: 01701, Reading License, which permits restricted use. United States of America Entire contents are copyright by of “Global USA Toll Free: +001-888-839-7392 Journal of Science Frontier Research” unless USA Toll Free Fax: +001-888-839-7392 otherwise noted on specific articles. No part of this publication may be reproduced Offset Typesetting or transmitted in any form or by any means, electronic or mechanical, including G lobal Journals Incorporated photocopy, recording, or any information storage and retrieval system, without written 2nd, Lansdowne, Lansdowne Rd., Croydon-Surrey, permission. Pin: CR9 2ER, United Kingdom The opinions and statements made in this book are those of the authors concerned. Packaging & Continental Dispatching Ultraculture has not verified and neither confirms nor denies any of the foregoing and no warranty or fitness is implied.
    [Show full text]
  • Fuzzy Sets, Fuzzy Logic and Their Applications • Michael Gr
    Fuzzy Sets, Fuzzy Logic and Their Applications • Michael Gr. Voskoglou • Michael Gr. Fuzzy Sets, Fuzzy Logic and Their Applications Edited by Michael Gr. Voskoglou Printed Edition of the Special Issue Published in Mathematics www.mdpi.com/journal/mathematics Fuzzy Sets, Fuzzy Logic and Their Applications Fuzzy Sets, Fuzzy Logic and Their Applications Special Issue Editor Michael Gr. Voskoglou MDPI • Basel • Beijing • Wuhan • Barcelona • Belgrade • Manchester • Tokyo • Cluj • Tianjin Special Issue Editor Michael Gr. Voskoglou Graduate Technological Educational Institute of Western Greece Greece Editorial Office MDPI St. Alban-Anlage 66 4052 Basel, Switzerland This is a reprint of articles from the Special Issue published online in the open access journal Mathematics (ISSN 2227-7390) (available at: https://www.mdpi.com/journal/mathematics/special issues/Fuzzy Sets). For citation purposes, cite each article independently as indicated on the article page online and as indicated below: LastName, A.A.; LastName, B.B.; LastName, C.C. Article Title. Journal Name Year, Article Number, Page Range. ISBN 978-3-03928-520-4 (Pbk) ISBN 978-3-03928-521-1 (PDF) c 2020 by the authors. Articles in this book are Open Access and distributed under the Creative Commons Attribution (CC BY) license, which allows users to download, copy and build upon published articles, as long as the author and publisher are properly credited, which ensures maximum dissemination and a wider impact of our publications. The book as a whole is distributed by MDPI under the terms and conditions of the Creative Commons license CC BY-NC-ND. Contents About the Special Issue Editor ...................................... vii Preface to ”Fuzzy Sets, Fuzzy Logic and Their Applications” ...................
    [Show full text]
  • Innovative Uses of Matrices
    University of New Mexico UNM Digital Repository Faculty and Staff Publications Mathematics 2012 Innovative Uses of Matrices Florentin Smarandache University of New Mexico, [email protected] W.B. Vasantha Kandasamy [email protected] Indra Venkatbabu Follow this and additional works at: https://digitalrepository.unm.edu/math_fsp Part of the Algebra Commons, Algebraic Geometry Commons, Analysis Commons, Applied Mathematics Commons, Discrete Mathematics and Combinatorics Commons, and the Other Mathematics Commons Recommended Citation W.B. Vasantha Kandasamy, F. Smarandache, I. Venkatbabu. Innovative Uses of Matrices. Ohio: Educational Publisher Inc., 2012. This Book is brought to you for free and open access by the Mathematics at UNM Digital Repository. It has been accepted for inclusion in Faculty and Staff Publications by an authorized administrator of UNM Digital Repository. For more information, please contact [email protected], [email protected], [email protected]. Innovative Uses of Matrices W. B. Vasantha Kandasamy Florentin Smarandache Indra Venkatbabu Educational Publisher Inc. Ohio 2012 This book can be ordered from: Education Publisher Inc. 1313 Chesapeake Ave. Columbus, Ohio 43212, USA Toll Free: 1-866-880-5373 Copyright 2012 by Educational Publisher Inc. and the Authors Peer reviewers: Professor Paul P. Wang, Ph D, Department of Electrical & Computer Engineering, Pratt School of Engineering, Duke University, Durham, NC 27708, USA Prof. Catalin Barbu, V. Alecsandri National College, Mathematics Department, Bacau, Romania
    [Show full text]
  • TME Volume 7, Number 1
    The Mathematics Enthusiast Volume 7 Number 1 Article 10 1-2010 TME Volume 7, Number 1 Follow this and additional works at: https://scholarworks.umt.edu/tme Part of the Mathematics Commons Let us know how access to this document benefits ou.y Recommended Citation (2010) "TME Volume 7, Number 1," The Mathematics Enthusiast: Vol. 7 : No. 1 , Article 10. Available at: https://scholarworks.umt.edu/tme/vol7/iss1/10 This Full Volume is brought to you for free and open access by ScholarWorks at University of Montana. It has been accepted for inclusion in The Mathematics Enthusiast by an authorized editor of ScholarWorks at University of Montana. For more information, please contact [email protected]. The Montana Mathematics Enthusiast ISSN 1551-3440 VOL. 7, NO.1, January 2010, pp.1-174 Editor-in-Chief Bharath Sriraman, The University of Montana Associate Editors: Lyn D. English, Queensland University of Technology, Australia Simon Goodchild, University of Agder, Norway Brian Greer, Portland State University, USA Luis Moreno-Armella, Cinvestav-IPN, México International Editorial Advisory Board Mehdi Alaeiyan, Iran University of Science and Technology, Iran Miriam Amit, Ben-Gurion University of the Negev, Israel Ziya Argun, Gazi University, Turkey Ahmet Arikan, Gazi University, Turkey. Astrid Beckmann, University of Education, Schwäbisch Gmünd, Germany Raymond Bjuland, University of Stavanger, Norway Morten Blomhøj, Roskilde University, Denmark Robert Carson, Montana State University- Bozeman, USA Mohan Chinnappan, University of Wollongong,
    [Show full text]
  • A Guide to the Fuzzynumbers Package for R (Fuzzynumbers Version 0.4-6)
    A Guide to the FuzzyNumbers Package for R (FuzzyNumbers version 0.4-6) Marek Gagolewski1 1 Systems Research Institute, Polish Academy of Sciences ul. Newelska 6, 01-447 Warsaw, Poland Jan Caha2 2 Institute of Geoinformatics, VŠB – Technical University of Ostrava https://cran.r-project.org/web/packages/FuzzyNumbers/ February 5, 2019 Contents 1 Getting Started 2 2 How to Create Instances of Fuzzy Numbers 3 2.1 Arbitrary Fuzzy Numbers . 3 2.1.1 Definition by Side Functions . 3 2.1.2 Definition by α-cut Bounds . 5 2.1.3 Definition with Generating Functions Omitted: Shadowed Sets . 6 2.2 Using Numeric Approximations of α-cut or Side Generators . 7 2.3 Trapezoidal Fuzzy Numbers . 8 2.4 Piecewise Linear Fuzzy Numbers . 10 2.5 Fuzzy Numbers with Sides Given by Power Functions . 14 3 Depicting Fuzzy Numbers 15 4 Basic Computations on and Characteristics of Fuzzy Numbers 18 4.1 Support and Core, and Other α-cuts . 19 4.2 Membership Function Evaluation . 19 4.3 “Typical” Value . 20 4.4 Measures of “Nonspecificity” . 21 5 Operations on Fuzzy Numbers 21 5.1 Arithmetic Operations . 21 5.2 Applying Functions . 22 5.2.1 Special Functions . 23 6 Approximation of Fuzzy Numbers 23 6.1 Metrics in the Space of Fuzzy Numbers . 24 6.2 Approximation by Trapezoidal Fuzzy Numbers . 24 6.2.1 Naïve Approximation . 24 6.2.2 L2-nearest Approximation . 25 6.2.3 Expected Interval Preserving Approximation . 26 6.2.4 Approximation with Restrictions on Support and Core . 27 1 6.3 Approximation by Piecewise Linear Fuzzy Numbers .
    [Show full text]
  • University of Alberta Neuro-Fuzzy Architecture Based on Complex
    University of Alberta Neuro-fuzzy architecture based on complex fuzzy logic by Sara Aghakhani A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Master of Science in Software Engineering and Intelligent Systems Department of Electrical and Computer Engineering ©Sara Aghakhani Spring 2010 Edmonton, Alberta Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission. Library and Archives Bibliothèque et Canada Archives Canada Published Heritage Direction du Branch Patrimoine de l’édition 395 Wellington Street 395, rue Wellington Ottawa ON K1A 0N4 Ottawa ON K1A 0N4 Canada Canada Your file Votre référence ISBN:978-0-494-56626-8 Our file Notre référence ISBN: 978-0-494-56626-8 NOTICE: AVIS: The author has granted a non- L’auteur a accordé une licence non exclusive exclusive license allowing Library and permettant à la Bibliothèque et Archives Archives Canada to reproduce, Canada de reproduire, publier, archiver, publish, archive, preserve, conserve, sauvegarder, conserver, transmettre au public communicate to the public by par télécommunication ou par l’Internet, prêter, telecommunication or on the Internet, distribuer et vendre des thèses partout dans le loan, distribute and sell theses monde, à des fins commerciales ou autres, sur worldwide, for commercial or non- support microforme, papier, électronique et/ou commercial purposes, in microform, autres formats.
    [Show full text]
  • Gradual Complex Numbers
    16th World Congress of the International Fuzzy Systems Association (IFSA) 9th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT) Gradual Complex Numbers Emmanuelly Sousa 1 Regivan H N Santiago2 1,2Group for Logic, Language, Information, Theory and Applications - LoLITA∗ Abstract Finally, in order to achieve the results, this paper proposes a notion of distance for GCNs. This paper aims to introduce the concept of Grad- ual Complex Number (GCN) based on the ex- 2. Gradual Real Number(GCN) isting definition of gradual numbers and to show that the algebraic and polar forms, as well as some Gradual real numbers were introduced by J. Fortin, algebraic properties, of complex numbers can be di- Didier Dubois e H. Fargier in [4]. rectly extended from the crisp case. Furthermore, a kind of distance is established in order to deal with Definition 2.1 A gradual real number r˜ is de- such numbers. fined by a total assignment function Ar˜ : (0, 1] → R such that Ar˜(1) = r. Keywords: Fuzzy Numbers, Gradual Numbers, Gradual Complex Numbers. Consider R˜ as the set of all gradual real num- bers. A real number r can be seen as a gradual real 1. Introduction number r˜ such that, for all α ∈ (0, 1], ar˜(α) = r. The operations defined in R can be extended to the In 1965, Lofti Zadeh [4] introduced the concept of set R˜. It is easy to see that the operations of ad- fuzzy sets to quantify subjective linguistic terms dition and multiplication defined on R˜ inherits the such as: “approximately”, “around” etc.
    [Show full text]
  • ICIC Express Letters
    9ROXPH1XPEHU % 2FWREHU,661; I C I C International ,&,&([SUHVV/HWWHUV $Q,QWHUQDWLRQDO-RXUQDORI5HVHDUFKDQG6XUYH\V (GLWRUVLQ&KLHI -XQ]R:DWDGD:DVHGD8QLYHUVLW\-DSDQ <DQ6KL7RNDL8QLYHUVLW\-DSDQ ,QGH[HGE\ (L&RPSHQGH[ (OVHYLHU 6FRSXV (OVHYLHU ,163(& ,(7 3XEOLVKHGE\,&,&,QWHUQDWLRQDO KWWSZZZLMLFLFRUJLFLFHOKWP ICIC Express Letters Editors-in-Chief Junzo Watada, Graduate School of Information, Production & Systems, Waseda University 2-7, Hibikino, Wakamatsu, Kitakyushu 808-0135, Japan Yan Shi, Graduate School of Science and Technology, Tokai University 9-1-1, Toroku, Kumamoto 862-8652, Japan Advisory Board Steve P. Banks, UK Tianyou Chai, China Tom Heskes, Netherlands Lakhmi C. Jain, Australia Jerry M. Mendel, USA Masaharu Mizumoto, Japan Witold Pedrycz, Canada Jeng-Shyang Pan, Taiwan Peng Shi, UK Jianrong Tan, China Takeshi Yamakawa, Japan Lotfi A. Zadeh, USA Kaiqi Zou, China Associate Editors Ramesh Agarwal, USA Jamal Ameen, UK Rawshan Basha, UAE Michael V. Basin, Mexico Yasar Becerikli, Turkey Genci Capi, Japan Ozer Ciftcioglu, Netherlands Joshua Dayan, Israel Vasile Dragan, Romania Kei Eguchi, Japan Keiichi Horio, Japan Chao-Hsing Hsu, Taiwan Xiangpei Hu, China Gerardo Iovane, Italy Karim Kemih, Algeria Dongsoo Kim, Korea Hyoungseop Kim, Japan Huey-Ming Lee, Taiwan Zuoliang Lv, China Magdi Mahmoud, Saudi Arabia Anatolii Martynyuk, Ukraine Tshilidzi Marwala, South Africa Subhas Misra, India Takuo Nakashima, Japan Nikos Nikolaidis, Greece Sing Kiong Nguang, New Zealand Pavel Pakshin, Russia Jiqing Qiu, China Chin-Shiuh Shieh, Taiwan
    [Show full text]