Judul: Deteksi Cendawan Yang terbawa Benih Gandum Dan Uji Kisaran Inangnya
Abstrak: Penelitian ini bertujuan untuk mendeteksi cendawan yang terbawa benih gandum dan uji kisaran inangnya. Penelitian ini dilakukan di Laboratorium dan rumah kaca Jurusan Ilmu Hama dan Penyakit Tumbuhan, Fakultas Pertanian, Institut Pertanian Bogor mulai bulan Desember 1983 sampai dengan bulan Juni 1984. Pengujian kesehatan benih dilakukan dengan menggunakan metode kertas hisap, metode Agar dan metode pengujian gejala kecambah. Cendawan yang didapatkan pada pengujian kesehatan bemin, kemudian diuji kemampuan infeksinya pada tanaman gandum, jagung, sorgum dan padi. Pengujian tersebut dilakukan dengan cara inokulasi pada bagian daun dan infestasi, ke dalam tanah. Cendawan yang berhasil dideteksi pada metode kertas hisap adalah: Aspergillus flavus, A. niger, Curvularia gеniculata, C. lunata, Fusarium equiseti, F. longines, F. moniliforme, F. semitectum, F. solani, Nigrospora sp. dan Phoma sp. Cendawan yang berhasil dideteksi pada metode agar (AKD) adalan: A. flavus, A. niger, C. geniculata, C. lunata, Chaetomium sp., Drechslera tetramera, F. equiseti, F. longi- Des, moniliforme, F. semitectum, F. solanı, Nigrospora sp. dan Phoma sp. Cendawan yang didapatkan pada pengujian gejala kecam- bah adalah: A. flavus, A. niger, Chaetomium sp., C. lunata, C. geniculata, D. maydis, D. tetramera, F. equiseti, F. longipes, F. moniliforme, F. semitectum, F. solani dân Phoma sp. ...
Keyword: 

Judul: Deteksi Cendawan yang Terbawa Benih Terung (Solanum melongena)
Abstrak: Kesehatan benih terung ungu (Solanum melongena) di Indonesia masih jarang diteliti. Kualitas terung dapat ditentukan melalui uji kesehatan benih. Oleh karena itu, penelitian ini bertujuan mendeteksi dan mengidentifikasi cendawan yang terbawa pada benih terung. Sampel yang digunakan ialah benih petani dari Kecamatan Tenjolaya, Bogor dan benih komersial. Deteksi cendawan pada benih dilakukan dengan uji kertas merang selama satu minggu. Benih terung yang berasal dari petani menunjukkan terdapatnya cendawan sebanyak 20% pada benih yang berkecambah hidup dan 3% berkecambah mati, sedangkan benih terung komersial menunjukkan terdapatnya cendawan sebanyak 11% pada benih yang berkecambah hidup dan 1% berkecambah mati. Cendawan dari benih diisolasi menggunakan teknik spora tunggal. Isolat cendawan yang berhasil diidentifikasi ialah Fusarium decemcellulare, F. solani, Fusarium spp., Memnoniella sp., Rhizoctonia sp., dan 11 cendawan Mycelia Sterilia yang belum dapat ditentukan genusnya.
Keyword: Bogor Agricultural University, Institut Pertanian Bogor, IPB, Eggplant, Isolation fungi from seeds, Straw paper test

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