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 assessment of the influence of the work-hardening of material on the optimum die profile and drawing force  in rod drawing process is the main objective of the present paper. The upper bound solution, based on the assumption of perfect plasticity, has been extended to consider the work-hardening of the material during the rod drawing process through curved dies. Analytical results of drawin...

We formulate the random coding exponent for single and multiple antennae systems on a flatfading additive white Gaussian noise (AWGN) channel with differential encoding and multiple-symbol differential detection (MSDD). Noting the intractability of the computation of the exponent for code lengths of interest, we propose the use of an approximated channel model based on the fact that the observa...

Searching for objects with unknown locations based on random walks can be optimized when the walkers obey Lévy distributions with a critical exponent. We consider the problem of optimizing statistical searches when a priori information, such as location densities, are known. We consider both spatially dependent exponents and biased search directions. For spatially localized target distributions...

we prove that for $p>7$ there are‎ ‎[‎ ‎p^{4}+2p^{3}+20p^{2}+147p+(3p+29)gcd (p-1,3)+5gcd (p-1,4)+1246‎ ‎] ‎groups of order $p^{8}$ with exponent $p$‎. ‎if $p$ is a group of order $p^{8}$‎ ‎and exponent $p$‎, ‎and if $p$ has class $c>1$ then $p$ is a descendant of $‎p/gamma _{c}(p)$‎. ‎for each group of exponent $p$ with order less than $‎p^{8} $ we calculate the number of descendants of o...

Floating point arithmetic has a vast applications in DSP, digital computers, robots due to its ability to represent very small numbers and big numbers as well as signed numbers and unsigned numbers. In spite of complexity involved in floating point arithmetic, its implementation is increasing day by day. Here we compare three different types of adders while calculating the addition of exponent ...

Von Bertalanffy proposed the differential equation m'(t) = p × m(t) a  - q × m(t) for the description of the mass growth of animals as a function m(t) of time t. He suggested that the solution using the metabolic scaling exponent a = 2/3 (Von Bertalanffy growth function VBGF) would be universal for vertebrates. Several authors questioned universality, as for certain species other models would p...

A parallel algorithm for diffusion-limited aggregation (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm is defined with respect to the PRAM model of parallel computation according to T ∼ L z , where T is the running time and L the cluster size. It is argued that z = D − D 2 /3, where D is the fractal dimension and D 2 is t...

The non-abelian tensor product of groups which has its origins in algebraic K-theory as well as inhomotopy theory, was introduced by Brown and Loday in 1987. Group theoretical aspects of non-abelian tensor products have been studied extensively. In particular, some studies focused on the relationship between the exponent of a group and exponent of its tensor square. On the other hand, com...

Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms used, one of the most serious threats against secret data stored in such devices is Side Channel Analysis. Implementing Public Key Cryptography in low-profile devices such as smart cards is particularly challenging given ...