Judul: Identifikasi penyebab penyakit hawar daun tanaman buah merah (pandanus conoideus lamk.) dan pengendaliannya menggunakan bakteri rizosfer
Abstrak: Red Fruit (Pandanus conoideus Lamk.) is an endemic plant in Papua, which is used for food and as pharmaceutical substance. A leaf blight disease of red fruit is occurred in Manokwari District. The symptom begins with a small spot and gradually enlarges into brown blight with dark brown at the center and surrounded by a yellow “halo”. The causal agent of the disease was not yet identified. This study was conducted to identify the pathogen of leaf blight based on morphology and molecular characters, to observe the abundance of rhizosphere bacteria and its ability as biocontrol agent. Based on Koch’s Postulates, morphological characterization, PCR and sequencing of 28S rDNA, the causal agent of leaf blight is identified as Fusarium sp. The fungal pathogen shows different characters from that of other Fusarium isolated from watermelon, melon, tomato, banana and jackfruit. Some heat tolerant bacteria isolates, chitinolytic bacteria isolates and a fluorescence bacterium originated from the rhizosphere of red fruit show ability to inhibit the growth of the pathogen.
Keyword: 

Judul: Keragaman mikroorganisme rizosfer pada tanaman pisang yang terinfeksi dan tidak terinfeksi Blood Disease Bacterium
Abstrak: Penyakit darah merupakan salah satu penyakit yang menyerang tanaman pisang yang disebabkan oleh blood disease bacterium (BDB) Eksplorasi mikroorganisme rizosfer pada tanaman pisang yang terinfeksi dan tidak terinfeksi BES perlu dilakukan untuk dapat mengetahui keragaman mikroorganisme riosfer pada tanaman tersebut, sehingga dapat diperoleh mikroorganisme yang bersifat antagonis, pemacu pertumbuhan tanaman, maupun penghambat pertumbuhan patogen, serta sebagai informasi dasar untuk penerapan pengendalian hama terpadu (PHT). Penelitian ini bertujuan untuk mengetahui keragaman mikroorganisme rizosfer, khususnya cendawan dan bakteri pada tanaman pisang yang terinfeksi dan tidak terinfeksi BDB. Penelitian dilakukan di Laboratorium Bakteri, Departemen Proteksi Tanaman, Fakultas Pertanian, Institut Pertanian Bogor. Contoh tanah diperoleh dari daerah kawasan ITI (Institut Teknologi Indonesia), Serpong, Tangerang (daerah terinfeksi) dan Darmaga, Bogor (daerah tidak terinfeksi). Isolasi mikroorganisme rizosfer dilakukan dengan metode pengenceran berseri. Identifikasi genus cendawan yang berhasil diisolasi mengacu pada pustaka yang dikemukakan oleh Watanabe (1993) dan Domsch et al (1993), sedangkan identifikasi bakteri mengacu pada kunci identifikasi yang dikemukakan oleh Brown et al. (1980) dan Schaad et al. (2001). Dari hasil isolasi mikroorganisme rizosfer dapat diketahui bahwa terdapat keragaman mikroorganisme rizosfer pada lahan terinfeksi dan tidak terinfeksi BDB. Pada lahan yang terinfeksi, terdapat mikroorganisme berupa bakteri Xanthomonas sp. dan Agrobacterium sp. serta cendawan Pythium sp., sedangkan pada lahan yang tidak terinfeksi BDB diperoleh mikroorganisme yang lebih beragam dibandingkan lahan terinfeksi, yaitu bakteri Xanthomonas sp., Pseudomonas fluorescens, dan Bacillus sp. serta cendawan Aspergillus sp., Penicillium sp. Aspergillus niger, Verticillium sp., dan Trichoderma sp.
Keyword: Penyakit darah tanaman pisang, Penyebab dan gejala penyakit, Penyebaran penyakit, Pengendalian penyakit darah pada tanaman pisang, blood disease bacterium

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