DOCSLIB.ORG

Modified Sweep Algorithm with Fuzzy-Based Parameters for Public Bus Route Selection

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Modified Sweep Algorithm with Fuzzy-Based Parameters for Public Bus Route Selection I declare that I have read this thesis and in my opinion this thesis has satisfied the scope and quality for the award of the degree of Doctor of Philosophy in Computer Science”. Signature : Name of Supervisor : PM. Dr. Rose Alinda Alias Date : 17 Februari 2003 Signature : Name of Supervisor : PM. Dr. Siti Mariyam Shamsuddin Date : 17 Februari 2003 Signature : Name of Supervisor : PM. Dr. Md. Noor Md. Sap Date : 17 Februari 2003 BAHAGIAN A – Pengesahan Kerjasama* Adalah disahkan bahawa projek penyelidikan tesis ini telah dilaksanakan melalui kerjasama antara _______________________ dengan _______________________ Disahkan oleh: Tandatangan : Tarikh : Nama : Jawatan : (Cop rasmi) * Jika penyediaan tesis/projek melibatkan kerjasama. BAHAGIAN B – Untuk Kegunaan Pejabat Sekolah Pengajian Siswazah Tesis ini telah diperiksa dan diakui oleh: Nama dan Alamat Pemeriksa Luar : Prof. Dr. Zainodin Jubok Pusat Pengajian Pascasiswazah Universiti Malaysia Sabah Malaysia Nama dan Alamat Pemeriksa Dalam : PM. Dr. Safaai Deris Fakulti Sains Komputer dan Sistem Maklumat UTM Skudai, Johor Bahru Malaysia Nama Penyelia Lain (jika ada) : 1. PM. Dr. Siti Mariyam Shamsuddin 2. PM. Dr. Md. Noor Md. Sap Disahkan oleh Peno long Pendaftar di SPS: Tandatangan : Tarikh : Nama : Hj. Dahari bin Hj. Derani MODIFIED SWEEP ALGORITHM WITH FUZZY-BASED PARAMETERS FOR PUBLIC BUS ROUTE SELECTION GUNADI WIDI NURCAHYO A thesis is submitted in fulfilment of the requirements for the award of the Degree of Doctor of Philosophy Faculty of Computer Science and Information System Universiti Teknologi Malaysia APRIL, 2003 To my parents and especially, My beloved wife, Retno Ngesti Rahayuningsih and My beloved son, Raihan Widi Ekoprabowo ACKNOWLEDGEMENTS I would first and foremost like to extend my deepest gratitude and appreciation to my supervisors Dr. Siti Mariyam Shamsuddin, Associate Professor Dr. Rose Alinda Alias, and Associate Professor Dr. Mohammad Noor Md. Sap for their support and encouragement throughout the study. I would also like to thank H. Herman Nawas and Hj. Zerni Melmusi, Akt., MM. for their financial support and, most of all, their invaluable help and motivation towards the completion of my study. I would like to thank my colleagues, staff, and lecturers in the Faculty of Computer Science and Information System for their help, facilities, and conducive working environment. Finally, above all, I would like to praise and thank almighty Allah SWT for giving me the determination and will to complete this study. v ABSTRACT This research investigates route selection for a public bus routing problem. Route selection in many vehicle routing problems is based on distance because the purpose is mainly for goods delivery. For a public bus transportation company, route selection is mainly based on demand. However, in the case being investigated in this study, demand could not be determined because the routes considered for selection were new routes which have never been used before. This research developed a technique for public bus route selection based on unknown demand. This research consists of three phases. In the first phase, existing sweep algorithm was tested using the routes currently used by the company. Then, in the second phase, sweep algorithm was modified with an extension of weighted-directed (WIDI) graph technique to replace the Travelling Salesman Problem (TSP) technique. In the third phase, this research incorporated a fuzzy system which fuzzified the three parameters of demand, distance and type of road. The initial experiment demonstrated that the existing algorithm did not solve the public bus route selection because it was based on TSP technique, where distance is the main criteria. The modified sweep algorithm implemented in the second phase generated routes based on demand. However, this experiment used known demand, whereas the problem considered in this research is based on unknown demand. Therefore, in the third phase, the modified sweep algorithm was implemented using fuzzy-based parameters consisting of three stages. The route identification stage identified all new nodes and links. The route evaluation stage converted fuzzy data using the fuzzy system into crisp values which were assigned as the weights of links. Finally, route selection stage implemented the proposed WIDI graph search technique to select new links. It was demonstrated that the modified sweep algorithm using fuzzy-based parameters was able to select new routes with unknown demand. The fuzzy-based technique had successfully represented the unknown demand. Therefore, the technique was able to generate the same route as that which was generated by the modified sweep algorithm with known demand. However, the fuzzy-based technique had an advantage of being able to represent the unknown demand in linguistic value. vi ABSTRAK Penyelidikan ini mengkaji pemilihan laluan bagi masalah menentukan laluan bas awam. Pemilihan laluan bagi kebanyakan masalah menentukan laluan kenderaan adalah berdasarkan kepada jarak kerana tujuan utamanya adalah untuk penghantaran barang. Bagi syarikat pengangkutan bas awam, pemilihan laluan adalah lazimnya berdasarkan permintaan. Walau bagaimanapun, dalam kes yang disiasat dalam kajian ini, permintaan tidak dapat ditentukan kerana laluan yang dipertimbangkan untuk pemilihan adalah laluan-laluan baru yang tidak pernah digunakan. Kajian ini telah manghasilkan suatu teknik pemilihan laluan bagi bas awam berdasarkan permintaan yang tidak diketahui. Penyelidikan ini terdiri daripada tiga fasa. Dalam fasa pertama, algoritma sweep sedia ada telah diuji menggunakan laluan-laluan yang sedang digunakan oleh syarikat tersebut. Di dalam fasa kedua pula, algoritma sweep diubahsuai dengan meluaskan teknik graf terarah untuk menggantikan teknik Travelling Salesman Problem (TSP). Di dalam fasa ketiga, kajian ini menggunakan sistem kabur di mana ketiga-tiga parameter permintaan, jarak dan jenis jalan telah dikaburkan. Eksperimen awalan menunjukkan algoritma sedia ada tidak dapat menyelesaikan masalah pemilihan laluan bas awam kerana ia berasaskan teknik TSP, di mana keriteria utama ialah jarak. Algoritma modified sweep yang digunakan dalam fasa kedua menjanakan laluan berdasarkan permintaan. Walau bagamanapun, eksperimen ini menggunakan permintaan yang diketahui, sedangkan masalah yang dipertimbangkan dalam penyelidikan ini berdasarkan permintaan yang tidak diketahui. Oleh itu, dalam fasa ketiga, modified sweep telah dilasanakan menggunakan parameter-parameter berteraskan system kabur yang terdiri daripada tiga peringkat. Peringkat pengecaman laluan mengenalpasti semua nod dan pautan baru. Peringkat penilaian laluan menukar data kabur kepada nilai jelas menggunakansistem kabur yang ditetapkan sebagai pemberat pautan. Akhir sekali, peringkat pemilihan laluan melaksanakan teknik carian graf WIDI yang dicadangkan untuk memilih pautan-pautan baru. Kajian ini menunjukkan bahawa algoritma modified sweep menggunakan parameter berasaskan sistem kabur boleh memilih laluan-laluan baru di mana permintaan tidak diketahui. Teknik berasaskan sistem kabur telah berjaya mewakilkan permintaan yang tidak diketahui. Oleh itu, teknik tersebut boleh menjana laluan yang sama seperti laluan yang dijana oleh modified sweep dengan permintaan yang diketahui. Walau bagaimanapun, teknik berasaskan system kabur ini mempunyai kelebihan untuk mewakili permintaan yang tidak diketahui dalam bentuk nilai linguistik. vii LIST OF CONTENTS CHAPTER TITLE PAGE ABSTRACT v ABSTRAK vi LIST OF CONTENTS vii LIST OF TABLES xiii LIST OF FIGURES xv LIST OF ABBREVIATIONS xviii LIST OF APPENDICES xx I INTRODUCTION 1 1.1 Introduction to Vehicle Routing Problem 1 1.2 Background of the Problem 4 1.3 Problem Statement 6 1.4 Objectives of the Study 7 1.5 Importance of the Study 7 1.6 Scope of the Study 8 1.7 Assumptions 9 1.8 Organization of the Thesis 9 II LITERATURE REVIEW 12 2.1 Introduction 12 2.2 Vehicle Routing Problem (VRP) 12 2.2.1 Definition 12 2.2.2 Current Problems in Vehicle Routing Problem 14 viii 2.2.2.1 Vehicle Dispatch Problem (VDP) 14 2.2.2.2 Travelling Salesman Problem (TSP) 15 2.2.2.3 Vehicle Routing Problem with Time Windows (VRPTW) 16 2.2.2.4 Vehicle Fleet Planning (VFP) 17 2.2.2.5 Route Selection Problem (RSP) 17 2.2.3 Current Problems in Public Bus Routing Problem (PBRP) 19 2.2.4 Solutions in VRP and PBRP 20 2.3 Selected Solutions and Direction of the Solutions 26 2.3.1 Sweep Algorithm 26 2.3.2 Fuzzy System 27 2.4 Fuzzy Systems in Vehicle Routing Problem 28 2.5 Summary 29 III RESEARCH METHODOLOGY 30 3.1 Introduction 30 3.2 Operational Framework 30 3.2.1 Case Study 32 3.2.1.1 Profile of the Company 32 3.2.1.2 Route Selection of the Company 35 3.2.1.3 Bus Routing of the Company 39 3.2.1.4 Route Profile 45 ix 3.2.2 Analysis and Description of the Problem 46 3.2.2.1 Input Data 46 3.2.2.2 Data Collection 47 3.2.2.3 Data Analysis 47 3.2.3 Problem Formulation 48 3.2.4 Design and Development 48 3.2.4.1 Model Formulation 48 3.2.4.2 Testing and Validation 49 3.3 Summary 51 IV PROBLEM DESCRIPTION AND MODEL FORMULATION 52 4.1 Introduction 52 4.2 Problem Definition 52 4.2.1 VRP and Public Bus Route Selection 53 4.2.2 Characteristics of the Problems 54 4.3 Model Formulation 56 4.3.1 Sweep Formulation 56 4.3.2 TSP Formulation 58 4.3.3 Graph 60 4.4 Summary 61 V SWEEP ALGORITHM 62 5.1 Introduction 62 5.2 Sweep Algorithm 62 5.3 Sweep Algorithm for Public Bus Routing Problem 65 5.3.1 Definition 65 5.3.2 Results of Original Sweep Algorithm 67 x 5.3.3 Evaluation of the Original Sweep Algorithm 70 5.4 Summary 71
Load more

