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: Etnobotani dan Potensi Tumbuhan Berguna di Kampung : Keay, Kabupaten Kutai Barat, Kalimantan Timur.
Abstrak: Keay Village is one of villages in West Kutai Regency, East Kalimantan. There are four ethnic groups occupying this village, i.e. Dayak, Javanese, Toraja, and Bugis. Dayak is the dominant ethnic group occupying the village, which still has traditional wisdom/knowledge in plants use. Ethnobotany is expected to document and hand on the knowledge of Dayak Benuaq ethnic group in using plants, and keep the knowledge from being loss. Data were collected through literature study, interview, field survey and inventory, vegetation analyses, and herbarium collection. Data on plants species found were classified in to classification of use, classification of illnesses, habitués percentage and parts of plants used, important value index, Shannon-Wienner species diversity index, and percentage of useful plants potential. There were 396 plant species found through ethnobotany and vegetation analyses, which was categorized into three categories i.e. plant species found through ethnobotany (285 species), plant species found through vegetation analyses in natural forest (158 species), plant species found through vegetation analyses in hevea plantation (34 species). There were 285 species belong to 78 families which uses had been known and grouped into 16 use groups. There were 53,79% of plants species in natural forest had the potential as useful plants, while in hevea plantation there were 50% of that species had the potential as useful plants. Dominant plant species in natural forest was keranyiq (Fordia johorensis) with IVI (Important Value Index) of pole level as much as 19,69%, sapling (25,46%), and seedling (24,67%). In hevea plantation, dominant plant species was hevea (Hevea brasiliensis) with IVI the highest IVI of tree level as much as 300%, pole (284,63%), sapling (143,59%), and seedling (52,42%). Plants use most widely used for medicinal as much as 95 species of 43 families. The community uses more plants from the forest than from the plantation, because there were more useful plants species in the forest. Potential useful plants at the forest of Keay village included mara uleq (Eurycoma longifolia), uwe (Korthalsia sp., Calamus sp., Daemonorops sp.), empulung (Asplenium nidus), and kerakap (Platycerium bifurcatum). Other potential other than plants potential in the natural forest was hevea (Hevea brasiliensis).
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