Judul: Kadar Fenol Total Dan Bioaktivitas Flavon Dari Kulit Kacang Tanah Sebagai Antioksidan Dan Antiproliferasi Terhadap Sel Kanker Hela
Abstrak: Kulit kacang tanah umumnya menjadi limbah atau dimanfaatkan sebagai pakan ternak saja. Kadar fenol total suatu bahan memiliki korelasi dengan aktivitas antioksidan, sehingga kadar fenol total dapat memengaruhi bioaktivitas tersebut. Oleh karena itu, penelitian ini bertujuan menentukan kadar senyawa fenol dan bioaktivitasnya sebagai antioksidan serta mengevaluasi isolat flavon dari kulit kacang tanah sebagai antiproliferasi pada sel kanker HeLa. Sampel diekstraksi dengan teknik refluks menggunakan pelarut etanol kemudian difraksionasi. Fraksi etil asetat diperoleh melalui teknik ekstraksi cair-cair dari ekstrak etanol dan pemisahan selanjutnya menggunakan kromatografi kolom gravitasi untuk mendapatkan isolat flavon. Kadar fenol total dari ekstrak etanol dan fraksi etil asetat ditentukan menggunakan metode Folin-Ciocalteau. Hasil uji menunjukkan kadar fenol total ekstrak etanol dan fraksi etil asetat masing-masing 262 dan 532 mg/g ekstrak. Aktivitas antioksidan dari ekstrak etanol dan fraksi etil asetat dievaluasi menggunakan metode penangkapan radikal 2,2-difenilpikrilhidrazil (DPPH) yang masing-masing menghasilkan IC50 32 dan 19 μg/mL. Isolat flavon diidentifikasi menggunakan spektrofotometer ultraviolet-tampak dan menghasilkan pita serapan di daerah 342, 297.5, dan 220 nm. Spektrum massa dari isolat dengan menggunakan teknik kromatografi cair-spektrometri massa memperlihatkan fragmen dengan m/z 271. Namun, spektrum menunjukkan bahwa fraksi yang mengandung apigenin ini belum sepenuhnya murni. Penghambatan proliferasi sel kanker HeLa menggunakan metode reaksi 3-(4,5–dimetil tiazol-2-il)-2,5-difeniltetrazolium bromida (MTT) mengungkap bahwa isolat flavon kulit kacang tanah memiliki potensi moderat dengan nilai IC50 34 μg/mL.
Keyword: apigenin, fenol total, flavon, kapasitas antioksidan, kulit kacang tanah, sel kanker HeLa

Judul: Potensi Ekstrak Daun Tin (Ficus carica L.) sebagai Antioksidan dan Aktivitas Hambatannya terhadap Proliferasi Sel Kanker HeLa
Abstrak: Fig fruit (Ficus carica L.) has antioxidant dan anticancer properties both empirically and scientific reseach. However, scientific research on the use of fig leaf as anticancer has not reported yet. This study examined the antioxidant and anticancer protency of fig leaf extract. Based on the phytochemicals test, simplicia of fig leaf contains flavonoids, tannins, steroids and alkaloids. Flavonoids, tannins, steroids of fig leaf were extracted by maceration technique using suitable solvent. The extracts were tested by 1,1-diphenyl-2-picrylhydrazyl antioxidant method and brine shrimp lethality test toxicity method. Flavonoid extract showed highest antioxidant activity with IC50 150 mg/L, while the LC50 for toxicity tests was 191.43 ppm. Flavonoids extract of fig leaf was fractionated using preparative thin layer chromatography and obtained seven fractions.Proliferation inhibition test against HeLa cancer cell by 3-[4,5-dimethylthiazol-2yl]-2,5-diphenyl tetrazolium bromide method showed the most active fraction was fraction F7 which inhibit 57.18 % proliferation of HeLa cancer cells at concentrations of 800 ppm. Based on the identification using ultraviolet spectrophotometer and fourier transform infrared, F7 fraction suspected to contain isoflavones or flavones compounds.
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