Browsing by Author "T. Aliu"
Now showing 1 - 5 of 5
Results Per Page
Sort Options
- ItemCryptography and Encryption(University of Lagos, 2010) Adeshola, A.D.; T. AliuThere is a strong need to devise new encryption mechanisms (algorithms) that offer enhanced security assurance, and guarantee the security of information transm itted over computer networks. This has generated a lot of interst, and has made cryptography an area of intrest in research all over the world today. In this study, we study Cryptography through the Euclid’GCD Algorithm Principle.
- ItemGroups and Subgroups in Cryptography(University of Lagos, 2009) Adeshola, A.D.; T. AliuThis study looks into the Mathematical applications of groups and subgroups in cryptography through Eulier’s Phi Function and Lagrange’s theorem with some definitions, theorems, illustrations and examples.
- ItemPerturbed Galerkin Method for Solving Integro- Differential Equations(Hindawi, 0002-04-15) K. Issa; J.Biazar; T.O. Agboola; T. AliuIn this paper, perturbed Galerkin method is proposed to find numerical solution of an integro-differential equations using fourth kind shifted Chebyshev polynomials as ba- sis functions which transform the integro-differential equation into a system of linear equations. The system of linear equations are then solved to obtain the approximate solution. Examples to justify the effectiveness and accuracy of the method are pre- sented and their numerical results are compared with Galerkin’s method, Taylor’s series method and Tau’s method which provide validation for the proposed approach. The errors obtained justify the effectiveness and accuracy of the method.
- ItemPerturbed Galerkin Method for Solving Integro-Differential Equations(Hindawi, 2022-04-15) K. Issa; J. Biazar; T. O. Agboola; T. Aliu; Saeid AbbasbandyIn this paper, perturbed Galerkin method is proposed to find numerical solution of an integro-differential equations using fourth kind shifted Chebyshev polynomials as basis functions which transform the integro-differential equation into a system of linear equations. The systems of linear equations are then solved to obtain the approximate solution. Examples to justify the effectiveness and accuracy of the method are presented and their numerical results are compared with Galerkin’s method, Taylor’s series method, and Tau’s method which provide validation for the proposed approach. The errors obtained justify the effectiveness and accuracy of the method.
- ItemSyntax Recognition in Semi groups(University of Nairobi, 2011) Adeshola, A.D.; T. AliuIn this paper, we establish the fact that decimal integers are formed from the ten decimal or denary digits 0, …,9; English words are formed from the 26 letters of English alphabet (or 52 if we distinguish between lower and upper case); English sentences are formed from the finite, but large number of English words[2]. This prelimnary study has attempted a description of a core aspect of both Syntax and Semigroup. It endeavours to succintly explain what syntax entails and in chronological norder, a review of major thoughts on syntax evaluation is highlighted. As a way of finding possible areas of relationship in the curious presence of Syntax and Semigroup, section one explains the relationship through logarithm, setion two equally looks at the syntatic nature of prefix, suffix and subwords, and in section three, results are analyzed and finally, conclusion are discussed in section four.