Judul: Pengaruh Insektisida Baycarb 500 EC terhadap Pertumbuhan Burayak Ikan Mas (Cyprinus carpio L.)
Abstrak: Penelitian ini dilakukan dari tanggal 13 Juli sampai, dengan 1 September 1987 di Balai Penelitian Perikanan Air Tawar, Bogor. Tujuan penelitian adalah untuk mengetahui : (1) pengamh akut dan bioaktivitas insektisida Baycarb 500 EC terhaaap burayak ikan Mas, (2) pengamh beberapa ambang lconsentrasi insektisida Baycarb 500 EC yang dianjurkan bagi pengendalian hama Wereng Coklat (Nilaparvata lugens), terhadap laju kematian, laju pertwnbuhan dan produksi burayak ikan Mas, dan (3) nilai Maximum Acceptable Toxicant Concentration (MATC) dan Application Factor (AF). Hewan uji adalah burayak ikan Mas dengan ukuran panjang 1 - 3 cm. Burayak ikan Mas diperoleh dari peternakan PI Akuakultura Nasional, Desa Cibening, Kabupaten Bogor. Bahan uji yang digunakan adalah insektisida Baycarb 500 EC dengan bahan aktif BPMC (2-(1-methyl propyl) phenyl methyl carbamate. Penelitian ini diran~ang menurut pola rancangan acak lengkap. Konsentrasi uji adalah kontrol, 1 ppm (dosis aplikasi di sawah.), 4 ppm dan 8 ppm.
Keyword: 

Judul: Pengaruh insektisida baycarb 500 ec terhadap pertumbuhan glondongan ikan mas
Abstrak: Penelitian ini dilakukan sejak 8 Juli hingga 1 September 1987, di Balai Perikanan Air Tawar, Bogor. Tujuan penelitian adalah untuk mempelajari (1) pengaruh akut dan bioaktivitas insektisida Baycarb 500 EC terhadap glondongan ikan Mas dan (2) pengaruh dosis aplikasi insektisi da Baycarb 500 EC yang dianjurkan bagi pengendalian hama Wereng coklat (Nilaparvata lugens) terhadap laju kematian, laju pertumbuhan dan produksi glondongan ikan Mas yang di budidayakan di kolam selama lima minggu, serta menentukan konsentrasi maksimum yang aman bagi kehidupan ikan (MATC). Ikan Mas stadia glondongan diperoleh dari peternakan PT Akuakultura Nasional, Desa Cibening, Kabupaten Bogor. Glondongan ikan Mas digunakan untuk uji toksisitas akut, bioaktivitas dan uji kadar aplikasi insektisida Baycarb 500 EC. Ukuran ikan uji adalah 5- 7 cm. Bahan uji yang digunakan adalah insektisida Baycarb 500 EC dengan bahan aktif BPMC. Konsentrasi uji masing-masing adalah O (kontrol); 17.9, 27.5, 31.8 dan 42.0 ppm untuk uji toksisitas akut; 0 (kontrol); 1, 4 dan 8 ppm untuk uji kadar aplikasi. Sedangkan untuk uji bioaktivitas digunakan waktu Ο, 14, 24, 41, 70, 91 jam serta kontrol (0 jam, tanpa insektisida) dengan menggunakan nilai LC100-24 jam yaitu 49 ppm.
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