Judul: Penentuan Titik Kritis pada Pangan Jajanan Anak Sekolah Berbasis Perikanan di Kota Bogor
Abstrak: Pangan jajanan berbasis perikanan seperti siomay, otak-otak, pempek banyak dijual di sekitar sekolah. Penelitian ini bertujuan untuk mengidentifikasi titik kritis pada rantai penyediaan pangan jajanan berbasis perikanan agar potensi cemaran fisik, mikrobiologi maupun kimia dapat ditangani secara tepat. Penentuan titik kritis dilakukan dengan cara mengidentifikasi potensi bahaya yang muncul pada setiap tahapan proses kemudian berdasarkan bahaya yang teridentifikasi signifikan ditentukan titik kritisnya. Titik kritis terdapat pada tahap pembelian bahan baku karena potensi histamin, utamanya dari ikan golongan scromboid seperti tenggiri, tuna dan tongkol. Pemasakan merupakan tahapan kritis untuk mengatasi bahaya mikrobiologi seperti Salmonella sp., Vibrio sp., S. aureus, E. coli, L. monocytogenes, parasit dan virus. Selain itu bahaya kimia berupa aflatoksin yang potensial terdapat pada sambal kacang dan Rhodamin B yang potensial terdapat pada saus cabai merupakan penyebab tahap penambahan bahan pelengkap pada saat penyajian menjadi titik kritis. Adanya migrasi monomer dari : kemasan plastik, melamin dan styrofoam perlu diwaspadai.
Keyword: Critical point, Food for school children, Fisherish product, Food science and technology, Hasil perikanan, Rantai penyediaan pangan, Potensi bahaya, PJAS

Judul: Penilaian Kantin Sehat Pangan Jajanan Anak Sekolah di Kota Depok
Abstrak: In order to promote the consumption of healthy food, Depok health service held a healthy canteen program assessments undertaken annually and coorporated with Bogor Agricultural University and National Agency of Drugs and Foods Controls. The healthy canteen assessment was consist of chemistry and microbiological analyses on food snacks sold in school canteens and also the aspects of physical building conditions. Canteen assessment was followed by 11 elementary schools, each school represented subdistrict. Heavy metals contamination analysis which was plumbum, food addictive which was cyclamate acid, and hazardous material such as formaline, borax, rhodamine B and methanil yellow. Microbiological analysis of E.coli and Salmonella. Healthy canteen assessment using the reduction value system was done if the parameters analyzed were detected. SD A4, A7, A8, SD and SD A11 earned the highest score,while SD A2 and A10 earned the lowest score.
Keyword: school, healthy canteen, food

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