Search

The ancient Vedic mathematics is well known for quicker handy multiplications but its recognition as an integrated circuit core against existing hardware multipliers is not established. As optimized hardware implementation of binary multiplier is one of the prominent unsolved problems in computer architecture, this paper proposes efficient Urdhava Tiryakbhyam Vedic multiplier architecture and compares it with the set of hierarchical multiplication algorithms which generate multiplication result in a single clock cycle. Two innovative algorithms are proposed here, one with a compact structure and another for faster execution. Also, its optimized transistor level layout is designed and implemented. To maintain homogeneity for comparison, all the algorithms are programmed on a common HDL language platform and analyzed with the same tool and technology. Final results indicate that the proposed architecture delivers 15.5% less power delay product (PDP) compared to closest competitor algorithm. [ABSTRACT FROM AUTHOR]

This study investigates the axisymmetric postbuckling of functionally graded graphene platelets reinforced composite (FG-GPLRC) annular plates resting on nonlinear elastic medium in thermal environment. Five kinds of graphene platelets (GPLs) distribution patterns including U -pattern, X -pattern, O -pattern, A -pattern, and V -pattern have been considered. The nonlinear equilibrium equations and associated boundary conditions are obtained based upon the Mindlin plate theory. The governing equations are solved via the generalized differential quadrature method (GDQM). Afterwards, the direct iterative method is implemented to accomplish postbuckling loads using the buckling mode deflection. In order to confirm the accuracy of the present model, comparisons between our data with those published in the available literature are put forth. Eventually, this paper emphasizes the impact of diverse parameters such as geometrical parameters of the structure, GPLs patterns and their geometric, GPLs weight fraction, boundary conditions, elastic medium's parameters and temperature change on the buckling and postbuckling response of nanocomposite annular plates. It can be found that elastic medium overshadows the applicability of distribution patterns and weight fraction of GPLs. [ABSTRACT FROM AUTHOR]

Let K be a number field. The Pólya field concept is used to know when the module of integer-valued polynomials over the ring of integers K of K has a regular basis. In [C. W.-W. Tougma, Some questions on biquadratic Pólya fields, J. Number Theory  229 (2021) 386–398], the author used cohomological results from [C. B. Setzer, Units over totally real C 2 × C 2 fields, J. Number Theory  12 (1980) 160–175] to answer questions raised in [A. Leriche, Pólya fields, Pólya groups and Pólya extensions: a question of capitulation, J. Théor. Nr. Bordx. 23 (2011) 235–249; A. Leriche, Cubic, quartic and sextic Pólya fields, J. Number Theory  133 (2013) 59–71] on biquadratic Pólya fields. Here we first prove that number fields were omitted from the list of exceptional fields cited in [A. Leriche, Pólya fields, Pólya groups and Pólya extensions: a question of capitulation, J. Théor. Nr. Bordx. 23 (2011) 235–249; A. Leriche, Cubic, quartic and sextic Pólya fields, J. Number Theory  133 (2013) 59–71]. We therefore identify new biquadratic Pólya fields, where the prime number 2 is totally ramified. This result corrects and completes some others on the literature. On the other hand, we show that the main results of [C. W.-W. Tougma, Some questions on biquadratic Pólya fields, J. Number Theory  229 (2021) 386–398] and this paper can be proved with a single method using Kuroda/Kubota's unit formula without cohomological results of [C. B. Setzer, Units over totally real C 2 × C 2 fields, J. Number Theory  12 (1980) 160–175]. [ABSTRACT FROM AUTHOR]

For a graph G = (V , E) and a set S ⊆ V (G) of size at least 2 , a path in G is said to be an S -path if it connects all vertices of S. Two S -paths P 1 and P 2 are said to be internally disjoint if E (P 1) ∩ E (P 2) = ∅ and V (P 1) ∩ V (P 2) = S. Let π G (S) denote the maximum number of internally disjoint S -paths in G. The k -path-connectivity π k (G) of G is then defined as the minimum π G (S) , where S ranges over all k -subsets of V (G). In [M. Hager, Path-connectivity in graphs, Discrete Math. 59 (1986) 53–59], the k -path-connectivity of the complete bipartite graph K a , b was calculated, where k ≥ 2. But, from his proof, only the case that 2 ≤ k ≤ min { a , b } was considered. In this paper, we calculate the situation that min { a , b } + 1 ≤ k ≤ a + b and complete the result. [ABSTRACT FROM AUTHOR]

The g -extra edge-connectivity is an important measure for the reliability of interconnection networks. Recently, Yang et al. [Appl. Math. Comput. 320 (2018) 464–473] determined the 3 -extra edge-connectivity of balanced hypercubes B H n and conjectured that the g -extra edge-connectivity of B H n is λ g ( B H n) = 2 (g + 1) n − 4 g + 4 for 2 ≤ g ≤ 2 n − 1. In this paper, we confirm their conjecture for n ≥ 6 − 1 2 g + 1 and 2 ≤ g ≤ 8 , and disprove their conjecture for n ≥ 3 e g ( B H n) g + 1 and 9 ≤ g ≤ 2 n − 1 , where e g ( B H n) = max { | E ( B H n [ U ]) | | U ⊆ V (B H n) , | U | = g + 1 }. [ABSTRACT FROM AUTHOR]