Judul: Pengaruh penggunaan karbofuran di pesemaian terhadap penggerek batang padi putih scirpophaga innotata Walker (lepidoptera : pyralidae) dan parasitoid trichogramma sp (Hymenoptera : trichogrammatidae)
Abstrak: Penelitian bertujuan untuk mengetahui pengaruh penggunaan karbofuran di pesemaian terhadap penggerek batang padi putih Scirpophaga innotata yang meliputi efek fumigan karbofuran terhadap larva penggerek batang padi putih, efek fumigan karbofuran terhadap imago Trichogramma sp, efek sistemik karbofuran terhadap penggerek batang padi putih, dan efek gabungan karbofuran terhadap penggerek batang padi putih. Penelitian dilaksanakan di Laboratorium Lapangan Program Nasional Pengendalian Hama Terpadu, Desa Panyingkiran, Kecamatan Rawamerta, Kabupaten Karawang, dan dimulai pada awal Maret sampai Desember 1991. Insektisida yang digunakan adalah Furadan 3G dengan bahan aktif karbofuran. Aplikasi karbofuran dilakukan pada saat sebar benih dan saat umur pesemaian 10 hari dengan dosis 1, 2, dan 4 kg/500 m2 atau 10, 20, dan 40 g/5m2. Infestasi larva penggerek batang padi putih (untuk efek fumigan, sistemik dan gabungan) dan imago Trichogramma sp. (untuk efek fumigan) sebanyak empat kali sampai tanaman berumur 24 hari.
Keyword: 

Judul: Pengaruh insektisida Bancol 250 EC dan evisect 50 WP terhadap kematian parasitoid telur penggerek batang padi putih Scirpophaga innotata (Walker) (Lepidoptera : Pyralidae)
Abstrak: Penelitian bertujuan untuk mengetahui pengaruh insek- tisida Bancol 250 EC dan Evisect 50 WP terhadap kematian parasitoid telur penggerek batang padi putih. Parasitoid telur diperoleh melalui perbanyakan di Laboratorium dari kelompok telur yang diambil dari lapang. Percobaan dilakukan di Laboratorium Bionomi dan Ekologi Hama, Jurusan Hama dan Penyakit Tumbuhan, Fakultas Pertanian, Institut Pertanian Bogor. Bahan dan alat yang digunakan diantaranya insektisida Bancol 250 EC Evisect 50 WP, potter tower sprayer, cawan petri plastik, gelas ukur, gelas erlenmeyer, tabung gelas plastik, pipet volumetrik, freezer dan mikroskop binokuler. Aplikasi insektisida dilakukan dengan dua cara, yaitu aplikasi secara langsung dengan beberapa konsentrasi dan residu insektisida dengan dosis anjuran. Pengamatan dilakukan pada 24 dan 48 jam setelah perlakuan dengan menghitung jumlah parasitoid yang mati. ...
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