Judul: Pengaruh Kadar Kimia Tanah terhadap Kandungan Flavonoid Daun Tabat Barito (Ficus deltoidea Jack.)
Abstrak: Tabat barito (F.deltoidea) merupakan tumbuhan obat yang biasa digunakan sebagai aprodisiak wanita dan diketahui pula bahwa tabat barito berpotensi sebagai antitumor dikarenakan kandungan flavonoid yang dimilikinya. Tujuan dari penelitian ini adalah mengetahui perbedaan kadar flavonoid daun tabat barito (F.deltoidea) di Taman Nasional Gunung Gede Pangrango (TNGGP) dan Taman Nasional Gunung Halimun Salak (TNGHS). Penelitian terhadap kandungan flavonoid daun tabat barito yang dilakukan di 2 lokasi berbeda, yaitu Kawah Ratu (TNGHS) dan sekitar information center (TNGP) menunjukkan hasil yang berbeda. Kawah ratu yang merupakan daerah berkawah memiliki kadar flavonoid yang lebih rendah, yaitu 2.41% dibandingkan dengan kadar flavonoid yang berada di TNGP, yaitu 3.54%. Perbedaan ini diduga karena perbedaan kadar kimia tanah dari kedua lokasi tersebut.
Keyword: epifit, flavonoid, kimia tanah, tabat barito

Judul: Pengaruh Konsentrasi dan Frekuensi Pemberian Colchicine terhadap Pertumbuhan  Daun Tabat Barito (Ficus deltoidea Jack)
Abstrak: Perkembangan pemanfaatan tumbuhan obat meningkatkan kebutuhan ballan baku yang ulnumnya masih diambil dari alam dan belum memperhatikan kemampua~ya untuk berexenerasi, sehingga memicu terjadinya pemanetian secara berlebihan yang lnengancam kelestarian populasi tilaupuo pemanfaatannya. Tabat Barito (Fzczrs deltoidea Jack.), sebagai bahan baku jamu yaog dipercaya berkhasiat bagi kesehatan wanita, ter~nasukd alam daftar spesies tumbuhan obat langka yang menjadi prioritas dalam upaya pelestarian pemanfaatannya. Diperkirakan pada tahun 2000 permintaan terhadap bahan baku simplisia Tabat Barito mencapai 25.751 kg (Sandra dan Kemala, 1994). Mengingat permintaan yang semakin meningkat sementara pengambilannya masih dari alam, dikhawatirkan terjadinya kepunahan spesies Tabat Barito ini, karena itu perlu adanya upaya pembudidayaan untuk meningkatkan produksi agar dapat memenuhi kebutuhan bahan baku sitiiplisia tumbuhan ini dan menurunkan ketergantungan petnanenan tutnbuhan ini dari alam guna rneojamin kelestarian populasi dan pemanfaatannya.
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