Judul: Uji Antagonis Trichoderma harzianum terhadap Rhizoctonia sp. Penyebab Penyakit Hawar Daun pada Jabon (Anthocephalus cadamba (Roxb.) Miq.) secara in Vitro
Abstrak: Jabon (A. cadamba) merupakan salah satu jenis pohon cepat tumbuh yang diminati oleh industri kayu lapis dan industri pulp dan kertas karena riapnya yang besar dengan daur yang pendek. Salah satu penyakit yang menyerang tanaman Jabon adalah hawar daun (leaf blight) yang disebabkan oleh Rhizoctonia sp. Penelitian ini menggunakan jamur antagonis T. harzianum dengan tujuan untuk mengetahui potensi penghambatan pada aktifitas Rhizoctonia sp. pada media PDA (Potatos Dextrose Agar) dan PFA (Potatos Fructose Agar) sebagai media padat serta PDB (Potatos Dextrose Broth) dan PFB (Potatos Fructose Broth) sebagai media cair yang digunakan untuk uji antagonis. Analisis data yang digunakan yaitu RAL (Rancangan Acak Lengkap) in time untuk isolat yang ditumbuhkan pada media padat dan RAL faktorial untuk isolat yang ditumbuhkan pada media cair. Hasil uji Duncan menunjukkan bahwa media-media yang digunakan tidak berpengaruh nyata terhadap penghambatan aktifitas Rhizoctonia sp. oleh T. harzianum dimana tingkat penghambatan pada metode langsung di media PDA (79.38%) lebih tinggi daripada di media PFA (69.10%).
Keyword: Jabon, Rhizoctonia sp., Trichoderma harzianum, media, RAL

Judul: Uji Antagonis Trichoderma harzianum terhadap Botryodiplodia sp. Penyebab Penyakit Mati Pucuk pada Jabon (Anthocephalus cadamba) secara in Vitro
Abstrak: Frenquently issues emerge on jabon (A. cadamba) plantations development is Botryodiplodia sp. aggression that cause dieback desease. Biology control is necessary as effort to hamper pathogen growth with lowest environmental contamination risk compared to non biological control. One of biological control configuration is using biological control agent T. harzianum the research supposed to acquire T. harzianum potency as biological control agent against Botryodiplodia sp.. In this research antagonist examination using direct method (dual culture) and indirect method (filtrate T. harzianum). Experiment model is using completely randomize design and in time completely randomize design. This research result shows that T. harzianum disposal in antagonist examination on direct mothode and indirect method against Botryodiplodia sp. growth. This case shows that T. harzianum has potency to against Botryodiplodia sp. growth. So that could be used as biological desease control on jabon (A. cadamba) especially caused by Botryodiplodia sp..
Keyword: Bogor Agricultural University (IPB), antagonistic examination, Trichoderma harzianum, Botryodiplodia sp

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