Judul: Profil Eritrogram pada Kucing Penderita Skabies.
Abstrak: Skabies merupakan salah satu penyakit yang menyerang kulit dan disebabkan oleh tungau Sarcoptes scabiei. Tungau skabies bertahan hidup di dalam lapisan kulit kucing dengan cara merusak jaringan dan dapat menyebabkan kegatalan. Penelitian ini bertujuan untuk mengetahui profil eritrogram pada kucing penderita skabies. Penelitian ini dibagi menjadi dua kelompok yaitu kelompok kucing penderita skabies dan kelompok kucing sehat (kontrol) dengan jumlah masing-masing 4 ekor kucing. Kucing kemudian diambil sampel darahnya dan diperiksa jumlah sel darah merah, haemoglobin, nilai hematokrit, MCV, dan MCHC. Hasil yang telah diperoleh adalah jumlah sel darah merah sedikit mengalami penurunan pada penderita skabies. Indeks eritrosit memperlihatkan tiga ekor kucing mengalami anemia tipe makrositik normokromik dan satu ekor mengalami anemia tipe normositik hiperkromik.
Keyword: skabies, kulit kucing, sel darah merah

Judul: Gambaran Eritrogram Pada Kucing Terinfeksi Skabies yang Diberi Asam Boswellik (Boswellia serrata).
Abstrak: Skabies merupakan penyakit kulit yang disebabkan karena adanya tungau yang hidup pada jaringan kulit. Manusia dan hewan dapat terkena skabies yang disebabkan oleh tungau Sarcoptidae dan Psoroptidae. Tujuan penelitian ini adalah untuk mengetahui gambaran sel eritrosit pada kucing yang terinfeksi skabies dan diberi krim asam boswellik. Penelitian ini menggunakan lima ekor kucing domestik (Felis catus) yang menderita skabies yang ditandai dengan adanya infestasi tungau Sarcoptes scabiei pada kulit. Pemberian krim asam boswellik dilakukan setiap hari sebanyak dua kali. Pengambilan darah kucing dilakukan melalui vena cephalica antebrachii setiap lima hari sekali selama tiga kali untuk pemeriksaan hematologi. Hasil penelitian ini memperlihatkan bahwa pemberian asam boswellik pada kucing yang menderita skabies tidak menunjukkan perbedaan yang signifikan menurut uji statistik antar waktu pengambilan darah. Pemberian krim asam boswellik tidak memberikan perbedaan yang signifikan walaupun pada indeks eritrosit Bies dan Nana terjadi pemulihan ke rentang normal. Hasil ini dapat menjadi gambaran awal bahwa krim asam boswellik tidak memiliki kecenderungan toksisitas pada kucing yang diobati.
Keyword: eritrosit, krim, kucing, skabies, asam boswellik, asam boswellik

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