Judul: Analisis pengelolaan kawasan eksokarst gunungkidul sebagai kawasan geowisata
Abstrak: Penelitian ini bertujuan untuk mengetahui : karakteristik sumberdaya keanekaragaman geologi di Kawasan Karst Gunungkidul sebagai obyek geowisata eksokarst, pembagian satuan geomorfologi dan zonasi karst, penentuan jalur geowisata serta kesiapan sarana prasarana dan aksesibilitas geowisata. Penelitian dilakukan dengan penentuan pemilihan lokasi karst di Gunungkidul berdasarkan pertimbangan bahwa : kawasan tersebut secara spesifik memiliki keanekaragaman bentang alam karst yang unik, secara aklamasi diakui oleh Union of Speleology sebagai warisan alam yang harus dilindungi, memiliki potensi air yang cukup besar, terdapat proses alami pembentukan eksokarst dan endokarst terlengkap di dunia serta banyak peninggalan jaman purba yang terdapat di goa-goa.
Keyword: 

Judul: Kajian Kondisi Gua untuk Pengembangan Wisata Minat Khusus di Kawasan Karst Gudawang, Kabupaten Bogor
Abstrak: Maraknya eksploitasi kawasan karst untuk penambangan mengakibatkan banyaknya kerusakan di kawasan karst. Padahal, karst memiliki nilai-nilai penting bagi kehidupan, diantaranya nilai ekologis, ilmiah, ekonomis, sosial dan budaya. Salah satu upaya konservasi kawasan karst yang dapat memberikan keuntungan baik bagi kawasan maupun masyarakat adalah dengan pengembangan kegiatan wisata. Salah satu bentuk wisata yang bisa dikembangkan dapat berupa wisata minat khusus. Penelitian ini dilakukan di kawasan Karst Gudawang, Kampung Cipining, Desa Argapura, Kecamatan Cigudeg, Kabupaten Bogor selama 3 bulan (Desember 2006 - Februari 2007). Metode yang digunakan adalah metode forward untuk pemetaan gua, sedangkan untuk data potensi wisata menggunakan metode wawancara dan observasi. Gua Gudawang merupakan salah satu kawasan karst yang dikembangkan sebagai obyek wisata yang mengutamakan gua sebagai obyek utama. Kawasan karst Gudawang terdiri dari 24 gua terbagi atas gua kering dan berair. Sebanyak 2 dari15 gua yang berair, 2 telah dikembangkan untuk wisata masal, 8 gua dapat dikembangkan sebagai wisata minat khusus, 2 gua tidak dapat dilakukan kajian dan 3 gua lainnya tidak dapat ditemukan.
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