Judul: Pengaruh Lama Pemberian Hormon 17a-Metiltestiteron secara Oral yang Disertai dengan Pemberian Makanan Alami terhadap perubahan jenis Kelamin Ikan Mas (Cyprinus carpio Linn) Hasil Ginogenesis Berumur Dua Puluh Hari
Abstrak: Penelitian ini bertujuan untuk mengetahui derajat keberhasilan pemberian hormon 17 a-metiltestosteron secara oral yang disertai dengan pemberian cacing rambut (Tubifex sp.) segar dalam merangsang perubahan jenis kelamin ikan mas betina berumur 20 hari menjadi ikan mas jantan, dengan lama waktu pemberian hormon yang berbeda. Ikan yang digunakan adalah benih ikan mas hasil proses ginogenesis berumur 20 hari. Hormon yang digunakan adalah 17 a-metiltestosteron. dengan cara Makanan berhormon diperoleh menyemprotkan larutan hormon secara merata kepada makanan buatan yang akan digunakan dengan dosis 100 mg/kg makanan. Pemberian makan yang dilakukan adalah empat kali sehari. Makanan berhormon diberikan pada pemberian makan pertama dan kedua sedangkan cacing rambut diberikan pada pemberian makan ketiga dan keempat…dst
Keyword: 

Judul: Pengaruh pemberian hormon metiltestosteron melalui makanan buatan yang pemberiannya diselingi dengan makanan alami terhadap perubahan jenis kelamin ikan mas (cyprinus carpio L.) berumur 15, 20, dan 25 hari
Abstrak: Penelitian dilakukan di Kolam Percobaan Fakultas Perikanan, Institut Pertanian Bogor, Darmaga, pada tanggal 22 Mei 1991 sampai 3 November 1991. Tujuannya untuk mengetahui pengaruh pemberian hormon 17a-metiltestosteron secara oral melalui makanan buatan, yang diselingi dengan pemberian makanan alami, terhadap perubahan jenis kelamin ikan mas (Cyprinus carpio I..) berumur 15, 20, dan 25 hari. Wadah yang digunakan dalam penelitian ini adalah akuarium berukuran 40x60x50 cm³, bak semen berukuran 60x 50x50 cm³, 100x50x50 cm³ dan 100x100x50 cm³ masing-masing sebanyak 12 buah. Makanan yang digunakan adalah makanan alami dan makanan buatan. Makanan buatan terdiri dari dua macam, yaitu makanan buatan yang mengandung hormon untuk kelompok ikan uji selama 36 hari serta makanan buatan yang tidak mengandung hormon untuk ikan kontrol dan pembesaran. Perlakuan yang digunakan adalah umur benih ikan mas pada awal pemberian hormon, yaitu 15 hari (A), 20 hari (B), 25 hari (C) dan kontrol (D).
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