Judul: Case Studies of Diagnostic and Treatment Giardiasis in Cat at Rvet Bogor Clinic
Abstrak: Giardiasis adalah penyakit yang disebabkan oleh infeksi Giardia sp. dan digolongkan sebagai waterborne disease. Kucing yang memiliki kebiasaan minum air sembarangan atau air mentah sangat rentan terinfeksi penyakit ini. Penelitian ini bertujuan mempelajari teknik diagnostik dan pengobatan giardiasis pada kucing di klinik Rvet Bogor. Penelitian dilakukan dengan pendekatan studi kasus. Kucing pada penelitian ini bernama Memed, kucing dengan ras mix persian dan berumur 1,5 tahun. Kucing mengalami diare tanpa darah selama 6 hari dan tidak disertai muntah. Memed biasa dilepas ke luar rumah dan suka meminum air sembarangan. Peneguhan diagnosa giardiasis pada kucing di klinik Rvet Bogor dilakukan dengan teknik flotasi sederhana. Memed didiagnosa mengalami giardiasis setelah ditemukannya kista Giardia pada sampel feses yang diamati. Kucing diberikan terapi pengobatan berupa sediaan Metronidazole dan vitamin B12. Setelah hari ke- 5 pascaterapi, Memed dinyatakan sembuh dari giardiasis yang ditandai dengan konsistensi feses yang kembali normal dan tidak ditemukannya kista Giardia pada feses.
Keyword: Giardia sp., Giardiasis, Kucing, Metronidazole

Judul: Study cases of Toxocariasis in cats patient at Rvet Bogor clinic in the period September 2020 - September 2021
Abstrak: Kucing peliharaan (Felis domesticus) merupakan hewan yang sudah didomestikasi dan sudah lama hidup berdampingan dengan manusia dan sudah dianggap sebagai sahabat bagi manusia. Kucing yang dipelihara tidak lepas dari penyakit infeksius, salah satunya adalah penyakit parasit yang bisa menginfeksi anak kucing dan kucing dewasa. Toxocariasis adalah penyakit yang disebabkan oleh cacing Toxocara cati yang merupakan salah satu spesies dari Toxocara yang dapat menyerang kucing. Penelitian ini bertujuan mengetahui tingkat kejadian Toxocariasis di klinik Rvet Bogor. Metode yang digunakan pada penelitian ini dilakukan dengan menginterpretasi data sekunder berupa rekam medik kucing yang terinfeksi Toxocara sp. dari 2569 pasien di klinik Rvet Bogor pada periode September 2020 – September 2021. Seluruh data rekam medis infeksi Toxocara cati pada kucing di klinik sebanyak 43 kasus. Tingkat kejadian Toxocariasis tertinggi pada bulan Desember hingga Januari saat musim hujan dan infeksi terendah pada bulan November. Tingginya tingkat kejadian infeksi Toxocara cati dipengaruhi oleh faktor cuaca dan kondisi lingkungan yang buruk.
Keyword: weather, rainfall, cats, Toxocariasis, study cases

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