Judul: Pengujian Aktivitas Hepatoprotektor Akar Pasak Bumi (Eurycoma longifolia Jack.)
Abstrak: Hati merupakan organ tubuh yang berkaitan erat dengan metabolisme nutrisi dan xenobiotik sehingga hati menjadi rentan terhadap kerusakan. Dari berbagai penelitian dilaporkan beragam faktor yang dapat mengakibatkan kerusakan hati, antara lain jamur, senyawa kimia, dan obat-obatan. Kerusakan hati sudah tentu dapat memengaruhi fungsi hati, namun sampai saat ini obat komplementer dan alternatif untuk gangguan fungsi hati masih terus memerlukan pengujian guna memperoleh hasil yang lebih memuaskan ditinjau dari segi manfaat pengobatan maupun kemungkinan efek samping yang ditimbulkannya.
Keyword: hepatotoxic effect, liver function, serum alanine transaminase, aspartate transaminase, total biliburin, subchronic toxicity

Judul: The Biochemical Parameters Alteration of Rat Liver Induced by CCl4 and Ethanolic Extract of Cockscomb Flower (Celosia cristata).
Abstrak: Hati merupakan organ yang mempunyai peran luas khususnya dalam metabolisme dan ekskresi xenobiotik. Karbon tetraklorida (CCl4) merupakan senyawa hepatotoksik yang banyak digunakan dalam permodelan kerusakan hati. Nekrosis dan stress oksidatif yang dinduksi oleh CCl4 menyebabkan berbagai jenis kerusakan hati. Senyawa antioksidan berperan penting dalam pencegahan pembentukan ROS. Bunga jengger ayam memiliki metabolit sekunder yang berperan sebagai antioksidan. Aktivitas antioksidan tersebut menjadikan ekstrak bunga jengger ayam memiliki peran hepatoprotektif. Penelitian ini bertujuan mengidentifikasi dan menganalisis potensi aktivitas antioksidan bunga jengger ayam sebagai agen hepatoprotektif secara preventif dan kuratif terhadap kerusakan hati tikus akibat CCl4 berdasarkan perubahan parameter biokimianya. Metode penelitian yang dipakai adalah uji in vivo, biomarker serum darah, histopatologi, histologi, dan hematologi. Analisis data menggunakan ANOVA dilanjutkan dengan Tukey dan Kruskal-Wallis (P<0.05). Pemberian ekstrak bunga jengger ayam secara kuratif, terutama dosis 200 mg/kg, dapat menormalkan morfologi, histologi, histopatologi, hematologi, biokimia darah, serta memberikan efek hepatoprotektif yang lebih baik dibandingkan obat standar silymarin., The liver is an organ with broad function, especially in the metabolism and excretion of xenobiotics. Carbon tetrachloride (CCl4) is hepatotoxic and is mostly used in liver damage models. Necrosis and oxidative stress induced by CCl4 cause many types of liver injury. An antioxidant has a major role to prevent the development of ROS. The Cockscomb flower has secondary metabolites that act as an antioxidant which makes cockscomb flower extract has a role as a hepatoprotective agent. The purpose of this study is to identify and analyze the Cockscomb flower extract antioxidant potential as a hepatoprotective agent by preventive or curative treatment to rat liver injury induced by CCl4 based on the biochemistry parameters alteration. The research methods are in vivo tests, the determination of serum biomarkers, histopathology, histology, and hematology. Data is analyzed using ANOVA followed by The Tukey test and Kruskal-Wallis test (P<0.05). The hepatoprotective effect of curative Cockscomb flower extract, especially a dose of 200 mg/kg, not only can normalize liver morphology, histology, histopathology, hematology, and biochemistry parameters but also gives a better hepatoprotective effect than silymarin as a standard drug.
Keyword: Antioxidant, Carbon tetrachloride, Celosia cristata, Liver, Oxidative stress

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