Judul: Penyusuoan Food Control Handbook Badan Pengawas Obat dan Makanan: Kajian Monitoring Garam Beryodium di Tingkat Peredaran
Abstrak: Pangan adalah segala sesuatu yang berasal dari sumber hayati dan air, baik yang diolah maupun tidak diolah, yang diperuntukkan sebagai makanan atau minuman bagi konsumsi manusia termasuk bahan tambahan pangan, bahan baku pangan dan baban lain yang digunakan dalam proses penyiapan, pengolaban dan atau pembuatan makanan atau minuman.
Keyword: 

Judul: Kajian Sistem Pengawasan Keamanan Pangan Oleh Badan Pengawas Obat dan Makanan (Badan POM) Republik Indonesia
Abstrak: “Food nutrition and safety are the right of individuals and government has the responsibilty to assure that the need is adequately fulfilled”,was a statement made during FAO/WHO International Conference on Nutrition (ICN), Rome, 1992. In Indonesia, the safety of processed food is controlled by the National Agency of Drug and Food Control (NADFC) through regulations and policies developed in the country. The purposes of this study are (1) to determine the food control systems established by the NADFC, (2) to evaluate the implementation of the systems, and (3) to make recommendations for improvement of the existing systems. The research was conducted as follows: (1) identification of food safety control sytems by the NADFC, (2) identification and implementation result of food safety control systems by the NADFC, (3) to assess the adequacy of the systems and its implementation, and (4) make the recommendations for improvement of the existing systems. Data were collected from data in the NADFC. The study shows that the NADFC establishes a safety control system of the marketed food products in Indonesia by controlling the foods before and after foods are being marketed. As a preventive control, the pre-market assessment for processed food is done by evaluation of the nutrition content, hazards, production process, and the manufacturer. The pre-market control depends on the ability and competence of human resources as food evaluators as well as networks with other agencies responsible for certification system (GMP, HACPP, etc). The postmarket control is carried out by Technical Implementation Unit Provincial Office of NADFC in Indonesia that conducts inspection of food production facilities, food distribution facilities, as well as food sampling and testing. The activities are conducted using guidelines and technical guidance from the NADFC. The activities of post-market control is not adequately coordinated and orthoroughly analyized. Better coordination and analysis are needed to enable NADFC to evaluate the results of the post-market control thus they can be used toward program establishment in the future such as sampling priority and management of certain contaminants.
Keyword: 

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