Judul: Fungus Pathogenicity Test and Identification that cause Root Rot on Ketapang Kencana (Terminalia mantaly) Plants
Abstrak: Serangan penyakit busuk akar banyak menyerang berbagai jenis tanaman kehutanan, seperti sengon, akasia, agathis, dan pinus. Serangan busuk akar juga ditemukan pada pohon ketapang kencana yang menyebabkan rubuhnya pohon dan merugikan manusia yang berada di sekitarnya. Penelitian ini bertujuan melakukan uji patogenisitas dan identifikasi jenis cendawan penyebab penyakit busuk akar pada tanaman ketapang kencana. Metode penelitian meliputi kegiatan uji patogenisitas dengan menginokulasikan isolat cendawan dan identifikasi jenis menggunakan ciri morfologi cendawan. Cendawan yang berhasil diidentifikasi adalah Fusarium sp. dan Botryodiplodia sp.. Botryodiplodia sp. teridentifikasi sebagai cendawan patogen yang diduga menyebabkan gejala busuk akar dan pangkal batang pada tanaman ketapang kencana karena menimbulkan serangan pada contoh uji berupa kayu sengon. Isolat Botryodiplodia sp. memiliki karakteristik makroskopis koloni berwarna putih yang kemudian berubah abu-abu, dengan tekstur menyerupai kapas, dan memiliki karakteristik mikroskopis konidiofor verticillate, konidia oval dengan dua ujung meruncing, hifa bersekat hialin yang kemudian berubah gelap.
Keyword: Botryodiplodia sp., Fusarium sp., Combretaceae, decay, morphology

Judul: Fungus Pathogenicity Test and Identification that causes Leaf Disease on Sengon in Dramaga Bogor Permanent Nursery
Abstrak: Sengon (Paraserianthes falcataria (L.) Nielsen) merupakan jenis pohon cepat tumbuh (fast-growing species) dan mudah didapat karena sudah banyak dibudidayakan di Indonesia. Usaha perbanyakan sengon melalui kegiatan pembibitan di persemaian banyak menemui kendala penyakit. Penelitian ini bertujuan mengidentifikasi cendawan penyebab penyakit daun pada tanaman sengon, serta menghitung luas dan intensitas serangan cendawan penyebab penyakit daun pada sengon di Persemaian Permanen Dramaga Bogor. Metode penelitian ini adalah rangkaian uji patogenisitas meliputi pengamatan lapang, postulat Koch, dan identifikasi jenis cendawan. Penelitian menggunakan Rancangan Acak Lengkap Faktorial (RALF). Gejala penyakit yang ditemukan pada daun sengon umur sekitar dua bulan yang ada di lokasi pengamatan adalah penyakit gugur daun, bercak daun, dan hawar daun. Hasil identifikasi cendawan penyebab gugur daun adalah Rhizoctonia sp., cendawan penyebab bercak daun adalah Colletotrichum sp., dan cendawan penyebab hawar daun adalah Fusarium sp.. Fusarium sp. menghasilkan persentase serangan tertinggi dengan luas serangan sebesar 67,34% dan intensitas serangan sebesar 57,28%., Sengon (Paraserianthes falcataria (L.) Nielsen) is a fast-growing tree species and easy to obtain because it has been widely cultivated in Indonesia. Sengon plant propagation is carried out through nursery activities in nurseries. The study aimed to identify the fungus that causes leaf disease on sengon plants and calculate the extent and intensity of attacks by the fungus that causes leaf disease on sengon in the Dramaga Bogor Permanent Nursery. This research method carried out pathogenicity test activities, including field observations, Koch's postulates, and the identification of fungal species. The study used a Completely Randomized Factorial Design (RALF). The disease symptoms found on around two months of sengon leaves old at the observation site were leaf fall, leaf spot, and leaf blight. The results of identifying the fungus that causes leaf fall were Rhizoctonia sp.. This fungus that causes leaf spots is Colletotrichum sp., and the fungus that causes leaf blight is Fusarium sp.. Fusarium sp. resulted in the highest percentage of attacks, with a disease incidence of 67,34% and disease severity of 57,28%.
Keyword: characteristics, identification, Koch's postulates, morphology

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