Judul: Kajian Pengembangan Kawasan Konservasi  Terumbu Karang Di Pulau Waidoba Kecamatan  Kayoa, Propinsi Maluku Utara
Abstrak: Penelitian bertujuan untuk mengetahui kondisi perairan dan ekosistem terumbu karang sebelum dikonservasi, menentukan batas dan zonasi kawasan konservasi terumbu karang sesuai kualitas perairan, kriteria ekologis, ekonomi, dan sosial, serta menentukan arahan kebijakan dan strategi pengelolaannya. Penelitian dilakukan di pulau Waidoba kecamatan Kayoa, propinsi Maluku Utara dan berlangsung pada bulan April sampai Juli 2002.
Keyword: 

Judul: Pengelolaan Ekosistem Terumbu Karang di Daerah Perlindungan Laut di Pulau Kaledupa Kabupaten Wakatobi
Abstrak: The study concerned to analyze the management of coral reef ecosystems in Marine Protected Areas (MPAs) Kaledupa Wakatobi. The used analytical frame work of Institutional Analysis and Development (IAD), development institutional concerd IAD is used to analyze the performance and structure of the management institutional MPAs. This will be evaluated by ecological, social, and institutional (rules used). Ecological aspects represented by changes in life of coral cover on the date of and after the MPAs formed, the social aspect is represented by the condition of society and people's perceptions, institutional aspect will focus on rules that used in the institutional structure and performance. The results showed that the location of the general conditions study and life of coral cover have decreased in the early establishment by 35.5% -51.3% (medium-well) to 17.2% -39.9% (broken-being) after MPAs runs. The decline was caused by the activities of overfishing and the use of fishing tools that are not environmentally friendly. From the institutional aspect, still can’t protect the resources. This can be seen from the surveillance sistem which is weak, the punishment didn’t work properly, and so the rules haven’t fully accepted by society.
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