In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex.
The main goal of this paper is to study and discuss a new class of meromorphici "functions[ which are multivalent defined by [fractional calculus operators. Coefficients iestimates , radiisi of satarlikeness , convexityi and closed-to-iconvexity are studied. Also distortion iand closure theorems for the classi" , are considered.
In this paper, Bayes estimators of the parameter of Maxwell distribution have been derived along with maximum likelihood estimator. The non-informative priors; Jeffreys and the extension of Jeffreys prior information has been considered under two different loss functions, the squared error loss function and the modified squared error loss function for comparison purpose. A simulation study has been developed in order to gain an insight into the performance on small, moderate and large samples. The performance of these estimators has been explored numerically under different conditions. The efficiency for the estimators was compared according to the mean square error MSE. The results of comparison by MSE show that the efficiency of Bayes est
... Show MoreThe chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.
Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.
The inefficient use of spectrum is the key subject to overcome the upcoming spectrum crunch issue. This paper presents a study of performance of cooperative cognitive network via hard combining of decision fusion schemes. Simulation results presented different cooperative hard decision fusion schemes for cognitive network. The hard-decision fusion schemes provided different discriminations for detection levels. They also produced small values of Miss-Detection Probability at different values of Probability of False Alarm and adaptive threshold levels. The sensing performance was investigated under the influence of channel condition for proper operating conditions. An increase in the detection performance was achi
... Show MoreThe paper is devoted to solve nth order linear delay integro-differential equations of convolution type (DIDE's-CT) using collocation method with the aid of B-spline functions. A new algorithm with the aid of Matlab language is derived to treat numerically three types (retarded, neutral and mixed) of nth order linear DIDE's-CT using B-spline functions and Weddle rule for calculating the required integrals for these equations. Comparison between approximated and exact results has been given in test examples with suitable graphing for every example for solving three types of linear DIDE's-CT of different orders for conciliated the accuracy of the results of the proposed method.
There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show MoreSome authors studied modules with annihilator of every nonzero submodule is prime, primary or maximal. In this paper, we introduce and study annsemimaximal and coannsemimaximal modules, where an R-module M is called annsemimaximal (resp. coannsemimaximal) if annRN (resp. ) is semimaximal ideal of R for each nonzero submodule N of M.
In this article, we introduce a new type of soft spaces namely, soft spaces as a generalization of soft paces. Also, we study the weak forms of soft spaces, namely, soft spaces, soft spaces, soft space, and soft spaces. The characterizations and fundamental properties related to these types of soft spaces and the relationships among them are also discussed.
The ground state densities of neutron-rich (11Be,15C) and proton-rich (9C,12N,23Al) exotic nuclei are investigated using a two-body nucleon density distribution (2BNDD) with two frequency shells model (TFSM). The structure of the valence one-neutron of 11Be is in pure (1p1/2) and of 15C in pure (1d5/2) configuration, while the structure of valence one-proton configuration is in 9C,12N are to be in a pure (1p1/2) and 23Al in a pure (2s1/2) . For our studied nuclei, an efficient (2BNDD) operator for point nucleon system folded with two-body correlation operator's functions is u
... Show More