Judul: Pengaruh bahan penguat pada bahan perekat tanin bahan-bahan (Rhizophoraceae) terhadap sifat-sifat papan partikel
Abstrak: Tujuan penelitian adalah untuk menjajagi kemungkinan pembuatan papan partikel dengan menggunakan perekat tanin bakau kacang (Rhizophora stylosa) dan tancang (Bruguiera gymnorhiza) yang diperkuat dengan pencampuran bahan kimia fenol-formaldehida (PF). Sebagai bahan partikel digunakan kayu jeungjing (Albizia falcataria) dalam bentuk flake. Kedua jenis tanin secara teknis laboratoris dapat digunakan sebagai bakal perekat, pada pembuatan papan partikel. Berdasarkan sifat-sifat papan partikel tertentu tanin tancang menghasilkan papan partikel yang lebih baik dibanding tanin bakau kacang. Penggantian tanin dengan PF sampai 30 persen belum menunjukkan perbaikan sifat papan partikel kecuali sifat Internal Bond dan MOE kering udara.
Keyword: Rhizophoracae;, Adhesives;, Tannins;

Judul: Ekstrak kulit pohon mangium sebagai bahan perekat tanin resorsinol formaldehida untuk pembuatan papan partikel
Abstrak: Penelitian ini meliputi 3 hal, yaitu ekstraksi dan pencirian ekstrak tanin mangium, sintesis dan pencirian perekat tanin resorsinol fonnaldehida (TRF), dan uji mutu papan partikel. Pencirian bahan baku clan produk kopolimemya dilakukan dengan menggunakan spektrofotometer inframerah, penganalisis termal diferensial, dan difraksi sinar X. Kulit pobon mangium (Acacia mangium) diekstraksi dengan air panas pada suhu 80°C untuk memperoleh ekstrak tanin, kemudian ekstrak yang diperoleb dibagi menjadi 2 bagian, sebagian dipergunakan untuk pencirian tanin ekstrak dan sebagian lagi untuk buatan perekat TRF. Tanin ekstrak dicampur dengan resorsinol pada berbagai komposisi (0,0, 0,2, 0,5, 0,7, 0,9 clan 1,1 mol) selanjutnya setiap komposisi tersebut ditambahkan 2 mol formaldehida pada kondisi basa (pH ± 11 ). Perekat TRF tersebut di lajari ciri-cirinya dan diaplikasikan sebagai perekat papan partikel skala laboratorium. Selanjutnya dilakukan pengujian mutu papan partikel menyangkut sifat fisik mekanik clan emisi fonnaldehida yang mengacu pada standar Jepang. Ekstrak tanin yang diperoleh mempunyai nilai rendemen 1,75%, bobot ekuivalen 5470, kadar abu 1,69%, kadar padatan 2,56%, kadar tanin terkondensasi 65,23%, kadar metoksil 3,87%, dan didominasi gugus fenolik dan eter. Kopolimer TRF yang paling memenuhi syarat sebagai perekat papan partikel adalab TRF 0,5 dengan komposisi tanin: resorsinol: fonnaldehida = 1,0: 0,5: 2,0 mol. Kopolimer ini mempunyai ciri derajat kristalinitas 51,33%, suhu transisi fase pelelehan 78,21°C, waktu gelatinasi 100,5 menit, kadar padatan 32,40%, bobot jenis 1, 14, viskositas 0,88 poise, clan kadar fonnaldehida bebas 0,3%.
Keyword: sistem perekat, tanin, perekat TRF

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