Judul: Pengaruh Sumber Air yang Berbeda terhadap Infestasi Ektoparasit dan Endoparasit pada Benih Ikan Mas (Cyprinus carpio L.)
Abstrak: Penelitian ini bertujuan untuk mempelajari pengaruh sumber air yang berbeda terhadap infestasi ektoparasit dan endoparasit pada benih ikan mas (Cyprinus carpio L.). Penelitian Perikanan Air Tawar (Balitkanwar),yang terletak di Desa Cijeruk, Kecamatan Cijeruk, Bogor, dari awal Desember 1987 sampai awal februari 1988.
Keyword: 

Judul: Pengaruh perbedaan penundaan waktu tebar benih ikan mas (Cyprinus carpio L.) di kolam air sumber terhadap infeksi beberapa jenis ektoparasit
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh penggunaan air sumber sebagai media penundaan waktu tebar benih ikan mas (Cyprinus carpio L.) terhadap infeksi bebera- pa jenis ektoparasit. Penelitian dilakukan di Cijeruk dan Instalasi Cibalagung, Balai Penelitian Perikanan Air Tawar, Bogor, dari awal Desember 1987 - awal Februari 1988. Rancangan percobaan yang digunakan adalah Rancangan Acak Lengkap (RAL), dengan tiga perlakuan dan tiga ulangan. Perlakuan yang digunakan adalah perbedaan penundaan waktu tebar benih ikan di kolam air sumber sebelum dipindah ke kolam penularan (kolam air biasa dari aliran sungai) yaitu: K (penundaan di kolam air sumber selama O minggu, benih ikan langsung ditebar ke kolam penularan), W2 (penundaan di kolam air sumber selama 2 minggu), dan W4 (penundaan di kolam air sumber selama 4 minggu). Analisa data dilakukan dengan mem- bandingkan derajad insidensi dan intensitas setiap jenis ektoparasit pada ketiga perlakuan. Ikan yang digunakan adalah benih ikan mas (Cyprinus carpio L.) berumur 7 hari (±1 cm). Wadah penelitian yang digunakan adalah kolam tanah berukuran 2,5 x 2,5 x 1,2 m2 dengan kedalaman air dipertahankan setinggi 0,6 m sebagai kolam penularan, dan kolam semen berukuran 2,5 x 2,0 x 1,1 m³ dengan kedalaman air dipertahankan setinggi 0,75 m sebagai kolam penundaan. Padat penebaran sebanyak 500 ekor per kolam. Pengambilan ikan contoh dilakukan setiap minggu sekali sebanyak 5 ekor setiap ulangan, dan diamati secara mikroskopis. Ektoparasit yang ditemukan menginfeksi benih ikan mas di kolam selama penelitian adalah jenis Trichodina, Dactylogy- rus, Gyrodactylus, Ichthyophthirius dan Lernaea cyprinacea L. Univers Jenis Trichodina ditemukan menginfeksi benih ikan mas di kolam K mulai minggu ke-1, sedangkan di kolam W2 dan W4 ektoparasit ini ditemukan pada benih ikan mulai minggu ke-2. Insidensi dan intensitasnya menunjukkan jumlah rata-rata lebih tinggi terjadi pada benih ikam di kolam K, kemudian diikuti pada benih ikan di kolam W2, dan terendah terjadi pada benih ikan di kolam W4…dst
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