Judul: Status Antioksidan Tikus Sprague-Dawley Betina dengan Pemberian Nanopartikel Kurkuminoid Temulawak Balittro
Abstrak: Curcuma (Curcuma xanthorrhiza) is an Indonesian herbs plant with antioxidant activity. This research aimed to measure the increasing of curcuminoids bioavaibility through the efectivity of nanoparticle curcuminoids as antioxidant for carbon tetrachloride (CCl4) induced rats. Nanoparticle curcuminoids was produced by homogenization-ultrasonication method showed results particle size of curcuminoids nanoparticle was 141.85±38.82 nm with polidispersity index was 0.233 and entrapment efficiency was 71%. During the treatment, rat’s body weight was increased. Clinical symptoms of rats (behavior and feces) was normal. Nanoparticle curcuminoids can decrease malondialdehide concentrations and increase peroxide, glutation peroxide, and superoxide dismutase activity.
Keyword: curcuma., solid lipid nanoparticle, curcuminoid, antioxidant

Judul: Status Antioksidan Tikus Jantan Diinduksi CCl4 dengan Perlakuan Nanopartikel Kurkuminoid Temulawak Lokal Ciemas
Abstrak: Java turmeric (Curcuma xanthorrhiza) is a typical Indonesian plants that has antioxidant activity. Clinical testing showed that curcumin is safe at high doses (12 g/day) but has low bioavailability. This study aimed to measure the increase curcuminoids bioavailability through nanoparticle curcuminoids effectiveness as an antioxidant in rats induce CCl4. Nanoparticle curcuminoids was produced with homogenization-ultrasonication method, after that 27 male rats were divided into 9 groups that will be measured the liver antioxidant activity. The nanoparticle curcuminoids product showed good results with the adsorption efficiency 79% and a particle size 114.4 ± 33.8 nm with IP value 0.218. Generally, the condition of each group of rats did not showed behavior and other physiological symptoms disorder. The best formula from antioxidant status analysis demonstrated 1500 mg dose of nanoparticles can suppress oxidative stress conditions caused by CCl4 administration through decreased levels of MDA and GPx activity and increased activity of SOD and peroxidase than other groups
Keyword: nanoparticle., java turmeric, curcuminoids, bioavailability, antioxidant

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