Fingerprint recognition is one among oldest procedures of identification. An important step in automatic fingerprint matching is to mechanically and dependably extract features. The quality of the input fingerprint image has a major impact on the performance of a feature extraction algorithm. The target of this paper is to present a fingerprint recognition technique that utilizes local features for fingerprint representation and matching. The adopted local features have determined: (i) the energy of Haar wavelet subbands, (ii) the normalized of Haar wavelet subbands. Experiments have been made on three completely different sets of features which are used when partitioning the fingerprint into overlapped blocks. Experiments are conducted on

This research shows the experimental results of the bending moment in a flexible and rigid raft foundation rested on dense sandy soil with different embedded depth throughout 24 tests. A physical model of dimensions (200mm*200mm) and (320) mm in height was constructed with raft foundation of (10) mm thickness for flexible raft and (23) mm for rigid raft made of reinforced concrete. To imitate the seismic excitation shaking table skill was applied, the shaker was adjusted to three frequencies equal to (1Hz,2Hz, and 3Hz) and displacement magnitude of (13) mm, the foundation was located at four different embedment depths (0,0.25B = 50mm,0.5B = 100mm, and B = 200mm), where B is the raft width. Generally, the maximum bending

In this paper, a new procedure is introduced to estimate the solution for the three-point boundary value problem which is instituted on the use of Morgan-Voyce polynomial. In the beginning, Morgan-Voyce polynomial along with their important properties is introduced. Next, this polynomial with aid of the collocation method utilized to modify the differential equation with boundary conditions to the algebraic system. Finally, the examples approve the validity and accuracy of the proposed method.

This article will introduce a new iteration method called the zenali iteration method for the approximation of fixed points. We show that our iteration process is faster than the current leading iterations  like Mann, Ishikawa, oor, D- iterations, and *-  iteration for new contraction mappings called  quasi contraction mappings. And we  proved that all these iterations (Mann, Ishikawa, oor, D- iterations and *-  iteration) equivalent to approximate fixed points of  quasi contraction. We support our analytic proof by a numerical example, data dependence result for contraction mappings type  by employing zenali iteration also discussed.

Secured multimedia data has grown in importance over the last few decades to safeguard multimedia content from unwanted users. Generally speaking, a number of methods have been employed to hide important visual data from eavesdroppers, one of which is chaotic encryption. This review article will examine chaotic encryption methods currently in use, highlighting their benefits and drawbacks in terms of their applicability for picture security.