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: Effectiveness of Cinnamon (Cinnamomum burmanii) Infusion as an Analgesic Effects and Stamina Enhancer in Male Mice (Mus musculus)
Abstrak: Kayu manis merupakan tanaman herbal yang memiliki beragam khasiat bagi kesehatan. Penelitian ini bertujuan mempelajari efektivitas infusa kayu manis sebagai analgesik dan peningkat stamina tubuh hewan. Penelitian ini menggunakan 20 ekor mencit jantan galur Deutschland Denken Yoken yang dikelompokkan menjadi 4 kelompok perlakuan dengan tiap kelompok terdiri atas 5 ekor mencit. Kelompok perlakuan dibagi menjadi kelompok mencit kontrol dan mencit perlakuan yang diberi infusa kayu manis dengan dosis 1, 2, dan 4 g/kg BB. Perlakuan dilakukan secara peroral dengan 3 kali ulangan dengan selang waktu satu hari. Pengujian pada uji analgesik dengan metode tail immersion flick test dan uji stamina dengan metode forced swim test. Data yang diperoleh dianalisis menggunakan one way analysis of variance (ANOVA) yang dilanjutkan dengan uji Tukey. Hasil penelitian menunjukkan bahwa pemberian infusa kayu manis pada mencit jantan mampu memberikan efek analgesik pada dosis 4 g/kg BB dan mampu meningkatkan stamina pada dosis 2 dan 4 g/kg BB. Kesimpulan penelitian ini ialah kayu manis memiliki potensi sebagai analgesik dan peningkat stamina., Cinnamon is a herbal plant that has various health benefits. This research aims to study the effectiveness of cinnamon infusion on analgesic effects and to increase stamina for animals body. This study used 20 male mice of the Deutschland Denken Yoken strain which were grouped into 4 treatment groups with each group consisting of 5 mice. The treatment group was divided into control mice and treatment mice that were given cinnamon infusion at doses of 1, 2, and 4 g/kg BW. The treatment was carried out peroral with 3 repetitions with an interval of one day. The analgesic test uses the tail immersion flick test and the stamina test uses the forced swim test. The data obtained were analyzed using one way analysis of variance (ANOVA) followed by the Tukey test. The results of the study showed administrating cinnamon infusion to male mice was able to provide an analgesic effect at a dose of 4 g/kg BW and was able to increase stamina at a dose of 2 and 4 g/kg BW. The conclusion of this research is that cinnamon has the potential as an analgesic and stamina enhancer.
Keyword: kayu manis, stamina, analgesik, mencit, obat herbal

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