In this paper, the class of semi
In this paper, we propose new types of non-convex functions called strongly --vex functions and semi strongly --vex functions. We study some properties of these proposed functions. As an application of these functions in optimization problems, we discuss some optimality properties of the generalized nonlinear optimization problem for which we use, as an objective function, strongly --vex function and semi strongly --vex function.
Glassy carbon electrode (GCE) was modified with carbon nanotubes CNT and C60 by attachment and solution evaporation techniques, respectively. CNT/Li+/GCE and C60/Li+/GCE were prepared by modifying CNT/GCE and C60/GCE in Li+ solution via cyclic voltammetry (CV) potential cycling. The sensing characteristics of the modified film electrodes, demonstrated in this study for interference of Mn2+ in different heavy metals ion esp. Hg2+, Cd2+ and Cu2+. The interfering effect was investigated that exert positive interference on the redox peaks of Mn2+. The modification of GCE with nano materials and Li+ act an enhancement for the redox current peaks to observe the effect of interference for Mn2+ in 1:1 ratio with different heavy metals ion.
Let
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.
In this paper, a new class of non-convex functions called semi strongly (
Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex
... Show More