Judul: Pengendalian Blast secra Kimiawi pada Padi Ladang
Abstrak: Tujuan percobaan ini adalah untuk mengetahui pengaruh fungisida benomyl-thiram f ZO WP), karbendazim (6.2 $1 -mancozeb (73.8 $1, klorotalonil (75 WP), edifenphos (50 EC) dan pyroquilon (50 WP) dalam menekan serangan cendawan Pyricularia oryzae Cav. pada padi ladang varietas IR 36 (rentan), MI 48 (toleran) dan I R 9575 (toleran). Percobaan menggunakan Rancangan Petalr Terpisah, dengan varietas sebagai petak utama dan fungisida sebagai anak pebak, diuiang tiga kali. Kanya edifenphos (50 EC) dan pyroquilon (50 WP) yag menekan blast daun pada varietas padi rentan (IR 36) sedangkan benomyl-thiram (20 WP) dan klorotalonil (75 WP) tidak mempan. Ketahanan varietzrr, M I 48 d m I R 9575 telah cukup untuk menahan blast daun, sehingga fungisida tidak diperlukan.
Keyword: 

Judul: Blast Resistance Test On 51 Rice Strains Against Blast Disease (Pyricularia oryzae) race 173.
Abstrak: Padi hasil persilangan program pemuliaan padi Departemen Agronomi dan Hortikultura IPB sebanyak 51 galur telah berhasil diuji dengan menggunakan metode injeksi. Pengujian tanaman dilakukan dengan dua kali penapisan, penapisan I sebanyak tiga ulangan dan penapisan II sebanyak dua ulangan. Penapisan I dimulai dengan memproduksi spora Pyricularia oryzae di media oatmeal agar kemudian dicuci dengan akuades steril setelah diinkubasi selama 10 hari. Penyinaran n-UV dilakukan untuk menginduksi spora sehingga spora dapat dipanen. Suspensi spora dengan konsentrasi 105 – 106 spora/ml diinjeksi pada daun tanaman padi yang berumur 20 hari (± 4-5 daun). Penapisan II dilakukan untuk menguji 18 galur padi hasil penapisan I dengan tingkat ketahanan >90%. Sebanyak 7 galur diperoleh dari hasil penapisan I dan penapisan II dengan tingkat ketahanan 100% yaitu IPB107-F-5-1, IPB107-F-7-3, IPB113-F-2-2, IPB117-F-7-2, IPB140-F-2-1, IPB149-F-4, dan IPB149-F-8. Identifikasi gen ketahanan Pi-ta dilakukan dengan Polymerase chain reaction (PCR) menggunakan 2 pasang primer yaitu primer ekson1 yang mengamplifikasi daerah ekson 1 dan primer ekson2 yang mengamplifikasi daerah ekson 2 pada gen ketahanan Pi-ta. Hasil identifikasi didapatkan bahwa semua galur yang tahan mempunyai gen Pi-ta, termasuk kontrol peka (Kencana Bali). Hasil yang diperoleh berbeda dengan penelitian sebelumnya yang menunjukkan bahwa Kencana Bali tidak memiliki gen ketahanan Pi-ta. Hal tersebut diduga bahwa varietas Kencana Bali mengalami delesi pada bagian belakang ekson2. Kata kunci : galur padi, penyakit blas (Pyricularia oryzae), gen Pi-ta
Keyword: 

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