This study was done to evaluate a new technique to determine the presence of methamphetamine in the hair using nano bentonite-based adsorbent as the filler of extraction column. The state of the art of this study was based on the presence of silica in the nano bentonite that was assumed can interact with methamphetamine. The hair used was treated using methanol to extract the presence of methamphetamine, then it was continued by sonicating the hair sample. Qualitative analysis using Marquish reagent was performed to confirm the presence of methamphetamine in the isolate.The hair sample that has been taken in a different period confirmed that this current developing method can be used to analyzed methamphetamine. This m

After baking the flour, azodicarbonamide, an approved food additive, can be converted into carcinogenic semicarbazide hydrochloride (SEM) and biurea in flour products. Thus, determine SEM in commercial bread products is become mandatory and need to be performed. Therefore, two accurate, precision, simple and economics colorimetric methods have been developed for the visual detection and quantitative determination of SEM in commercial flour products. The 1st method is based on the formation of a blue-coloured product with λmax at 690 nm as a result of a reaction between the SEM and potassium ferrocyanide in an acidic medium (pH 6.0). In the 2nd method, a brownish-green colored product is formed due to the reaction between the SEM and phosph

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

An Optimal Algorithm for HTML Page Building Process

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