The present work aims to validate the experimental results of a new test rig built from scratch to evaluate the thermal behavior of the brake system with the numerical results of the transient thermal problem. The work was divided into two parts; in the first part, a three-dimensional finite-element solution of the transient thermal problem using a new developed 3D model of the brake system for the selected vehicle is SAIPA 131, while in the second part, the experimental test rig was built to achieve the necessary tests to find the temperature distribution during the braking process of the brake system. We obtained high agreement between the results of the new test rig with the numerical results based on the developed model of the brake

In this study, nanocomposites have been prepared by adding
multiwall carbon nanotubes (MWCNTs) with weight ratios (0, 2, 3,
4, 5) wt% to epoxy resin. The samples were prepared by hand lay-up
method. Influence of an applied load before and after immersion in
sodium hydroxide (NaOH) of normality (0.3N) for (15 days) at
laboratory temperature on wear rate of Ep/MWCNTs
nanocomposites was studied. The results showed that wear rate
increases with increasing the applied load for the as prepared and
immersed samples and after immersion. It was also found that epoxy
resin reinforced with MWCNTs has wear rate less than neat epoxy.
The sample (Ep + 5wt% of MWCNTs) has lower wear rate. The
immersion effect in base so

In this paper Hermite interpolation method is used for solving linear and non-linear second order singular multi point boundary value problems with nonlocal condition. The approximate solution is found in the form of a rapidly convergent polynomial. We discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems. The examples to demonstrate the applicability and efficiency of the method have been given.

In this work, satellite images for Razaza Lake and the surrounding area
district in Karbala province are classified for years 1990,1999 and
2014 using two software programming (MATLAB 7.12 and ERDAS
imagine 2014). Proposed unsupervised and supervised method of
classification using MATLAB software have been used; these are
mean value and Singular Value Decomposition respectively. While
unsupervised (K-Means) and supervised (Maximum likelihood
Classifier) method are utilized using ERDAS imagine, in order to get
most accurate results and then compare these results of each method
and calculate the changes that taken place in years 1999 and 2014;
comparing with 1990. The results from classification indicated that

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t