Judul: Kendali Mutu Ekstrak Temuireng Berkhasiat sebagai Antioksidan
Abstrak: Mutu tanaman obat perlu dikendalikan sebagai upaya menjamin khasiatnya. Teknik kromatografi lapis tipis digunakan pada penelitian ini. Temuireng diekstraksi menggunakan pelarut etanol, metanol, kloroform, dan nheksana. Kandungan total fenol, flavonoid, dan kurkuminoid dari setiap ekstrak ditentukan dan dihubungkan dengan aktivitas antioksidan. Didapatkan korelasi yang kuat antara total fenol dan aktivitas antioksidan. Persamaan y= -0.744x + 3.522 dengan y=akar total fenol dan x=log IC50 dapat digunakan untuk menduga aktivitas antioksidan sampel berdasarkan kandungan total fenol. Kromatogram yang memiliki aktivitas antioksidan yang baik terdiri dari setidaknya 12 spot pada panjang gelombang ultraviolet (UV) 254 nm dan 3 spot cerah pada lampu UV 366 yang merupakan kurkuminoid.
Keyword: antioksidan, kromatogram, temuireng, total fenol.

Judul: Pengaruh Pelarut Ekstraksi Rimpang Temu Ireng Metode Microwave Assisted Extraction Terhadap Kandungan Polifenol dan Kapasitas Antioksidan
Abstrak: Temu ireng (Curcuma aeruginosa) merupakan salah satu tanaman yang mengandung senyawa fenolik berupa flavonoid yang berpotensi sebagai antioksidan alami. Pemilihan pelarut ekstraksi yang tepat merupakan hal yang penting untuk mendapatkan metabolit sekunder berkualitas. Penelitian ini bertujuan menentukan pelarut terbaik untuk mengekstrak rimpang temu ireng berdasarkan kadar fenolik total, kadar flavonoid total, dan kapsitas antioksidan dengan metode 2,2-diphenyl-1-pycrilhidrazil (DPPH) dan Ferric Reducing Antioxidant Power (FRAP). Kadar fenolik total diukur menggunakan metode Folin-Ciocalteu dan kadar flavonoid total diukur menggunakan metode Alumunium Klorida. Sampel diekstraksi dengan metode microwave assisted extraction (MAE) dengan pelarut akuades, etanol 50%, metanol 50%, dan aseton 50%. Hasil penelitian menunjukkan pelarut aseton 50% memiliki kadar fenolik total tertinggi (3,10 mg GAE/g BK), sedangkan pelarut metanol 50% menunjukkan kadar flavonoid total tertinggi (4,10 mg QE/g BK), serta kapasitas antioksidan DPPH (1,28 µmol TE/g BK), dan FRAP (12,21 µmol TE/g BK). Pelarut terbaik dalam mengekstrak senyawa aktif pada rimpang temu ireng adalah metanol 50% karena menghasilkan kadar flavonoid total serta kapasitas antioksidan metode DPPH dan FRAP tertinggi., Curcuma aeruginosa is one of the plants that contain phenolic compounds in the form of flavonoids that have the potential to be natural antioxidants. Choosing the right extraction solvent is essential to obtaining quality secondary metabolites. This study aimed to determine the best solvent to extract black rhizomes based on total phenolic content, total flavonoid content, and antioxidant capacity by DPPH and FRAP methods. The total phenolic content was measured using the Folin-Ciocalteu method and the total flavonoid content was measured using the Aluminum Chloride method. The samples were extracted by microwave assisted extraction (MAE) method with aqueous solvents, 50% ethanol, 50% methanol, and 50% acetone. The results showed that 50% acetone solvent had the highest total phenolic content (3,10 mg GAE/g BK), while 50% methanol solvent showed the highest total flavonoid content (4,10 mg QE/g BK), as well as the antioxidant capacity of DPPH (1,28 µmol TE/g BK), and FRAP (12,21 µmol TE/g BK). The best solvent for extracting the active compounds in the rhizomes of black temu is 50% methanol because it produces the total flavonoid levels and the highest antioxidant capacity of the DPPH and FRAP methods.
Keyword: flavonoid, Antioksidan, Pelarut, Fenolik, Temu ireng

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