Recommended publications
  • Discover Linear Algebra Incomplete Preliminary Draft
    Discover Linear Algebra Incomplete Preliminary Draft Date: November 28, 2017 L´aszl´oBabai in collaboration with Noah Halford All rights reserved. Approved for instructional use only. Commercial distribution prohibited. c 2016 L´aszl´oBabai. Last updated: November 10, 2016 Preface TO BE WRITTEN. Babai: Discover Linear Algebra. ii This chapter last updated August 21, 2016 c 2016 L´aszl´oBabai. Contents Notation ix I Matrix Theory 1 Introduction to Part I 2 1 (F, R) Column Vectors 3 1.1 (F) Column vector basics . 3 1.1.1 The domain of scalars . 3 1.2 (F) Subspaces and span . 6 1.3 (F) Linear independence and the First Miracle of Linear Algebra . 8 1.4 (F) Dot product . 12 1.5 (R) Dot product over R ................................. 14 1.6 (F) Additional exercises . 14 2 (F) Matrices 15 2.1 Matrix basics . 15 2.2 Matrix multiplication . 18 2.3 Arithmetic of diagonal and triangular matrices . 22 2.4 Permutation Matrices . 24 2.5 Additional exercises . 26 3 (F) Matrix Rank 28 3.1 Column and row rank . 28 iii iv CONTENTS 3.2 Elementary operations and Gaussian elimination . 29 3.3 Invariance of column and row rank, the Second Miracle of Linear Algebra . 31 3.4 Matrix rank and invertibility . 33 3.5 Codimension (optional) . 34 3.6 Additional exercises . 35 4 (F) Theory of Systems of Linear Equations I: Qualitative Theory 38 4.1 Homogeneous systems of linear equations . 38 4.2 General systems of linear equations . 40 5 (F, R) Affine and Convex Combinations (optional) 42 5.1 (F) Affine combinations .
    [Show full text]
  • Download Special Issue
    Scientific Programming Scientific Programming Techniques and Algorithms for Data-Intensive Engineering Environments Lead Guest Editor: Giner Alor-Hernandez Guest Editors: Jezreel Mejia-Miranda and José María Álvarez-Rodríguez Scientific Programming Techniques and Algorithms for Data-Intensive Engineering Environments Scientific Programming Scientific Programming Techniques and Algorithms for Data-Intensive Engineering Environments Lead Guest Editor: Giner Alor-Hernández Guest Editors: Jezreel Mejia-Miranda and José María Álvarez-Rodríguez Copyright © 2018 Hindawi. All rights reserved. This is a special issue published in “Scientific Programming.” All articles are open access articles distributed under the Creative Com- mons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Editorial Board M. E. Acacio Sanchez, Spain Christoph Kessler, Sweden Danilo Pianini, Italy Marco Aldinucci, Italy Harald Köstler, Germany Fabrizio Riguzzi, Italy Davide Ancona, Italy José E. Labra, Spain Michele Risi, Italy Ferruccio Damiani, Italy Thomas Leich, Germany Damian Rouson, USA Sergio Di Martino, Italy Piotr Luszczek, USA Giuseppe Scanniello, Italy Basilio B. Fraguela, Spain Tomàs Margalef, Spain Ahmet Soylu, Norway Carmine Gravino, Italy Cristian Mateos, Argentina Emiliano Tramontana, Italy Gianluigi Greco, Italy Roberto Natella, Italy Autilia Vitiello, Italy Bormin Huang, USA Francisco Ortin, Spain Jan Weglarz, Poland Chin-Yu Huang, Taiwan Can Özturan, Turkey
    [Show full text]
  • Memory Capacity of Neural Turing Machines with Matrix Representation
    Memory Capacity of Neural Turing Machines with Matrix Representation Animesh Renanse * [email protected] Department of Electronics & Electrical Engineering Indian Institute of Technology Guwahati Assam, India Rohitash Chandra * [email protected] School of Mathematics and Statistics University of New South Wales Sydney, NSW 2052, Australia Alok Sharma [email protected] Laboratory for Medical Science Mathematics RIKEN Center for Integrative Medical Sciences Yokohama, Japan *Equal contributions Editor: Abstract It is well known that recurrent neural networks (RNNs) faced limitations in learning long- term dependencies that have been addressed by memory structures in long short-term memory (LSTM) networks. Matrix neural networks feature matrix representation which inherently preserves the spatial structure of data and has the potential to provide better memory structures when compared to canonical neural networks that use vector repre- sentation. Neural Turing machines (NTMs) are novel RNNs that implement notion of programmable computers with neural network controllers to feature algorithms that have copying, sorting, and associative recall tasks. In this paper, we study augmentation of mem- arXiv:2104.07454v1 [cs.LG] 11 Apr 2021 ory capacity with matrix representation of RNNs and NTMs (MatNTMs). We investigate if matrix representation has a better memory capacity than the vector representations in conventional neural networks. We use a probabilistic model of the memory capacity us- ing Fisher information and investigate how the memory capacity for matrix representation networks are limited under various constraints, and in general, without any constraints. In the case of memory capacity without any constraints, we found that the upper bound on memory capacity to be N 2 for an N ×N state matrix.
    [Show full text]
  • Noncommutative Spaces from Matrix Models Lei Lu Allen B Stern, Committee Chair Nobuchika Okada Benjamin Harms Gary Mankey Martyn
    NONCOMMUTATIVE SPACES FROM MATRIX MODELS by LEI LU ALLEN B STERN, COMMITTEE CHAIR NOBUCHIKA OKADA BENJAMIN HARMS GARY MANKEY MARTYN DIXON A DISSERTATION Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Physics and Astronomy in the Graduate School of The University of Alabama TUSCALOOSA, ALABAMA 2016 Copyright Lei Lu 2016 ALL RIGHTS RESERVED Abstract Noncommutative (NC) spaces commonly arise as solutions to matrix model equations of motion. They are natural generalizations of the ordinary commuta- tive spacetime. Such spaces may provide insights into physics close to the Planck scale, where quantum gravity becomes relevant. Although there has been much research in the literature, aspects of these NC spaces need further investigation. In this dissertation, we focus on properties of NC spaces in several different contexts. In particular, we study exact NC spaces which result from solutions to matrix model equations of motion. These spaces are associated with finite-dimensional Lie-algebras. More specifically, they are two-dimensional fuzzy spaces that arise from a three-dimensional Yang-Mills type matrix model, four-dimensional tensor- product fuzzy spaces from a tensorial matrix model, and Snyder algebra from a five-dimensional tensorial matrix model. In the first part of this dissertation, we study two-dimensional NC solutions to matrix equations of motion of extended IKKT-type matrix models in three- space-time dimensions. Perturbations around the NC solutions lead to NC field theories living on a two-dimensional space-time. The commutative limit of the solutions are smooth manifolds which can be associated with closed, open and static two-dimensional cosmologies.
    [Show full text]
  • Mathfest 2018
    Abstracts of Papers Presented at MathFest 2018 Denver, CO August 1 – 4, 2018 Published and Distributed by The Mathematical Association of America Contents Invited Addresses 1 Earle Raymond Hedrick Lecture Series by Gigliola Staffilani . 1 Nonlinear Dispersive Equations and the Beautiful Mathematics That Comes with Them Lecture 1: Thursday, August 2, 11:00–11:50 AM, Plaza Ballroom A, B, & C, Plaza Building Lecture 2: Friday, August 3, 10:30–11:20 AM, Plaza Ballroom A, B, & C, Plaza Building Lecture 3: Saturday, August 4, 10:00–10:50 AM, Plaza Ballroom A, B, & C, Plaza Building . 1 AMS-MAA Joint Invited Address . 1 Gravity’s Action on Light: A Mathematical Journey by Arlie Petters Thursday, August 2, 10:00–10:50 AM, Plaza Ballroom A, B, & C, Plaza Building . 1 MAA Invited Address . 1 Inclusion-exclusion in Mathematics: Who Stays in, Who Falls out, Why It Happens, and What We Should Do About It by Eugenia Cheng Friday, August 3, 11:30–12:20 AM, Plaza Ballroom A, B, & C, Plaza Building . 1 Snow Business: Scientific Computing in the Movies and Beyond by Joseph Teran Saturday, August 4, 11:00–11:50 AM, Plaza Ballroom A, B, & C, Plaza Building . 1 Mathematical Medicine: Modeling Disease and Treatment by Lisette de Pillis Thursday, August 2, 9:00–9:50 AM, Plaza Ballroom A, B, & C, Plaza Building . 2 MAA James R.C. Leitzel Lecture . 2 The Relationship between Culture and the Learning of Mathematics by Talitha Washington Saturday, August 4, 9:00–9:50 AM, Plaza Ballroom A, B, & C, Plaza Building .
    [Show full text]
  • Equivariant Reduction of Matrix Gauge Theories and Emergent Chaotic Dynamics a Thesis Submitted to the Graduate School of Natura
    EQUIVARIANT REDUCTION OF MATRIX GAUGE THEORIES AND EMERGENT CHAOTIC DYNAMICS A THESIS SUBMITTED TO THE GRADUATE SCHOOL OF NATURAL AND APPLIED SCIENCES OF MIDDLE EAST TECHNICAL UNIVERSITY BY GÖKSU CAN TOGA˘ IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN PHYSICS JULY 2018 Approval of the thesis: EQUIVARIANT REDUCTION OF MATRIX GAUGE THEORIES AND EMERGENT CHAOTIC DYNAMICS submitted by GÖKSU CAN TOGA˘ in partial fulfillment of the requirements for the degree of Master of Science in Physics Department, Middle East Technical Uni- versity by, Prof. Dr. Halil Kalıpçılar Dean, Graduate School of Natural and Applied Sciences Prof. Dr. Altug˘ Özpineci Head of Department, Physics Prof. Dr. Seçkin Kürkçüoglu˘ Supervisor, Physics Department, METU Examining Committee Members: Prof. Dr. Ali Ulvi Yılmazer Physics Engineering Department, Ankara University Prof. Dr. Seçkin Kürkçüoglu˘ Physics Department, METU Assoc. Prof. Dr. Yusuf Ipeko˙ glu˘ Physics Department, METU Prof. Dr. Ismail˙ Turan Physics Department, METU Prof. Dr. Sadi Turgut Physics Department, METU Date: I hereby declare that all information in this document has been obtained and presented in accordance with academic rules and ethical conduct. I also declare that, as required by these rules and conduct, I have fully cited and referenced all material and results that are not original to this work. Name, Last Name: GÖKSU CAN TOGA˘ Signature : iv ABSTRACT EQUIVARIANT REDUCTION OF MATRIX GAUGE THEORIES AND EMERGENT CHAOTIC DYNAMICS Toga,˘ Göksu Can M.S., Department of Physics Supervisor : Prof. Dr. Seçkin Kürkçüoglu˘ July 2018, 74 pages In this thesis we focus on a massive deformation of a Yang-Mills matrix gauge the- ory.
    [Show full text]
  • Pattern Classification and Associative Recall by Neural Networks
    PATTERN CLASSIFICATION AND ASSOCIATIVE RECALL BY NEURAL NETWORKS Thesis by Tzi-Dar Chiueh In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1989 (Submitted May 24, 1989) -u- To MY BELOVED PARENTS A D MY DEAREST VVIFE -iii- Acknowledgements The author would like to express his gratitude to Professor Rodney M. Goodman for his guidance and interest in this work. Many helpful a.nd stimulating discussions with Amir Atiya a.nd John Miller are a.lso acknowledged. Tha.nks are a.lso due to Patrick Smythe, Sean Coffey, Kathleen Kramer, and Chi-Cha.o Cha.o. The author acknowledges fina.ncia.l support of two teaching assistantships a.nd various research assistantships from the Institute. Last, but not least, the author wishes to gratefully acknowledge his parents Mr. C. M. Chiueh a.nd Ms. Y. J . W. Chiueh, a.nd his wife Jill J . H. Wang for their encouragement and support during his period of residence at the Institute. -IV- Abstract The first part of this dissertation discusses a new classifier based on a multilayer feed-forward network architecture. The main idea is to map irregularly-distributed pro­ totypes in a classification problem to codewords that are organized in some way. Then the pattern classification problem is transformed into a threshold decoding problem, which is easily solved using simple hard-limiter neurons. At first we propose the new model and introduce two families of good "internal representation" codes. Then some analyses and software simulation concerning the storage capacity of this new model are done.
    [Show full text]
  • Discover Linear Algebra Incomplete Preliminary Draft
    Discover Linear Algebra Incomplete Preliminary Draft Date: November 28, 2017 L´aszl´oBabai in collaboration with Noah Halford All rights reserved. Approved for instructional use only. Commercial distribution prohibited. c 2016 L´aszl´oBabai. Last updated: November 10, 2016 Preface TO BE WRITTEN. Babai: Discover Linear Algebra. ii This chapter last updated August 21, 2016 c 2016 L´aszl´oBabai. Contents Notation ix I Matrix Theory 1 Introduction to Part I 2 1 (F, R) Column Vectors 3 1.1 (F) Column vector basics . 3 1.1.1 The domain of scalars . 4 1.2 (F) Subspaces and span . 8 1.3 (F) Linear independence and the First Miracle of Linear Algebra . 11 1.4 (F) Dot product . 16 1.5 (R) Dot product over R ................................. 18 1.6 (F) Additional exercises . 19 2 (F) Matrices 20 2.1 Matrix basics . 20 2.2 Matrix multiplication . 24 2.3 Arithmetic of diagonal and triangular matrices . 31 2.4 Permutation Matrices . 33 2.5 Additional exercises . 36 3 (F) Matrix Rank 39 3.1 Column and row rank . 39 iii iv CONTENTS 3.2 Elementary operations and Gaussian elimination . 40 3.3 Invariance of column and row rank, the Second Miracle of Linear Algebra . 43 3.4 Matrix rank and invertibility . 45 3.5 Codimension (optional) . 47 3.6 Additional exercises . 48 4 (F) Theory of Systems of Linear Equations I: Qualitative Theory 51 4.1 Homogeneous systems of linear equations . 51 4.2 General systems of linear equations . 54 5 (F, R) Affine and Convex Combinations (optional) 56 5.1 (F) Affine combinations .
    [Show full text]
  • On Equivalence of Matrices
    On Equivalence of Matrices ⋆ Daizhan Cheng Key Laboratory of Systems and Control, AMSS, Chinese Academy of Sciences, Beijing 100190, P.R.China Abstract A new matrix product, called the semi-tensor product (STP), is briefly reviewed. The STP extends the classical matrix product to two arbitrary matrices. Under STP the set of matrices becomes a monoid (semi-group with identity). Some related structures and properties are investigated. Then the generalized matrix addition is also introduced, which extends the classical matrix addition to a class of two matrices with different dimensions. Motivated by STP of matrices, two kinds of equivalences of matrices (including vectors) are introduced, which are called matrix equivalence (M-equivalence) and vector equivalence (V-equivalence) respectively. The lattice structure has been es- tablished for each equivalence. Under each equivalence, the corresponding quotient space becomes a vector space. Under M- equivalence, many algebraic, geometric, and analytic structures have been posed to the quotient space, which include (i) lattice structure; (ii) inner product and norm (distance); (iii) topology; (iv) a fiber bundle structure, called the discrete bundle; (v) bundled differential manifold; (vi) bundled Lie group and Lie algebra. Under V-equivalence, vectors of different dimensions form a vector space V, and a matrix A of arbitrary dimension is considered as an operator (linear mapping) on V. When A is a bounded operator (not necessarily square but includes square matrices as a special case), the generalized characteristic function, eigenvalue and eigenvector etc. are defined. In one word, this new matrix theory overcomes the dimensional barrier in certain sense. It provides much more freedom for using matrix approach to practical problems.
    [Show full text]
  • Synthesis of Hopfield Type Associative Memories
    On the EXISTENCE OF HOPFIELD NEURAL NETWORKS: SYNTHESIS OF HOPFIELD TYPE ASSOCIATIVE MEMORIES: Garimella Rama Murthy* and Moncef Gabbouj** *International Institute of Information Technology, Hyderabad, India **Tampere University of Technology, Tampere, Finland ABSTRACT In this research paper, the problem of existence of the associative memory synthesized by Hopfield is addressed and solved. Using Hadamard matrix of suitable dimension, an algorithm to synthesize real valued Hopfield neural network is discussed. The problem of existence and synthesis of a certain complex Hopfield neural network is addressed and solved. Also, synthesis of real and complex Hopfield type associative memories is discussed. Novel Complex Hadamard matrices are defined and studied. Using such matrices Novel Complex Hadamard transform is proposed. Also complex Walsh functions are proposed. Certain interesting distance measures are defined. 1. INTRODUCTION : In the progress of Science and Technology, homosapiens attempted mathematical model of natural ( physical / chemical / biological ) systems. Specifically, there were attempts to model the biological neural network. McCulloch and Pitts proposed a model of artificial neuron. Using that model of neuron and its variations, researchers comprehensively built the theory of Artificial Neural Networks (ANNs). In this theory, some important milestones were Single Layer Perceptron (SLP) and Multi Layer Perceptron (MLP). Multi Layer Perceptron is an example of feedforward neural network that received considerable attention and many applications continue to utilize such a neural network. Researchers were naturally motivated to investigate feedback neural networks. Hopfield effectively succeeded in proposing a feedback neural network model that acts as an associative memory. Hopfield neural network model led to intense research activity on various types of associative memories such as the Bi-directional Associative Memory (BAM ).
    [Show full text]
  • On Multimatrix Models Motivated by Random Noncommutative Geometry Ii: a Yang-Mills–Higgs Matrix Model
    ON MULTIMATRIX MODELS MOTIVATED BY RANDOM NONCOMMUTATIVE GEOMETRY II: A YANG-MILLS–HIGGS MATRIX MODEL CARLOS I. PEREZ-SANCHEZ Abstract. We continue the study of fuzzy geometries inside Connes’ spectral formalism and their relation to multimatrix models. In this companion paper to [arXiv:2007:10914, Ann. Henri Poincaré, 2021] we propose a gauge theory setting based on noncommuta- tive geometry, which—just as the traditional formulation in terms of almost-commutative manifolds—has the ability to also accommodate a Higgs field. However, in contrast to ‘almost-commutative manifolds’, the present framework employs only finite dimensional algebras. In a path-integral quantization approach to the Spectral Action, this allows to state Yang-Mills–Higgs theory (on four-dimensional Euclidean fuzzy space) as an explicit random multimatrix model obtained here, whose matrix fields exactly mirror those of the Yang-Mills–Higgs theory on a smooth manifold. 1. Introduction The approximation of smooth manifolds by finite geometries (or geometries de- scribed by finite dimensional algebras) has been treated in noncommutative ge- ometry (NCG) some time ago [LLS01] and often experiences a regain of interest; in [DLM14, CvS20], for instance, these arise from truncations of space to a finite resolution. In an ideologically similar vein but from a technically different view- point, this paper addresses gauge theories derived from the Spectral Formalism of NCG, using exclusively finite-dimensional algebras, also for the description of the space(time). This allows one to make precise sense of path integrals over noncom- mutative geometries. Although this formulation is valid at the moment only for a small class of geometries, the present method might shed light on the general problem of quantization of NCG, already tackled using von Neumann’s information theoretic entropy in [CCvS19] and [DKvS19], by fermionic and bosonic-fermionic second quantization, respectively.
    [Show full text]
  • Deep Quantum Geometry of Matrices
    Deep Quantum Geometry of Matrices Xizhi Han and Sean A. Hartnoll Department of Physics, Stanford University, Stanford, CA 94305-4060, USA Abstract We employ machine learning techniques to provide accurate variational wavefunc- tions for matrix quantum mechanics, with multiple bosonic and fermionic matrices. Variational quantum Monte Carlo is implemented with deep generative flows to search for gauge invariant low energy states. The ground state, and also long-lived metastable states, of an SU(N) matrix quantum mechanics with three bosonic matrices, as well as its supersymmetric ‘mini-BMN’ extension, are studied as a function of coupling and N. Known semiclassical fuzzy sphere states are recovered, and the collapse of these geome- tries in more strongly quantum regimes is probed using the variational wavefunction. We then describe a factorization of the quantum mechanical Hilbert space that corre- sponds to a spatial partition of the emergent geometry. Under this partition, the fuzzy sphere states show a boundary-law entanglement entropy in the large N limit. arXiv:1906.08781v2 [hep-th] 5 Jan 2020 1 Contents 1 Introduction3 2 The mini-BMN model5 2.1 Representation of the fermion wavefunction...................6 2.2 Gauge invariance and gauge fixing........................7 3 Architecture design for matrix quantum mechanics8 3.1 Parametrizing and sampling the gauge invariant wavefunction.........9 3.2 Benchmarking the architecture.......................... 10 4 The emergence of geometry 13 4.1 Numerical results, bosonic sector......................... 13 4.2 Semiclassical analysis of the fuzzy sphere..................... 15 4.3 Numerical results, supersymmetric sector..................... 18 5 Entanglement on the fuzzy sphere 21 5.1 Free field with an angular momentum cutoff..................
    [Show full text]