Judul: Patogenesitas Botryodiplodia theobromae Pat. Terhadap Daun Kayu Afrika (Maesopsis eminii Engl.)
Abstrak: Kayu afrika (Maesopsis eminii Engl.) merupakan kayu perdagangan yang tergolong kayu cepat tumbuh yang memiliki banyak manfaat. Gangguan penyakit menjadi hambatan pertumbuhan dan menurunkan kualitas kayu. Botryodiplodia theobromae merupakan patogen penyebab penyakit yang merugikan dan memiliki banyak inang. Penelitian bertujuan menguji patogenisitas Botryodiplodia theobromae terhadap daun kayu afrika, menguji secara makroskopis dan mikroskopis patogen yang menyerang daun kayu afrika adalah Botryodiplodia theobromae. Rancangan percobaan yang digunakan adalah rancangan acak lengkap. Perlakuan yang digunakan terdiri dari tanpa pelukaan inokulasi, pelukaan, inokulasi dan pelukaan ditambah inokulasi. Hasil pengamatan menunjukkan gejala bercak daun dengan warna kecoklatan pada daun kayu afrika. Berdasarkan uji jarak berganda (Duncan) pelukaan ditambah inokulasi memberikan rataan terbesar terhadap keparahan penyakit sebesar 27.56% dan kejadian penyakit sebesar 82.67%. Hasil pengamatan makroskopis pada media PDA menunjukkan koloni isolat ini memiliki warna putih kapas hingga berumur 7 hari dan berwarna abu-abu hingga hitam pekat pada miselium yang tua. Koloni miselium memiliki tekstur seperti benang halus dengan miselium udara yang tebal dan koloni menyebar dari bagian tengah dengan alur tidak beraturan. Pengamatan mikroskopis daun yang bergejala penyakit hasilnya memperlihatkan karakter patogen Botryodiplodia theobromae, dengan ditemukan hifa bersekat hialin dan konidia yang berbentuk ellipsoid hialin.
Keyword: Botryodiplodia theobromae, disease incidency, disease severity, leaf spots, Maesopsis eminii Engl.

Judul: Uji Patogenisitas Patogen Hawar Daun pada Tanaman Kayu Afrika (Maesopsis Eminii Engl.) di Persemaian Permanen BPDAS Bogor
Abstrak: African wood (Maesopsis eminii Engl.) is a fast-growing tree species which are now begin to be exploited. This research is aimed to identify the types of pathogens, disease incidence and severity of leaf blight disease in African wood seedlings. Methods include field observations, isolation of symptomatic leaf blight and subsequent testing of Koch's postulates. Results of field observations indicating that the incidence of the disease is at 99.44%, while the severity of the disease by 8.85%. When isolation of symptomatic leaf blight was found 8 kinds of isolates that have different colors. The isolates were found in plants are then inoculated on African wood, and almost all isolates can causing the symptoms of leaf blight. The result of Koch's postulates inoculated leaf, found two types of isolates were identical to the initial isolation. Pathogenicity test results showing isolates with 1.1 code has the highest percentage value of disease incidence and severity than the other isolates. The identification results show the isolates with 1.1 code is a type of fungus characterized by having sectional hyphae and contained conidia, this fungus belongs to a class of Deuteromycetes
Keyword: Bogor Agricultural University (IPB), severity of disease, Maesopsis eminii Engl, leaf blight, Koch's postulates, Fungus

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