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: Effect of Subchronic Toxicity Test of Soursop Leaf Endophytic Fungi Extract on Enzymes and Liver Histopathology of Sprague-Dawley Rats
Abstrak: Ekstrak etil asetat kapang endofit daun sirsak (Annona muricata L.) diketahui memiliki aktivitas sebagai antikanker payudara, tetapi keamanannya terhadap kondisi hati pada uji toksisitas subkronis belum diketahui. Penelitian ini bertujuan menguji pengaruh pemberian ekstrak terhadap enzim dan histopatologi hati tikus Sprague-Dawley pada uji toksisitas subkronis selama 90 hari yang dilihat dari parameter kadar enzim hati (ALT dan AST), histopatologi, dan bobot hati. Pemberian ekstrak terhadap kadar enzim dan bobot hati tikus menunjukkan hasil yang tidak berbeda nyata antara kelompok perlakuan dengan kelompok kontrol normal dan masih berada pada rentang normal. Kadar enzim hati pada kelompok satelit menunjukkan adanya efek reversible terhadap sediaan uji. Gambaran histopat hati pada seluruh kelompok tidak menunjukkan adanya kelainan yang spesifik. Simpulan dari penelitian ini adalah pemberian ekstrak etil asetat kapang endofit daun sirsak sampai dosis 240 mg/kgBB selama 90 hari pada tikus Sprague-Dawley terhadap enzim, histopatologi, dan bobot hati tikus tergolong aman karena tidak menimbulkan adanya tanda-tanda kerusakan hati., Ethyl acetate extract of the endophytic fungi of soursop leaf (Annona muricata L.) is known to have anticancer activity, but its safety against liver conditions in subchronic toxicity tests is unknown. This study aimed to examine the effect of the extract on enzymes and liver histopathology of Sprague-Dawley rats in the 90-day subchronic toxicity test, which was seen from the parameters of liver enzyme concentrations (ALT and AST), histopathology, and liver weight. Giving extracts to enzyme concentrations and liver weight of rats showed results that were not significantly different between the treatment group and the normal control group and were still in the normal range. Liver enzyme concentrations in the satellite group showed a reversible effect on the test preparation. Liver histopathology in all groups did not show any specific abnormalities. The conclusion of this study was that the administration of ethyl acetate extract of endophytic fungi of soursop leaves up to a dose of 240 mg/kgBW for 90 days in Sprague-Dawley rats against enzymes, histopathology, and liver weight of rats was considered safe because it did not cause any signs of liver damage.
Keyword: endophytic fungi, liver, soursop leaf, subchronic toxicity

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