Judul: Pengujian Total Mikroba dengan MAS-100 serta Proses Pengendaliannya pada Ruang Filling PT. XYZ, Kabupaten Bogor
Abstrak: Tingginya defect produk jenis kapang dan unsterile menjadi perhatian khusus divisi Quality Control di PT XYZ. Diduga salah satu penyebab jenis defect ini adalah kontaminasi dari lingkungan yaitu mikroba udara. Pengujian total mikroba udara pada ruang filling dilakukan dengan metode active impaction sampling menggunakan alat MAS-100. Hasil yang didapatkan pada pengukuran Total Plate Count (TPC) menunjukkan nilai rata-rata tertinggi sebesar 4.44 cfu/500L, analisis ragam untuk TPC menunjukkan bahwa tahap proses pengambilan sampel berpengaruh dengan jumlah koloni. Pengukuran Yeast and Mold (YM) menunjukkan nilai rata-rata tertinggi sebesar 2.1 cfu/500L, analisis ragam YM menunjukkan bahwa waktu pengambilan sampel tidak berpengaruh terhadap jumlah koloni. Tindak pengendalian yang telah dilakukan adalah dengan mengganti lampu UV yang rusak dan pre-filter yang kotor di ruang filling, memberi penutup pada lubang saluran pembuangan air, serta melakukan perbaikan standard operating procedure cleaning dan fogging, serta penambahan proses foaming. Terdapat penurunan jumlah koloni baik TPC maupun YM yang terbentuk setelah dilakukan tindakan perbaikan.
Keyword: MAS-100, ruang filling, active impaction sampling, Airborne bacteria, Total microbes, TPC, Colonies number, Yeast, Mold, YM

Judul: Kajian Metode Pengambilan Sampel Air dalam Rangka Analisis Mutu Mikrobiologi Air Baku Industri di PT MNO Gunung Sindur, Nama NIM Bogor
Abstrak: Water is one of the most important needs in human life. In the food industry, water can be used for various activities such as sanitation, production process or even used as raw material for production. Therefore, water used in production should has its own requirements and standards of quality. PT MNO has its own water supply installation to help fulfilling the needs of raw water for production. Raw water used on any production process need to be analyzed its quality either physical, chemical, or microbiology quality. This study attempts to review the water sampling method used in production, in order to determine the microbiological quality of raw water for production process in PT MNO Gunung Sindur, Bogor. The microbiological analysis performed in this study are the calculation of Total Plate Count, yeast and mold content, as well as examination of coliform bacteria and E. coli. The result of microbiological analysis on water samples after sampling method repairment showed that the average microbiology content in the water samples were reduced compared to the analysis results before the repairment done. The statistical result from both data sets that were proceed with paired samples t-test implied that the reduction occurred on the samples taken with additional treatments has not significant yet. It means the repairment of sampling method had not gave a significant effect but has the potential to reduce the effect of external factors that can affect the result of microbiological analysis
Keyword: Bogor Agricultural University (IPB), yeast, water quality, water, mold, Escherichia coli, coliform

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