Judul: Effect of OPEFB Filler on Rubber Matrix Foam Container Application in Air Mode Forest Fire Fighting
Abstrak: Kebakaran hutan kerap kali terjadi di Indonesia berulang-ulang setiap tahunnya. FC (Foam container) adalah Inovasi dalam penanganan kebakaran hutan mode udara yang memodifikasi metode WCB (water container ball) dengan mengganti isian air menjadi foam agent. Penelitian ini bertujuan membuat shell FC dari komposit sandwich TKKS - karet alam, karakterisasi dan pengujian-nya berdasarkan sistem pemadaman kebakaran hutan mode udara. Hasil uji menunjukan penambahan jumlah filler serat TKKS pada matrik karet alam ketebalan konstan dapat meningkatkan sifat mekanik dan ketahanan-nya terhadap pengaruh termal. Namun elastisitas biokomposit menurun seiring penambahan jumlah filler. Biokomposit memiliki potensi untuk dijadikan sebagai material shell FC, karena memenuhi syarat tidak rusak (pecah) saat benturan ringan namun dapat pecah saat bertumbukan dengan sasaran. Namun perlu dilakukan pengembangan pada metode penyambungan biokomposit untuk mendapatkan FC yang sesuai dalam aplikasi pemadaman kebakaran hutan mode udara.
Keyword: EFB, natural rubber, sandwich biocomposite, shell FC

Judul: Effect of OPEFB Filler on Mechanical Properties and Moment of Inertia WCB Bionanocomposite Application of Forest Fire Fighting
Abstrak: Kebakaran hutan di Indonesia sudah terjadi pada tahun 1970, pemerintah melakukan upaya pemadaman kebakaran hutan melalui metode darat maupun udara. Metode pemadaman kebakaran hutan melalui udara yang sedang dikembangkan adalah Water Container Bombing (WCB). Penelitian ini bertujuan menganalisis pengaruh Tandan Kosong Kelapa Sawit (TKKS) terhadap sifat mekanik dan momen inersia bionanokomposit container. Container pada penelitian ini terbuat dari karet alam yang dipadukan dengan TKKS. Pembuatan bionanokomposit container dilakukan menggunakan metode hot press dengan variasi TKKS yaitu 0 phr, 5 phr, 10 phr dan 15 phr. Pengujian mekanik yang dilakukan yaitu hardness, tensile strength, elongation at break, rebound resilience, compression dan uji bakar. Hasil uji mekanik menunjukkan sampel terbaik adalah sampel NR-D karena memiliki nilai kekerasan dan kekuatan yang tinggi namun elastisitas rendah. Sampel NR-D merupakan sampel dengan variasi penambahan TKKS 15 phr (258 g TKKS, 1,72 kg karet alam dan 232 g zat aditif). Sampel pada penelitian ini tidak ada yang memenuhi factor of safety karena memiliki nilai dibawah 1,5 dibuktikan dengan uji beban pada container yang mengalami kerusakan saat diberi beban pada kondisi G = 1,5 dan G = 2,5. Nilai momen inersia pada sampel NR-D merupakan nilai yang tertinggi yaitu 5,899 kg m2, Forest fires in Indonesia occurred in 1970, the government made efforts to extinguish forest fires through land and air methods. The method of extinguishing forest fires by air that is being developed is Water Container Bombing (WCB). This study aims to analyze the effect of Oil Palm Empty Fruit Bunches (OPEFB) on the mechanical properties and moment of inertia of bionanocomposite containers. The container in this study is made of natural rubber combined with EFB. The manufacture of bionanocomposite containers was carried out using the hot press method with variations of OPEFB, namely 0 phr, 5 phr, 10 phr and 15 phr. Mechanical tests carried out are hardness, tensile strength, elongation at break, rebound resilience, compression and burn test. The results of the mechanical test showed that the best sample was the NR-D sample because it had high hardness and strength values but low elasticity. The NR-D sample is a sample with variations in the addition of 15 phr OPEFB (258 g OPEFB, 1.72 kg natural rubber and 232 g additives). The sample in this study did not meet the factor of safety because it had a value below 1.5 as evidenced by the load test on the container that was damaged when loaded at conditions G = 1.5 and G = 2.5. The value of the moment of inertia in the NR-D sample is the highest value, namely 5.899 kg m2
Keyword: bionanocomposite, filler, natural rubber, OPEFB

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm