Chemical and biological reactions of solidification of peat using ordinary portland cement (OPC) and coal ashes

Construction over peat area have often posed a challenge to geotechnical engineers. After decades of study on peat stabilisation techniques, there are still no absolute formulation or guideline that have been established to handle this issue. Some researchers have proposed solidification of peat but a few researchers have also discovered that solidified peat seemed to decrease its strength after a certain period of time. Therefore, understanding the chemical and biological reaction behind the peat solidification is vital to understand the limitation of this treatment technique. In this study, all three types of peat; fabric, hemic and sapric were mixed using Mixing 1 and Mixing 2 formulation which consisted of ordinary Portland cement, fly ash and bottom ash at various ratio. The mixtures of peat-binder-filler were subjected to the unconfined compressive strength (UCS) test, bacterial count test and chemical elemental analysis by using XRF, XRD, FTIR and EDS. Two pattern of strength over curing period were observed. Mixing 1 samples showed a steadily increase in strength over curing period until Day 56 while Mixing 2 showed a decrease in strength pattern at Day 28 and Day 56. Samples which increase in strength steadily have less bacterial count and enzymatic activity with increase quantity of crystallites. Samples with lower strength recorded increase in bacterial count and enzymatic activity with less crystallites. Analysis using XRD showed that pargasite (NaCa2[Mg4Al](Si6Al2)O22(OH)2) was formed in the higher strength samples while in the lower strength samples, pargasite was predicted to be converted into monosodium phosphate and Mg(OH)2 as bacterial consortium was re-activated. The Michaelis�Menten coefficient, Km of the bio-chemical reaction in solidified peat was calculated as 303.60. This showed that reaction which happened during solidification work was inefficient. The kinetics for crystallite formation with enzymatic effect is modelled as 135.42 (1/[S] + 0.44605) which means, when pargasite formed is lower, the amount of enzyme secretes is higher

A Comparison of Nature Inspired Algorithms for Multi-threshold Image Segmentation

In the field of image analysis, segmentation is one of the most important preprocessing steps. One way to achieve segmentation is by mean of threshold selection, where each pixel that belongs to a determined class islabeled according to the selected threshold, giving as a result pixel groups that share visual characteristics in the image. Several methods have been proposed in order to solve threshold selectionproblems; in this work, it is used the method based on the mixture of Gaussian functions to approximate the 1D histogram of a gray level image and whose parameters are calculated using three nature inspired algorithms (Particle Swarm Optimization, Artificial Bee Colony Optimization and Differential Evolution). Each Gaussian function approximates thehistogram, representing a pixel class and therefore a threshold point. Experimental results are shown, comparing in quantitative and qualitative fashion as well as the main advantages and drawbacks of each algorithm, applied to multi-threshold problem.Comment: 16 pages, this is a draft of the final version of the article sent to the Journa

A survey of swarm intelligence for dynamic optimization: algorithms and applications

Swarm intelligence (SI) algorithms, including ant colony optimization, particle swarm optimization, bee-inspired algorithms, bacterial foraging optimization, firefly algorithms, fish swarm optimization and many more, have been proven to be good methods to address difficult optimization problems under stationary environments. Most SI algorithms have been developed to address stationary optimization problems and hence, they can converge on the (near-) optimum solution efficiently. However, many real-world problems have a dynamic environment that changes over time. For such dynamic optimization problems (DOPs), it is difficult for a conventional SI algorithm to track the changing optimum once the algorithm has converged on a solution. In the last two decades, there has been a growing interest of addressing DOPs using SI algorithms due to their adaptation capabilities. This paper presents a broad review on SI dynamic optimization (SIDO) focused on several classes of problems, such as discrete, continuous, constrained, multi-objective and classification problems, and real-world applications. In addition, this paper focuses on the enhancement strategies integrated in SI algorithms to address dynamic changes, the performance measurements and benchmark generators used in SIDO. Finally, some considerations about future directions in the subject are given