Judul: Pemeriksaan Mikroskopis Kasus Hemoplasmosis pada Lima kucing di praktek dokter hewan "Drh Setyo Widodo dkk".
Abstrak: Agen penyakit yang dapat menurunkan kualitas hidup kucing hingga dapat menyebabkan kematian salah satunya adalah Hemoplasma sp. bakteri tersebut memiliki target infeksi pada eritrosit. Infeksi Hemoplasma sp. dapat menyebabkan kondisi anemia pada kucing, apabila kondisi anemia tidak segera diterapi maka akan berujung pada kematian.. Penelitian ini bertujuan untuk mengamati temuan klinis dan pemeriksaan mikroskopis kasus Hemoplasmosis pada lima ekor kucing yang berada di praktek dokter hewan “Drh Setyo Widodo dkk”. Penetapan diagnosis Hemoplasma sp. dapat dilakukan dengan menggunakan pemeriksaan penunjang berupa pemeriksaan darah (hematologi). Pemeriksaan darah dapat dilakukan dengan membuat preparat ulas darah tepi. Sampel ulas darah yang telah diwarnai dengan pewarnaan Romanowsky diamati dibawah mikroskop cahaya dengan pembesaran lensa objektif 40x. Pengamatan menggunakan mikroskop memperlihatkan Hemoplasma sp. terletak di tepi eritrosit, memiliki bentuk bulat dan terlihat bebas, Berdasarkan pemeriksaan mikroskopis lima ekor kucing yang diteliti terinfeksi Hemoplasma sp dengan temuan klinis berupa demam, membran mukosa pucat hingga ikterus dan adanya kehadiran kutu.
Keyword: anemia, hemoplasmosis, kucing, ulas darah

Judul: Studi Pemahaman Pemilik Hewan terhadap Infeksi Parasit Darah pada Kucing di Klinik Mayda Animal Care dan di iVet Clinic Dramaga
Abstrak: Penyakit parasit darah merupakan salah satu permasalahan yang paling umum ditemukan pada kucing. Gejala yang umum ditemukan pada kucing yang menderita penyakit ini berupa anemia, dehidrasi, dan nafsu makan menurun. Penelitian ini bertujuan melihat tingkat pengetahuan, pemahaman, dan tindakan pemilik hewan terhadap kasus infeksi parasit darah, serta menjelaskan kasus infeksi parasit darah pada kucing. Penelitian ini menggunakan kuesioner yang dibagikan kepada pemilik hewan yang datang ke klinik mengenai infeksi parasit darah pada kucing dalam bentuk fisik dan Google Form, serta data rekam medis di Klinik Mayda Animal Care dan iVet Clinic Dramaga selama tahun 2022. Berdasarkan hasil kuesioner, 62% pemilik hewan memiliki pengetahuan, pemahaman, dan tindakan yang baik terhadap infeksi parasit darah di kucing. Data rekam medis menunjukkan kasus infeksi parasit darah tertinggi di kedua klinik pada bulan Mei sampai September. Pengobatan yang diberikan berupa antibiotik yaitu Doxycycline, Amoxicillin, dan Clindamycin., Blood parasites disease is one of the most common case found in pets, like cats. Symptom that are common be found in cats whom suffer this disease is anemia, dehydration, and lose of appetite. This study aims to look at the level of knowledge, understanding, and practice of animal owners in cases of blood parasite infections, as well as to explain cases of blood parasitic infections in cats. This study used a questionnaire distributed to animal owners who came to the clinic regarding blood parasite infections in cats in physical form and Google Form, as well as medical record data at the Mayda Animal Care Clinic and iVet Clinic Dramaga in 2022. Based on questionnaries results, 62% of animal owners have a good knowledge, understanding, and practice against blood parasite cases in cat. Medical record data showed the highest cases of blood parasite infection in both clinics happen in May until September. The treatment is in the form of antibiotics, namely Doxycycline, Amoxicillin, and Clindamycin.
Keyword: blood parasites, cats, questionnaries, understanding

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