نتایج جستجو برای: totally fuzzy boundedset

تعداد نتایج: 118346  

Journal: :Discrete & Computational Geometry 2009

Journal: :Illinois Journal of Mathematics 1977

2009
Hooman Tahayori Giovanni Degli Antoni

about to represent. Once the membership function has been established (estimated or defined), the concept is described very precisely as the membership values are exact numerical quantities. This seems to raise a certain dilemma of excessive precision in describing imprecise phenomena. In fact, this concern has already sparked a lot of debates starting from the very inception of fuzzy sets.” Co...

Journal: :Transactions of the American Mathematical Society 1973

Planting project is one of the methods for improvement of rangeland degradation that exact implementation depends on many factors. Therefore, there is a need for a fundamental method. In the present study for locating planting project, in Maravehtappe watershed, analytic hierarchical process and fuzzy logic are applied. In this study, four ecological criteria of vegetation, soil, physiography a...

Journal: :IEEE Access 2021

This paper considers the power capture control problem of variable-speed wind turbine (VSWT) systems with flexible shaft. The objective is to optimize energy by tracking desired output. A novel command filter based adaptive signal feedback (PSF) method proposed design PSF controller for non-affine nonlinear VSWT a two-mass model which parameters are totally unknown. compensation dynamic adaptab...

Journal: :Complex & Intelligent Systems 2021

Abstract Due to the presence of two opposite directional thinking in relationships between countries and communication systems, systems may not always be balanced. Therefore, perfectness relations are highly important. It comes from how much they were connected each other for communication. In this study, first perfectly regular bipolar fuzzy graph is introduced examined regularity nodes. Then,...

N. Angel Benseera P. Jeyanthi,

A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید