Judul: Aplikasi Prebiotik dengan Dosis Berbeda Melalui Pakan untuk Pencegahan Infeksi Aeromonas hydrophila pada Ikan Mas Cyprinus carpio
Abstrak: Penyakit motile aeromonad septicemia (MAS) yang disebabkan oleh infeksi bakteri Aeromonas hydrophila merupakan kendala yang sering dialami dalam budidaya ikan mas. Salah satu pencegahan yang dapat dilakukan adalah dengan menggunakan prebiotik. Penelitian ini bertujuan untuk mengetahui pengaruh pemberian prebiotik dengan dosis berbeda melalui pakan terhadap kinerja pertumbuhan dan gambaran darah ikan mas yang diinfeksi A. hydrophila. Sebanyak 15 ekor ikan mas dengan bobot 4,94±0,32 g dipelihara dalam akuarium berukuran 80x60x40 cm3 dengan volume 96 liter. Perlakuan yang diberikan yaitu kontrol negatif (K-), kontrol positif (K+), prebiotik 0,5% (A), prebiotik 1% (B) dan prebiotik 2% (C). Setelah 30 hari pemeliharaan, setiap perlakuan (kecuali K-) diuji tantang dengan injeksi A. hydrophila sebanyak 0,1 ml/ekor pada konsentrasi 107 CFU/ml secara intramuskular kemudian diamati mortalitasnya selama 14 hari. Hasil penelitian menunjukan bahwa penambahan prebiotik 2% memberikan hasil terbaik dengan kelangsungan hidup (100%), laju pertumbuhan harian (2,71%), konversi pakan (1,36) serta gambaran darah yang lebih baik pada sebelum dan pasca injeksi A. hydrophila.
Keyword: Aeromonas hydrophila, hematologi, ikan mas, prebiotik

Judul: Aplikasi Prebiotik Mannanoligosakarida Dengan Dosis Berbeda Melalui Pakan Pada Ikan Mas Cyprinus Carpio Yang Diinfeksi Aeromonas Hydrophila
Abstrak: Penelitian ini bertujuan untuk menguji efektivitas pemberian prebiotik mannanoligosakarida (MOS) dengan dosis berbeda melalui pakan terhadap kinerja pertumbuhan, respon imun, dan kelangsungan hidup ikan mas yang kemudian diinfeksi A. hydrophila. Sebanyak 15 ekor ikan mas dengan bobot rata-rata 4,25±0,13 g dipelihara dalam akuarium berukuran 65x42x40 cm3 dengan ketinggian air 31 cm. Perlakuan yang diberikan yaitu kontrol, prebiotik 0,1% (A), prebiotik 0,2% (B), dan prebiotik 0,4% (C) dengan masing-masing 3 ulangan. Setelah 30 hari pemeliharaan, setiap perlakuan (kecuali K-) diuji tantang dengan injeksi A. hydrophila sebanyak 0,1 ml/ekor pada konsentrasi 104 CFU/ml secara intramuskular kemudian diamati mortalitasnya selama 7 hari. Hasil penelitian menunjukan bahwa pemberian prebiotik MOS melalui pakan dapat meningkatkan pertumbuhan dan respon imun ikan mas. Penambahan prebiotik 0,2 % memberikan hasil terbaik dengan laju pertumbuhan harian (1,65%), rasio konversi pakan (1,77), dan kelangsungan hidup pascauji tantang (91,67%), serta gambaran darah ikan mas yang lebih baik pada pasca injeksi A. hydrophila.
Keyword: Aeromonas hydrophila, hematologi, ikan mas, prebiotik MOS

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