We investigate the interaction of proton with a solid target, describing the wake effects by taking fitted parameters with experimental values of energy loss function ELF for copper using the dielectric function of random phase approximation (RPA). The results exhibited a damped oscillatory behavior in the longitudinal direction behind the projectile. In addition, the wake potential becomes asymmetric around the z-axis with proton velocity values higher than Fermi velocity, as well as it depends on the position of projectile in cylindrical coordinates.
The purpose of this study was to evaluate the anesthetic effectiveness of a buccal infiltration technique combined with local massage (using 2% lidocaine) in the extraction of mandibular premolars to be utilized as an alternative to the conventional inferior alveolar nerve block.
Patients eligible included any subject with a clinical indication for tooth extraction of the mandibular 1st or 2nd premolars. All patients were anesthetized buccally by local infiltration technique followed by an external pressure applied for 1 min directly over the injection area. In each case, another local
Most Internet of Vehicles (IoV) applications are delay-sensitive and require resources for data storage and tasks processing, which is very difficult to afford by vehicles. Such tasks are often offloaded to more powerful entities, like cloud and fog servers. Fog computing is decentralized infrastructure located between data source and cloud, supplies several benefits that make it a non-frivolous extension of the cloud. The high volume data which is generated by vehicles’ sensors and also the limited computation capabilities of vehicles have imposed several challenges on VANETs systems. Therefore, VANETs is integrated with fog computing to form a paradigm namely Vehicular Fog Computing (VFC) which provide low-latency services to mo
... Show MoreThis study emphasizes the infinite-boundary integro-differential equation. To examine the approximate solution of the problem, two modified optimization algorithms are proposed based on generalized Laguerre functions. In the first technique, the proposed method is applied to the original problem by approximating the solution using the truncated generalized Laguerre polynomial of the unknown function, optimizing coefficients through error minimization, and transforming the integro-differential equation into an algebraic equation. In contrast, the second approach incorporates a penalty term into the objective function to effectively enforce boundary and integral constraints. This technique reduces the original problem to a mathematical optimi
... Show MoreIdentification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed
... Show MoreMagnetic levitation (Maglev) systems are employed in a wide range of applications and are therefore of significant practical importance, which has led to growing research interest. This paper presents the design of a terminal synergetic control (TSC) and feedback linearization-based proportional-integral-derivative plus second-order derivative (FL-PIDD2) controller for the Maglev system. For developing the control law of both controllers, the mathematical model of the Maglev system is converted into a canonical system where the expression of the nonlinearity is displayed in the last differential dynamic equation of the system. The determination of the TSC and FL-PIDD2 gains for achieving the desired dynamic response is carried out using the
... Show MoreThe aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key
... Show More