Judul: Pengaruh penggunaan pestisida terhadap hewan bentos di daerah intensifikasi pertanian Kabupaten Karawang
Abstrak: Tujuan penelitian ini adalah untuk mengetahui jenis dan komposisi hewan benthos di daerah sawah yang intensif pemakaian pestisidanya, serta untuk mengetahui seberapa jauh telah terjadi pencemaran pestisida dengan melihat besarnya indeks keanekaragaman hewan benthos serta besarnyakandungan residu pestisida di dalamnya. Penelitian dimulai tanggal 5 April sampai dengan 30 Juli 1982. Analisis residu pestisida dilakukan di Laboratorium Kimia Lingkungan BATAN Jakarta, dengan menggunakan gas khromatografi. Dari hasil pemeriksaan sifat fisika-kimia air diketahui bahwa kondisi kualitas air di daerah penelitian sudah mengalami pencemaran, meskipun masih dalam tingkat tercemar ringan. Hal ini juga ditunjang oleh besarnya nilai indeks keanekaragaman hewan benthos yang diperoleh. Ditinjau dari hasil pengukuran kandungan ortho-phosphat, kalsium dan kandungan N-NO3 maka tingkat kesuburan air sangat baik untuk kehidupan hewan benthos dan organis-akuatik yang lain. Ditemukan 44 jenis hewan benthos selama penelitian.
Keyword: Melanoides culata;

Judul: Pengaruh limbah organik tambak udang intensif terhadap kualitas lingkungan perairan pesisir: studi kasus pada PT Tambak Inti Rakyat, Karawang
Abstrak: Penelitian ini dilaksanakan di lingkungan perairan Pertambakan PP Tambak Inti Rakyat, Karawang pada akhir Maret sampai akhir Juni 1994. Tujuan Penelitian ini adalah untuk : (1) mengetahui tingkat pencemaran yang ditimbulkan kegiatan tambak udang intensif terhadap lingkungan perairan pesisir ; (2) mengetahui perbedaan kualitas air masuk dan air buangan suatu kegiatan pertambakan intensif; serta (3) mengetahui besarnya beban limbah bahan organik dari tambak udang intensif yang terbuang ke lingkungan perairan pesisir. Hasil penelitian ini menunjukkan terjadinya pencemaran limbah organik pada lingkungan perairan pesisir akibat aktivitas tambak udang intensif. Hal ini ditunjang dari hasil pengukuran Kekeruhan, TSS, COD dan nitrit air buangan yang telah melampaui ambang batas Baku Mutu Air Laut Untuk Biota Laut (Kep-02/MENKLH/I/1988). Berdasarkan Indeks Mutu Lingkungan Perairan NSF-WQI diperoleh kisaran 53,49-66,44 dengan kriteria perairan tercemar sedang. Fitoplankton di lingkungan perairan pesisir PP TIR, Karawang menunjukkan kisaran nilai indeks keragaman 1,66 - 2,19 dan indeks keseragaman 0,59 - 0,87. ...
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