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: Controlling of Blast Disease (Pyricularia oryzae Cav.) in Lowland Rice with Several Cultivation Methods
Abstrak: Padi merupakan sumber pangan utama yang penting bagi masyarakat Indonesia. Oleh karena itu keberlanjutan produksinya dari tahun ke tahun selalu menjadi perhatian bagi pemerintah. Faktor yang dapat memengaruhi produktivitas padi salah satunya adalah serangan hama dan penyakit tanaman. Penyakit blas yang disebabkan oleh Pyricularia oryzae merupakan penyakit penting pada tanaman padi di negara-negara penghasil padi di seluruh dunia. Saat ini terdapat tiga cara utama yang dapat dilakukan untuk mengendalikan penyakit blas, yaitu teknik budidaya, penggunaan fungisida dan varietas tahan. Percobaan lapangan ini dilakukan untuk mengetahui pengaruh beberapa teknik budidaya tanaman padi terhadap perkembangan penyakit blas. Percobaan ini dilakukan dengan menggunakan rancangan acak lengkap satu faktor dengan tiga perlakuan dan tiga ulangan. Perlakuan tersebut yaitu P1 (pengembalian jerami, penggunaan pupuk hayati, pengurangan pupuk sintetis, tanpa penggunaan pestisida sintetis), P2 (pengembalian jerami, penggunaan pupuk dan pestisida sintetis sesuai dengan cara petani setempat), dan P3 (jerami dibakar, penggunaan pupuk dan pestisida sintetis sesuai dengan cara petani setempat). Data tingkat serangan blas daun, blas leher, tinggi tanaman, jumlah anakan total dan jumlah anakan produktif pada setiap ulangan diamati pada 50 rumpun tanaman contoh yang ditentukan secara sistematis. Pengamatan tersebut dilakukan pada umur 30, 40, 60, 80, dan 90 hari setelah pindah tanam. Perlakuan yang diuji cobakan tidak menunjukkan perbedaan yang nyata terhadap insidensi dan keparahan penyakit, baik blas daun maupun blas leher, tinggi tanaman, total jumlah anakan serta jumlah anakan produktif. Perlakuan P2 menunjukkan produktivitas gabah kering panen maupun kering giling yang paling tinggi dibandingkan dua perlakuan lainnya., Rice is an important main food source for Indonesian people. Therefore, the sustainability of production from year to year is always a concern for the government. One of the factors that may affect rice productivity is the presence of pests and plant diseases. Blast disease caused by Pyricularia oryzae is an important disease in rice-producing countries around the world. At present, there are three primary control measures that may be applied, namely cultural practices, fungicides and cultivar resistance. This field experiment was conducted to determine the effect of several rice cultivation techniques on the development of blast disease. This experiment was conducted using a one-factor completely randomized design with three treatments and three replications. The treatments were P1 (returning straw to the field, using biological fertilizers, reducing synthetic fertilizers, without the use of synthetic pesticides), P2 (returning straw to the fields, using synthetic fertilizers and pesticides with the dosage as commonly practiced by local farmers), and P3 as comparison treatment (cultivation techniques commonly practiced by local farmers include burning straw, use of synthetic fertilizers and pesticides with doses as commonly practiced by local farmers). Data on incidence and severity of leaf blast and neck blast, plant height, number of total tillers and number of productive tillers in each replication were observed on 50 sample plants which were determined systematically. The observations were made at 30, 40, 60, 80, and 90 days after transplanting. The treatments tested did not show significant differences in the incidence and severity of both leaf and neck blast disease, plant height, total number of tillers and number of productive tillers. The P2 treatment showed
Keyword: bio-fertilizer, blast disease, straw return, synthetic fertilizer, synthetic pesticides

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