Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...

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...

Let a,b∈R , with a≠b . The harmonic, logarithmic, and arithmetic means of a b are respectively defined by H(a,b)=21a+1b=2aba+b,L(a,b)=b−a ln b− ln a A(a,b)=a+b2 .Theorem. For 0<a<b,2a+b< ...

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...

In this study, a Neural Network (NN) based data fusion and estimation algorithm is developed, which could be applied in monitoring and detection applications that use measurements coming from multiple sensors. For NN based applications, a fast training approach which can also guarantee the global minimum is highly desirable and is subject for ongoing research. For this purpose, in this study, a...

In this note we obtain necessary and sufficient conditions for a convergence space to have a smallest Hausdorff compactification and to have a smallest regular compactification. Introduction. A Hausdorff convergence space as defined in [1] always has a Stone-Cech compactification which can be obtained by a slight modification of the result in [3]. But in general this need not be the largest Hau...

(3) { zn = βnxn + (1− βn)Txn, xn+1 = αnxn + (1− αn)Tzn, n ≥ 0, where the initial guess x0 is taken arbitrarily and {αn}n=0 and {βn} are sequences in the interval [0, 1]. In general not much has been known regarding the convergence of the iteration processes (1)-(3) unless the underlying space X has nice properties which we briefly mention here. The iteration process (1) has been proved to be st...