Judul: Gambaran Darah Tikus Betina (Rattus sp.) Usia Lahir Sampai Usia 21 hari (Hematological Value qf Female Rats (Rattus sp.) at Birth up to 21th Days Old)
Abstrak: Penelitian yang bertujuan untuk j1Iengetahui nilai data dasar fisiologis darah 60 tikus neo natal betina, galur Sprague-Dawley pada usia lahir sampai usia 21 hari, telah dilaksanaJ<an di Laboratorium Fisiologi, Bagian Fisiologi dan Farmakologi - Fakultas Kedokteran Hewan, Institut Pertanian Bogor selama 6 bulan. Hasil penelitian menunjukan bahwa data fisiologis darah untuk jumlah sel darah merah (eritrosit) dan nilai hematokrit (PCV) secara statistik mengalami perubahan yang nyata (P<C,05) seiring pertambahan usia tikus dengan peningkatan masing-masing 528,9% dan 121,3%. Sedangkan kadar hemoglobin secara statistik tidak mengalami perubahan.
Keyword: 

Judul: Gambaran Perkembangan Profil Eritrosit Induk dan Anak Tikus Putih Sejak Lahir Hingga Dewasa.
Abstrak: Darah adalah salah satu komponen penting untuk menilai kondisi fisiologis. Pembentukan sel darah serta pematangannya dimulai sejak dalam kebuntingan. Pembentukan darah fetus terakhir terjadi pada sumsum tulang. Penelitian ini bertujuan untuk mengetahui perkembangan profil eritrosit tikus putih Sprague Dawley. Parameter yang digunakan adalah jumlah eritrosit, kadar hemoglobin, dan nilai hematokrit pada 15 ekor induk tikus bunting yang dikelompokkan dalam usia kebuntingan 1, 13, partus, 21 dan 70 hari postpartus. Parameter darah anak diambil saat neonatus, usia 21 dan 70 hari dari 15 ekor anak tikus jantan dan 15 ekor anak tikus betina yang dilahirkan. Perhitungan jumlah eritrosit dilakukan menggunakan hemositometer. Pengukuran nilai hematokrit dilakukan dengan metode mikrokapiler hematokrit. Kadar hemoglobin diukur menggunakan alat EasyTouch GCHb. Hasil penelitian menunjukkan jumlah profil eritrosit induk tikus putih menurun dari hari kebuntingan pertama sampai pada hari partus dan meningkat dari hari partus hingga hari ke-70 postpartus. Pada anak tikus profil eritrosit terus meningkat dari neonatus hingga dewasa dan belum terlihat perbedaan nilai profil darah antara tikus jantan dan betina sampai usia 70 hari.
Keyword: Erythrocyte, neonates, postpartum, pregnancy

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