Judul: Kajian etnobotani masyarakat di sekitar Taman Nasional Gunung Merapi: studi kasus di Desa Umbulharjo, Sidorejo, Wonodoyo dan Ngablak
Abstrak: Mount Merapi National Park (TNGM) has total an area about 6410 ha, with the details: in Central Java Province about 5126.01 ha and in Province of Yogyakarta Special Region about 1283.99 ha. By looking at the potential of plants and community culture in TNGM region (in the terms of plant utilization) allows interaction between community and that region. Therefore, the study of ethnobotany community around TNGM region needs to be done. The purpose of this study are to know and identify the various utilization of plants by community around TNGM and also to know kind of interaction between community and potential plant diversity in TNGM region. The research was conducted in 4 (four) villages in the surround TNGM region included the Village Umbulharjo, Sidorejo, Wonodoyo and Ngablak. This research carried out about 2 months that started from June to August 2010. The method used in this research was a field survey. The activities undertaken in this research included interviews, making of herbarium, data processing and data analysis. The data was collected in the form of primary data (ethnobotany) and secondary data (general conditions of the location). Primary data collection techniques was conducted through interviews with the respondents (people around TNGM) whereas secondary data was done through literature studies. Based on research results, indicate that the characteristics of respondents in the surround TNGM that most livelihood as farmers and low educated (Elementary School), with the largest age rate is 16-40 years. Plants that used by the community about 103 kinds, and can be differentiated into eleven groups of functions, namely medicinal plants (47 kinds), ornamental (11 kinds), aromatic (7 kinds), food (40 kinds), fodder (7 kinds), botanical pesticides (4 kinds), dyes and tannins (2 kinds), firewood (10 kinds), ceremonies (13 kinds), building materials (20 kinds) and also rope materials, wicker and crafts (6 kinds). Community around TNGM has a level of interaction with Merapi volcano which close enough. This can be seen from the social and cultural developing. The suggestion needs to be done from this study results is further development of the useful plants utilization in order to increase the community income around TNGM, especially after Mount Merapi eruption through kinds cultivation based on traditional knowledge of the society.
Keyword: 

Judul: Etnobotani dan potensi tumbuhan berguna di Taman Nasional Gunung Ciremai, Jawa Barat
Abstrak: The people around TNGC have a very close interaction with the surrounding natural resources as can be seen when they deal with the use of plants (ethnobotany). Documenting the people‟s knowledge in TNGC ethnobotany is especially important so that the knowledge of TNGC people in the use of these plants can be preserved. This study aimed to identify the use of plants by the people around TNGC (etnobotany) and to find out the potential of useful plants in the TNGC region. Ethnobotany study was conducted by interviews and the potential of useful plants in the TNGC region was learned through a vegetation analysis. The number of species obtained from the ethnobotany results was 131 species and 62 families. Medicinal plants were among the much used reaching 37 species. The number of spesies obtained from the results of vegetation analysis was 99 plant spesies and 43 families residing in the TNGC area. The most useful plant species were plants producing buildings as many as 14 species. Out of 131 plant that were used by community, many them were not be found in the area of TNGC reached 113 species, whereas plants that were aas many as 18 species. Of all the plants obtained from the ethnobotany results and vegetation analysis, 10 superior species can be develoved by communities around the TNGC area, for example, nilam (Pogostemon cablin) as aromatic material and raw material for the manufacture of perfume and ground orchids with yellow flowers (Phaius flavus ) for ornamental plants. These superior species if well-cultivated are expected to help TNGC community improve their income.
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