Judul: Efektivitas Museum Kars Indonesia sebagai Media Interpretasi Konservasi Kawasan Karst
Abstrak: Education is required for the conservation of a karst area. Indonesian Karst Museum (Museum Kars Indonesia-MKI) is one of the interpretation media that can be used as a media for karst education. The objectives of this study were to determine the visitors‟ characteristics and preferences, and to assess the effectiveness of MKI. The study was conducted by using questionnaire to visitors, record and observe the contents of MKI. Majority of MKI visitors (88.64%) came from close distance (0-70km), mostly from Wonogiri (60.44%) and from adult age class (59%), for the purpose of enjoying the scenery (47.46%). The assessment of the effectiveness of MKI consisted of the elements of room design, content of subject and media used. The effectiveness of MKI as an interpretation media for karst conservation classified not effective yet because of the effectiveness elements didn‟t met the criterias: (1) the facilities of room design; (2) systematic of delivery of material contents; and (3) type n material of media used.
Keyword: 

Judul: Water Conservation Planning in the Karst Area of Bukit Cibodas-Bogor and its Surroundings
Abstrak: Kawasan karst memiliki keunikan secara hidrologi sehingga diperlukan upaya konservasi air guna melestarikan kawasan ini. Penelitian ini bertujuan untuk merencanakan upaya konservasi air di kawasan karst baik secara struktural maupun non – struktural. Analisis yang dilakukan meliputi status daya dukung lingkungan, kapasitas simpan air, potensi suplai air, serta perencanaan konservasi air melalui perencanaan tutupan lahan dan bangunan penangkap mata air. Penelitian ini dilakukan di kawasan karst Bukit Cibodas - Bogor. Kawasan karst dan sekitarnya memiliki ketersediaan air dari curah hujan andalan sebesar 14,80 x 10⁶ m³ dengan kapasitas simpan air sebesar 0,98 x 10⁶ m³ (44%). Estimasi jejak ekologi kebutuhan air (water footprint) sebesar 35,38 x 10⁶ m³/tahun. Status daya dukung lingkungan sumberdaya air pada kawasan karst dan sekitarnya yaitu “terlampaui” (overshoot) dengan rasio supply/demand sebesar 0,4. Kapasitas simpan air kawasan karst sebesar 0,98 x 10⁶ m³ dengan potensi debit suplai air sebesar 0,19 m³/detik. Upaya konservasi air pada kawasan karst dan sekitarnya yang dapat dilakukan diantaranya adalah dengan konversi lahan pertambangan dan fasilitasnya menjadi hutan yang berimplikasi terhadap peningkatan kapasitas simpan air sebesar 0,02 x10⁶ m³ (3%) menjadi 1,00 x10⁶ m³. Tipe bangunan penangkap mata air yang disarankan yaitu tipe IA kapasitas 0,02 m3/detik dengan perkiraan biaya sebesar Rp.75.159.000., The karst area is hydrologically unique, so water conservation efforts are needed to preserve this area. This study aims to plan water conservation efforts in karst areas, both structurally and non-structurally. The analysis includes the status of environmental carrying capacity, water storage capacity, water supply potential, and water conservation planning through land cover planning and broncapturing building. This research was conducted in the karst area of Bukit Cibodas - Bogor. The karst area and its surroundings have water availability from reliable rainfall of 14,80 x 10⁶ m with a water storage capacity of 0,98 x 10⁶ m³ (44%). The estimated ecological footprint (water footprint) is 35,38 x 10⁶ m³/year. The status of the environmental carrying capacity in the area is “overshoot” with supply/demand ratio of 0,4. The water storage capacity of the karst area is 0,98 x 10⁶ m³ with a potential discharge of water supply of 0,19 m³/second. Water conservation efforts in the area that can be carried out include converting mining land into forests which has implications for increasing water storage capacity by 0,02 x10⁶ m³ (3%) to 1,00 x10⁶ m³. The recommended type of broncapturing building is IA with capacity 0,02 m3/second an estimated cost Rp. 75.159.000.
Keyword: Conservation, Water, Karst

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