this paper introduces an implicit scheme for a   continuous representation of nonexpansive mappings on a closed convex subset of a hilbert space with respect to a   sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup.   the main result is to    prove the strong convergence of the proposed implicit scheme to the unique solutio...

This paper introduces an implicit scheme for a   continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a   sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup.   The main result is to    prove the strong convergence of the proposed implicit scheme to the unique solutio...

We introduce a general implicit algorithm for finding a common element of‎ ‎the set of solutions of systems of equilibrium problems and the set of common fixed points‎ ‎of a sequence of nonexpansive mappings and a continuous representation of nonexpansive mappings‎. ‎Then we prove the strong convergence of the proposed implicit scheme to the unique solution of the minimization problem on the so...

decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. the resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. the most comprehensible decision trees have been designed for perfect symbolic data. classical crisp decision trees (dt) are widely applied to classification t...

In this paper we consider  (extended) metaplectic representation of the  semidirect product  $G_{mathbb{J}}=mathbb{R}^{2d}timesmathbb{J}$  where $mathbb{J}$ is a closed subgroup of $Sp(d,mathbb{R})$, the symplectic group. We will investigate continuous representation frame on $G_{mathbb{J}}$. We also discuss the existence of duals for such frames and give several characterization for them. Fina...

due to the changes which may occur in their parameters, systems are usually demonstrated by some subsystems for different conditions. this paper employs modified petri nets (mpn) to model theses subsystems and makes it simple to analyze them. in this method, first, the continuous transfer function is converted to a discrete transfer function and then, by mpn, system is modeled and analyzed. all...

Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...

we introduce a general implicit algorithm for finding a common element of‎ ‎the set of solutions of systems of equilibrium problems and the set of common fixed points‎ ‎of a sequence of nonexpansive mappings and a continuous representation of nonexpansive mappings‎. ‎then we prove the strong convergence of the proposed implicit scheme to the unique solution of the minimization problem on the so...