AND SELF-ORGANIZED MAP NEURAL NETWORKS Borching Su and Shyh-Kang Jeng Graduate Institute of Communication Engineering and Department of Electrical Engineering National Taiwan University Taipei, Taiwan, ROC. Email: [email protected] ABSTRACT This paper presents a new method for musical chord recognition based on a model of human perception. We classify the chords directly from the sound wi...

A circle graph is the intersection graph of a family of chords on a circle. There is no known characterization of circle graphs by forbidden induced subgraphs that do not involve the notions of local equivalence or pivoting operations. We characterize circle graphs by a list of minimal forbidden induced subgraphs when the graph belongs to one of the following classes: linear domino graphs, P4-t...

Consider a family of chords i n a c ircle . is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. I n t h i s paper, we describe e f f i c i en t algorithms for finding a ma3cimwn clique and a maximum independent s e t of circle graphs. the number of vertices i n the graph. Key WO&: Circle graph, transi t ive graph, ...

To improve poloidal rotation measurement capabilities on the DIII-D tokamak, new chords for the charge exchange recombination spectroscopy (CER) diagnostic have been installed. CER is a common method for measuring impurity rotation in tokamak plasmas. These new chords make measurements on the high-field side of the plasma. They are designed so that they can measure toroidal rotation without the...

In this paper, we have proved edge-magic total labeling of cycles with P3 chords.