Judul: Identifikasi Titik Kritis dan Tingkat Kepatuhan Pedagang Minuman Es di Kota Bogor.
Abstrak: Minuman es merupakan pangan yang sering dikonsumsi masyarakat Indonesia. Namun, minuman es berpotensi mengandung bahaya mikrobiologi. Bahaya tersebut dipengaruhi oleh kualitas mikrobiologi, kimia atau fisik komponen di dalamnya, yaitu es batu, air atau campuran. Penelitian ini bertujuan untuk mengidentifikasi titik kritis dan sumber cemaran minuman es, mengetahui tingkat kepatuhan pedagang terhadap pelaksanaan good practices selama proses pengolahan minuman es dan menganalisis hubungan antara elemen kritis dengan tingkat kepatuhan pedagang dalam menerapkan CPPB (Cara Produksi Pangan yang Baik). Penelitian dilakukan dengan cara survei dan observasi responden, responden distratifikasi berdasarkan skala ekonomi. Penentuan titik kritis dilakukan dengan menggunakan prinsip pertama dan kedua Hazard Analysis Critical Control Point (HACCP). Prinsip pertama yaitu dengan mengidentifikasi potensi bahaya yang muncul pada setiap tahapan proses. Prinsip kedua yaitu berdasarkan bahaya yang terindentifikasi signifikan kemudian ditentukan titik kritisnya. Hasilnya menunjukkan bahwa terdapat titik kritis di rantai penyediaan minuman es, baik di tingkat kelas bawah, menengah maupun atas. Titik kritis pada penyediaan minuman es kelas bawah adalah es batu, air PAM yang tidak direbus, santan, sirup atau gula cair, minuman serbuk, perebusan air, pencucian es, pengecilan ukuran es, penyimpanan es, pemotongan buah dan campuran, penyimpanan buah dan campuran, serta proses pencampuran. Sedangkan titik kritis untuk pedagang minuman es kelas menengah adalah perebusan air, pemotongan buah dan campuran, serta proses pencampuran. Titik kritis untuk pedagang minuman es kelas atas adalah pada saat proses pencampuran. Penentuan tingkat kepatuhan pedagang berdasarkan latar belakang pendidikan, skala ekonomi dan tempat berjualan.
Keyword: Iced beverages, surveys, HACCP, critical points, compliance levels

Judul: Penentuan Titik Kritis Risiko Keamanan Mikrobiologi dalam Rantai Penyediaan Es Batu dan Minuman Es (Studi Kasus Sekolah Dasar di Jakarta)
Abstrak: Ice and iced beverages are frequently consumed by Indonesian, including elementary school students. Ironically, ice and iced beverages have a potential to carry on microbial hazards. The entry point for the microbes in contaminating ice was still unidentified. The aim of this study was to determine the critical points of microbiological safety risk in ice and iced beverages supply chain in some elementary schools in Jakarta. The determination was done by using the first and second principles of Hazard Analysis Critical Control Point (HACCP). The result showed that there were some critical points in every part of the supply chain. The critical points in home-scale ice producer were water that was used to make ice, water boiling process, and water filling process, whereas the critical points in factory-scale ice blocks producer were water that was used to make ice, filtration, and ice sorting process. The critical points in ice distributor line were distribution process from ice factory to ice house, ice storage, ice washing, ice crushing, and distribution process to food service. In food service line, the critical points were ice crushing, crushed ice storage, and ice and ingredients mixing process. The critical points found showed the importance for everyone engaging in ice and iced beverages business to be aware and take action to ensure the safety of the products for the consumers.
Keyword: Bogor Agricultural University (IPB), iced beverages, ice, HACCP, food safety, critical points

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