Judul: Aspek Bakteorologis Air Susu Konsumsi Dari Pengantar Susu
Abstrak: Penelitian yang mengambil aspek bakteriologis dari air susu konsumsi yang berasal dari tiga peternakan rakyat di Kotamadya Bogor yaitu Kebon Pedes, Cimanggu dan Lebak Pasar, secara langsung bertujuan melihat kualitas air susu dari segi jumlah dan jenis bakteri kontaminan apakah masih memenuhi standar layak dikonsumsi. Selain itu secara tidak langsung juga diharapkan dapat memberikan gambaran tentang kondisi sanitasi peternakan-peternakan rakyat ter sebut. Sampel air susu untuk penelitian ini diambil dari pengantar susu melalui pelanggan di wilayah pemasaran masing-masing, sebanyak liter untuk tiap pengambilan sampel pagi dan sore hari dengan 7 kali pengulangan. Hasil yan didapat dari pemeriksaan laboratoris menunjukkan jumlah bakteri rata-rata untuk ketiga peternakan rakyat tersebut sebagai berikut: Kebon Pedes, 14 617 142 (pagi) dan 39 052 857 (sore); Cimanggu, 47 142 857 (pagi) dan 54 602 857 (sore); Lebak Pasar, 47 040 000 (pagi) dan 12 057 142 (sore) dengan jumlah rata-rata keseluruhan adalah 24 810 857/mililiter air susu untuk pagi hari dan 35 237 619/mililiter air susu untuk sore hari. Jumlah ini. ternyata tidak jauh berbeda dengan hasil penelitian Rusdi dkk. (1981) yang mendapatkan jumlah bakteri 23 180 000/mililiter air susu segar yang belum dipasteurisasi di daerah Pengalengan. Secara uji statistika perbedaan lokasi peter nakan dan waktu pengantaran pagi dan sore hari, dalam jum- lah bakteri ternyata tidak berbeda nyata. Sedangkan dari jenis bakteri didapatkan 18 jenis bakteri yaitu Enterobacter aerogenes, Alkaligenes faeca lis, Staphylococcus aureus, Providentia, Serratia, Pseudo- monas putida, Escherichia coli, Aeromonas hydrophilla, Flavobacterium, Micrococcus, S. epidermidis, Bacillus sp, Proteus sp, Klebsiella, Citrobacter freundii, P. aerugino- sa, Kurtia sp dan Corynebacterium renale. Dari hasil penelitian ini juga menunjukkan bahwa pe- manasan air susu sampai tepat mendidih tidak cukup membu- nuh semua bakteri di dalamnya. Dari ketiga peternakan rakyat tersebut didapatkan jumlah bakteri rata-rata se- telah pemanasan sebagai berikut Kebon Pedes, 503 (pagi) dan 914 (sore); Cimanggu, 1864 (pagi) dan 864 (sore); Lebak Pasar, 278 (pagi) dan 925 (sore) dengan jumlah rata- rata keseluruhan adalah 881/mililiter air susu pagi hari dan 901/mililiter air susu sore hari…dst
Keyword: 

Judul: Quality of Raw Milk Based on Total Number of Microorganisms, Staphylococcus aureus, and Enterobacteriaceae From Dairy Farm in Pondok Ranggon
Abstrak: Susu merupakan produk hasil ternak perah yang bernilai gizi tinggi. Kandungan gizi yang tinggi pada susu memberi peluang bagi perkembangan bakteri, baik yang patogen maupun non patogen. Bakteri dapat menurunkan kualitas susu, sehingga dalam waktu yang sangat singkat susu menjadi tidak layak dikonsumsi bila tidak ditangani dengan tepat dan benar. Tujuan penelitian ini adalah mendapatkan data tentang keberadaan jumlah total mikroorganisme, Staphylococcus aureus, dan Enterobacteriaceae serta mengetahui kualitas mikrobiologi susu kandang dan penampungan dari Peternakan Sapi Perah Pondok Ranggon, Jakarta Timur. Pengambilan sampel dilakukan dengan metode simple random sampling. Sampel susu kandang diambil dari peternakan sapi perah Pondok Ranggon, Jakarta Timur dan susu penampungan diambil dari TPS, kemudian diuji di Laboratorium Kesehatan Masyarakat Veteriner, Departemen Ilmu Penyakit Hewan dan Kesehatan Masyarakat Veteriner, Fakultas Kedokteran Hewan, Institut Pertanian Bogor. Variabel yang diamati dalam penelitian ini adalah Jumlah Total Mikroorganisme/Total Plate Count (TPC), S. aureus, dan Enterobacteriaceae. Pengujian sampel susu yang dilakukan yaitu isolasi, inkubasi, dan perhitungan jumlah koloni bakteri. Kualitas mikroorganisme susu segar di peternakan sapi perah Pondok Ranggon mempunyai rata-rata TPC 4,6 x 106 ± 6,8 x 106 CFU/mL, jumlah cemaran S. aureus 3,0 x 104 ± 7,8 x 104 CFU/mL, dan cemaran Enterobacteriaceae 1,1 x 105 ± 2,2 x 105 CFU/mL. Susu segar yang diproduksi dari peternakan sapi perah di Pondok Ranggon belum memenuhi standar Batas Maksimum Cemaran Mikroba (BMCM) yang telah ditetapkan., Milk is a dairy product with high nutrition value. The high nutrition value in milk provides an opportunity for bactery to grow, both pathogenic and nonpathogenic. Bactery can reduce the quality of milk, so that milk becomes unfit for consumption in a very short time if it not handled properly and correctly. The aim of this study was to obtain data on the presence of the total number of microorganisms, Staphylococcus aureus, and Enterobacteriaceae and to determine the microbiological quality of bulk milk and shelters from dairy farm Pondok Ranggon, East Jakarta. The samples were collected by using simple random sampling method. Bulk milk samples were collected at dairy farm Pondok Ranggon, East Jakarta and collected milk at TPS, then tested at the Veterinary Public Health Laboratory, Department of Animal Disease and Veterinary Public Health, FKH, IPB. The variables observed in this study were the total number of microorganisms/total plate count (TPC), S. aureus, and Enterobacteriaceae. Testing of milk samples carried out were isolation, incubation, and calculation of the number of bacterial colonies. The microorganisms quality of raw milk at dairy farm Pondok Ranggon has an average of TPC 4,6 x 106 ± 6,8 x 106 CFU/mL, number of S. aureus 3,0 x 104 ± 7,8 x 104 CFU/mL, and Enterobacteriaceae 1,1 x 105 ± 2,2 x 105CFU/mL. Fresh milk produced from dairy farms in Pondok Ranggon has not met the Maximum Microbial Contamination Limit (BMCM) standard.
Keyword: Enterobacteriaceae, fresh milk, S. aureus, TPC

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