Judul: Color Change and Resistance of Pine and Jabon Wood Preserved with Imidacloprid againts Subterranean Termites through Graveyard Test
Abstrak: Kayu pinus (Pinus merkusii Jungh. et de Vriese) dan jabon (Anthocephalus cadamba (Roxb) Miq.) termasuk kelas awet V yang rentan terhadap serangan organisme perusak, sehingga ketahanannya perlu ditingkatkan. Penelitian ini bertujuan menganalisis pengaruh bahan pengawet imidakloprid terhadap perubahan warna dan ketahanan kayu pinus dan jabon akibat serangan rayap tanah melalui uji kubur selama satu tahun. Pengawetan kayu menggunakan metode vakum tekan dengan bahan pengawet imidakloprid. Pengujian terdiri dari kerapatan, kadar air, retensi, perubahan warna, kehilangan berat, dan tingkat ketahanan kayu. Pengujian tingkat ketahanan kayu menggunakan standar ASTM D 1758-06 dimodifikasi. Hasil menunjukkan pada semua contoh uji setelah uji kubur terjadi perubahan warna dengan nilai perubahan warna (ΔE*) yang besar dan perubahan warna antar contoh uji satu sama lain tidak berbeda. Nilai retensi kayu pinus lebih rendah dibandingkan kayu jabon. Kayu pinus dan jabon kontrol dengan pengawetan imidakloprid berbeda nyata pada pengujian kerapatan, kadar air, kehilangan berat, dan tingkat ketahanan kayu., Pine (Pinus merkusii Jungh. Et de Vriese) and jabon (Anthocephalus cadamba (Roxb) Miq.) belong to durable class V which are susceptible to attack by destructive organisms, so their resistance need to be increased. This study aims to analyze the effect of imidacloprid as a preservative on discoloration and resistance of pine and jabon wood due to subterranean termite attack through a one-year grave test. The preservation of wood used the vacuum-pressed method with the preservative imidacloprid. The test consists of density, moisture content, retention, discoloration, weight loss, and wood resistance level. The protection level test of wood used the modified ASTM D 1758-06 standard. The results showed that after the grave test, all samples had a color change with a large color change va lue (ΔE*) and the color cha nges (ΔE*) of the samples were not different from one another. The retention value of pine wood is lower than jabon wood. Pine wood and control jabon with imidacloprid preservation were significantly different in tests of density, moisture content, weight loss, and wood protection level.
Keyword: discoloration, imidacloprid, jabon, pine, wood resistance

Judul: Color Change and Resistance of Sengon and Mangium Wood Preserved by Imidacloprid through the Grave Test
Abstrak: Sengon (Falcataria moluccana [L.] Nielsen) dan mangium (Acacia mangium Willd.) merupakan kayu yang memiliki tingkat ketahanan yang rendah terhadap serangan organisme perusak. Ketahanan kayu dapat ditingkatkan dengan bahan pengawet imidakloprid. Penelitian ini bertujuan mengetahui perubahan warna yang terjadi setelah uji kubur 12 bulan dan menganalisis pengaruh pengawetan kayu menggunakan imidakloprid terhadap tingkat ketahanan kayu sengon dan mangium akibat serangan rayap tanah. Pengawetan kayu menggunakan metode vakum-tekan. Pengujian tingkat ketahanan kayu mengacu pada ASTM D 1758-06 yang dimodifikasi. Perubahan warna yang terjadi setelah uji kubur memiliki nilai yang besar. Nilai perubahan warna pada semua perlakuan menunjukkan hasil tidak berbeda nyata. Kadar air pada kondisi kering oven menunjukkan hasil kayu mangium lebih tinggi dari kayu sengon pada kedua perlakuan. Nilai retensi kayu sengon lebih rendah dibandingkan kayu mangium. Pengawetan menggunakan imidakloprid membuat kerapatan kayu menjadi meningkat. Kehilangan berat paling besar yaitu sengon kontrol dan terkecil yaitu mangium imidakloprid. Tingkat ketahanan kayu paling tinggi yaitu mangium imidakloprid dan paling rendah sengon kontrol., Sengon (Falcataria moluccana [L.] Nielsen) and mangium (Acacia mangium Willd.) are woods that have a low level of resistance so they are easily attacked by destructive organisms. The termite resistance of wood can be increased using imidacloprid. This study aims to determine the color change that occurs after the 12 months grave test and to analyze the effect of wood preservation using imidacloprid on the resistance of sengon and mangium woods due to subterranean termite attack. Preservation of wood using the vacuum-pressedmethod. The termite resistance test of wood using the modified ASTM D 1758-06. The color change that occurred after the grave test had a large value. The value of color change in all treatments showed no significant difference. The moisture content in oven dried showed thatmangium wood was higher sengon wood in both treatments. The retention value of sengon wood was lower than mangium wood. Preservation using imidacloprid increased the density of the wood. The biggest weight loss was control sengon and the smallest was mangium imidacloprid. The highest protection level was mangium imidacloprid and the lowest was sengon control.
Keyword: color change, imidacloprid, mangium, sengon, wood preservation

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