Judul: Kausa Mastitis Mikotik dan Cara Diagnosa Labolatorium
Abstrak: Tujuan penelitian adalah untuk menelaah mastitis yang disebabkan oleh kamir dan kapang. Makanan konsentrat yang terdiri dari bungkil kacang dan ampas bir merupakan media baik untuk pertumbuhan kamir dan kapang dapat merupakan sumber infeksi mastitis mikotik. Spora kamir dan kapang dapat masuk bersama antibiotika yang diberikan intramammaria atau masuk lewat puting susu saat pemerahan oleh tangan pemerah yang terkontaminasi spora kamir dan kapang (Hulse, 1952). Penggunaan antibiotika yang terlalu sering dalam pengobatan mastitis akan menekan pertumbuhan bakteri, akan tetapi memberi kesempatan meningkatnya pertumbuhan kamir dan kapang (Jungerman dan Schwartzman, 1972). Spesimen air susu dari 14 ekor sapi perah penderita mastitis diperiksa di Laboratorium Fakultas Kedokteran Hewan Institut Pertanian Bogor terhadap kehadiran kamir dan kapang. Hasil penelitian menunjukkan bahwa dari 14 ekor yang diperiksa air susunya ternyata 26 kwartir dari 11 ekor menderita mastitis mikotik. Dari pemeriksaan mikrobiologik berhasil diisolasi 30 isolat dengan persentase kehadiran kamir Candi- da 30% (9 isolat), Nocardia 20% (6 isolat), Aspergillus 13,33% (4 isolat), kamir yang belum teridentifikasi lebih lanjut 30% (9 isolat), dan kapang yang belum teridentifikasi lebih lanjut 6,67% (2 isolat). ...
Keyword: 

Judul: Kausa mastitis bakterial dan cara dianogsa laboratorium
Abstrak: Mestitis atau redang kelenjar ambing merupakan salah satu penyakit pada sapi peran yang menimbulkan kerugian cukup tinggi dan termasuk penyakit yang sulit diberantes. Berdasarkan kausanya mastitis dibagi menjadi mastitis infeksius dan non infeksius yang kejadiannya jarang. Mastitis infeksius disebabkan oleh mikroorganisme bakteri, fungi atau virus. Bakteri merupakan kausa mastitis yang utama. Kejadian mastitis bakterial mencapai 95% (Philpot, 1979) dan sisanya adalah mastitis yang disebabkan oleh fungi atau virus. Streptococcus agalactiae, S. dysgalactiae, S. uberis, Staphylococcus aureus dan S. epidermidis adalah bakteri- bakteri penyebab utama mastitis. Bakteri coliform yakni Escherichia coli dan Klebsiella sp. termasuk penyebab mas titis yang sporadis. Meskipun jarang, mastitis yang dise babkan oleh Corynebacterium pyogenes, Bacillus cereus, Mycobacterium tuberculosis, Pasteurella multocida, Pseudo- monas aeruginosa, Serratia marcescens, Sphaerophorus necro phorus dan Mycoplasma sp. (Blood et al, 1981, Seddon dan Abiston, 1965). ...
Keyword: 

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