Judul: Pengaruh dosis hormon 17 a_metiltestosteron terhadap perubahan jenis kelamin ikan mas (Cyprinus carpio Linn.)
Abstrak: Penelitian ini bertujuan untuk mengetahui dosis hormon 17a-metiltestosteron terhadap keberhasilan perubahan jenis kelamin ikan mas berusia duapuluh hari hasil proses ginogenesis. Penelitian dilaksanakan di Laboratorium Pengembangbiakan Ikan, Jurusan Budidaya Perairan, Fakultas Perikanan, Institut Pertanian Bogor dari awal Bulan November 1991 sampai akhir Mei 1992. Rancangan penelitian yang digunakan adalah sebagai berikut. Perlakuan A, ikan uji diberi makanan yang dicampur hormon dengan dosis 50 mg/kg makanan. Perlakuan B, ikan uji diberi makanan yang dicampur hormon dengan dosis 100 mg/kg makanan. Perlakuan C, ikan uji diberi makanan yang dicampur hormon dengan dosis 150 mg/kg makanan. Perlakuan D, merupakan kontrol dengan ikan uji diberi makanan yang tidak dicampur hormon. Kepadatan awal tiap perlakuan sebanyak 150 ekor yang dibagi rata ke dalam enam wadah akuarium…dst
Keyword: Dosis hormon 17a_metiltestosteron, Cyprinus carpio L., Jenis kelamin ikan mas, Kualitas air, Ginogenesis

Judul: Pengaruh dosis hormon 17a-metiltestosteron yang diberikan pada embrio terhadap nisbah kelamin ikan mas(cyprinus carpio L.)
Abstrak: Ikan mas betina mempunyai pertumbuhan 5% - 10% lebih cepat daripada ikan mas jantan. Sehingga petani kadang- kadang menginginkan pemeliharaan ikan semua berjenis kelamin betina. Sehubungan dengan hal tersebut, maka berbagai usaha dilakukan untuk mendapatkan ikan berjenis kelamin betina. Di antaranya adalah manipulasi kelamin (sex reversal). Manipulasi ini dapat dilakukan secara langsung maupun secara tidak langsung. Secara tidak langsung adalah dengan membuat tetua jantan fungsional, yang bergenotif XX. Kalau sperma ikan hasil manipulasi kelamin ini digunakan untuk membuahi telur maka akan dihasilkan keturunan 100% betina. Percobaan ini bertujuan untuk mengetahui pengaruh dosis hormon 17a-metiltestosteron terhadap nisbah kelamin ikan mas (Cyprinus carpio) kalau perendaman dilakukan pada embrio. Percobaan dilakukan di Laboratorium Pengembangbiakan dan Genetika Ikan, kolam Percobaan lama Babakan Darmaga, dari pertengahan April sampai awal Agustus 1996. Telah dilaksanakan enam perlakuan dan satu kontrol, dengan masing-masing tiga kali ulangan. Perlakuan tersebut adalah perbedaan dosis hormon, yaitu 5 mg/1, 10 mg/1, 15 mg/1, 20 mg/1, 25 mg/1 dan 30 mg/1 terhadap embrio ikan mas selama 6 jam. Setelah ikan dapat diperiksa gonadnya, dilakukan analisa gonad. Ikan uji yang digunakan adalah tetua jantan dan betina normal.
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