Judul: Aplikasi Konsep Ekowisata Dalam Perencanaan Zona Pemanfaatan Taman Nasional untuk Patiwisata dengan Pendekatan Ruang (Studi Kasus Wilayah Seksi Bungan Kawasan Taman Nasional Betung Kerihun di Provinsi Kalimantan Barat)
Abstrak: Betung Kerihun National Park had a potencial objects for ecotourism. Existing utilization of Park had to be developed into an ideal productive ecotourism. This research was aimed to evaluate tourism objects, potencial activities of local community and tourism in one of existing running tourism activites of the park . The research was planned a use zone and tourism areas of the section. Use zone and tourism areas were delineated and ground true checked based on (1) area defined traditionally by local people, (2) protected area (3) potency to develop adventure tourisms, (4) potency to develop education with interpretation program. It is concluded that there were intensive use areas of 2.136 ha (10,8 %), general outdoor tourism 4.321 ha (21,8 %), natural environment areas 10.027 ha (50,6 %), wilderness tourism areas 3.250 ha (16,4 %), tradisional aktivities areas 88 ha (0,4 %).
Keyword: Ecotourism, Betung Kerihun National Park, Sistem Informasi Geografis

Judul: Perencanaan Lanskap Ekowisata Di Daerah Penyangga Kawasan Konservasi Taman Nasional Ujung Kulon Provinsi Banten
Abstrak: Taman Nasional Ujung Kulon (TNUK) adalah kawasan pelestarian alam yang memilki biodiversitas dan ekosistem sangat tinggi yang dikelola dengan sistem zonasi untuk optimalisasi pengelolaan dan pemanfaatan. Masalah kawasan TNUK saat ini adalah pengelolaan dan pemanfaatan zona-zona yang berinteraksi langsung dengan pemukiman penduduk lokal. Kawasan TNUK dikelilingi 19 desa yang ditetapkan sebagai daerah penyangga yang mencakup Kecamatan Sumur dan Kecamatan Cimanggu Kabupaten Pandeglang dengan jumlah penduduk sekitar 59.669 jiwa, hal ini menyebabkan Kawasan TNUK rentan terhadap tekanan aktivitas masyarakat sekitarnya. Ekowisata diyakini dapat meningkatkan kesejahteraan masyarakat dan kelestarian sumberdaya alam. Pengembangan ekowisata di TNUK harus terintegrasi dengan kawasan penyangga yang menghubungkan antara aktivitas masyarakat dan konservasi, untuk itu harus diketahui karakteristik dan potensi obyek dan daya tarik wisata alam (ODTWA) di dalamnya. Tujuan penelitian ini meliputi; (1) analisis pemanfaatan ruang daerah penyangga TNUK (2) analisis objek dan daya tarik wisata (3) analisis daya dukung kawasan wisata (4) menyusun rencana lanskap ekowisata. Analisis pemanfaatan ruang menggunakan sistem informasi geospasial (SIG). Analisis potensi obyek dan daya tarik wisata alam menggunakan pedoman Analisis Daerah Operasi – Obyek dan Daya Tarik Wisata Alam (ADO – ODTWA) Dirjen PHKA 2002 dan penilaian kelayakan objek dan atraksi wisata menggunakan kriteria penilaian menurut MacKinnon (1986). Analisis daya dukung kawasan menggunakan formulasi menurut Yulianda (2007). Situasi pemanfaatan ruang daerah penyangga kawasan TNUK menggambarkan sebagian besar sudah tidak sesuai perencanaan perluasan pemanfaatan eksisting seperti sawah, hutan lahan basah dan kebun campuran. Daerah Penyangga TNUK memiliki potensi obyek dan daya tarik wisata alam yang layak untuk dikembangkan. Potensi objek dan atraksi wisata tersebar di 10 desa penyangga yang memiliki kategori sangat potensial dan potensial dari 15 desa yang menjadi fokus penelitian dengan berbagai jenis keragaman objek dan atraksi wisata. Analisis daya dukung kawasan wisata daerah penyangga TNUK diperoleh sebesar 8.241 orang/hari. Berdasarkan kesesuaian tapak untuk pengembangan wisata, ruang, aktifitas dan fasilitasnya. Zona pengembangan meliputi zona atraktif, semi atraktif dan tidak atraktif. Sedangkan ruang wisata yang dihasilkan adalah ruang utama meliputi ruang wisata akuatik dan ruang wisata terestrial dan ruang penunjang meliputi ruang penerimaan, ruang transisi dan ruang pendukung.
Keyword: Pemanfaatan ruang, perencanaan lanskap, daerah penyangga

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