Judul: Gambaran Histopatologi Hati Tikus Putih yang Diinduksi Karsinogen DMBA dan Diberi Ekstrak Kunyit (Curcuma domestica Val.).
Abstrak: Penelitian ini bertujuan mengetahui gambaran histopatologi hati tikus putih yang diinduksi DMBA dan diberi ekstrak kunyit. Tikus dibagi menjadi dua kelompok. Kelompok pertama diinduksi DMBA melalui mukosa bukal tanpa pemberian ekstrak kunyit dan kelompok kedua diinduksi DMBA dengan pemberian ekstrak kunyit peroral dengan dosis 80 mg/kg bobot badan selama 8 minggu. Tikus dieuthanasi dan dinekropsi. Sampel hati diambil dan dibuat preparat histopatologi. Lesi yang diamati di bawah mikroskop adalah degenerasi sel, nekrosis sel dan apoptosis sel pada jaringan parenkim, infiltrasi sel radang, kongesti, dan hemoragi pada jaringan interstitium, serta proliferasi duktus empedu dan jaringan ikat pada segitiga porta. Hasil dianalisis menggunakan metode one-way ANOVA dan uji Mann-Whitney. Degenerasi sel dan nekrosis sel di antara kedua kelompok menunjukkan perbedaan yang nyata (P<0.05). Apoptosis, infiltrasi sel radang, kongesti, hemoragi, proliferasi duktus empedu, dan jaringan ikat di antara kedua kelompok menunjukkan perbedaan yang tidak nyata (P>0.05). Berdasarkan hasil tersebut, disimpulkan bahwa induksi DMBA menyebabkan kerusakan pada jaringan parenkim, jaringan interstitium, dan segitiga porta. Pemberian ekstrak kunyit diduga mampu mengurangi kerusakan pada hati yang disebabkan DMBA.
Keyword: DMBA, ekstrak kunyit, hati, histopatologi, tikus

Judul: Gambaran Histopatologi Ginjal Tikus Putih yang Diinduksi Karsinogen DMBA dan Diberi Ekstrak Kunyit (Curcuma domestica Val.).
Abstrak: Penelitian ini bertujuan untuk mengetahui gambaran histopatologi ginjal tikus putih yang diinduksi karsinogen DMBA dan diberi ekstrak kunyit. Tikus dibagi menjadi dua kelompok, kelompok pertama diinduksi karsinogen DMBA tanpa pemberian ekstrak kunyit dan kelompok kedua diinduksi DMBA dengan pemberian ekstrak kunyit secara oral dengan dosis 80 mg/kg berat badan selama 8 minggu. Tikus dieuthanasi, dinekropsi dan sampel diambil untuk dibuat preparat histopatologi. Lesio diamati dibawah mikroskop dengan menghitung jumlah dan skoring lesio dari jumlah glomerolus, penebalan kapsula Bowman, hiperselularitas, atrofi glomerolus, endapan protein glomerulus, perubahan inti sel tubulus, degenerasi sitoplasma, endapan protein tubulus, kongesti, hemoragi, dan akumulasi infiltrasi sel radang. Data dianalisis dengan metode One Way ANOVA dan uji Mann-Whitney. Hasil pengamatan menunjukkan bahwa penebalan kapsula Bowman, hiperselularitas, atrofi glomerolus, perubahan inti sel tubulus, endapan protein tubulus dan akumulasi infiltrasi sel radang diantara kelompok yang diberi ekstrak kunyit dan tanpa ekstrak kunyit secara signifikan berbeda nyata (p<0.05), sedangkan jumlah glomerulus, endapan protein glomerulus, degenerasi sitoplasma, kongesti dan hemoragi secara signifikan tidak berbeda nyata (p>0.05). Berdasarkan hasil, dapat disimpulkan bahwa karsinogen DMBA menginduksi terjadinya kerusakan ginjal di glomerulus, tubulus, dan jaringan interstitium. Pemberian ekstrak kunyit diduga mampu memperbaiki kerusakan ginjal.
Keyword: DMBA, Ekstrak Kunyit, Ginjal, Histopatologi, Tikus

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