نتایج جستجو برای: l fuzzifying rank function
تعداد نتایج: 1824534 فیلتر نتایج به سال:
Let X be a a complete hyperbolic threefold of a finite volume with only one cusp. For a unitary local system ρ of rank one on X, one may associte the Ruelle L-function Rρ(z). Suppose the restriction of ρ to the cusp is nontrivial. We will show that the Ruelle L-function has a pole at the origin whose order is equal to −2dimH(X, ρ). Moreover we will prove if dimH(X, ρ) is zero Rρ(0) is equal to ...
Cost and operation of inventory depends a great deal on what happens to demand when the system is out of stock. In real inventory systems, it is more reasonable to assume that part of the excess demand is backordered and the rest is lost. However, the amount of backorders (or lost sales) often incurs disturbance due to various uncertainties. To incorporate this reality, this article attempts to...
1. Preliminaries. A functor from a category of combinatorial geometries, or equivalently a category of geometric lattices, to a category of commutative algebras will be described, and some properties of this functor will be investigated. In particular, a cohomology will be associated to each point of a geometry and will be derived from the associated algebra. If (G, S) is a geometry on a set S ...
INTRODUCTION Chronic Periodontitis (CP) is an inflammatory disease of bacterial origin that results in alveolar bone destruction. Porphyromonas gingivalis (Pg), one of the main periopathogens, initiates an inflammatory cascade by host immune cells thereby increasing recruitment and activity of osteoclasts, the bone resorbing cells, through enhanced production of the crucial osteoclastogenic fac...
We prove that a minimal automaton has a minimal adjacency matrix rank and a minimal adjacency matrix nullity using equitable partition (from graph spectra theory) and Nerode partition (from automata theory). This result naturally introduces the notion of matrix rank into a regular language L, the minimal adjacency matrix rank of a deterministic automaton that recognises L. We then define and fo...
In this paper we consider the reduced rank regression problem min rank ¯ L=n,L 3 det Y α − ¯ LP β − L 3 U α Y α − ¯ LP β − L 3 U α T solved by maximum-likelihood-inspired State-Space Subspace System Identification algorithms. We conclude that the determinant criterion is, due to potential rank-deficiencies, not general enough to handle all problem instances. The main part of the paper analyzes ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید