Dynamin (DNM2) centronuclear myopathy (CNM) has variable age of onset, distal greater than proximal muscle weakness, ptosis with or without extraocular muscle weakness, and a characteristic muscle biopsy with radial sarcoplasmic strands giving spoke like appearance. The following case report highlights clinical, electrophysiology, and pathology features of… (More)
Let χ denote the space of all gai sequences and Λ the space of all analytic sequences. First we show that the set E = s (k) : k = 1, 2, 3, · · · is a determining set for χ M. The set of all finite matrices transforming χ M into FK-space Y denoted by (χ M : Y). We characterize the classes (χ M : Y) when Y = summary we have the following table: (c 0) π c π χ… (More)
In 1963, Erd˝ os and Sós conjectured that every graph of average degree greater than k − 1 contains every tree of order k + 1. Recently, there have been a variety of partial solutions to this conjecture showing the conjecture is true for various classes of graphs. We were able to test the conjecture for graphs with vertices varying between 14 and 30 and k… (More)
In this paper we tried to introduce a new variety of continuous and open functions called Somewhat almost g-continuous functions and Somewhat almost g-open functions. Its basic properties are discussed.
In this paper, we introduced parallel communicating flip pushdown automata communicating by stacks. PCFPA (2) equals the family of recursively enumerable languages Also we have proved that. RPCFPA (3) equals the family of recursively enumerable languages.
In this paper we introduced the Orlicz space of χ π. We establish some inclusion relations, topological results and we characterize the duals of the Orlicz of χ π sequence spaces.
This report discusses the size and shape comparison of objects represented by two sets of three dimensional data. We examine geometric invariants such as pairwise distances, distances from the centroid, and the volumes of the tetrahedrons. We examine rigid motion estimation using Procrustes analysis, the iterative closest point algorithm, and various uses… (More)
In 1959 Gallai  showed that the vertex independence number and the vertex covering number of a graph G = (V, E) sum to |V |. Over the last twenty years, many results similar to Gallai's Theorem have been observed . These theorems are referred to as " Gallai Theorems " and usually have the form: α + β = n. Slater  described several graph subset… (More)