using image processing and artificial intelligence systems in agriculture and food industry is increasing daily. the purpose of this research is to study the feasibility of using image processing technique in predicting process of moisture content changes on green tea sheets during the drying using predictive artificial intelligence systems such as: artificial neural networks and adaptive neuro...

In 1982 (see [1]) Imre Bárány observed that some of the classical theorems in convexity admit interesting and mysterious generalizations which he called “colorful theorems”. For example, the Colorful Helly Theorem says that if a family (repetitions of the same sets are allowed) of compact convex sets in Rk is colored (properly) with k+1 colors and it has the property that any choice of k+1 diff...

A common problem for marketing strategists is how to appropriately segment the market and select segment-specific marketing strategies. This paper presents a novel approach which integrates Fuzzy Delphi method, self-organizing maps (SOM) and a visualization technique to cluster customers according to their various characteristic variables and visualize segments by producing colorful market maps...

In this paper, we introduce a decomposition theory for fuzzy cognitive maps (FCMs). First, we partition the set of vertices of an FCM into blocks according to an equivalence relation, and by regarding these blocks as vertices we construct a quotient FCM. Second, each block induces a natural sectional FCM of the original FCM, which inherits the topological structure as well as the inference from...

We demonstrate that the topological Helly theorem and the algebraic Auslander-Buchsbaum may be viewed as different versions of the same phenomenon. Using this correspondence we show how the colorful Helly theorem of I.Barany and its generalizations by G.Kalai and R.Meshulam translates to the algebraic side. Our main results are algebraic generalizations of these translations, which in particula...

Given a vertex-colored arc-weighted directed acyclic graph G , the Maximum Colorful Subtree problem (or MCS ) aims at finding an arborescence of maximum weight in which no color appears more than once. The was originally introduced [1] context de novo identification metabolites by tandem mass spectrometry. However, thorough analysis initial motivation shows that formal definition should be amen...

Abstract Let K be a simplicial complex on vertex set V . is called d - Leray if the homology groups of any induced subcomplex are trivial in dimensions and higher. collapsible it can reduced to void by sequentially removing simplex size at most that contained unique maximal face. Motivated results Eckhoff Montejano Oliveros “tolerant” versions Helly’s theorem, we define t tolerance , $${\mathca...

The colorful Carathéodory theorem asserts that if X1, X2, . . . , Xd+1 are sets in R, each containing the origin 0 in its convex hull, then exists a set S ⊆ X1 ∪ · · · ∪ Xd+1 with |S ∩ Xi| = 1 for all i = 1, 2, . . . , d + 1 and 0 ∈ conv(S) (we call conv(S) a colorful covering simplex). Deza, Huang, Stephen and Terlaky proved that if the Xi are in general position with respect to 0 (consequentl...

network sensors consist of sensor nodes in which every node covers a limited area. the most common use ofthese networks is in unreachable fields.sink is a node that collects data from other nodes.one of the main challenges in these networks is the limitation of nodes battery (power supply). therefore, the use oftopology control is required to decrease power consumption and increase network acce...