Judul: Kadar Fenolik dan Aktivitas Antioksidan Lima Aksesi Tanaman Kunyit (Curcuma domestica) pada Lokasi Budidaya Kecamatan Nagrak, Sukabumi.
Abstrak: Turmeric is well known have the fenolik content that can be as antioxidant. The purpose of this research is for analyzing the fenolik’s compound and the antioxidant’s activity of turmeric that comes from five promicing lines and two varieties in Nagrak’s agricultural. The activity of antioxidant is depent on DPPH (1,1-diphenyl-2-picryl-hydrazyl)’s method. Wereas for the total of fenolik is used FCA (Folin-Ciocalteau assay)’s method. Nagrak’s promicing lines has the highest fenolik’s level and the activity antioxidant’s level of all it is 479.20 mg/g and 39.36 μg/mL. Turina’s 2 is a better tumeric than the other promicing lines from six location. Besides the agrobiofisik’s parameter, the environment of Nagrak is not good for the Tumeric because the temperature is only 18-26oC, the rainfall is ± 231.98 mm year1 and the land has no sand
Keyword: 

Judul: Kandungan Kurkuminoid dan Daya Antioksidan Aksesi Temulawak (Curcuma xanthorrhiza Roxb.) asal Sukabumi
Abstrak: Curcuma xanthoriza Roxb. is one kind of curcums which useful as medicine plants. It containts curcuminoid which has antioxidant bioactivity. This study aimed to measure curcuminoids content and antioxidant bioactivity of Ciemas (Sukabumi) accessions compared with varieties of Kursina 3 from Bogor. HPLC method were used to determined curcuminoid content. The antioxidant bioactivity of both samples were evaluated using 2,2-diphenyl-1-picrylhydrazyl (DPPH) free radical method. Percent yield ethanol 70 % extract of Curcuma xanthoriza Roxb. were 15.85 % (Kursina 3) and 19.94 % (accession). The curcuminoid content of Kursina 3 and acccession were 0.79 % and 0.99 %, respectively. The result of IC50 were 82.8 ppm (Kursina 3) and 47.97 ppm (accession) respectively. Based on the result of the study, Sukabumi promising lines curcuma has the potential to be further researched and developed as new varieties.
Keyword: antioxidant, Curcuma xanthoriza Roxb, curcuminoid.

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