The notion of the sub-exact sequence is generalization exact in algebra especially on a module. A module over ring R vector space field F. Refers to special F when we have complete inner product space, it called Hilbert space. if every Cauchy converges. Now, introduce which can later be useful statistics. This paper aims investigate properties and their relation direct summand As result, get tw...

In this paper by using natural density real valued bounded sequence space $l_{\infty}$ is extented and statistical $l_{\infty}^{st}$ obtained. Besides the main properties of $l_{\infty}^{st}$, it shown that a Banach with norm produced help density. Also, there no matrix extension its sequences covers $l_{\infty}^{st}$. Finally, non-porous subset

we prove a strong convergence result for a sequence generated by halpern's type iteration for approximating a common fixed point of a countable family of quasi-lipschitzian mappings in a real hilbert space. consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...

Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence  ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...

The mechanisms which enable the vast majority of computer attacks are based on design and programming errors in networked applications. The growing use of voice over IP (VOIP) phone technology makes these phone applications potential targets. We present a tool to perform security testing of VOIP applications to identify security vulnerabilities which can be exploited by an attacker. Session Ini...

In this paper, the researchers have investigated a Concatenated Robot Move (CRM) sequence problem and Minimal Part Set (MPS) schedule problem with different setup times for two-machine robotic cell. They have focused on simultaneous solving of CRM sequence and MPS schedule problems with different loading and unloading times. They have applied a Simulated Annealing (SA) algorithm to provide a go...