Judul: Analisis Kondisi Habitat Terumbu Karang Pasca Pengelolaan COREMAP II di Kecamatan Gunung Kijang, Bintan, Kepulauan Riau.
Abstrak: COREMAP (Coral Reef Rehabilitation and Management Program) adalah program jangka panjang yang bertujuan untuk melindungi, merehabilitasi, dan mengelola pemanfaatan terumbu karang secara lestari yang pada akhirnya dapat menunjang kesejahteraan masyarakat pesisir. Penelitian ini bertujuan untuk mengkaji kondisi ekosistem terumbu karang dan sosial ekonomi masyarakat pasca COREMAP II. Kondisi tutupan terumbu karang dinilai menggunakan metode LIT (Line Intercept Transect) dan pengumpulan data masyarakat melalui pengisian kuisioner. Hasilnya menunjukkan bahwa terjadi penurunan persentase tutupan karang hidup pada tahun 2014 sebesar 10,6%. Selain itu, tidak ada perbedaan yang signifikan antara tutupan karang hidup saat COREMAP II berlangsung dan saat pasca COREMAP II tahun 2014. Konsep COREMAP II belum melingkupi faktor ekternal lain yang mampu menimbulkan resiko perubahan fungsi dan struktur ekosistem terumbu karang.
Keyword: COREMAP II, Kecamatan Gunung Kijang, pengelolaan, terumbu karang

Judul: Kondisi ekosistem terumbu karang di perairan Kabupaten Bintan dan alternatif pengelolaannya:
Abstrak: Ekosistem terumbu karang menyediakan berbagai sumber kebutuhan hidup untuk masyarakat pesisir seperti hasil perikanan, budidaya dan pariwisata. Hampir 60 persen masyarakat Kabupaten Bintan berkonsentrasi di sepanjang pesisir untuk mencari penghidupan sepanjang tahunnya sehingga memberi tekanan pada sumberdaya pesisir dan laut melalui rentangan berbagai pengaruh. Kelebihan tangkap, kerusakan habitat dan peningkatan sedimen memberikan antropogenik yang sangat luas di Bintan sebagaimana informasi yang di peroleh dari CRITC Coremap II-LIPI. Tujuan dari penelitian ini adalah: Untuk mengetahui kondisi dan penyebab kerusakan di ekosistem terumbu karang di Kabupaten Bintan dan mencari alternatif pengelolaan ekosistem terumbu karang dengan pengembangan lesson learn dari existing terumbu karang.
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