Judul: Efek Pemberian Ekstrak Etanol Biji Mahoni Terhadap Profil Imunohistokimia Antioksidan Superoksida Dismutase (Sod) Pada Pankreas Tikus Model Diabetes
Abstrak: Penelitian ini bertujuan untuk menganalisis efek ekstrak etanol biji mahoni terhadap berat badan, kadar glukosa darah dan profil antioksidan copper, zinc-superoxide dismutase (Cu,Zn-SOD) jaringan pankreas tikus DM. Sejumlah 25 ekor tikus jantan putih galur Sprague Dawley telah digunakan pada penelitian ini, yang dibagi menjadi lima kelompok perlakuan, yaitu : (1) Kontrol negatif (KN), (2) Kontrol positif, tikus DM (KP), (3) Tikus DM yang diberi ekstrak etanol biji magoni (EM), (4) Tikus DM yang diberi obat acarbose 2 mg/Kg berat badan. dan (5) Tikus non DM yang diberi ekstrak etanol biji magoni (KE). Kondisi DM didapatkan dengan induksi alloxan 110 mg/kg bb pada tikus percobaan. Perlakuan ekstrak etanol biji mahoni dilakukan selama 28 hari. Berat badan, total konsumsi pakan, dan kadar glukosa darah dihitung selama masa perlakuan. Pada akhir perlakuan, tikus dianestesi dengan ketamine-xylazine dan organ pankreas diambil. Organ pankreas selanjutnya difiksasi dengan larutan Bouin, kemudian diproses dengan diembedding menggunakan parafin. Potongan jaringan selanjutnya diwarnai secara imunohistokimia menggunakan antibodi monoklonal Cu,Zn-SOD. Hasil yang diperoleh menunjukan bahwa ekstrak etanol biji mahoni mampu meningkatkan berat badan, menurunkan konsumsi pakan dan kadar glukosa darah, serta mempertahankan kandungan antioksidan Cu, Zn-SOD baik di pulau Langerhans maupun di sel-sel asinar jaringan pankreas tikus DM.
Keyword: antioksidan Cu, Zn-SOD, diabetes melitus, imunohistokimia, pankreas, mahoni

Judul: Pengaruh Pemberian Ekstrak Etanol Biji Mahoni (Swietenia mahagoni Jacq.) Terhadap Profil Sel β Pankreas pada Tikus Diabetes Mellitus.
Abstrak: The aim of this research was to analyze the effect of ethanol mahogany seeds extract on body weight, total feed consumtion, blood glucose level, the number of beta cells and the islets of Langerhans in the pancreatic tissue of diabetic rats.This study used 25 male rats (Sprague Dawley). The rats were divided into 5 groups: (i) negative control group (K-), (ii) positive control group/diabetes mellitus (DM) (K+), (iii) DM group that was treated with 500 mg/kgBW of the ethanol mahagony seeds extract (EM), (iv) DM group that was treated with acarbose (KO), and (v) non DM group that was treated with 500 mg/kgBW of the ethanol mahagony seed extract (KE). DM condition was obtained by alloxan induction (110 mg/kgBW). The treatments were done for 28 days. Body weight, total feed intake, and blood glucose level were measured during the treatments. At the end of treatments, the pancreas tissues were then obtained and analyzed for the number of beta cells. This study showed that ethanol Swietenia mahagony seeds extract increased body weight, decrease blood glucose level and inhibit the rate of pancreatic β cells damage in the experimental diabetic rats.
Keyword: Mahogany seed extract, diabetes mellitus, beta cells, islets of Langerhans, rats

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