The compressive residual stresses generated by shot peening, is increased in a direct proportional way with shot peening time (SPT). For each metal, there is an optimum shot peening time (O.S.T) which gives the optimum fatigue life. This paper experimentally studied to optimize shot peening time of aluminium alloy 6061-T651 as well as using of and analysis of variance (ANOVA).

Two types of fatigue test specimens’ configuration were used, one without notch (smooth) and the other with a notch radius (1,25mm), each type was shot peened at different time. The (O.S.T) was experimentally estimated  to be 8 minutes reaching the surface stresses at maximum peak of -184.94 MPa.

A response surface methodology (RSM) is presen

NeighShrink is an efficient image denoising algorithm based on the discrete wavelet
transform (DWT). Its disadvantage is to use a suboptimal universal threshold and identical
neighbouring window size in all wavelet subbands. Dengwen and Wengang proposed an
improved method, which can determine an optimal threshold and neighbouring window size
for every subband by the Stein’s unbiased risk estimate (SURE). Its denoising performance is
considerably superior to NeighShrink and also outperforms SURE-LET, which is an up-todate
denoising algorithm based on the SURE. In this paper different wavelet transform
families are used with this improved method, the results show that Haar wavelet has the
lowest performance among

      The aim of this research is to solve a real problem in the Department of Economy and Investment in the Martyrs establishment, which is the selection of the optimal project through specific criteria by experts in the same department using a combined mathematical model for the two methods of analytic hierarchy process and goal programming, where a mathematical model for goal programming was built that takes into consideration the priorities of the goal criteria by the decision-maker to reach the best solution that meets all the objectives, whose importance was determined by the hierarchical analysis process. The most important result of this research is the selection of the second pro

The paper is concerned with the state and proof of the existence theorem of a unique solution (state vector) of couple nonlinear hyperbolic equations (CNLHEQS) via the Galerkin method (GM) with the Aubin theorem. When the continuous classical boundary control vector (CCBCV) is known, the theorem of existence a CCBOCV with equality and inequality state vector constraints (EIESVC) is stated and proved, the existence theorem of a unique solution of the adjoint couple equations (ADCEQS) associated with the state equations is studied. The Frcéhet derivative derivation of the "Hamiltonian" is obtained. Finally the necessary theorem (necessary conditions "NCs") and the sufficient theorem (sufficient conditions" SCs") for optimality of the stat

Gumbel distribution was dealt with great care by researchers and statisticians. There are traditional methods to estimate two parameters of Gumbel distribution known as Maximum Likelihood, the Method of Moments and recently the method of re-sampling called (Jackknife). However, these methods suffer from some mathematical difficulties in solving them analytically. Accordingly, there are other non-traditional methods, like the principle of the nearest neighbors, used in computer science especially, artificial intelligence algorithms, including the genetic algorithm, the artificial neural network algorithm, and others that may to be classified as meta-heuristic methods. Moreover, this principle of nearest neighbors has useful statistical featu

The first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o

The first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o