Judul: Hubungan Fisika dan Kimia Air dengan Produktivitas Biota Planktonik di Perairan Segara Anakan
Abstrak: Tujuan penelitian ini adalah untuk mempelajari hubungan kualitas fisika dan kimia air dengan produktivitas biota planktonik, berkenaan dengan pola penyebaran Muatan Padatan Tersuspensi yang berbeda-beda d i perairan Segara Anakan. Untuk itu lokasi stasiun-stasiun penelitian di perairan Segara Anakan ditetapkan empat zona dan tiga kelas muatan padatan tersuspensi.
Keyword: 

Judul: Tingkat kesuburan Situ Perikanan dalam menunjang komunitas fitoplankton
Abstrak: Penelitian ini bertujuan: (1) menelaah parameter fisik dan kimia perairan yang menunjang kesuburan perairan, (2) keterkaitan antara faktor fisik-kimia perairan dengan kondisi komunitas fitoplankton. Penelitian ini dimulai pada tanggal 2 Juni 1995 sampai dengan 17 Juli 1995 di Situ Perikanan, Kampus IPB Darmaga, Bogor. Pengamatan dilakukan sebanyak enam kali pada empat stasiun. Pengambilan sampel parameter fisik-kimia perairan yang diukur meliputi suhu perairan, kecerahan, kekeruhan, TSS, DHL, PH, DO, CO2, COD, NH3-N, NO₂-N, NO3-N, Ortofospat, dan Silikat, serta fitoplankton sebagai parameter biologi. Analisa data biologi adalah dengan menghitung kelimpahan fitoplankton, indeks keanekaragaman, indeks keseragaman, indeks dominansi, serta pendekatan dengan model grafik Frontier. Untuk menentukan kesamaan antar stasiun digunakan indeks Bray-Curtis dan indeks Canberra. Keterkaitan antara parameter fisika-kimia air dan kelimpahan fitoplankton dianalisis dengan inenggunakan analisis regresi berganda. Untuk menentukan tingkat kesuburan dilakukan pendekatan dengan beberapa kriteria pustaka, terhadap beberapa parameter fisika-kimia dan biologi. Selama penelitian kecerahan perairan berkisar antara 0,56 - 2,85 meter. Kekeruhan berkisar antara 2,540,0 NTU, TSS: 4340 mg/l, DHL: 4572 umhos/cm, pH: 5,006,55. Secara umum nilai-nilai tersebut lebih besar di Stasiun 1 (inlet) dan 4 (outlet). Karbon dioksida berkisar antara 6,39 27,96 mg/l. Secara umum kandu- ngan karbon dioksida lebih besar di Stasiun 2 dan 3. ...
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