Judul: Perendaman Plati Pedang (Xiphophorus helleri) Betina Dewasa di Dalam Larutan 17α-Metiltestosteron untuk Menimbulkan Ciri Seksual Sekunder Jantan
Abstrak: Dimorfisme ikan plati pedang menyebabkan nilai ekonomis jantan lebih tinggi dibanding betina. Teknik maskulinisasi dengan hormon 17α-metiltestosteron (MT) telah dilakukan untuk meningkatkan produksi ikan berfenotip jantan. Namun aplikasinya masih terbatas pada stadia larva, sedangkan pada stadia dewasa baru dilakukan dengan teknik oral. Penelitian ini bertujuan untuk mengetahui munculnya ciri seksual sekunder jantan pada betina yang direndam di dalam larutan 17α-metiltestosteron. Penelitian ini menggunakan Rancangan Acak Lengkap dengan kombinasi perlakuan dosis dan frekuensi perendaman. Dosis yang digunakan pada penelitian ini 1 mg/L dan 2mg/L, sedangkan frekuensi perendaman sebanyak 1 kali, 2 kali, dan 3 kali. Hasil yang diperoleh pada semua perlakuan berhasil menimbulkan ciri seksual sekunder jantan setelah perendaman dengan larutan MT berupa pemanjangan sirip ekor bagian bawah. Dosis MT 2 mg/L dan frekuensi sebanyak 3 kali menunjukkan hasil terbaik pada pemanjangan sirip ekor.
Keyword: dimorfisme, metiltestosteron, perendaman, plati pedang

Judul: Pengarahan kelamin jantan Ikan Plati Pedang (Xiphophorus helleri) menggunakan dosis propolis melalui perendaman anakan pada suhu berbeda
Abstrak: Ikan plati pedang (Xipohophorus helleri) memiliki tampilan morfologi yang berbeda antara jantan dan betina. Ikan jantan memiliki pedang pada bagian anal. Tujuan dari penelitian ini adalah mengevaluasi dosis propolis dan perlakuan suhu pada pengarahan kelamin jantan ikan plati pedang melalui perendaman anakan. Anak ikan plati pedang diberi perlakuan perendaman menggunakan propolis pada suhu ruang (26-28°C) dan suhu 28°C dengan padat tebar 10 ekor. m-3 selama 10 jam. Setelah itu dipelihara selama 90 hari dan diberi pakan berupa daphnia dan cacing sutra. Rancangan penelitian yang digunakan adalah rancangan acak lengkap (RAL) dengan tujuh perlakuan dan tiga ulangan, yaitu propolis 0 μl. L-1, 50 μl. L-1, 100 μl. L-1 dan MT (17α-Metiltestoteron 2 mg. L-1) sebagai kontrol pada suhu ruang dan suhu 28°C. Persentase kelamin jantan ikan plati pedang pada suhu ruang (26-28°C) lebih tinggi dibandingkan suhu 28°C. Hasil penelitian terbaik pada perlakuan pemberian propolis dosis 100 μl. L-1 suhu ruang (95%) tidak berbeda nyata dengan MT (100) (P<0,05) dengan nilai tingkat kelangsungan hidup 90%, laju pertumbuhan panjang mutlak (PPM) dan pertumbuhan bobot mutlak (PBM) sebesar 4,82 cm dan 0,018 gr/ekor/hari.
Keyword: Swordtail fish Xiphopurus helleri, propolis, sex reversal, temperature

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