Judul: Etnobotani Pangan Masyarakat Suku Dayak Kenyah di Sekitar Taman Nasional Kayan Mentarang Kalimantan Timur
Abstrak: Dayak Ethnic of Kayan Mentarang Nasional Park (KMNP) consists of several Dayak sub ethnics, one of them is Dayak Kenyah. It has unique characteristic in the use of plants, particularly food plants, which needed to be documented. This research was aimed to identify the diversity of food plants and local wisdom of Dayak Kenyah tribe in food plants use. This research was conducted in Long Alango Village, Subdistrict of Bahau Hulu, National Park Section Management (NPSM) Region II Kayan Mentarang Nasional Park, Malinau, East Borneo on March - April 2011. Research methods used consist of literature study, field survey, interview using questionaire, herbarium sample making and identification, and data analysis. The research had identified 139 spesies of food plants that used by Dayak Kenyah tribe of KMNP, which consisted of 32 species of wild food plants (origin from forest), 46 species of wild food plants that had been cultivated, and 61 species of cultivated food plants. All those species could be processed into carbohydrate source, vegetables, complementary food, and beverages. Among all the foods source that consumed by Dayak Kenyah ethnic, there are several species of rice plant like pa’dai bere, pa’dai ba’an, pa’dai putik, and pa’dai adan. The largest habitat types of food plants was garden and forest (33%), then followed by forest/wild habitat (23%), the bund of irrigated rice field (16%), garden (15%), unirrigated agricultural field and jekkau (6%), yard (6%), and irrigated rice field (1%). Local wisdom of Dayak Kenyah tribe were the use of food plants when hunting, cultivation of food plants from forest in garden, cultivation system, etc. Conclusion of this research shows that Dayak Kenyah tribe of KMNP used various plants for various needs of foods, and Dayak Kenyah ethnic has local wisdom in the use of food plants.
Keyword: 

Judul: Local Wisdom in Wildlife Hunting of Dayak Kenyah in Kayan Mentarang National Park, East Kalimantan.
Abstrak: Berburu merupakan salah satu kegiatan penting dalam pemenuhan kebutuhan hidup serta suatu bentuk dari penyesuaian diri manusia terhadap sumberdaya alam bagi masyarakat sekitar hutan yang menggantungkan hidupnya terhadap hutan. Penelitian ini dilaksanakan untuk menggali kearifan lokal masyarakat Suku Dayak Kenyah tentang perburuan satwa liar dan pemanfaatannya dalam kehidupan sehari-hari di sekitar Taman Nasional Kayan Mentarang, Kabupaten Malinau, Kalimantan Timur. Hasil penelitian ini diharapkan sebagai bentuk dokumentasi tertulis kearifan lokal Suku Dayak Kenyah terkait perburuan satwa liar sehingga dapat terus diwariskan kepada generasi berikutnya, serta bahan masukan pengelolaan satwa liar bagi Taman Nasional Kayan Mentarang. Penelitian dilakukan di Desa Long Alango, Kecamatan Bahau Hulu, Kabupaten Malinau, pada bulan Maret- April 2011. Metode pengumpulan data dilakukan dengan wawancara secara mendalam kepada responden yang telah ditentukan secara sengaja (purposive sampling). Orang-orang yang dipilih ini merupakan informan kunci yang dianggap banyak mengetahui tentang kajian penelitian ini. Data yang diperoleh diolah dengan metode triangulasi, disajikan secara tabulatif dan dianalisis secara deskriptif. Hasil dari penelitian ini menunjukkan bahwa motivasi utama kegiatan perburuan adalah sebagai pemenuhan kebutuhan protein. Kegiatan perburuan hanya diizinkan bagi masyarakat lokal yang memang sejak dahulu menggantungkan hidupnya pada hutan. Satwa buruan utama adalah babi berjenggot (Sus barbatus), rusa sambar (Cervus unicolor), kijang (Muntiacus muntjak) dan pelanduk kancil (Tragulus javanicus). Kearifan lokal dalam berburu masyarakat lokal Suku Dayak Kenyah antara lain : larangan membunuh satwa liar di dalam hutan tanpa tujuan yang jelas, larangan berburu di daerah asal babi akan bermigrasi, pemilihan satwa buruan dan pemanfaatan beberapa gejala alam untuk berburu satwa liar. Pewarisan keterampilan berburu dilakukan kepada generasi berikutnya secara lisan dan praktik secara langsung di dalam hutan. Pemanfaatan satwa liar utama sebagai pemenuhan kebutuhan sumber protein, selain itu merupakan pemanfaatan sebagai obat (16 jenis), hiasan, upacara adat, kerajinan tangan (8 jenis) dan pemanfaatan bahan makanan lain (3 jenis).
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