The paper deals with devising the combination of fuzzy inference systems (FIS) and neural networks called the adaptive network fuzzy inference system (ANFIS) to determine the forming limit diagram (FLD). In this paper, FLDs are determined experimentally for two grades of low carbon steel sheets using out-of-plane (dome) formability test. The effect of different parameters such as work hardening...

‎Some functional inequalities‎ ‎in variable exponent Lebesgue spaces are presented‎. ‎The bi-weighted modular inequality with variable exponent $p(.)$ for the Hardy operator restricted to non‎- ‎increasing function which is‎‎$$‎‎int_0^infty (frac{1}{x}int_0^x f(t)dt)^{p(x)}v(x)dxleq‎‎Cint_0^infty f(x)^{p(x)}u(x)dx‎,‎$$‎ ‎is studied‎. ‎We show that the exponent $p(.)$ for which these modular ine...

Very few public-key cryptosystems are known that can encrypt and decrypt in time b with conjectured security level 2 against conventional computers and quantum computers. The oldest of these systems is the classic McEliece code-based cryptosystem. The best attacks known against this system are generic decoding attacks that treat McEliece’s hidden binary Goppa codes as random linear codes. A sta...

A well-known attack on RSA with low secret-exponent d was given by Wiener in 1990. Wiener showed that using the equation ed − (p − 1)(q − 1)k = 1 and continued fractions, one can efficiently recover the secret-exponent d and factor N = pq from the public key (N, e) as long as d < 1 3 N 1 4 . In this paper, we present a generalization of Wiener’s attack. We show that every public exponent e that...

The exponent of the strong product of a digraph of order m and a digraph of order n is shown to be bounded above by m+n− 2, with equality for Zm ⊠Zn. The exponent and diameter of the strong product of a graph and a digraph are also investigated.

abstract. in this paper we study some relations between the power andquotient power graph of a finite group. these interesting relations motivateus to find some graph theoretical properties of the quotient power graphand the proper quotient power graph of a finite group g. in addition, weclassify those groups whose quotient (proper quotient) power graphs areisomorphic to trees or paths.

The exponent of the strong product of a digraph of order m and a digraph of order n is shown to be bounded above by m+n− 2, with equality for Zm ⊠Zn. The exponent and diameter of the strong product of a graph and a digraph are also investigated.