Judul: Aktivitas Antioksidan Ekstrak Etanol Harendong (Melastoma malabatrichum L.) dalam Darah Talasemia α secara In Vitro
Abstrak: Talasemia α adalah kelainan sel darah merah turunan akibat tidak normalnya sintesis rantai globin α. Talasemia α berkaitan dengan stres oksidatif namun belum ada yang menunjukkan kemampuan antioksidan dari tumbuhan dalam darah talasemia α, seperti tumbuhan harendong (Melastoma malabatrichum L.). Tujuan penelitian ini menentukan aktivitas antioksidan dari ekstrak etanol 70% harendong dalam darah talasemia α. Buah mentah dan daun harendong diekstraksi menggunakan teknik maserasi. Uji fitokimia menunjukkan bahwa golongan flavonoid tertinggi adalah ekstrak buah mentah harendong dengan total flavonoid sebesar 234.04 ± 1.95 mg quercetin equivalent/g ekstrak. Ekstrak buah mentah harendong juga menunjukkan aktivitas antioksidan dan bioaktivitas tertinggi dengan konsentrasi penghambatan 50% sebesar 6.48 ± 0.75 μg/mL dan konsentrasi kematian 50% sebesar 782.41 μg/mL. Aktivitas antioksidan dalam darah talasemia α diuji menggunakan Cell-based Antioxidant Protection in erythrocyte dengan hasil ekstrak buah mentah harendong tidak dapat menurunkan stres oksidatif dalam darah talasemia α (p > 0.05).
Keyword: Aktivitas antioksidan, Melastoma malabatrichum L., Stres oksidatif, Talasemia-alfa

Judul: Aktivitas Antioksidan Ekstrak Air dan Etanol Daun Surian (Toona sinensis) secara In Vitro.
Abstrak: Antioksidan alami sangat penting dikembangkan dengan asumsi memiliki efek samping yang rendah atau sama sekali tidak memiliki efek samping terhadap tubuh. Tanaman Surian (Toona sinensis) diketahui mengandung banyak senyawa antioksidan. Ekstrak daun surian mengandung senyawa alkaloid, tanin, fenolik, flavonoid, dan terpenoid. Tujuan penelitian ini mengukur aktivitas antioksidan ekstrak daun dari tanaman surian berumur 30 tahun. Ekstrak air, etanol 70%, dan etanol 96% daun surian digunakan untuk menguji aktivitas antioksidan melalui metode TBA dan kapasitas penangkapan hidrogen peroksida. Hasil penelitian menunjukkan aktivitas antioksidan daun surian tergolong kuat dalam menghambat peroksidasi lipid serta menetralkan radikal H2O2. IC50 seluruh sampel berada dibawah batas maksimal kandungan antioksidan dalam makanan (˂200 ppm). Ketiga ekstrak daun surian memiliki aktivitas menghambat pembentukan MDA yang tidak berbeda nyata, tetapi lebih kuat dari kontrol positif α-tokoferol. Nilai IC50 metode H2O2 ekstrak etanol 70% (20.493 ± 0.097 μg/mL), air (29.868 ± 0.216 μg/mL), dan etanol 96% (26.143 ± 0.402 μg/mL) saling berbeda nyata. Ekstrak daun surian berpotensi sebagai sumber alternatif antioksidan yang sangat kuat.
Keyword: Radikal bebas, ekstrak daun surian, MDA, H2O2, IC50

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