Judul: Determinasi Pemberian Minyak Trans Terhadap Stres Oksidatif pada Tikus Galur Wistar dengan Malondialdehida Pankreas sebagai Indikator
Abstrak: Trans fatty acids (TFAs) are the entire unsaturated fatty acids containing one or more double bonds isolated in trans configuration believed as predisposing factor of oxidative stress, excluding conjugated double bond fatty acids. Malondialdehyde (MDA) is a product of lipid peroxidation used as oxidative stress marker. The objective of this study was to see the correlation between TFAs containing-oil (consists of 3-6% TFAs) intake at various administration doses and pancreatic MDA levels in Wistar rats. Twelve rats were grouped according to administration doses (20%, 40%, 60% of given feed total energy and control group). TFAs containing-oil was administered orally once a day for 70 days at given doses by force feeding. Pancreatic MDA were measured using TBARS assay adapted from Singh et al. (2006). Increase of TFAs containing-oil administration dose caused insignificant increase of pancreatic MDA level.
Keyword: Bogor Agricultural University (IPB), palm oil, Wistar rats, malondialdehyde, oxidative stress, trans fatty acids

Judul: Pengaruh pemberian oleoresin jahe (zingiberofficinale) terhadap aktivitas superoksida dismutase (SOD) ginjal tikus yang mengalami perilaku stres
Abstrak: Tujuan penelitian ini adalah untuk mengetahui pengaruh pemberian oleoresin jahe terhadap aktivitas SOD dan kadar malonaldehida (MDA) ginjal tikus yang mendapat perlakuan stres. Kadar MDA merupakan indikator terjadinya kerusakan oksidatif dan keberadaan radikal bebas di dalam tubuh, sedangkan enzim SOD adalah salah satu dari enzim antioksidan yang dimiliki tubuh yang berperan dalam meredam serangan radikal superoksida. Penelitian dibagi menjadi tiga bagian, yaitu penelitian pendahuluan, penelitian utama dan penelitian penunjang. Penelitian pendahuluan meliputi persiapan jahe, ekstraksi oleoresin jahe menggunakan pelarut metanol, karakterisasi komponen ekstrak methanol jahe dan pengujian aktivitas antioksidan oleoresin jahe yang dibandingkan dengan a-tokoferol. Dari analisis penelitian pendahuluan diketahui bahwa karakterisasi ekstrak metanol jahe menggunakan metode Kromatografi Lapis Tipis (KLT) menunjukkan tiga fraksi dengan spot yang cukup tajam dengan nilai Rf fraksi pertama 0.24, fraksi kedua 0.32 dan fraksi ketiga 0.38. Berdasarkan perbandingan dengan nilai Rf referensi ditentukan fraksi pertama sebagai senyawa gingerol, fraksi kedua sebagai zingeron dan fraksi ketiga sebagai shogaol. Sedangkan dari analisis aktivitas antioksidan, diketahui oleoresin jahe memiliki nilai periode induksi (PI) 25.57 hari dan faktor protektif (FP) 5.44, nilai ini menunjukkan perbedaan yang nyata terhadap aktivitas antioksidan a-tokoferol dengan nilai PI 13.99 hari dan FP 2.98 serta kontrol (tanpa bahan antioksidan) dengan nilai PI 4.7 hari. Data tersebut menunjukkan nilai faktor protektif dan periode induksi oleoresin jahe adalah yang tertinggi. Sehingga dapat disimpulkan bahwa aktivitas antioksidan oleoresin jahe lebih tinggi daripada a-tokoferol. Pada penelitian tahap kedua (utama) dilakukan intervensi oleoresin jahe terhadap tikus. Tikus percobaan dibagi menjadi lima kelompok perlakuan yaitu: kontrol (tanpa stres dan tanpa oleoresin), stres, stres oleoresin, oleoresin + stres dan oleoresin + stres + oleoresin. Kemudian dilakukan pengujian kadar malonaldehida (MDA) dan aktivitas Superoksida Dismutase (SOD) ginjal tikus. Stres yang diberikan berupa pelakuan puasa selama lima hari ditambah berenang pada hari ke-2, 3 dan 4 selama 10 menit per harinya. Oleoresin diberikan secara oral menggunakan alat sonde dengan konsentrasi 60 mg/kg berta badan selama tujuh hari
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