In information security, fingerprint verification is one of the most common recent approaches for verifying human identity through a distinctive pattern. The verification process works by comparing a pair of fingerprint templates and identifying the similarity/matching among them. Several research studies have utilized different techniques for the matching process such as fuzzy vault and image filtering approaches. Yet, these approaches are still suffering from the imprecise articulation of the biometrics’ interesting patterns. The emergence of deep learning architectures such as the Convolutional Neural Network (CNN) has been extensively used for image processing and object detection tasks and showed an outstanding performance compared to traditional image filtering techniques. This paper aimed to utilize a specific CNN architecture known as AlexNet for the fingerprint-matching task. Using such an architecture, this study has extracted the significant features of the fingerprint image, generated a key based on such a biometric feature of the image, and stored it in a reference database. Then, using Cosine similarity and Hamming Distance measures, the testing fingerprints have been matched with a reference. Using the FVC2002 database, the proposed method showed a False Acceptance Rate (FAR) of 2.09% and a False Rejection Rate (FRR) of 2.81%. Comparing these results against other studies that utilized traditional approaches such as the Fuzzy Vault has demonstrated the efficacy of CNN in terms of fingerprint matching. It is also emphasizing the usefulness of using Cosine similarity and Hamming Distance in terms of matching.
Imitation learning is an effective method for training an autonomous agent to accomplish a task by imitating expert behaviors in their demonstrations. However, traditional imitation learning methods require a large number of expert demonstrations in order to learn a complex behavior. Such a disadvantage has limited the potential of imitation learning in complex tasks where the expert demonstrations are not sufficient. In order to address the problem, we propose a Generative Adversarial Network-based model which is designed to learn optimal policies using only a single demonstration. The proposed model is evaluated on two simulated tasks in comparison with other methods. The results show that our proposed model is capable of completing co
... Show Moreobjective: To evaluate the influence of monolithic zirconia brand, thickness, and substrate color on color matching accuracy when optically coupled to abutment substrates. Methods: A total of 180 samples of two brands of monolithic zirconia [Prettau Anterior (PA), Ceramill Zolid FX Multicolor (CZ)] were prepared in three different thicknesses (0.8 mm, 1.5 mm, and 2 mm) with a standardized 10 mm diameter. Color properties of the samples were assessed using spectrophotometry at baseline and after coupling to three substrate types: standard dentin, discolored dentin, and titanium. Color differences (ΔE) were calculated and statistically analyzed by 3-way ANOVA and pairwise comparison ( α=0.05). Results: The brand and material thickness, at
... Show More
In today's world, most business, regardless of size, believe that access to Internet is imperative if they are going to complete effectively. Yet connecting a private computer (or a network) to the Internet can expose critical or confidential data to malicious attack from anywhere in the world since unprotected connections to the Internet (or any network topology) leaves the user computer vulnerable to hacker attacks and other Internet threats. Therefore, to provide high degree of protection to the network and network's user, Firewall need to be used.
Firewall provides a barrier between the user computer and the Internet (i.e. it prevents unauthor
... Show MoreAmong the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the
... Show MoreBackground: Coronavirus pandemic (COVID-19) has enormously affected various healthcare services including the one of community pharmacy. The ramifications of these effects on Iraqi community pharmacies and the measures they have taken to tackle the spread of COVID-19 is yet to be explored. In this cross sectional survey, infection control measures by community pharmacies in Sulaimani city/Iraq has been investigated.
Methods: Community pharmacists were randomly allocated to participate in a cross-sectional survey via visiting their pharmacies and filling up the questionnaire form.
Results and discussion:
... Show MoreThis paper proposes improving the structure of the neural controller based on the identification model for nonlinear systems. The goal of this work is to employ the structure of the Modified Elman Neural Network (MENN) model into the NARMA-L2 structure instead of Multi-Layer Perceptron (MLP) model in order to construct a new hybrid neural structure that can be used as an identifier model and a nonlinear controller for the SISO linear or nonlinear systems. Two learning algorithms are used to adjust the parameters weight of the hybrid neural structure with its serial-parallel configuration; the first one is supervised learning algorithm based Back Propagation Algorithm (BPA) and the second one is an intelligent algorithm n
... Show MoreLet A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with is the same for all . Here is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i
... Show MoreThe research focuses on determination of best location of high elevated tank using the required head of pump as a measure for this purpose. Five types of network were used to find the effect of the variation in the discharge and the node elevation on the best location. The most weakness point was determined for each network. Preliminary tank locations were chosen for test along the primary pipe with same interval distance. For each location, the water elevation in tank and pump head was calculated at each hour depending on the pump head that required to achieve the minimum pressure at the most weakness point. Then, the sum of pump heads through the day was determined. The results proved that there is a most economical lo
... Show More