Judul: Pengaruh Tepung Terigu d,.,' Garam Terhadap Perubahan Kualitas Air dan Kelangsungan Hidup Benih Ikan Mas (Cyprinus carpio L.).
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh penggunaan campuran tepung terigu dan garam terhadap kualitas air dan kelangsungan hidup benih ikan mas (Cyprinus carpio L.). Penelitian dilaksanakan pada bulan Maret sampai Juni 2003 di Laboratorium Lingkungan BDP dengan menggunakan wadah berupa toples berukuran 2.5 liter. Media yang digunakan adalah air dengan salinitas 0, 5, 10, 15, 20, 25, 30, 35 ppt. Bahan uji yang digunakan adalah berupa campuran tepung terigu dan garam (1 : 1). Ikan uji berupa benih ikan mas yang berukuran 2-2.5 cm dan babet 0.24· 0.35 gram.
Keyword: 

Judul: Pengaruh padat penebaran ikan terhadap pertumbuhan dan kelangsungan hidup benih ikan mas (cyprinus carpio L.) pada pendederan sistem air mengalir
Abstrak: Penelitian ini dilaksanakan di Kampung Curug Kalong, Desa Tangkil, Kecamatan Caringin, Kabupaten Bogor, pada sistem kolam air mengalir yang berupa bak persegi panjang dengan volume air 1000 1 yang dilengkapi dengan inlet dan outlet. Penelitian ini terdiri dari tiga perlakuan padat penebaran yang berbeda, yaitu padat tebar 1 ekor/ liter, 3 ekor/ liter dan 5 ekor/ liter. Setiap perlakuan terdiri dari 4 ulangan. Pelaksanaan pemeliharaan dibagi atas 2 kelompok. Kelompok pertama terdiri atas 3 perlakuan dengan 2 ulangan yang dijalankan mendahului perlakuan kelompok kedua, yakni 3 perlakuan dengan 2 ulangan lainnya. Ikan yang ditebar adalah benih ikan mas yang berukuran 3-5 gram/ ekor. Pada dua minggu pertama ikan diberi pakan buatan (comflete feed) sebanyak 10% bobot badan (bb) per hari dan dua minggu berikutnya sebanyak 8% bobot badan (bb) per hari dengan frekuensi pemberian 4 kali per hari. Parameter yang diukur adalah laju pertumbuhan harian, laju pertumbuhan spesifik, kelangsungan hidup, konversi pakan dan hasil (vield). Laju pertumbuhan harian berkisar antara 0.23 -0.31 gram/ hari, sedangkan laju pertumbuhan spesifik berkisar antara 3.574.21%. Laju pertumbuhan harian dan laju pertumbuhan spesifik ini menurun sejalan dengan meningkatnya...
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