A complete metric space is a well-known concept. Kreyszig shows that every non-complete metric space can be developed into a complete metric space , referred to as completion of .
We use the b-Cauchy sequence to form which “is the set of all b-Cauchy sequences equivalence classes”. After that, we prove to be a 2-normed space. Then, we construct an isometric by defining the function from to ; thus and are isometric, where is the subset of composed of the equivalence classes that contains constant b-Cauchy sequences. Finally, we prove that is dense in , is complete and the uniqueness of is up to isometrics
Let R be an associative ring with identity. An R-module M is called generalized
amply cofinitely supplemented module if every cofinite submodule of M has an
ample generalized supplement in M. In this paper we proved some new results about
this conc- ept.
Water saturation is the most significant characteristic for reservoir characterization in order to assess oil reserves; this paper reviewed the concepts and applications of both classic and new approaches to determine water saturation. so, this work guides the reader to realize and distinguish between various strategies to obtain an appropriate water saturation value from electrical logging in both resistivity and dielectric has been studied, and the most well-known models in clean and shaly formation have been demonstrated. The Nuclear Magnetic Resonance in conventional and nonconventional reservoirs has been reviewed and understood as the major feature of this approach to estimate Water Saturation based on T2 distribution. Artific
... Show MoreA sensitive, accurate, and affordable colorimetric method was developed for assaying prednisolone (PRZ) in various medicinal forms. The procedure involves the oxidation of PRZ by ferric ions, followed by complexation of the resulting ferrous ions with ferricyanide to produce a greenish-blue product. Common complexation conditions were thoroughly investigated. The mole ratio of FeCl₃·6H₂O to K₃Fe(CN)₆ was 8:1. The proposed mechanism of complexation was suggested and considered. Various parameters were optimized, including the reduction of the colorimetric reaction temperature to 50°C and the duration of heating and analysis to 20-30 minutes. The calibration curve was linear over the range of 1-60 µg/mL. The limit of detection (LOD
... Show MoreClassical cryptography systems exhibit major vulnerabilities because of the rapid development of quan tum computing algorithms and devices. These vulnerabilities were mitigated utilizing quantum key distribution (QKD), which is based on a quantum no-cloning algorithm that assures the safe generation and transmission of the encryption keys. A quantum computing platform, named Qiskit, was utilized by many recent researchers to analyze the security of several QKD protocols, such as BB84 and B92. In this paper, we demonstrate the simulation and implementation of a modified multistage QKD protocol by Qiskit. The simulation and implementation studies were based on the “local_qasm” simulator and the “FakeVigo” backend, respectively. T
... Show MoreThis paper concerns is the preparation and characterization of a bidentate ligand [4-(5,5- dimethyl-3-oxocyclohex-1-enylamino)-N-(5-methylisoxazol-3-yl) benzene sulfonamide]. The ligand was prepared from fusing of sulfamethoxazole and dimedone at (140) ºC for half hour. The complex was prepared by refluxing the ligand with a bivalent cobalt ion using ethanol as a solvent. The prepared ligand and complex were identified using Spectroscopic methods. The proposed tetrahedral geometry around the metal ions studied were concluded from these measurements. Both molar ratio and continuous variation method were studied to determine metal to ligand ratio (M:L). The M to L ratio was found to be (1:1). The adsorption of cobalt complex was carried out
... Show MoreDetecting protein complexes in protein-protein interaction (PPI) networks is a challenging problem in computational biology. To uncover a PPI network into a complex structure, different meta-heuristic algorithms have been proposed in the literature. Unfortunately, many of such methods, including evolutionary algorithms (EAs), are based solely on the topological information of the network rather than on biological information. Despite the effectiveness of EAs over heuristic methods, more inherent biological properties of proteins are rarely investigated and exploited in these approaches. In this paper, we proposed an EA with a new mutation operator for complex detection problems. The proposed mutation operator is formulated und
... Show MoreDetecting protein complexes in protein-protein interaction (PPI) networks is a challenging problem in computational biology. To uncover a PPI network into a complex structure, different meta-heuristic algorithms have been proposed in the literature. Unfortunately, many of such methods, including evolutionary algorithms (EAs), are based solely on the topological information of the network rather than on biological information. Despite the effectiveness of EAs over heuristic methods, more inherent biological properties of proteins are rarely investigated and exploited in these approaches. In this paper, we proposed an EA with a new mutation operator for complex detection problems. The proposed mutation operator is formulate
... Show Moremodel is derived, and the methodology is given in detail. The model is constructed depending on some measurement criteria, Akaike and Bayesian information criterion. For the new time series model, a new algorithm has been generated. The forecasting process, one and two steps ahead, is discussed in detail. Some exploratory data analysis is given in the beginning. The best model is selected based on some criteria; it is compared with some naïve models. The modified model is applied to a monthly chemical sales dataset (January 1992 to Dec 2019), where the dataset in this work has been downloaded from the United States of America census (www.census.gov). Ultimately, the forecasted sales
In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons
... Show More