Judul: Telaah beberpa aspek eko biologikan mujair (Oreochromis mossambicus, trew). ikan tawes (Punntius javanicus, Bikr.) dan ikan mas (Cyprinus carpio, Limm) di situ gede Kecamatan Ciomas, Kabupaten Bogor, Jawa Barat
Abstrak: Suatu penelitian tentang beberapa aspek ekobiologi ikan mujair (Oreochromis mossambicus, Trew), ikan tawes (Puntius javanicus, Blkr) dan ikan mas (Cyprinus carpio, Linn) telah dilaksanakan di Situ Gede, Kec. Ciomas, Kab. Bogor, Jawa Barat. Penelitian tersebut dimulai dari awal Nopember sampai dengan akhir Desember 1986. Hasil penelitian diharapkan dapat dijadikan dasar pertimbangan dalam usaha pengelolaan situ tersebut. Contoh ikan diperoleh dari hasil penangkapan dengan menggunakan gill net dan cast net milik masyarakat setempat. Kualitas air yang diamati meliputi suhu, ke cerahan, dan pH. Hasil tangkapan ikan mujair (58 ekor) terdiri dari 28 ekor ikan dan 26 ekor ikan f ( L = 163 mm dan = 72,3 gram), ikan tawes (100 ekor) terdiri dari 57 ekor ikan dan 34 ekor ikan ( L = 170 mm dan d = 66, 3 gram) dan ikan mas (72 ekor) terdiri dari 23 ekor ikan dan 20 ekor ikan & ( L = 168 mm dan \mathbb{N} = 78, 5 gram). Jumlah tangkapan ikan mujair, tawes, dan mas yang tidak diketa hui jenis kelaminnya masing-masing sebanyak 4, 9, dan 29 ekor. ...
Keyword: 

Judul: Evaluasi stok ikan mujair, Oreochromis mossambicus (Peters) di Waduk Selorejo
Abstrak: Penelitian ini dilakukan pada bulan April hingga bulan Juni 1994 di waduk Selorejo, Malang. Tujuan dari penelitian ini adalah mempelajari parameter biologi reproduksi, parameter stok rekrut) (laju pertumbuhan, laju kematian dan hasil per serta untuk menentukan ukuran mujair terkecil yang diperkenangkan untuk ditangkap. diharapkan dapat mendasari Hasil dari penelitian ini pengambilan. keputusan dalam tindakan pengelolaan perikanan mujair di waduk Selorejo. Total ikan mujair contoh yang diperoleh dengan gill net eksperimental sebesar pertumbuhan (L dan K) seluruh ikan contoh. tas digunakan 133 1142 ekor. dan kematian Untuk (2, keperluan M dan F) studi digunakan Sedang untuk keperluan studi Fekundi- ekor ikan contoh pada tingkat kematangan gonad 3 dengan kisaran panjang total 8.0 24.3 cm. Hubungan panjang berat dan pola pertumbuhan ikan mujair diwaduk Selorejo memperlihatkan bahwa ikan jantan dan betina mempunyai nilai b yang sama yaitu secara statistik nilai..dst
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