Judul: Aspek Morfometri dan Beberapa Parameter Fisika-kimia Perairan di Situ Rawa Besar, Depok
Abstrak: Pemahaman akan ciri dan sifat suatu perairan sangat diperlukan dalam pemanfaatan dan pengelolaan suatu perairan secara tepat dan lestari. Ciri dan sifat suatu perairan seperti situ, dapat dilihat dari aspek morfometri dan parameter fisika- kimia perairan itu sendiri. Tujuan dari penelitian ini adalah untuk mengetahui data morfometri dan kondisi perairan Situ Rawa Besar, Depok, berdasarkan parameter fisika-kimia perairan, serta untuk membandingkan aspek fisika-kimia perairan saat penelitian dengan aspek fisika-kimia perairan beberapa tahun sebelumnya. Hasil dari penelitian ini menunjukkan bahwa perairan Situ Rawa Besar, Depok selama kurun waktu 1990-2001 telah mengalami penyempitan dan penyusutan baik secara luas dan volume masing-masing sebesar 22.74% dan 73,10%. Sementara pada tahun 1999-2003 konsentrasi beberapa parameter fisika- kimia perairan mengalami penurunan seperti kekeruhan, pH, PO4-P, DO dan BOD. Berdasarkan parameter PO-P diketahui bahwa perairan ini tergolong eutrofik. Sementara berdasarkan Peraturan Pemerintah RI NO. 82 Tahun 2001, diketahui bahwa parameter fisika-kimia di tahun 2003 masih memenuhi persyaratan sesual baku mutu air kelas dua, kecuali parameter BODS.
Keyword: 

Judul: Struktur Komunitas Makrozoobenthos dan Beberapa Parameter Fisika Kimia Perairan Situ Rawa Besar Depok Jawa Barat
Abstrak: Situ Rawa Besar adalah salah salu situ alami yang terdapat di Kelurahan Depok Jaya, Kecamatan Pancoran Mas, Kota Depok, Propinsi Jawa Barat Situ ini berfungsi sebagai daerah resapan air dan penduduk setempat memanfaatkannya sebagai tempet pemeliharaan ikan dalam kamnba jaring apung (KJA), pemancingan umum serta media transportasi penyeberangan. Pesatnya pembangunan pemukiman di sekitar situ dan kesadaran masyarakat sekitar yang rendah yaitu masih membuang sampah ke perairan situ dan belum atau kurang adanya perhatian serta campur tangan dalam pengelolaan secamjeias dan nyata dati PEMDA setempat ikut mempengaruhi penurunan kondisi kualitas lingkuogao perairan Situ Rawa Besar.
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