Judul: Uji pengaruh toksisitas venom ubur-ubur (Cyanea sp.) pada suhu yang berbeda terhadap Daphnia sp.
Abstrak: Penelitian ini diawali dengan pengambilan sampel ubur-ubur di Perairan Karangantu, Banten pada tanggal 3 Agustus 2005. Penelitian di laboratorium dilakukan selama dua hari, ya%u tanggal 3 dan 4 Agustus 2005 di Laboratorium Basah Biologi Laut, Fakultas Perikanan dan Ilmu Kelautan, Institut Pertanian Bogor, Bogor. Sebelum dilakukan pengujian, sampel ubur-ubur dipotong dahulu pada bagian tentakelnya dan disaring. Setelah cukup kering, bagian tentakel tersebut ditumbuk, namun tidak sampai halus dan disimpan dalam toples kaca.
Keyword: 

Judul: Pengaruh berbagai konsentrasi pupuk kotoranayam terhadap ukuran dan nilai nutrisi daphnia sp
Abstrak: PB Uni Penelitian ini yang bertujuan untuk mengetahui pengaruh dosis pupuk kotoran ayam terhadap ukuran dan nilai nutrisi Daphnia sp. (protein, 1 emak, Karbohidrat dan energi), telah dilakukan selama kurang lebih dua bulan yaitu dari bulan Maret sampai April 1987. Tempat penelitian ini di Laboratorium "Aquatic Biology" Biotrop, Jalan Raya Tajur Km 6 Bogor, Jawa Barat. Biota uji yang dipakai adalah anak Daphnia sp. yang diperoleh dari Daphnia sp. betina dewasa yang kan pada wadah sediaan selama 1 X 24 digunakan Kotoran adalah ayam jam. negeri diinokulasi- Pupuk yang yang sudah dikeringkan. Wadah yang digunakan adalah silinder kaca dengan volume 20 liter, sedangkan media yang digunakan adalah air sumur pompa yang telah diaerasi selama 24 jam. Selama penelitian berlangsung media tetap diaerasi. Perlakuan berupa konsentrasi pupuk yang diberikan, yaitu 1,6; 2,4; 3,2 4,0 gram/liter. Penempatan wadah dilakukan secara acak dengan masing-masing 3 wadah untuk setiap sedangkan pengamatan hasil perlakuan, secara komposit (tanpa ulangan). Anak-anak Daphnia sp. Yang didapat dari kultur sediaan dibagikan merata ke dalam wadah percobaan berdasarkan metode perbandingan volume. Setelah dibagikan, kepadatan anak Daphnia sp. adalah 200 ekor per wadah. sp. Setiap hari dilakukan pengambilan contoh Daphnia untuk dianalisis protein, karbohidrat dan ukuran panjang masing-masing 10 ekor, serta energi 50 ekor…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