Judul: Analisis kapasitas Antioksidan dan kandungan total Fenol pada buah
Abstrak: Buah merupakan salah satu potensi sumber antioksidan. Penelitian mengenai kapasitas antioksidan dan kandungan total fenol buah dari Indonesia masih sangat terbatas. Tujuan dari penelitian ini adalah untuk menganalisis kapasitas antioksidan dan kandungan total fenol dari berbagai jenis buah yang diperjualbelikan dan dikonsumsi di Indonesia. Tiga puluh jenis buah dipilih secara purposif di pasar Anyar, Bogor. Kapasitas antioksidan buah dianalisis menggunakan metode DPPH dan total fenol dianalisis menggunakan metode Folin-Ciocalteau. Hasil menunjukkan bahwa asam jawa memiliki kapasitas antioksidan tertinggi dengan 76.15±0.09 mg AEAC/100 g. Pisang mas memiliki kapasitas antioksidan terendah dengan 1.29±0.14 mg AEAC/100 g. Buah berwarna tua memiliki rata-rata kapasitas antioksidan lebih tinggi dibandingkan dengan buah berwarna muda. Markisa memiliki kandungan total fenol tertinggi dengan 3.25±1.70 mg TAE/100 g, dan pisang kepok terendah dengan 0.12±0.29 mg TAE/100 g. Penelitian ini juga menunjukkan adanya korelasi positif antara kapasitas antioksidan dan kandungan total fenol (p<0.05; r=0.545, Fruit is one of potential sources of antioxidant. Very limited studies have been done in determining the antioxidant capacity and phenolic content of fruits of Indonesia. The objective of this study was to analyze the antioxidant capacity and phenolic content of various types of fruits is traded and consumed in Indonesia. Thirty kind of fruits were selected purposively in Anyar traditional market of Bogor. The antioxidant capacity of the fruits was evaluated by applying DPPH method and total phenolic content was analized by applying the Folin- Ciocalteau method. The results showed that tamarind has the highest antioxidant capacity of 76.15±0.09 mg AEAC/100 g Mas banana is the lowest antioxidant capacity of 1.29±0.14 mg AEAC/100 g. Dark-colored fruits have a higher antioxidant capacity than the light-colored fruit. Passion fruit has the highest total phenolic content of 3.25±1.70 mg TAE/100 g and kepok banana has the lowest total phenolic content of 0.12±0.29 mg TAE/100 g. This study also showed that the positive correlation between antioxidant capacity and total phenolic content (p<0.05; r=0.545).
Keyword: antioksidan, buah, total fenol

Judul: Kapasitas Antioksidan dan Hubungannya Dengan Nilai Total Fenol Ekstrak Sayuran Indigenous:
Abstrak: Hasil pengujian epidemiologi menunjukkan bahwa mengkonsumsi buah-buahan dan sayur-sayuran yang banyak mengandung senyawa fenol dapat menurunkan resiko terkena penyakit jantung dan kanker. Hal ini dikarenakan, senyawa fenolik yang banyak terdapat dalam tumbuhan dapat berfungsi sebagai antioksidan. Antioksidan didefinisikan sebagai senyawa yang dapat menunda, memperlambat dan mencegah terjadinya reaksi antioksidasi radikd bebas dalam oksidasi lipid. Salah satu jenis sayuran yang dapat berfumigasi sebagai antioksidan adalah sayuran indigenous. Sayuran indigenous merupakan sayuran yang banyak mengandung senyawa fenolik berupa flavonoid. Batari (2007) menunjukkan bahwa sayuran indigenous megandung senyawa flavonoid yang berupa flavonol dan flavone. Penelitian ini bertujuan untuk mengetahui kapasitas antioksidan ekstrak sayuran indigenous dan melakukan analisis data mengenai hubungan antara nilai total fenol ekstrak antioksidan sayuran indigenous dengan kapasitas antioksidan sebagai radikal scavenger, kemampuan mereduksi dan penghambat oksidasi lipid lanjut. Sayuran indigenous yang digunakan dalam penelitian ini adalah daun kenikir, beluntas, mangkokan, kemangi, pohpohan, katuk, antanan, ginseng, kedondong cina, bunga kecombrang dan krokot. Pembuatan ekstrak antioksidan dari sayuran ini dilakukan dengan menggunakan pelarut metanol. Data hasil penelitian yang menyatakan hubungan antara nilai total fenol dan kapasitas antioksidan sebagai radikal scavenger, dan kemampuan mereduksi serta hubungan antara kemampuan mereduksi dan kapasitas antioksidan sebagai radikal scavenger dihitung menggunakan persamaan regresi linier dan dinyatakan sebagai koefisien korelasi. Persen penghambatan oksidasi lipid lanjut didapat dari rata-rata nilai malonaldehid (MDA) yang terbentuk dibagi dengan rata-rata MDA tiap perlakuan yang terbentuk dikalikan 100%.
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