Judul: RIZKY MASTRINDA CAESARANI. Acute Toxicity Test of Cinnamon Infusion (Cinnamomum burmannii) on Female Mice (Mus musculus).
Abstrak: Kayu manis merupakan tumbuhan rempah yang memiliki sifat sebagai antioksidan, antiinflamasi, dan antimikroba. Penelitian ini bertujuan menguji keamanan dan tingkat toksisitas akut infusa kayu manis pada mencit betina menggunakan penentuan nilai lethal dose 50 (LD50) serta memberikan informasi terkait keamanan infusa kayu manis sebagai pertimbangan dalam penggunaannya di bidang obat herbal. Penelitian ini menggunakan 20 ekor mencit betina galur DDY yang dibagi menjadi 4 kelompok perlakuan, kelompok pertama adalah kelompok kontrol yang hanya diberikan akuades dan ketiga kelompok lainnya adalah mencit yang diberi perlakuan menggunakan infusa kayu manis dengan dosis 5, 10, dan 15 g/kg BB. Pengamatan yang dilakukan meliputi gejala klinis, mortalitas, respons fisiologis tubuh, bobot badan, dan perubahan organ mencit pada hari ke-14 pascapemberian infusa kayu manis. Hasil pengujian nilai LD50 menunjukkan infusa kayu manis sampai dengan dosis 15 g/kg BB merupakan sediaan yang relatif tidak membahayakan. Infusa kayu manis menimbulkan gejala klinis kurangnya nafsu makan pada mencit yang ditandai dengan menurunnya bobot badan mencit. Infusa kayu manis juga tidak terbukti menimbulkan perubahan pada makroanatomi organ mencit sehingga termasuk dalam sediaan yang aman secara akut.
Keyword: acute toxicity, cinnamon, female mice, infusion, lethal dose 50 (LD)50

Judul: Acute Toxicity Test of Sappan Wood (Caesalpinia sappan L.) in Mice (Mus musculus)
Abstrak: Kayu secang (Caesalpinia sappan L.) sering dikonsumsi karena dipercaya dapat menyembuhkan berbagai jenis penyakit. Tujuan penelitian ini adalah menentukan toksisitas dari infusa kayu secang sehingga dapat dijadikan acuan untuk pengujian berikutnya. Penelitian ini menggunakan 20 ekor mencit betina yang dibagi menjadi empat kelompok; satu kelompok kontrol dan tiga kelompok perlakuan. Kelompok kontrol diberi akuades dan kelompok perlakuan diberi infusa kayu secang dengan dosis 5, 10, dan 15 g/kg BB. Pemberian infusa kayu secang dan akuades menggunakan sonde lambung dan diberikan dalam dosis tunggal. Pengamatan dilakukan selama 14 hari setelah perlakuan. Berdasarkan hasil penelitian ditemukan adanya perubahan perilaku dan didapatkan nilai LD50 yaitu 16,6 g/kg BB. Perubahan bobot badan tampak berbeda nyata pada dosis 10 g/kg pada hari ke-7 dan 14. Rata-rata bobot organ absolut dan relatif tidak berbeda nyata pada tingkat kepercayaan 95% (p>0,05) dan tidak ditemukan kelainan secara makroskopis pada organ. Kesimpulan penelitian ini adalah kayu secang termasuk ke dalam kategori relatif tidak membahayakan dan aman untuk digunakan., Sappanwood (Caesalpinia sappan L.) is often consumed because it is believed to be able to cure various types of diseases. Acute toxicity testing was carried out to assess the safety level of sappanwood. This study used 20 female mice which were divided into four groups; one control group and three treatment groups. The control group was fed with distilled water and the treatment groups were fed with sappanwood with 5, 10, and 15 g/kg body weight doses. Sappanwood and distilled water was administered using a gastric tube and given in a single dose. The observation started in 14 days after treatment. Based on research results, there is a change in behavior and the obtained LD50 value was 16,6 g/kg body weight. Changes in body weight were significantly different on 10 g/kg body weight doses. However, the absolute and relative organ weight was not significantly different at the 95% confidence level (p>0,05), and there was no abnormality found in macroscopic organs. It was conclude that sappanwood infusion categorized in relatively non dangerous or non toxic substance.
Keyword: body weight, organ weight, sappan wood, LD50

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