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: Aktivitas Inhibisi Terhadap Siklooksigenase, Kadar Pati dan Fenolik Temulawak (Curcuma xanthorriza Roxb.) Aksesi Sukabumi
Abstrak: Curcuma xanthorrhiza Roxb. known as temulawak is widely used as herbal medicinal plant that has many benefits, including antiinflammation. The objectives of this research were to evaluate inhibitory activity of temulawak Sukabumi accession toward cyclooxygenase-2 (COX-2) and to analyze its correlation with starch and phenolic level. The extraction method used maseration with ethanol 70%. The starch level was analyzed using Luff-scohrl’s method, and the phenolic level was determined using the Folin-Ciocalteu’s. The starch level is relatively higher (P>0.05) on temulawak Cursina variety were 23.05%±3.49, while the phenolic level is relatively higher (P>0.05) on temulawak Sukabumi accession were 81.16 mg/g±19.68. Both of temulawak extracts showed inhibitory activity against COX-2. The highest activity (P>0.05) on temulawak Sukabumi accession with inhibition value of 55.35%. Based on analysis of corelation, the phenolic compound has antiinflammation activity, while starch will reduce antiinflammation activity.
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