The effects of shot peening treatment (SPT) were studied at (10,20, and 30) minutes on the rotating bending fatigue behavior and the behavior of the alloy steel DIN 41Cr4 vibrations. The hardness test, tensile test, constant amplitude fatigue tests, and the vibration measurements were performed on samples with and without cracks at room temperature (RT), also, the fracture surface was examined and analyzed by a Scanning Electron Microscope (SEM). The results of the investigations, for example, Stress to Number of cycles to failure (S-N) curves, fatigue strength improvement factor of 5% to 10%, the decreasing percentage of maximum Fast Fourier Transform (FFT) acceleration of the shot-peened condition were compared to untreated conditions ranging between 25% and 40%. All these improvements occurred for up to 20 minutes of shot peening time (20 SPT), exceeding that time the fatigue behavior tended to decrease due to high roughness and the generation of tensile residual stress.
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near topological spaces over B. Also, we introduce the concepts of fibrewise near closed and near open topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.
Due to the impact of industrial companies on the ransformations and developments witnessed by the world in general nd Iraq in particular, especially in the industrial and economic Jonrnal spects, the liberalization of internal and external trade, and the idoption of the open market policy in Iraq, which led to the intensification of competition between industrial companies and heir products and services, and the increase and diversity of the Onumber of alternatives Available to the public on the one hand, and he diversity and change of their desires and needs on the other hand, which was reflected in the reality of those companies and heir products or services, especially in light of the great challenges facing companies and the deteriorat
... Show MoreIn this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm). And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restr
... Show MoreIn this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.
Agriculture improvement is a national economic issue that extremely depends on productivity. The explanation of disease detection in plants plays a significant role in the agriculture field. Accurate prediction of the plant disease can help treat the leaf as early as possible, which controls the economic loss. This paper aims to use the Image processing techniques with Convolutional Neural Network (CNN). It is one of the deep learning techniques to classify and detect plant leaf diseases. A publicly available Plant village dataset was used, which consists of 15 classes, including 12 diseases classes and 3 healthy classes. The data augmentation techniques have been used. In addition to dropout and weight reg
... Show MoreWe consider some nonlinear partial differential equations in higher dimensions, the negative order of the Calogero-Bogoyavelnskii-Schiff (nCBS) equationin (2+1) dimensions, the combined of the Calogero-Bogoyavelnskii-Schiff equation and the negative order of the Calogero-Bogoyavelnskii-Schiff equation (CBS-nCBS) in (2+1) dimensions, and two models of the negative order Korteweg de Vries (nKdV) equations in (3+1) dimensions. We show that these equations can be reduced to the same class of ordinary differential equations via wave reduction variable. Solutions in terms of symmetrical Fibonacci and Lucas functions are presented by implementation of the modified Kudryashov method.
This research develops a new method based on spectral indices and random forest classifier to detect paddy rice areas and then assess their distributions regarding to urban areas. The classification will be conducted on Landsat OLI images and Landsat OLI/Sentinel 1 SAR data. Consequently, developing a new spectral index by analyzing the relative importance of Landsat bands will be calculated by the random forest. The new spectral index has improved depending on the most three important bands, then two additional indices including the normalized difference vegetation index (NDVI), and standardized difference built-up index (NDBI) have been used to extract paddy rice fields from the data. Several experiments being
... Show MoreRefuse derived fuel (RDF) is considered one of the most important types of low cost thermal energy which can be tapped in the industry, especially the cement industry in particular being the need of high thermal energy during the production processes, and in this paper we have implemented the use of a derivative of the fuel RDF as a substitute for gasoline , to reduce production costs and thereby achieve production efficiency, and the methodology used in this research statistical analysis as well as the use of the cost of kaizen target for the purpose of reducing costs and achieve production efficiency, and this has reduced the cost total cement production by which led to reduce total costs of cement production by 8.4% and an incre
... Show MoreIn this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr
... Show More