Judul: Analisis Hematologi dan Kimia Darah Macaca Fascicularis dengan Infeksi Positif terhadap Klebsiella Pneumoniae
Abstrak: Klebsiella pneumoniae belongs to the family Enterobacteriaceae and is found in mouth and intestine. Klebsiella pneumoniae has been reported in various nonhuman primate species with the cases of pneumonia, septicemia, and enteritis. This secondary study purposed to obtain information of clinical pathology profile related to Klebsiella infection in cynomolgus monkeys (Macaca fascicularis). This secondary study was conducted on three long-tailed monkeys which showed positive results in the bacterial culture test. The secondary study was based on blood analysis to evaluate hematology and blood chemistry. The results demonstrate that monkeys with Klebsiella pneumoniae exhibited marked changes in erythrocytes, hemoglobin, hematocrit and mean corpuscular hemoglobin concentration values in hematology as well as creatinine, total protein, and albumin levels and albumin/globulin ratio in blood chemistry profile. The changes may indicate the incidence of anemia, liver disease, thrombocytopenia, dehydration, inflammatory response and kidney disease, which may be associated with Klebsiella pneumoniae infection.
Keyword: Blood chemistry analysis, Hematological analysis, Klebsiella pneumoniae, Macaca Fascicularis

Judul: Case Study of the Hematological Profile  of A Colony Macaca fascicularis in PSSP with Klebsiella pneumoniae Infection
Abstrak: Monyet ekor panjang (Macaca fascicularis) adalah hewan model karena memiliki kemiripan dengan manusia secara morfologis. Informasi mengenai profil hematologi monyet ekor panjang dengan kasus Klebsiella pneumoniae masih sangat terbatas. Hasil penelitian ini diharapkan dapat menjadi salah satu rujukan pada kasus Klebsiella pneumoniae pada monyet ekor panjang. Data sampel didapatkan dari lab PSSP sejumlah 27 sampel darah yang sudah dianalisis dengan alat hematology analyzer dan PCR. Data kemudian dianalisis secara deskriptif dan ditampilkan dalam bentuk rata-rata ± standar deviasi. Data tersebut dibandingkan dengan profil hematologi Macaca fascicularis normal. Nilai profil hematologi rata- rata pada Macaca fascicularis di penangkaran PSSP baik dari yang positif dan negatif Klebsiella pneumoniae mengalami penurunan adalah leukosit, eritrosit, hemoglobin hematokrit, MCV, trombosit dan PDW, sedangkan yang mengalami kenaikan adalah MCH, MCHC dan RDW. Hal ini menunjukkan terjadinya leukopenia, anemia mikrositik hiperkromik, dan trombositopenia yang dapat terjadi akibat infeksi Klebsiella pneumoniae., The long-tailed monkey (Macaca fascicularis) is a model animal because it is morphologically similar to humans. Information on the hematological profile of long-tailed monkeys with Klebsiella pneumoniae cases is still very limited. The results of this study are intended to serve as a reference in the case of Klebsiella pneumoniae in long-tailed monkeys. The sample data was obtained from the PSSP laboratory. A total of 27 blood samples were analyzed using a hematology analyzer and PCR. The data were then analyzed descriptively and presented in terms of mean and standard deviation. These data were compared with the normal Macaca fascicularis hematological profile. The mean values of the hematological profile in captive Macaca fascicularis of PSSP, both positive and negative Klebsiella pneumoniae, were decreased in leukocytes, erythrocytes, hemoglobin, hematocrit, MCV, platelets, and PDW, while those showing an increase in MCH, MCHC, and RDW. This indicates the occurrence of leukopenia, hyperchromic microcytic anemia, and thrombocytopenia, which can occur due to infection with Klebsiella pneumoniae.
Keyword: Klebsiella pneumoniae, Macaca fascicularis, profil hematologi, Hematology profile

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