On Kolmogorov Complexity of Unitary Transformations in Quantum Computing
A Second Derivative Block Method Derived from a Family of Modified Backward Differentiation Formula (BDF) Type for Solving Stiff Ordinary Differential Equations
Equiprime Ideals and Equiprime Semimodules in Boolean Like Semirings
Numerical Solution of Temperature Profile in Annulus
Mathematical Modelling of EOR Methods
An Introduction to Various Types of Mathematics Teaching Aids
A Simple Method of Numerical Integration for a Class of Singularly Perturbed Two Point Boundary Value Problems
A New Approach to Variant Assignment Problem
A Homotopy Based Method for Nonlinear Fredholm Integral Equations
Proof of Beal's Conjecture and Fermat Last Theorem using Contra Positive Method
Trichotomy–Squared – A Novel Mixed Methods Test and Research Procedure Designed to Analyze, Transform, and Compare Qualitative and Quantitative Data for Education Scientists who are Administrators, Practitioners, Teachers, and Technologists
Algorithmic Triangulation Metrics for Innovative Data Transformation: Defining the Application Process of the Tri–Squared Test
A New Hilbert-Type Inequality In Whole Plane With The Homogeneous Kernel Of Degree 0
Surfaces in R3 with density
Introducing Trinova: “Trichotomous Nomographical Variance” a Post Hoc Advanced Statistical Test of Between and Within Group Variances of Trichotomous Categorical and Outcome Variables of a Significant Tri–Squared Test
This paper proposes a simple method to find an optimum and efficient basic solution to bi-objective transportation problem (BOTP) using weighted goal programming approach. Preferential weights for the goals (objectives) are derived from analytic hierarchy process (AHP). Solution obtained by the proposed approach has been found to be the nearest basic feasible solution to the ideal solution in terms of Euclidean distance measure. The method is illustrated with numerical examples taken from the literature and solutions compared in terms of the number of iterations, computational complexity and proximity to the ideal solution. The modified minimum supply and demand method is used to obtain initial basic feasible solutions that are found to be optimal, and hence this method is computationally simpler compared to other linear programming methods. It has been observed that weighted objective function optimization yields optimal efficient BOTP solutions using appropriate weights for the objective functions.
Analytic Rayleigh wave speed formula in nonlinear orthotropic medium is determined. Speed of Rayleigh waves in iodic acid, a specimen of non-linear orthotropic materials, is calculated and is compared with that of the speed in linear orthotropic iodic acid. In linear iodic acid, three distinct Rayleigh waves propagate with speeds 53.44 km/s, 80.94 km/s, and 125.37 km/s, respectively. While, in nonlinear iodic acid these three waves become coincident and only one Rayleigh wave seem to propagate with velocity 63.68 km/s.
In this paper, we establish some results on the existence and uniqueness of common fixed point theorems in partially ordered Ab -metric spaces. Examples and application also are presented in support of the obtained results.
Group theory and Combinatorics play important role in design security protocols, algorithms and techniques for various security applications. Secure group-oriented communication is crucial to a wide range of applications in Internet of Things (IoT). Key management is the mechanism which is used to work out the problem of creation, establishment, to distribute, periodic refresh and the maintenance of the cryptographic keys. It is not enough to care only about primitives that satisfy a stated security objective in the domain of the IoT. The design of group key establishment techniques for securing group communications between resource-constrained IoT devices is presented in this work. Furthermore, the paper assesses possible ways for tailoring current security protocols to the peculiarities of IoT devices and networks.
Securing data in this era of technology is the most challenging task. Cryptography is a practice of different techniques and methodologies for data confidentiality, data integrity, authentication, and non-repudiation. Many mathematical techniques are being used in cryptography from ancient times. The Laplace integral transforms and its inverse forms gain significant importance to design cryptographic methods. In this work, we propose cryptography methodology based on Natural and Elzaki transform and this study comprises a unique structure that provides Laplace-Elzaki and Sumudu-Elzaki methodologies. A generalized version of Laplace and Sumudu transform is also presented.