Judul: Dampak pemberian tepung buah pare terhadap profil imunohistokimia antioksidan Copper, Zinc-Superoxide dismutase (Cu, Zn-SOD) pada jaringan ginjal tikus diabetes mellitus
Abstrak: Kondisi diabetes mellitus menyebabkan jumlah radikal bebas berlebih dan dapat menimbulkan kerusakan sel. Tubuh secara normal mempunyai mekanisme pertahanan terhadap radikla bebas yaitu antioksidan. Antioksidan berfungsi untuk menetralkan radikal bebas. Superoksida dismutase (SOD) adalah salah satu enzim antioksidan intraseluler yang berfungsi melindungi sel dari radikal bebas. Kondisi diabetes menyebabkan kandungan antioksidan intrasel menurun, sehingga tubuh membutuhkan antioksidan eksogenus untuk membantu pertahanan tubuh terhadap radikal bebas. Dampak pemberian tepung buah pare terhadap penurunan kadar gula darah pada kondisi diabetes telah banyak diteliti, namun dampak pemberian tepung buah pare terhadap profil antioksidan Cu,Zn-SOD belum pernah dilaporkan.
Keyword: 

Judul: Gambaran Imunohistokimia Antioksidan Superoksida Dismutase pada Ginjal Tikus Diabetes yang diberi Tepung Tempe.
Abstrak: Diabetes melitus adalah gangguan metabolisme karbohidrat, protein, dan lipid yang ditandai dengan kondisi hiperglikemia akibat penurunan sekresi insulin, resistensi insulin, atau keduanya. Diabetes melitus merupakan salah satu kondisi stres oksidatif. Stres oksidatif menyebabkan tingginya penggunaan antioksidan di dalam tubuh. Antioksidan eksogen dibutuhkan untuk meningkatkan kandungan antioksidan endogen, termasuk superoksida dismutase (SOD). Tepung tempe kedelai dan tepung tempe kecambah kedelai merupakan salah satu sumber antioksidan yang tinggi. Tujuan penelitian ini adalah menganalisis gambaran imunohistokimia antioksidan SOD pada jaringan ginjal tikus diabetes yang diberi tepung tempe kedelai dan tepung tempe kecambah kedelai. Penelitian ini menggunakan 12 ekor tikus jantan galur Sprague dawley yang dibagi dalam empat kelompok: (i) Tikus non diabetes (KN), (ii) Tikus diabetes (KP), (iii) Tikus diabetes diberi perlakuan protein tepung tempe kedelai 10% (TK), dan (iv) Tikus diabetes yang diberi protein tepung tempe kecambah kedelai 10% (TKK). Kondisi diabetes didapat dengan injeksi aloksan dosis 110 mg/kgBB secara intraperitoneal. Tikus diberi perlakuan selama 36 hari. Jaringan ginjal diproses dengan metode standar embedding parafin. Preparat jaringan ginjal diwarnai dengan teknik imunohistokimia untuk mendeteksi kandungan antioksidan Cu,Zn-SOD. Pemberian tepung tempe kedelai (TK) dan tepung tempe kecambah kedelai (TKK) dapat meningkatkan kandungan antioksidan Cu,Zn-SOD pada jaringan ginjal tikus diabetes. Perlakuan tepung tempe kecambah kedelai (TKK) memberikan hasil yang lebih baik (p<0.01) dibandingkan perlakuan tepung tempe kedelai (TK) dalam meningkatkan kandungan antioksidan Cu,Zn-SOD pada jaringan ginjal tikus diabetes.
Keyword: Diabetes melitus, ginjal, superoksida dismutase, tepung tempe kecambah kedelai, tepung tempe kedelai

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