Judul: Ethnobotany of Medicinal Plants in the Miduana Traditional Community Balegede Village Naringgul District, Cianjur.
Abstrak: Pengetahuan atau kearifan tradisional masyarakat Kampung Adat Miduana dalam pemanfaatan sumberdaya tumbuhan sebagai obat merupakan hal yang perlu dikaji agar tetap lestari. Tujuan dari penelitian ini adalah mengidentifikasi spesies, manfaat, dan cara pengolah serta kearifan lokal mengenai pemanfaatan tumbuhan obat masyarakat Kampung Adat Miduana. Metode pengumpulan data yang dilakukan adalah studi literatur, survei lapangan, dan wawancara. Analisis data yang digunakan adalah karakteristik responden, karakteristik tumbuhan obat, pengelompokkan penyakit, dan potensi pengelolaan lestari dan status konservasi tumbuhan obat. Berdasarkan penelitian terdapat 106 spesies tumbuhan yang termasuk ke dalam 47 famili. Manfaat tumbuhan obat terbanyak adalah untuk penyakit saluran pencernaan. Pengolahan tumbuhan tersebut paling banyak menggunakan metode direbus. Kearifan lokal yang terdapat pada masyarakat Kampung Adat Miduana berupa ramuan-ramuan dan pengobatan tradisional menggunakan leuhang serta sistem pewarisan pengetahuan secara turun-temurun dan menggunakan sistem karuhun., The traditional knowledge or wisdom of the Miduana Traditional Village community in utilizing plant resources as medicine is something that needs to be studied in order to remain sustainable. The purpose of this study is to identify species, benefits, and processing methods as well as local wisdom regarding the utilization of medicinal plants in the Miduana Traditional Village community. The data collection methods used were literature studies, field surveys, and interviews. The data analysis used is the characteristics of respondents, characteristics of medicinal plants, disease grouping, and the potential for sustainable management and conservation status of medicinal plants. Based on the research, there are 106 plant species included in 47 families. The benefits of most medicinal plants are for digestive tract diseases. The processing of these plants mostly uses the boiled method. Local wisdom found in the Miduana Traditional Village community in the form of herbs and traditional medicine using leuhang and the system of inheriting knowledge from generation to generation and using the karuhun system.
Keyword: kampung adat, kearifan lokal, tumbuhan obat

Judul: Etnobotani Tumbuhan Pangan dan Obat Suku Kei Masyarakat Kampung Adat Waur Maluku Tenggara
Abstrak: Pemanfaatan tumbuhan oleh masyarakat secara tradisional sudah berlangsung lama. Penelitian ini mengidentifikasi keanekaragaman tumbuhan pangan, tumbuhan obat, dan bentuk kearifan tradisional dalam pemanfaatan tumbuhan pangan dan obat oleh masyarakat Suku Kei. Metode yang digunakan adalah observasi lapang, wawancara dan kajian pustaka. Berdasarkan hasil penelitian, teridentifikasi sebanyak 111 spesies tumbuhan obat dari 38 famili dan 94 spesies tumbuhan pangan dari 50 famili dimanfaatkan oleh masyarakat. Fabaceae merupakan famili yang paling banyak dimanfaatkan untuk tumbuhan pangan, sedangkan tumbuhan obat adalah famili Euphorbiaceae. Pohon merupakan habitus tumbuhan pangan yang paling banyak ditemukan, sedangkan pada tumbuhan obat adalah perdu. Bagian tumbuhan yang paling banyak digunakan pada tumbuhan pangan adalah buah dan pada tumbuhan obat adalah daun. Masyarakat Kampung Adat Waur melakukan sistem pertanian ladang berpindah dan memiliki larangan sasi untuk melindungi hutan dan lahan pertanian yang telah dilakukan secara turun temurun.
Keyword: etnobotani, kearifan tradisional, tumbuhan obat, tumbuhan pangan

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