Heat shock proteins (HSPs) are a group of intracellular proteins that promote proteins folding and unfolding under normal and/or stress conditions. In addition to their intracellular location, HSPs are found on the plasma membranes of stressed, but not normal, cells and in the extracellular milieu where they can trigger an immune response. For instance, the inducible form of heat shock protein 70 (HSPA1A) was found to be overexpressed, intra or extracellularly, by many types of stressed cells. In our study, we aim to investigate the levels of HSPA1A in the serum of untreated lung tumor patients and its expression in the tissues derived from lung tumors and chronic obstructive pulmonary diseases (COPD) and healthy
... Show MoreIn this paper, the Magnetohydrodynamic (MHD) for Williamson fluid with varying temperature and concentration in an inclined channel with variable viscosity has been examined. The perturbation technique in terms of the Weissenberg number to obtain explicit forms for the velocity field has been used. All the solutions of physical parameters of the Darcy parameter , Reynolds number , Peclet number and Magnetic parameter are discussed under the different values as shown in plots.
In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.
In this paper, we studied the scheduling of jobs on a single machine. Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi
... Show MoreResearchers used different methods such as image processing and machine learning techniques in addition to medical instruments such as Placido disc, Keratoscopy, Pentacam;to help diagnosing variety of diseases that affect the eye. Our paper aims to detect one of these diseases that affect the cornea, which is Keratoconus. This is done by using image processing techniques and pattern classification methods. Pentacam is the device that is used to detect the cornea’s health; it provides four maps that can distinguish the changes on the surface of the cornea which can be used for Keratoconus detection. In this study, sixteen features were extracted from the four refractive maps along with five readings from the Pentacam software. The
... Show MoreMeerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a
... Show MoreIn recent years, the migration of the computational workload to computational clouds has attracted intruders to target and exploit cloud networks internally and externally. The investigation of such hazardous network attacks in the cloud network requires comprehensive network forensics methods (NFM) to identify the source of the attack. However, cloud computing lacks NFM to identify the network attacks that affect various cloud resources by disseminating through cloud networks. In this paper, the study is motivated by the need to find the applicability of current (C-NFMs) for cloud networks of the cloud computing. The applicability is evaluated based on strengths, weaknesses, opportunities, and threats (SWOT) to outlook the cloud network. T
... Show MoreIn the latest years there has been a profound evolution in computer science and technology, which incorporated several fields. Under this evolution, Content Base Image Retrieval (CBIR) is among the image processing field. There are several image retrieval methods that can easily extract feature as a result of the image retrieval methods’ progresses. To the researchers, finding resourceful image retrieval devices has therefore become an extensive area of concern. Image retrieval technique refers to a system used to search and retrieve images from digital images’ huge database. In this paper, the author focuses on recommendation of a fresh method for retrieving image. For multi presentation of image in Convolutional Neural Network (CNN),
... Show MoreAccording to the theory of regular geometric functions, the relevance of geometry to analysis is a critical feature. One of the significant tools to study operators is to utilize the convolution product. The dynamic techniques of convolution have attracted numerous complex analyses in current research. In this effort, an attempt is made by utilizing the said techniques to study a new linear complex operator connecting an incomplete beta function and a Hurwitz–Lerch zeta function of certain meromorphic functions. Furthermore, we employ a method based on the first-order differential subordination to derive new and better differential complex inequalities, namely differential subordinations.
In this article, we propose a Bayesian Adaptive bridge regression for ordinal model. We developed a new hierarchical model for ordinal regression in the Bayesian adaptive bridge. We consider a fully Bayesian approach that yields a new algorithm with tractable full conditional posteriors. All of the results in real data and simulation application indicate that our method is effective and performs very good compared to other methods. We can also observe that the estimator parameters in our proposed method, compared with other methods, are very close to the true parameter values.