Judul: Aktivitas Antioksidan dan Antiinflamasi In Vitro serta Kandungan Kurkuminoid dari Temulawak dan Kunyit Asal Wonogiri
Abstrak: This research examined antioxidant and anti-inflamantory activities of Curcuma xanthorrhiza RoxB. and Curcuma domestica Val. from Wonogiri. The main bioactive compounds functioning as antioxidant and anti-inflamantory are curcuminoid. The previous research reported that curcuminoid compound is present in C. xanthorrhiza RoxB. and C. domestica Val. The antioxidant potency of the sample was detected by DPPH (2,2-difenil-1-pikrilhidrazil) method. Results showed that the antioxidant potency of C. xanthorrhiza RoxB. is higher than that of C. domestica Val. from Wonogiri. IC50 value of C. xanthorrhiza RoxB. was 53.13 ppm and C. domestica Val. Was 61.72 ppm. Anti-inflamantory activity was analyzed by in vitro cyclooxygenase 2 (COX2) inhibition method. The best inhibition activity against of COX2 is showed by C. domestica Val. in amount of 47.45% and value of C. xanthorrhiza RoxB is 87.19%. Curcuminoid Content of C. xanthorrhiza RoxB. and C. domestica Val. was measured by High Performance Liquid Chromatography (HPLC). Results showed that curcuminoid content of C. domestica Val. was 74.57 mg/g and C. xanthorrhiza RoxB. was 20.04 mg/g.
Keyword: 

Judul: Bioaktivitas Antioksidan dan Antiinflamasi Secara In Vitro serta Kandungan Kurkuminoid Temulawak dan Kunyit Asal Sukabumi
Abstrak: Curcuma xanthorrhiza and Curcuma domestica are kind of medicinal plants which have many health benefits. Both of them have curcuminoid content which is useful as an antioxidant and anti-inflamatory. In this study, ethanol extracts of C. xanthorrhiza and C. domestica promising lines from Sukabumi, Indonesia were investigated for the presence of curcuminoids, antioxidant and anti-inflamatory activities. HPLC method were used to determined curcuminoids content. The antioxidant (radical scavenging) potential of the samples was evaluated using 2,2-diphenyl-1-picrylhydrazyl (DPPH) free radical method. While for the anti-inflamatory activity, the in vitro cyclooxygenase 2 (COX2) inhibition method was used. The curcuminoid content of C. xanthorrhiza and C. domestica were 31.27 mg/g and 66.32 mg/g, respectively. IC50 values for DPPH radical scavenging activity were 81.99 μg/mL and 73.31 μg/mL, with C. domestica having lowest value and most potent than C. xanthorrhiza. Percent inhibition values for COX2 inhibitor activity were 74.84 % and 67.96 %, with C. domestica having the highest value. In this study, the ethanol extracts of C. domestica promosing line from Sukabumi of Indonesia exhibited most in curcuminoids content, antioxidants properties and anti-inflamatory activity than C. xanthorrhiza promosing line.
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