Judul: Mikosis sistemik pada kelelawar buah: gambaran histopatologi organ interna
Abstrak: Systemic mycoses recently have become increasingly important with the raising number of risk population whereas fruit bats are a potential vector of the disease. The aim of this research was to find systemic mycoses in fruit bats by examining the hystopatology of its lungs, liver, and guts. As many as 10 bats were sampled for organs. The respective organs were stained by Haematoxylin-Eosin (HE) stain and Periodic-Acid Schiff (PAS) stain. HE result signified systemic infection with 7 samples out of 10 exhibits lung lesions while 5 of them has liver lesions and 1 sample had gut lesion. PAS result revealed round unencapsulated PAS-positive cells with broad-based budding and round unencapsulate PASpositive cells without budding. Based on the type of budding and the absence of capsule, both organism were suspected as Blastomyces sp. with the differential diagnoses of Cryptococcus sp.. Out of 10 samples, 6 were suspected to be infected by Blastomyces sp.. Blastomycosis is classified as zoonotic disease thus there is a possibility of fruit bats being the vector of this pathogen.
Keyword: Bogor Agricultural University (IPB), zoonoses, systemic mycoses, Periodic-Acid Schiff, fruit bats, Blastomyces

Judul: Studi kasus : gambaran histopatologi organ ginjal pada kalong di Gorontalo
Abstrak: Fruit bats were world wide distributed mammals including in Indonesia. This study used samples called Kalong Gorontalo (KG) of the kidney from three species of fruit bats (Acerodon celebensis, Dobsonia exoleta, and Pteropus hypomelanus) from Gorontalo, North Sulawesi. The aims of this study were to find out the histology overview and pathology condition from the kidney to know the pathogenesis of the disease that infected those fruit bats. Histological overview used Hematoxylin Eosin (HE) shows that the cell and tissue in all of the samples had some pathology condition such as : hydropic swelling, degeneration, necrosis, protein deposition in the tubulus lumen, and dilatation of tubulus lumen. Some of the samples that were KG 1, 4, 5, 6, 21, and 26 showed positive reaction with Periodic Acid Schiff (PAS), it means that there were glycogen deposition in kidney. In addition, sample KG 7 showed positive reaction PAS with budding cell inside that indicated a systemic mycosis.
Keyword: Acerodon celebensis, Dobsonia exoleta, fruit bats, kidney, Pteropus hypomelanus.

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