Judul: Hasil Pencirian Senyawa dan Aktivitas Antioksidan Fraksi Polar Ekstrak Temu Kunci (Curcuma rotunda).
Abstrak: Curcuma rotunda yang dikenal dengan nama temu kunci di Indonesia, rimpangnya telah terbukti mengandung senyawaan flavonoid yang memiliki aktivitas antioksidan. Tujuan penelitian ini adalah mengisolasi metabolit sekunder dari fraksi polar ekstrak aseton rimpang temu kunci dan menentukan aktivitas antioksidannya. Isolasi metabolit sekunder dilakukan sampai tahap Kromatografi Kolom Gravitasi dan menghasilkan 2 fraksi, yaitu P2 dengan profil Kromatografi Lapis Tipis 1 noda dan P3 dengan 2 noda yang keterpisahannya baik. Dugaan senyawa pada fraksi P2 dan P3 dicirikan dengan Liquid Chromatography-Mass Spectrophotometry. Diduga senyawa yang terdapat pada fraksi P2 adalah kalkon pinostrobin dan kardamonin, sedangkan pada fraksi P3 diduga adalah pinosembrin dan kalkon pinosembrin. Persen inhibisi fraksi P2 dan P3 jauh dibawah 50%. Nilai IC50 ekstrak kasar 125,75 μg/mL, lebih besar dari vitamin C yang IC50 nya 4,62 μg/mL.
Keyword: antioksidan, fraksi polar, kalkon pinosembrin, kalkon pinostrobin, kardamonin, pinosembrin, temu kunci

Judul: Struktur, Aktivitas Antibakteri, dan Antioksidan Ekstrak Temu Kunci (Curcuma rotunda).
Abstrak: umumnya dimanfaatkan sebagai tanaman obat tetapi belum banyak dilaporkan tentang komponen kimia beserta aktivitasnya. Penelitian ini bertujuan mengisolasi dan mencirikan senyawa yang terkandung dalam ekstrak rimpang temu kunci, serta menentukan aktivitas antibakteri dan antioksidannya. Sampel dimaserasi, difraksionasi dengan kromatografi radial, dan dipurifikasi dengan kromatografi lapis tipis preparatif. Isolat berbentuk kristal kuning (fraksi K231) dan kristal putih (fraksi A41). Analisis struktur mengunakan spekrum inframerah dan resonansi magnetik inti 1-dimensi (1H, 13C NMR, NOESY) dan 2-dimensi (HMBC, HSQC). Senyawa yang diperoleh ditafsir sebagai pinosembrin (1) dan pinostrobin (2). Kedua senyawa tidak menunjukkan aktivitas antibakteri terhadap bakteri uji Staphylococcus aureus dan Pseudomonas sp. dan IC50 antioksidannya pun tidak dapat ditentukan.
Keyword: antibakteri, antioksidan, pinosembrin, pinostrobin, temu kunci

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