We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...

‎let $g$ be a graph and $chi^{prime}_{aa}(g)$ denotes the minimum number of colors required for an‎ ‎acyclic edge coloring of $g$ in which no two adjacent vertices are incident to edges colored with the same set of colors‎. ‎we prove a general bound for $chi^{prime}_{aa}(gsquare h)$ for any two graphs $g$ and $h$‎. ‎we also determine‎ ‎exact value of this parameter for the cartesian product of ...

We describe a serial algorithm called feature-inclusion stochastic search, or FINCS, that uses online estimates of edge-inclusion probabilities to inform the process of Bayesian model determination in Gaussian graphical models. FINCS is compared to Metropolis-based search methods and found to be superior along a variety of dimensions, leading to more accurate and less volatile estimates of edge...

In this paper we deal with an NP -hard combinatorial optimization problem, the kcardinality tree problem in edge-weighted graphs. This problem has several applications in practice, which justify the need for eÆcient methods to obtain good solutions. Metaheuristic applications have already been shown to be successful in tackling the kcardinality tree problem in the past. In this paper we propose...

This explanation of what a brain is and does rests on informational first principles, because information theory, like its parent theory thermodynamics, is mathematically sacrosanct, itself resting on real-valued probability. Just as thermodynamics has enabled hyper-potent physical technologies from the internal combustion engine to the hydrogen bomb, so information theory has enabled hyper-per...

This paper explores the utility of the Independent Component Analysis (ICA) for remote sensing applications and compares it directly to the Principal Component Transform (PCT). The ICA is a signal processing method that extracts independent signal sources from a composite signal. It has been applied to a wide area of applications ranging from electroencephalography, for understanding brain acti...

in this paper we characterize hyper mv -algebras in which 0 or1 are scalar elements . we prove that any nite hyper mv -algebra that 0is a scaler element in it, is an mv -algebra. finally we characterize hypermv -algebras of order 2 and order 3.

hypercoagulable states are a group of conditions associated with an enhanced tendency toward blood clotting. although usual clinical manifestations of hypercoagulable states are thrombotic events such as deep venous thrombosis, hematoma can also occurs as a result of hypercoagulability in some patients. several inherited or acquired conditions may lead to hypercoagulable states. some of them in...

objectives: it is important to recognize any risk factors for the development of injuries in the athletic population. the aim of this study was to investigate the association between joint hyper mobility and low back pain in iranian hyper mobile and non-hyper mobile athletes. methods: 50 athletic patients with low back pain (age=23.20±12.79 years) and 51 healthy athletes (age=24.28±13.70) from ...

‎‎let $g=(v,e)$ be a simple graph‎. ‎an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_2$ defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$‎, ‎where $z_2={0,1}$ is the additive group of order 2‎. ‎for $iin{0,1}$‎, ‎let‎ ‎$e_f(i)=|f^{-1}(i)|$ and $v_f(i)=|(f^+)^{-1}(i)|$‎. ‎a labeling $f$ is called edge-friendly if‎ ‎$|e_f(1)-e_f(0)|le 1$‎. ‎$i_f(g)=v_f(...