In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex.
We report a new theranostic device based on lead sulfide quantum dots (PbS QDs) with optical emission in the near infrared wavelength range decorated with affibodies (small 6.5 kDa protein-based antibody replacements) specific to the cancer biomarker human epidermal growth factor receptor 2 (HER2), and zinc(II) protoporphyrin IX (ZnPP) to combine imaging, targeting and therapy within one nanostructure. Colloidal PbS QDs were synthesized in aqueous solution with a nanocrystal diameter of ∼5 nm and photoluminescence emission in the near infrared wavelength range. The ZHER2:432 affibody, mutated through the introduction of two cysteine residues at the C-terminus (
The purpose of this paper is to apply different transportation models in their minimum and maximum values by finding starting basic feasible solution and finding the optimal solution. The requirements of transportation models were presented with one of their applications in the case of minimizing the objective function, which was conducted by the researcher as real data, which took place one month in 2015, in one of the poultry farms for the production of eggs
... Show MoreThis paper reports the synthesis and use of a novel metal-organic framework (MOF), named Zr-BADS, within the thin-film nanocomposite (TFN) membranes for reverse osmosis (RO) applications. Two types of zirconium-based MOFs, Zr-BADS-1 and Zr-BADS-2, were synthesized via a solvothermal method using bicinchoninic acid disodium salt as a linker and either dimethylformamide or ethanol as solvent, respectively. TFN membranes were prepared by embedding these MOFs within the polyamide thin film supported by a polysulfone support sheet. The specific surface area of Zr-BADS-1 and Zr-BADS-2 was determined to be 396.1 and 278.6 m2/g, respectively, indicating significant surface area conducive to water permeation. Scanning electron microscopic analysis r
... Show MoreData scarcity is a major challenge when training deep learning (DL) models. DL demands a large amount of data to achieve exceptional performance. Unfortunately, many applications have small or inadequate data to train DL frameworks. Usually, manual labeling is needed to provide labeled data, which typically involves human annotators with a vast background of knowledge. This annotation process is costly, time-consuming, and error-prone. Usually, every DL framework is fed by a significant amount of labeled data to automatically learn representations. Ultimately, a larger amount of data would generate a better DL model and its performance is also application dependent. This issue is the main barrier for
An innovative desalination method called electrosorption or capacitive deionization (CDI) has significant benefits for wastewater treatment. This process is performed by using a carbon fiber electrode as a working electrode to remove hexavalent chromium ions from an aqueous solution. The pH, NaCl concentration, and cell voltage were optimized using the Box-Behnken experimental design (BDD) in response surface methodology (RSM) to study the effects and interactions of selected variables. To attain the relationship between the process variables and chromium removal, the experimental data were subjected to an analysis of variance and fitted with a quadratic model. The optimum conditions to remove Cr(VI) ions were: pH of 2, a cell voltage of 4.
... Show MoreOptimizing the Access Point (AP) deployment has a great role in wireless applications due to the need for providing an efficient communication with low deployment costs. Quality of Service (QoS), is a major significant parameter and objective to be considered along with AP placement as well the overall deployment cost. This study proposes and investigates a multi-level optimization algorithm called Wireless Optimization Algorithm for Indoor Placement (WOAIP) based on Binary Particle Swarm Optimization (BPSO). WOAIP aims to obtain the optimum AP multi-floor placement with effective coverage that makes it more capable of supporting QoS and cost-effectiveness. Five pairs (coverage, AP deployment) of weights, signal thresholds and received s
... Show MoreOptimizing the Access Point (AP) deployment is of great importance in wireless applications owing the requirement to provide efficient and cost-effective communication. Highly targeted by many researchers and academic industries, Quality of Service (QOS) is an important primary parameter and objective in mind along with AP placement and overall publishing cost. This study proposes and investigates a multi-level optimization algorithm based on Binary Particle Swarm Optimization (BPSO). It aims to an optimal multi-floor AP placement with effective coverage that makes it more capable of supporting QOS and cost effectiveness. Five pairs (coverage, AP placement) of weights, signal threshol
This paper presents the matrix completion problem for image denoising. Three problems based on matrix norm are performing: Spectral norm minimization problem (SNP), Nuclear norm minimization problem (NNP), and Weighted nuclear norm minimization problem (WNNP). In general, images representing by a matrix this matrix contains the information of the image, some information is irrelevant or unfavorable, so to overcome this unwanted information in the image matrix, information completion is used to comperes the matrix and remove this unwanted information. The unwanted information is handled by defining {0,1}-operator under some threshold. Applying this operator on a given ma
... Show MoreLet G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric