In this article, we study convex optimization problems where agents of a network cooperatively minimize the global objective function which consists multiple local functions. The intention work is to solve large-scale complicated, and numerous. Different from most existing works, each agent presented as average finite instantaneous Integrating gradient tracking algorithm with stochastic averagi...

A class of solutions Einstein field equations satisfying Karmarkar embedding condition is presented which could describe static, spherical fluid configurations, and serve as models for compact stars. The under consideration has unequal principal stresses i.e. locally anisotropic. certain physically motivated geometry metric potential been chosen codependency the potentials outlines formation mo...

This paper's main aim is to investigate the existence of a new classification embedded class-I solutions compact stars, by using Karmarkar condition in $f(R)$ gravity background. To achieve that goal, we consider two different models theory for static spherically symmetric spacetime considering anisotropic matter distribution. Further, employ relate components metric potentials $g_{rr}$ and $g_...

This paper brings to light a method based on Multiphase algorithm for single variable equation using Newton's correction. Newton's method is derived through the logarithmic differentiation of polynomial equation. A correction term which enhances the high speed of convergence is hereby introduced. A translation of Newton's method to Total Step and Single Step Methods (T. S. M and S. S. M) re...

many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. in this paper we discuss integrity and its properties in vulnerability calculation. the integrity of a graph g, i(g), is defined t...

The original S-boxes and algorithms of DES are designed to resist differential attack[11]. We propose eight more new S-boxes with the same cryptographic properties as S-boxes in DES. These 16 S-boxes are used to construct the extended DES, which is double the size of the original DES. The differential and linear cryptanalyses of the extended DES are given. The complexities of the two attacks ar...