Judul: Pengaruh Beberapa Jenis Makanan terhadap Mortalitas dan Pertumbuhan Burayak Ikan Mas (Cyprinus Carpio L)
Abstrak: Ikan mas merupakan jenis ikan yang peniting dan banyak disukai masyarakat. Salah satu cara untuk meningka~kan produksi ikan mas adalah dengan memperbanyak benihnya.
Keyword: 

Judul: Pengaruh Frekwensi Pemberian Makanan Tiga, Lima dan Tujuh Kali Sehari Terhadap Pertumbuhan Ikan Mas (Cyprinus carpio Linn.)
Abstrak: Penelitian yang telah dilaksanakan bertujuan untuk mendapatkan frekwensi pemberian makanan yang dapat mendukung pertumbuhan dan produksi bagi ikan mas ukuran rata-rata 10 gram. Hypothesis yang digunakan dalam penelitian ini adalah bahwa sampai besaran frekwensi tertentu, lebih tinggi frekwensi pemberian makanan kepada ikan mas, lebih tinggi juga pertumbuhan, produksi dan effektivitas ransumnya. Perlu dikemukakan bahwa khusus bagi konversi makanan dan retensi lemak yang digunakan sebagai indikator effektivitas ransum, disebabkan bentuk formula persamaan dan effisiensi penggunaan ransum, akan terlihat pola yang terbalik yakni, bahwa lebih tinggi frekwensinya, lebih rendah juga nilai konversi makanan maupun retensi lemaknya. Untuk membuktikan kebenarannya, telah digunakan disain penelitian yang berbentuk klasifikasi tunggal Rancangan Acak Lengkap (RAL). Perlakuan yang diberikan pada ikan uji selama penelitian 47 hari adalah pemberian makanan sebanyak 7x, 5x, dan 3x per hari masing-masing dengan tiga ulangan. Analisa statistik dari hasil perlakuan kemudian menunjukkan bahwa untuk semua indikator pertumbuhan, pro- duksi dan effektivitas ransum yang diamati tidak terdapat perbedaan nyata antar perlakuan. Tetapi, pemeriksaan data analisa tersebut menunjukkan bahwa kecuali untuk beberapa indikator seperti laju pertumbuhan harian, konversi makanan dan retensi lemak, hasil perlakuan cenderung berbeda yaitu pertumbuhan, produksi dan effektivitas ransum tertinggi tercapai pada frekwensi pemberian makanan 7x per hari dan disusul berturut-turut oleh yang dihasilkan frekwensi 5x dan 3x/hari. Perlakuan 7x, 5x dan 3x/hari dalam 47 hari menghasilkan berturut-turut pertambahan berat mutlak individu 3,76; 3,02; dan 2,88 gram; pertum- buhan panjang mutlak individu 0,94; 0,78; dan 0,71 cm; produksi 94,13; 75,57; dan 71,93 gram; retensi protein 8,67; 4,28; dan 3,33%; serta retensi energi 23,48; 16,98; dan 12,16 %. ...
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