Judul: Kandungan Fenolik dan Flavonoid Total serta Aktivitas Antioksidan Ekstrak Daun Surian (Toona sinensis).
Abstrak: Tanaman surian diketahui memiliki kandungan senyawa fenolik dan flavonoid yang berfungsi sebagai antioksidan. Penelitian ini bertujuan untuk menguji aktivitas antioksidan, serta mengukur kandungan total fenolik dan flavonoid esktrak daun surian. Aktivitas antioksidan ditentukan dengan metode DPPH (1,1-diphenil-2-picrylhydrazil) dan daya reduksi. Hasil penelitian menunjukkan ekstrak etanol 70% daun surian memiliki kandungan fenolik dan flavonoid total sebesar 225.05 μg GAE/mg dan 38.41 μg QE/mg ekstrak. Hasil ini lebih tinggi dibandingkan ekstrak air yang sebesar 218.79 μg GAE/mg dan 20.00 μg QE/mg ekstrak. Aktivitas antioksidan ekstrak etanol 70% daun surian dinyatakan dalam bentuk IC50, dengan nilai 16.45 μg/mL pada DPPH dan 44.65 μg/mL pada daya reduksi. Semakin kecil nilai IC50, semakin besar aktivitas antioksidan. Nilai IC50 ekstrak etanol 70% lebih tinggi dibandingkan ekstrak air yang sebesar 142.28 μg/mL pada DPPH dan 60.15 μg/mL pada daya reduksi. Semakin besar kadar fenolik dan flavonoid total, semakin tinggi aktivitas antioksidannya.
Keyword: antioksidan, daun surian, fenolik, flavonoid

Judul: Kandungan Total Fenolik, Total Flavonoid, dan Aktivitas Antioksidan Ekstrak Air dan Etanol Daun Surian (Toona sinensis).
Abstrak: Surian (Toona sinensis) merupakan tumbuhan hutan yang tersebar luas di daerah Asia, termasuk Indonesia. Ekstrak daun surian diketahui berpotensi sebagai antioksidan alami. Tujuan penelitian ini ialah mengukur kandungan total fenolik dan flavonoid serta menguji aktivitas antioksidan ekstrak air dan etanol daun dari tumbuhan surian yang berumur 30 tahun. Kadar total fenolik ekstrak etanol 70% daun surian paling tinggi dibandingkan ekstrak air dan etanol 96% dengan nilai 735.278 mg GAE/g ekstrak. Kadar total flavonoid ekstrak etanol 96% tertinggi di antara ekstrak yang lain dengan nilai 84.809 mg QE/g ekstrak. Ekstrak etanol 70% memiliki aktivitas penghambatan radikal DPPH terkuat di antara ekstrak air dan etanol 96%. Ketiga ekstrak daun surian memiliki aktivitas penghambatan radikal MDA yang tidak berbeda nyata. Perbedaan pelarut terbukti mempengaruhi kadar total fenolik, flavonoid, dan aktivitas antioksidan ekstrak daun surian pada metode DPPH. Perbedaan pelarut tidak mempengaruhi aktivitas antioksidan ekstrak daun surian secara signifikan pada metode TBA.
Keyword: DPPH, fenolik, flavonoid, surian, TBA

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