This paper is concerned with finding solutions to free-boundary inverse coefficient problems. Mathematically, we handle a one-dimensional non-homogeneous heat equation subject to initial and boundary conditions as well as non-localized integral observations of zeroth and first-order heat momentum. The direct problem is solved for the temperature distribution and the non-localized integral measurements using the Crank–Nicolson finite difference method. The inverse problem is solved by simultaneously finding the temperature distribution, the time-dependent free-boundary function indicating the location of the moving interface, and the time-wise thermal diffusivity or advection velocities. We reformulate the inverse problem as a non-linear optimization problem and use the lsqnonlin non-linear least-square solver from the MATLAB optimization toolbox. Through examples and discussions, we determine the optimal values of the regulation parameters to ensure accurate, convergent, and stable reconstructions. The direct problem is well-posed, and the Crank–Nicolson method provides accurate solutions with relative errors below 0.006% when the discretization elements are M=N=80. The accuracy of the forward solutions helps to obtain sensible solutions for the inverse problem. Although the inverse problem is ill-posed, we determine the optimal regularization parameter values to obtain satisfactory solutions. We also investigate the existence of inverse solutions to the considered problems and verify their uniqueness based on established definitions and theorems.
In this paper the design of hybrid retina matching algorithm that is used in identification systems is considered. Retina based recognition is apparent as the most secure method for identification of an identity utilized to differentiate persons.
The characteristics of Speeded up Robust Feature (SURF) and Binary Robust Invariant Scalable Key-Points (BRISK) algorithm have been used in order to produce a fast matching algorithm than the classical ones, those characteristics are important for real-time applications which usually need quick processing of a growing quantity of data. The algorithm is divided into three stages: retinal image processing and segmentation, extracting the lo
... Show MoreManufacturing systems of the future foresee the use of intelligent vehicles, optimizing and navigating. The navigational problem is an important and challenging problem in the field of robotics. The robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the capabilities of the robot itself. On-line navigation is a set of algorithms that plans and executes a trajectory at the same time. The system adopted in this research searches for a robot collision-free trajectory in a dynamic environment in which obstacles can move while the robot was moving toward the target. So, the ro
... Show MoreThe aim of this research is to study the factors affecting drag coefficient (C d ) in
non-Newtonian fluids which are the rheological properties ,concentrations of non-
Newtonian fluids, particle shape, size and the density difference between particle and
fluid .Also this study shows drag coefficient (C d ) and particle Reynolds' number (Re
P ) relationship and the effect of rheological properties on this relationship.
An experimental apparatus was designed and built, which consists of Perspex pipe
of length of 160 cm. and inside diameter of 7.8 cm. to calculate the settling velocity,
also electronic circuit was designed to calculate the falling time of particles through
fluid.
Two types of solid particles were
The aim of this paper is to introduce and investigate new subclasses of regular functions defined in . The coefficients estimate and for functions in these subclasses are determined. Many of new and known consequences are shown as particular cases of our outcomes.
The search is an application for one of the problems of mathematics in the computer; as providing construction and design of a major program to calculate the inverse permutations of the symmetric group Sn , where 1 ≤ n ≤ 13; using some of the methods used in the Number Theory by computer . Also the research includes design flow chart for the main program and design flow chart for the program inverse permutations and we give some illustrative examples for different symmetric groups and their inverse permutations.
Biometrics represent the most practical method for swiftly and reliably verifying and identifying individuals based on their unique biological traits. This study addresses the increasing demand for dependable biometric identification systems by introducing an efficient approach to automatically recognize ear patterns using Convolutional Neural Networks (CNNs). Despite the widespread adoption of facial recognition technologies, the distinct features and consistency inherent in ear patterns provide a compelling alternative for biometric applications. Employing CNNs in our research automates the identification process, enhancing accuracy and adaptability across various ear shapes and orientations. The ear, being visible and easily captured in
... Show More