Judul: Praktek Higiene dan Penilaian Konsumen Terhadap Kebersihan Fisik Di Restoran Sunda Bogor
Abstrak: Praktek penjamah makanan pada restoran etnik mempengaruhi penilaian konsumen terkait sanitasi sesuai dengan Permenkes 1098 tahun 2003. Penelitian ini bertujuan untuk mengetahui praktek higiene dan penilaian konsumen terhadap kebersihan fisik di restoran sunda Bogor. Penelitian ini menggunakan desain cross sectional study yang dilakukan di dua Restoran Sunda di kota Bogor pada bulan Mei 2014. Sampel penelitian terdiri dari 24 penjamah makanan dan 81 konsumen yang bersedia menjadi responden. Hasil penelitian menunjukkan bahwa penjamah makanan restoran A dan restoran B sebagian besar memiliki skor praktek memiliki cukup (60-80%). Skor penilaian konsumen di restoran A dan B terhadap lingkungan fisik restoran tergolong cukup, penilaian untuk peralatan pada restoran A masih termasuk cukup dan penilaian pelayanan di restoran A dan B kategori baik. Praktek higiene penjamah makanan sebagian besar cukup.
Keyword: Praktek, penjamah makanan, konsumen, sanitasi higiene

Judul: Studi Higiene Sanitasi Restoran Sunda di Kota Bogor
Abstrak: This research aimed to know about hygiene and sanitation based on physical condition, as well as the knowledge of Sundanese restaurant’s manager in Bogor City. Case study and descriptive analysis was applied in this study. Sampling method of purposive sampling was carried out and the number of samples that used were 4 restaurants. The result of analysis based on Keputusan Menteri Kesehatan RI Nomor 1098/Menkes/SK/VII/2003, total score of all variables on samples earned the lower score than minimum score. The sample that earned the highest score and close to minimum score after modification was SK (Saung Kuring) restaurant. The sample that earned lowest score was BK (Balai Kabayan) restaurant. Based on this research, all samples had no sertificate of hygiene and sanitation for restaurants. Most of samples had bad knowledge about hygiene and sanitation. Crosstabs showed that score of hygiene and sanitation tends to proportionate the number of consumer but inversely to knowledge of restaurant’s manager.
Keyword: Sundanese Restaurant, Sanitation, Hygiene

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