Judul: Uji intoksikasi akut fraksi hexan dan etil asetat rimpang kunyit [Curcuma longa Linn.] pada mencit : Kajian histopatologi lambung dan usus
Abstrak: Penelitian ini dilakukan bertujuan untuk mengetahui gambaran histopatologi usus dan lambung mencit yang diberi fraksi hexan dan fraksi etil asetat rimpang kunyit dengan cara dicekok menggunakan sonde lambung dan membandingkan intoksisitas akut fraksi hexan ekstrak rimpang kunyit dengan fraksi etil asetat ekstrak rimpang kunyit melalui pengamatan mikroskopis. Sebanyak 45 ekor mencit jantan dan betina dengan umur 2,5 bulan dengan bobot badan antara 22-25 gr dibagi dalam 3 kelompok besar yang terdiri dari kelompok kontrol (tanpa perlakuan), kelompok yang diberi dosis toksik (7,5 g/kgBB, 15 g/kgBB, 30 g/kgBB, 16 g/kgBB) fraksi etil asetat rimpang kunyit dan kelompok yang diberi dosis toksik (7,5 g/kgBB, 15 g/kgBB, 30 g/kgBB, 16 g/kgBB) fraksi hexan rimpang kunyit. Studi histopatologi yang dilakukan dengan cara mengamati sediaan lambung dan usus di bawah mikroskop. Lesio atau kelainan histopatologi yang ditemukan dibandingkan derajat keparahannya antar kelompok perlakuan dan disajikan secara deskriptif. Secara umum hasil pengamatan histopatologi menunjukkan bahwa lambung mengalami penambahan jumlah sel parietal dan sel zimogen; usus mengalami proliferasi sel goblet. Berdasarkan hasil evaluasi histopatologi disimpulkan bahwa fraksi hexan rimpang kunyit lebih toksik daripada fraksi etil asetat rimpang kunyit. Kata kunci : kunyit, lambung, usus, hexan dan etil asetat.
Keyword: Turmeric, Gastric, Intestine, Hexane, Etyl acetate

Judul: Uji indtoksikasi akut fraksi hexan dan etil asetat rimpang kunyit [Curcuma longa] pada mencit : Kajian histopatologi hati dan ginjal
Abstrak: Penelitian ini bertujuan untuk mengetahui gambaran histopatologi organ hati dan ginjal mencit yang telah dicekok fraksi etil asetat dan hexan C. longa dengan dosis yang diberikan adalah 7.5, 15, 30, dan 60 g/kg bb dosis toksik pada uji intoksikasi akut. Sebanyak 45 ekor mencit (Mus musculus albinus) berumur dua setengah bulan dibagi 9 kelompok, yang terdiri dari sebuah kelompok kontrol (tanpa perlakuan) dan 8 kelompok perlakuan yang diberi fraksi etil asetat dan hexan C. longa dosis 7.5, 15, 30, dan 60 g/kg bb. Perlakuan diberikan secara intragastrik. Hasil pengamatan histopatologi hati mengalami degenerasi hidropis, degenerasi berbutir, apoptosis, kongesti interstitium, sedangkan ginjal mengalami oedema glomerulus, kongesti glomerulus, apoptosis tubulus, dan degenerasi tubulus. Berdasarkan hasil evaluasi histopatologi disimpulkan bahwa pemberian fraksi hexan dan etil asetat rimpang kunyit dosis toksik pada hati menimbulkan lesio yang semakin parah, sesuai dengan peningkatan dosis. Pemberian fraksi etil asetat dan hexan rimpang kunyit dosis toksik menimbulkan lesio pada ginjal yang semakin parah sejalan dengan peningkatan dosis. Kata kunci : Curcuma longa, hati, ginjal, etil asetat, hexan, ekstrak.
Keyword: Curcuma longa, Kidney, Ethyl acetate, Hexane, Extract

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