Judul: In silico Study: The Study Between The Relationship of Prenyl and Antioxidant Activity on Some Flavonoids
Abstrak: Flavon dan flavonol merupakan contoh senyawa anggota flavonoid yang memiliki beberapa aktivitas biologis, salah satunya aktivitas antioksidan. Pada penelitian ini, perhitungan energi pemutusan ikatan (BDE) dilakukan terhadap 4 contoh golongan senyawa dari masing-masing golongan flavon dan flavonol terprenilasi. Mekanisme antioksidan yang dikaji adalah pemutusan ikatan antar atom oksigen dan hidrogen pada gugus fenolik, baik secara langsung maupun tidak langsung, sehingga perhitungan BDE dan potensial ionisasi (PI) memenuhi asumsi tersebut. Secara keseluruhan, gugus yang menjadi penyebab meningkatnya nilai BDE secara signifikan adalah cincin piran-7OH dengan tambahan prenil. Sementara, keberadaan cincin piran-5OH disertai prenil tambahan pada posisi 8 merupakan penyebab meningkatnya nilai PI secara tajam. Dari 176 contoh senyawa yang telah dihitung, krisin merupakan golongan senyawa yang pada umumnya mengalami peningkatan aktivitas antioksidan setelah terprenilasi (ΔBDE = -1,708 - -27,728 kcal/mol). Penurunan aktivitas antioksidan paling banyak terjadi pada golongan senyawa kuersetin dan kaemferol terprenilasi. Dari hasil penelitian ini, dapat disimpulkan bahwa penambahan gugus prenil secara umum menurunkan aktivitas antioksidan flavon dan flavonol.
Keyword: Bogor Agricultural University, Institut Pertanian Bogor, IPB, antioxidant, BDE value, prenyl, radical position, Flacon, Nilai BDE, Posisi radikal

Judul: Prenilasi Senyawa β-Diketon sebagai Prekursor 3-Prenilflavon
Abstrak: One group of flavonoids that has not been commonly synthesized is 3- prenylflavone. The main objective of this experiment was to synthesize precursor of 3-prenylflavone. Firstly, β-diketone was synthesized via 4 steps from phenol as starting compound with total yield of 24%. Prenylation of β-diketone with prenyl bromide and K2CO3 base produced 4 fractions which were separated by using preparative thin layer chromatography (PTLC) with n-hexane:EtOAc (8:2) as the eluent. Fraction with Rf = 0.80 was further separated by using preparative PTLC with n-hexane:EtOAc (99:1) as the eluent. Two fractions were obtained with Rf = 0.38 and 0.42. The first fraction has been characterized as diprenylated β-diketone with 49% yield. Application of protecting group on the phenolic OH group in β- diketone are needed to obtain monoprenylated β-diketone which can be further cyclized into 3-prenylflavone
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