Judul: Kajian Etnobotani terhadap Serat Centhini
Abstrak: Telah dilakukan penelitian yang mengkaji aspek etnobotani terhadap Serat Centhini, sebuah kana sastra klasik Jawa yang ditulis pada awal abad XIX. Penelitian ini bertujuan untuk (1) menggali aspek emik, yaitu mengeiiai sistem pengetahuan tradisional tentang pengelolaan dan pemanfaatan keanekaragaman sumber daya hayati dalam Seral Centhini, terutama meugenai pemainfaatan keanekaragaman jenis tumbuh-tumbuhan dalam berbagai aspek kehidupan masyarakat Jawa; (2) memperkenalkan aspek budaya, terutama yang berhubungan dengan sistim pengelolaan sumber daya alam hayati dan lingkungannya kepada masyarakat luas agar lebih mengmal khasanah budaya Indonesia dan budaya Jawa pada khususnya; (3) mengungkap berbagai pengetahuan tradisional tentang sistem pengelolaan sumber daya hayati yang mungkin memiliki keunggulan untuk dilestarikan, diterapkan, dan dikembangkan lebih lanjut.
Keyword: 

Judul: Ethnobotany on Sundanese Traditional Society in Cireundeu Village, Cimahi, West Java
Abstrak: Pengungkapan pengetahuan dan kearifan lokal memiliki nilai yang sangat strategis sebagai upaya penggalian potensi dan keunggulan sumber daya hayati khususnya jenis tumbuhan yang dimiliki oleh kelompok masyarakat, seperti masyarakat adat Cireundeu di Jawa Barat. Masyarakat adat Cireundeu memiliki pengetahuan dan kearifan lokal yang berbeda dari masyarakat adat Sunda lainnya. Penelitian ini bertujuan menggali dan mendokumentasikan pengetahuan dan kearifan lokal masyarakat Adat Cireundeu dalam mengelola satuan lingkungan dan memanfaatkan sumber daya tumbuhan yang ada didalamya, serta membandingkannya dengan masyarakat umum di sekitarnya. Pengumpulan data dilakukan melalui wawancara terstruktur dan open-ended kepada lima orang informan kunci dan 40 orang informan umum menggunakan metode purposive sampling. Data keanekaragaman tanaman dikumpulkan dengan metode participative plot sampling yang melibatkan informan sebagai pemandu. Data vegetasi dianalisis menggunakan 4 ukuran plot yaitu 20x20 m untuk tingkat pohon, 10x10 m untuk tingkat tiang, 5x5 m untuk tingkat pancang, dan 2x2 m untuk tumbuhan bawah. Hasil penelitian menunjukkan masyarakat adat Cireundeu mengelola empat satuan lingkungan, yaitu Padumukan, Leuweung Baladahan, Leuweung Tutupan dan Leuweung Larangan; dan memanfaatkan 462 jenis tanaman. Tanaman tersebut dikelompokkan menjadi 12 kategori penggunaan, yang didominasi oleh tanaman hias sebanyak 138 jenis. Hasil analisis Index of Cultural Significance (ICS) yang dikorelasikan dengan Indeks Nilai Penting (INP) menunjukkan bahwa banyak jenis tanaman memiliki nilai ICS dan INP yang berbeda pada kedua kelompok masyarakat yang mencerminkan pemanfaatan tanaman dan pengelolaan lingkungan yang berbeda antara masyarakat adat dan masyarakat umum., Disclosure of local knowledge and wisdom has strategic value for exploring the potential and advantages of biological resources, especially plant species belonging to community groups such as Sundanese traditional society in Cireundeu West Java. The people of Cireundeu have the knowledge and local wisdom that are different from other Sundanese indigenous peoples. The study aimed to explore and document the knowledge and local wisdom of the Cireundeu Indigenous people in managing various environmental units and utilizing their plant resources, as well as comparing them with the general public around them. Ethnobotanical data were collected using structured and open-ended interviews with five key informants and 40 public informants conducted using the purposive sampling method. Data on plant diversity was collected using the participative plot sampling method which involved informants as guides. Vegetation data were analyzed using 4 plot sizes, 20x20 m for tree level, 10x10 m for pole level, 5x5 m for sapling level, and 2x2 m for understory plant. The results of this study indicate that the Cireundeu Indigenous people manage four environmental units, Padumukan, Leuweung Baladahan, Leuweung Tutupan, and Leuweung Larangan; and utilize 462 plant species. These plants are grouped into 12 categories of use dominated by ornamental plants as many as 138 species. The results of the Index of Cultural Significance (ICS) analysis correlated with the Important Value Index (IVI) show that many plant species have different ICS and IVI values in two community groups reflecting diverse plant uses and environmental management between indigenous and public peoples.
Keyword: culture, environmental units, local knowledge, plant resources

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