Judul: Penyusunan modul pendidikan konservasi tumbuhan obat untuk siswa SDN Gunung Leutik, Kecamatan Ciampea, Kabupaten Bogor
Abstrak: Pengetahuan tentang tumbuhan obat di kalangan masyarakat sebaiknya perlu diwariskan kepada anak-anak sejak dini baik melalui pendidikan formal maupun informal, dengan harapan adanya pemanfaatan tumbuhan obat secara berkelanjutan. Strategi yang dapat dilakukan agar pendidikan konservasi tumbuhan obat dapat dirasakan anak-anak adalah melalui penelitian tentang penyusunan modul pendidikan konservasi tumbuhan obat untuk siswa sekolah dasar. Tujuannya adalah menyusun dan menguji modul pendidikan konservasi tumbuhan obat yang efektif untuk mengembangkan pengetahuan dan menumbuhkan sikap konservasi tumbuhan obat pada siswa sekolah dasar.
Keyword: 

Judul: Pengetahuan dan Sikap Murid, Guru, Kepala Sekolah dan Orang Tua terhadap Konservasi Tumbuhan Obat di SDN Pengadilan 5 Bogor
Abstrak: At this time many people use medicinal plants as natural remedy. Excessive use of medicinal plants which was not accompanied by cultivation can cause scarcity. Low of knowledge and negative attitude could influence the conservation of medicinal plants. The research was carried out to obtain information about (1) the knowledge and attitude of students, teachers, principal and parents towards the conservation of medicinal plants, and (2) problems of the development of medicinal plant conservation in the school. The research was conducted in Pengadilan 5 Bogor Elementary School from September to October 2011. Data was collected through structured interview with interview guidelines and literature study. The resulting data was tabulated and descriptively analyzed. Respondents consisted of 120 students from 3rd to 6th grade classes, 9 teachers, 1 principal and 80 parents. The result showed that the meaning of medicinal plants was known by most student (73%), all teacher, principal and most parents (81%). Respondents knew the meaning of medicinal plants, examples of and how to use the medicinal plants from their experience and various sources of information, example books, internet and televition. Almost off respondents like to use medicinal plants, most of them agreed on the existence of medicinal plants at the school. Medicinal plant conservation problems in Pengadilan 5 Bogor Elementary School were limited area, the lack of applicable knowledge and quality of the teachers, lack of allocation and clear resources of funds, and the lack of optimal role of the school committee. The conclusion of this research was that’s the respondents knowledge of medicinal plants was very high and they had positive attitude toward the conservation of medicinal plants in the school. The main problem for conservation of medicinal plants in the school was limited area.
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