Kajian terhadap ketahanan hentaman ke atas konkrit berbusa yang diperkuat dengan serat kelapa sawit

Konkrit berbusa merupakan sejenis konkrit ringan yang mempunyai kebolehkerjaan yang baik dan tidak memerlukan pengetaran untuk proses pemadatan. Umum mengenali konkrit berbusa sebagai bahan binaan yang mempunyai sifat kekuatan yang rendah dan lemah terutama apabila bahan binaan ini dikenakan tenaga hentaman yang tinggi. Namun begitu, konkrit berbusa merupakan bahan yang berpotensi untuk dijadikan sebagai bahan binaan yang berkonsepkan futuristik. Binaan futuristik adalah binaan yang bercirikan ringan, ekonomi, mudah dari segi kerja pembinaan dan yang paling penting adalah mesra alam. Dalam kajian ini, konkrit berbusa ditambah serat buangan pokok kelapa sawit untuk untuk meningkatkan sifat kekuatan atau rapuh. Serat kelapa sawit juga berfungsi mempertingkatkan ketahanan hentaman terutamanya aspek nilai penyerapan tenaga hentaman dan nilai tenaga hentaman. Kandungan peratusan serat kelapa sawit yang digunakan adalah 10%, 20% dan 30% dengan dua ketumpatan konkrit berbusa iaitu 1000kg/m3 dan 1400kg/m3 . Untuk menentukan nilai penyerapan tenaga hentaman dan nilai tenaga hentaman, ujikaji Indentasi dan ujikaji hentaman dilakukan ke atas sampel�sampel yang telah diawet selama 28 hari. Luas bawah graf tegasan-terikan yang diperolehi daripada ujikaji Indentasi merupakan nilai penyerapan tenaga hentaman bagi sampel konkrit berbusa. Untuk ujikaji hentaman, keputusan ujikaji dinilai berdasarkan nilai tenaga hentaman untuk meretakkan sampel yang diperolehi daripada mesin ujikaji dynatup. Secara keseluruhannya, hasil dapatan utama bagi kedua-dua ujikaji menunjukkan sampel yang mengandungi peratusan serat kelapa sawit sebanyak 20% mempunyai nilai penyerapan tenaga hentaman dan nilai tenaga hentaman yang tinggi. Serapan tenaga maksimum adalah sebanyak 4.517MJ/m3 untuk ketumpatan 1400kg/m3 . Ini menunjukkan ketumpatan 1400kg/m3 berupaya menyerap tenaga lebih baik berbanding ketumpatan 1000kg/m3 . Manakala untuk nilai tenaga hentaman maksimum adalah sebanyak 27.229J untuk ketumpatan 1400kg/m3 . Hasil dapatan tersebut menunjukkan ketumpatan 1400kg/m3 dengan peratusan serat sebanyak 20% berupaya mengalas tenaga hentaman yang lebih banyak sebelum sampel retak. Kesimpulannya, peningkatan ketumpatan konkrit berbusa dan pertambahan serat buangan kelapa sawit ke dalam konkrit berbusa dapat meningkatkan ciri ketahanan hentaman konkrit berbusa khususnya aspek nilai penyerapan tenaga hentaman dan nilai tenaga hentaman

Towards a Better Understanding of the Local Attractor in Particle Swarm Optimization: Speed and Solution Quality

Particle Swarm Optimization (PSO) is a popular nature-inspired meta-heuristic for solving continuous optimization problems. Although this technique is widely used, the understanding of the mechanisms that make swarms so successful is still limited. We present the first substantial experimental investigation of the influence of the local attractor on the quality of exploration and exploitation. We compare in detail classical PSO with the social-only variant where local attractors are ignored. To measure the exploration capabilities, we determine how frequently both variants return results in the neighborhood of the global optimum. We measure the quality of exploitation by considering only function values from runs that reached a search point sufficiently close to the global optimum and then comparing in how many digits such values still deviate from the global minimum value. It turns out that the local attractor significantly improves the exploration, but sometimes reduces the quality of the exploitation. As a compromise, we propose and evaluate a hybrid PSO which switches off its local attractors at a certain point in time. The effects mentioned can also be observed by measuring the potential of the swarm

Parameters identification of unknown delayed genetic regulatory networks by a switching particle swarm optimization algorithm

The official published version can be found at the link below.This paper presents a novel particle swarm optimization (PSO) algorithm based on Markov chains and competitive penalized method. Such an algorithm is developed to solve global optimization problems with applications in identifying unknown parameters of a class of genetic regulatory networks (GRNs). By using an evolutionary factor, a new switching PSO (SPSO) algorithm is first proposed and analyzed, where the velocity updating equation jumps from one mode to another according to a Markov chain, and acceleration coefficients are dependent on mode switching. Furthermore, a leader competitive penalized multi-learning approach (LCPMLA) is introduced to improve the global search ability and refine the convergent solutions. The LCPMLA can automatically choose search strategy using a learning and penalizing mechanism. The presented SPSO algorithm is compared with some well-known PSO algorithms in the experiments. It is shown that the SPSO algorithm has faster local convergence speed, higher accuracy and algorithm reliability, resulting in better balance between the global and local searching of the algorithm, and thus generating good performance. Finally, we utilize the presented SPSO algorithm to identify not only the unknown parameters but also the coupling topology and time-delay of a class of GRNs.This research was partially supported by the National Natural Science Foundation of PR China (Grant No. 60874113), the Research Fund for the Doctoral Program of Higher Education (Grant No. 200802550007), the Key Creative Project of Shanghai Education Community (Grant No. 09ZZ66), the Key Foundation Project of Shanghai (Grant No. 09JC1400700), the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant No. GR/S27658/01, the International Science and Technology Cooperation Project of China under Grant No. 2009DFA32050, an International Joint Project sponsored by the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Genetic learning particle swarm optimization

Social learning in particle swarm optimization (PSO) helps collective efficiency, whereas individual reproduction in genetic algorithm (GA) facilitates global effectiveness. This observation recently leads to hybridizing PSO with GA for performance enhancement. However, existing work uses a mechanistic parallel superposition and research has shown that construction of superior exemplars in PSO is more effective. Hence, this paper first develops a new framework so as to organically hybridize PSO with another optimization technique for “learning.” This leads to a generalized “learning PSO” paradigm, the *L-PSO. The paradigm is composed of two cascading layers, the first for exemplar generation and the second for particle updates as per a normal PSO algorithm. Using genetic evolution to breed promising exemplars for PSO, a specific novel *L-PSO algorithm is proposed in the paper, termed genetic learning PSO (GL-PSO). In particular, genetic operators are used to generate exemplars from which particles learn and, in turn, historical search information of particles provides guidance to the evolution of the exemplars. By performing crossover, mutation, and selection on the historical information of particles, the constructed exemplars are not only well diversified, but also high qualified. Under such guidance, the global search ability and search efficiency of PSO are both enhanced. The proposed GL-PSO is tested on 42 benchmark functions widely adopted in the literature. Experimental results verify the effectiveness, efficiency, robustness, and scalability of the GL-PSO