Judul: Uji Toksisitas Akut Infusa Biji Kemiri (Aleurites moluccana) pada Mencit (Mus musculus).
Abstrak: Kemiri (Aleurites moluccana) merupakan tanaman asli Indonesia yang dipercaya dapat mengobati berbagai penyakit. Potensi biji kemiri sebagai bahan obat dan penyebab keracunan telah banyak diketahui, namun informasi spesifik mengenai tingkat toksisitas dan keamanan dari biji kemiri masih sangat terbatas. Penelitian ini dilakukan untuk menentukan tingkat toksisitas akut dari infusa biji kemiri pada mencit betina menggunakan uji Lethal Dose 50 (LD50). Sebanyak 20 ekor mencit dibagi menjadi 5 kelompok kemudian diberi infusa biji kemiri secara oral dengan dosis 0 (kontrol), 2, 4, 8, dan 16 g/kg BB setiap kelompok. Variabel penelitian adalah jumlah kematian dalam 14 hari, bobot badan pada hari 0, 7, dan 14, dan bobot organ (absolut dan relatif). Data dianalisis dengan menggunakan probit analysis, one way analysis of variance (ANOVA) dan uji lanjut Tukey. Nilai LD50 infusa biji kemiri yang diperoleh adalah 12.20±3.35 g/kg BB. Simpulan penelitian ini ialah infusa biji kemiri termasuk bahan toksik ringan.
Keyword: biji kemiri, infusa, mencit, nilai LD50, uji toksisitas akut

Judul: Uji Toksisitas Akut Minyak Kemiri (Aleurites moluccana L.) pada Mencit (Mus musculus)
Abstrak: Kemiri (Aleurites moluccana L.) merupakan tanaman yang memiliki manfaat dari setiap bagiannya khususnya biji kemiri yang diolah untuk menghasilkan minyak. Penelitian ini bertujuan menghitung tingkat toksisitas minyak kemiri pada mencit dengan menggunakan penentuan nilai lethal dose 50 (LD50). Penelitian ini menggunakan rancangan percobaan acak lengkap. Sebanyak 20 ekor mencit betina dibagi menjadi lima kelompok yaitu kelompok kontrol negatif dan kelompok perlakuan yang diberikan minyak kemiri dosis 5, 10, 15, dan 20 g/kg BB secara peroral. Pengamatan gejala toksisitas pada mencit pascaperlakuan dilakukan selama 14 hari. Parameter yang diamati berupa mortalitas, gejala klinis, dan respon fisiologis mencit. Hasil pada pengamatan dengan parameter mortalitas hewan uji menunjukkan bahwa tidak ada mencit yang mengalami kematian sampai dengan dosis 20 g/kg BB. Parameter respon fisiologis seperti suhu tubuh dan frekuensi nafas berada di rentang normal, sedangkan frekuensi denyut jantung berada di bawah rentang normal. Kesimpulan penelitian ini yaitu minyak kemiri termasuk kedalam kategori praktis tidak toksik.
Keyword: acute toxicity test, candlenut oil, female mice, 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