Judul: Parasit pada benih ikan mas (Cyprinus carpio Linn.) dari kolam balai budidaya air tawar Sukabumi
Abstrak: Penelitian ini bertujuan untuk mengetahui jenis-jenis parasit yang menginfeksi benih ikan mas, keberadaan parasit selama satu tahun, dan hubungan umur ikan dengan parasit yang ditemukan. Penelitian ini dilakukan di Balai Budidaya Air Tawar, Sukabumi sebagai tempat pemeliharaan ikan dan Laboratorium Parasit Ikan Jurusan Budidaya Perairan, Fakultas Perikanan, Institut Pertanian Bogor sebagai tempat pemeriksaan ikan dan identifikasi parasit. Waktu penelitian selama 12 bulan dari tanggal 15 Juli 1989 sampai dengan Juni 1990. Ikan yang digunakan untuk penelitian adalah ikan mas yang berukuran benih. Pemijahan ikan dilakukan dua bulan sekali dan setiap pemijahan dilakukan empat kali pengambilan dan 60 hari. ikan contoh yaitu pada ikan umur 15, 30, 45, Telur hasil pemijahan diletakkan di kolam Pendederan I sampai ikan berumur 30 hari. Dari kolam Pendederan I ikan dipindahkan ke kolam Pendederan II. Lama ikan di kolam Pendederan II adalah 30 hari. Ikan contoh umur 15 dan 30 hari diambil dari kolam Pendederan I, sedangkan Ikan umur 45 dan 60 hari diambil dari kolam Pendederan II.
Keyword: 

Judul: Kerentanan benih ikan mas (Cyprinus carpio L.) strain cangkringan, Kuningan, Pandeglang dan Jember terhadap infeksi parasit myxospera
Abstrak: Penelitian ini dilakukan di BBAT Sukabumi dan di Lab. Babakan - Darmaga sejak bulan Februari 1989 sampai dengan Agustus 1989. Hewan uji yang digunakan adalah ikan mas (Cyprinus carpio L.) strain Cangkringan (A), Kuningan (B), Pandeglang (C) dan Jember (D), berumur dua bulan. Penelitian ini dibagi menjadi empat tahapan kegiatan, penyediaan ikan uji (2 bulan), penularan ikan uji yaitu (15 hari), masa pemeliharaan/inkubasi (50 hari) dan peme- riksaan ikan uji (2 bulan). Wadah yang digunakan untuk penularan ikan uji adalah haga berukuran 2x1x1 m³ sebanyak 12 buah yang ditempatkan 01 kolam yang banyak mengandung Myxosporea, sedangkan untuk pemeliharaan ikan selama masa inkubasi adalah bak fiber- glass bervolume 1000 liter. Setiap wadah diisi dengan satu macam strain untuk satu ulangan. Penempatan wadah diacak menurut bilangan acak Steel and Torrie (1981).
Keyword: Ikan mas, Cyprinus carpio L.

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