A comprehensive review focuses on 3D network-on-chip (NoC) simulators and plugins while paying attention to the 2D simulators as the baseline is presented. Discussions include the programming languages, installation configuration, platforms and operating systems for the respective simulators. In addition, the simulator’s properties and plugins for design metrics evaluations are addressed. This review is intended for the early career researchers starting in 3D NoC, offering selection guidelines on the right tools for the targeted NoC architecture, design, and requirements.
Objective(s): The world of dentistry is constantly evolving, and with the advent of 3D printing technology, the possibilities are endless. However, little is known about the effects of adding ZrO2 NPs to the denture base resin of 3D additive manufacturing technique.Aim of this study is to evaluate the behavior of resin which is used to 3D printing of denture base with the addition of ZrO2 NPs on denture adaptation property and diametral compression strength.Methods: 60 samples were printed, 30 disks for diametral compressive test and 30 denture base for denture adaptation test. Three groups per test (n=10). The control group for each test included unreinforced 3Dprinted denture base resin, and the other groups were reinforced with (2&
... Show MoreIn this paper, chip and powder copper are used as reinforcing phase in polyester matrix to form composites. Mechanical properties such as flexural strength and impact test of polymer reinforcement copper (powder and chip) were done, the maximum flexural strength for the polymer reinforcement with copper (powder and chip) are (85.13 Mpa) and (50.08 Mpa) respectively was obtained, while the maximum observation energy of the impact test for the polymer reinforcement with copper (powder and chip) are (0.85 J) and (0.4 J) respectively
In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.
Computer systems and networks are being used in almost every aspect of our daily life, the security threats to computers and networks have increased significantly. Usually, password-based user authentication is used to authenticate the legitimate user. However, this method has many gaps such as password sharing, brute force attack, dictionary attack and guessing. Keystroke dynamics is one of the famous and inexpensive behavioral biometric technologies, which authenticate a user based on the analysis of his/her typing rhythm. In this way, intrusion becomes more difficult because the password as well as the typing speed must match with the correct keystroke patterns. This thesis considers static keystroke dynamics as a transparent layer of t
... Show MoreLocalization is an essential demand in wireless sensor networks (WSNs). It relies on several types of measurements. This paper focuses on positioning in 3-D space using time-of-arrival- (TOA-) based distance measurements between the target node and a number of anchor nodes. Central localization is assumed and either RF, acoustic or UWB signals are used for distance measurements. This problem is treated by using iterative gradient descent (GD), and an iterative GD-based algorithm for localization of moving sensors in a WSN has been proposed. To localize a node in 3-D space, at least four anchors are needed. In this work, however, five anchors are used to get better accuracy. In GD localization of a moving sensor, the algo
... Show MoreFinding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over
... Show MoreIn some cases, surgeons need to navigate through the computer system for reconfirmation patients’ details and unfortunately surgeons unable to manage both computer system and operation at the same time. In this paper we propose a solution for this problem especially designed for heart surgeon, by introducing voice activation system with 3D visualization of Angiographic images, 2D visualization of Echocardiography processed video and selected patient’s details. In this study, the processing, approximation of the 3D angiography and the visualization of the 2D echocardiography video with voice recognition control are the most challenging work. The work involve with predicting 3D coronary three from 2D angiography image and also image enhan
... Show MoreIn the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H
... Show More