Judul: Kearifan Tradisional Perlindungan dan Pemanfaatan Sumberdaya Hutan oleh Suku Kanume di Taman Nasional Wasur
Abstrak: Wasur National Park (TN Wasur), is located in Merauke, Papua. The Kanume tribe is one of indigenous communities who have long been living in TN Wasur, which has the region's largest in TN Wasur, about 305.312 ha (73,78%). This study was conducted to analyze the pattern of protection and use of forest resources by the tribe Kanume in the Wasur National Park. The results showed that the people of clans in the ethnic of Kanume has a custom rules and wisdom in terms of protection and utilization of forest resources. Clans in the tribe of Kanume has ownership rights at the ulayat land to protect and exploit resources that there can be found sacred places, the old village, the well nature, hamlet of sago, and places the ancestral journey. In traditional wisdom and resource utilization, the tribe of Kanume have a culture that supports the management of the forest resource. This can be seen by the existence of the division of conception space based on the area of ulayat customs, the system of mastery and ownership of land, Sasi system and the belief of Totem(Totemism).
Keyword: traditional wisdom, Taman Nasional Wasur, Suku Kanume

Judul: Kajian etnobotani masyarakat suku marini sendawi di kawasan taman nasional Wasur, kabupaten Merauke, propinsi Papua
Abstrak: Taman Nasional Wasur (TNW) merupakan salah satu taman nasional yang terletak di Kabupaten Merauke, Papua Taman nasional ini maupakan salah satu taman nasional model, yaitu karena di dalam kawasan terdapat penduduk yang masuk dalam pengelolaan taman nasional. Masyarakat adat yang tinggal di kawasan TNW memiliki kearifan tradisional dalam memanfaatkan tumbuhan untuk kehidupan sehari-hari. Kearifan tradisional tersebut sesuai menurut pengetahuan lokal yang mereka ketahui. Hasil penelitian ini diharapkan dapat menjadi bahan masukan dalam pengelolaan Taman Nasional Wasur, Kab. Merauke, Papua. Penelitian ini dilakukan di 6 lokasi yang terdapat di dalam dan sekitar TNW yaitu kampung Ndalir (Nggawil Anim), kampung Rawa Biru, Yanggandur dan Sota (Kanume), kampung Wasur (Marori-Men Gey) dan kampung Poo (Yeinan). Waktu penetitian adalah bulan April sampai Juni 2008. Bahan yang digunakan dalam penelitian ini adalah dokumen/laporan penelitian yang telah dilakukan baik oleh pibak Balai TNW maupun oleh instansi/pihak lain, tumbuhan untuk pembuatan herbarium, dan alkohol 70%, sedanngkan alat yang digunakan adalah peta, kamera digital, kertas koran kantong plastik, sasak, tally, sheet, kuisioner, label gantung, alat tulis menulis.
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