Judul: Studi Konservasi Sumberdaya Alam Hayati pada Masyarakat Tengger di Resort Ranu Pani, Taman Nasional Bromo Tengger Semeru
Abstrak: Ranu Pani village is an enclave village located in a area Ranu Pani Resort, Bromo Tengger Semeru National Park. Purpose of this study was to access the understanding and motivation of Tengger society, the level of economic dependency, and examines the real action of conservation. Methods in use begins with a literature study, field observation, and questionnaires. The trust believed that the forest is the system of life that must be preserved for the sake of happiness the offspring, forming positiveness on Tengger society to maintain the forest in order to preservein an hereditary manner, utilization done very limited only adoption of kindling the trees that is dead and retrieval grass for cattle course. The economic society derived from the results of the field so as not to be depended from biological resources in the forest. Ranu Pani village society sometimes actively in conservation activities through planting, forest ares extinguish the blaze, and joined in the conservation cadre society ang public patner of rangers. Various counseling who regularly performed by the management of Ranu Pani Resort, capable of being creates understanding conservation for Ranu Pani society so take care of security of the area an understand the established rules.
Keyword: Ranu Pani Resort, Tengger society, conservation

Judul: Dinamika Kearifan Tradisional Masyarakat Desa Ranu Pane dalam Pemanfaatan Sumberdaya Hayati di Taman Nasional Bromo Tengger semeru
Abstrak: Desa Ranu Pane merupakan wilayah enclave TNBTS yang terletak pada ketinggian 2200 mdpl. Desa Ranu Pane memiliki luas 300 ha yang terbagi ke dalam dua dukuh yaitu Mbedog Asu (Sidodadi) dan Besaran. Pada kawasan ini terdapat zona pemanfaatan tradisional yang dapat digunakan oleh masyarakat dalam memanfaatkan sumberdaya hutan TNBTS. Metode yang digunakan di dalam pengumpulan data adalah metode FGD (Foccus Group Discussion), wawancara dan kuesioner dalam bentuk close ended. Kearifan lokal mengenai pemanfaatan flora dan fauna sudah mulai tergeser. Pemanfaatan flora untuk saat ini masih dimanfaatkan walaupun tidak seintensif dulu seperti pemanfaatan tumbuhan obat, tumbuhan pangan dan bahan sajen. Pemanfaatan fauna sudah tidak lagi dimanfaatkan oleh masyarakat Suku Tengger. Pergeseran ini terjadi karena beberapa faktor yaitu larangan dari pihak taman nasional, sumberdaya alam yang tersedia dan tidak adanya kemauan dari generasi muda untuk memepelajari kearifan lokal.
Keyword: faktor perubah, kearifan tradisional, Suku Tengger

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