Judul: Study on Melamine Contaminant on Food Product and Its Regulatory in Indonesia
Abstrak: In September 2008 there was reports of the incident of melamine tainted milk and milk products in Cina which was afraid marketed in Indonesia. At the time the case of melamine tainted on food was unusual and was a new emerging about food adulteration where the regulation are not established. Therefore the objective of this research was to conduct the study of probability melamine contamination on food and its regulatory in Indonesia. The steps of research were collecting data and references, regulations and result of laboratory testing on melamine on food in Indonesia. Melamine contamination on some food products origin of Cina or raw material that used from Cina. Melamine contaminated milk, candy, snack, preserved egg ‘pitan’, egg powdered and ammonium bicarbonate. Level contaminant is 8.51 mg/kg on soymilk drink to 945.86 mg/kg which found on milk candy which imported from Cina, 0,1 mg/kg and 0,16 mg/kg on pitan egg, 0.13 mg/kg to 7.05 mg/kg on powdered egg and 0.178 to 2.74 mg/kg on biscuits ex Malaysia. The Melamine also found on ammonium bicarbonate as 67.71 mg/kg and 75.98 mg/kg. From 72 samples of infant formula registered in Badan POM, melamine was not detected. The products consisted of 40 samples of domestic product and 32 samples of imported from United States (2 products), Netherland (8 products), Philipphine (6 products), Germany (1 product), Malaysia (1 product), New Zealand (6 product), Singapore (4 product), Spain (2 product), Switzeerland (2 product). Melamine was not detected in raw material of milk powder in milk premise.
Keyword: 

Judul: Review on food microbiological standard in Indonesia
Abstrak: Microbiological standards for processed food in Indonesia are regulated by the Head of NADFC in Decree No. POM. HK.00.06.1.52.4011 2009 pertaining Microbial and Chemical Contamination Limit in Food and by the Indonesian National Standard (SNI). In the implementation, there were several obstacles and some criteria could not be met because they were too stringent or the testing methods were not available. The purpose of this study was to compare the fulfillment of microbiological standards of Indonesia and some other countries in the world against the rules of CAC microbiology criteria, to review microbiological criteria of priority foods and to provide recommendations for their microbiological criteria. The study was conducted by comparing and analyzing the microbiological criteria from Indonesia and 10 other countries, namely Australia and New Zealand, Europe, Philippines, Malaysia, Canada, Hongkong, India, Japan, Singapore and South Africa and recommendation by Codex Alimentarius Comission (CAC) Principles for The Establishment and Application of Microbiological Criteria for Foods (CAC/GL 21-1997). As the case studies, several foods were selected based on several obstacles occurred and their criteria and studied as above. The results showed almost all countries have not comply the rules. The study also showed that Indonesia’s standard for bottled/packaged drinking water, instant coffee and canned food need revision. There were two maximum limit of TPC and discrepancies with the analytical method requirements on drinking water. Forthe purpose of verification of the production process and lot acceptance, it is recommended to set one maximum limit of TPC. The recommendation for TPC sampling plan for drinking water is a three-class sampling plan with n = 5 and c = 2 and a maximum of m = 102 cfu/mL and M = 105 cfu/mL. Analytical methods that can be refered to is ISO or analytical methods other than that specified in the standard, provided that the method of analysis has been validated for its equivalent sensitivity, reproducibility and reliability based ISO/TR/13843 of Water quality-Guidance on validation of microbiological methods. The nature of instant coffee as dry food does not support microbial growth.To anticipate of bad sanitation and hygiene practices, the determination of the maximum limits and sampling plansfot instant coffee can be proposed by a three-class sampling plan with n = 5, c = 2, m = 103 cfu/g and M = 105 cfu/g. While the sampling plan for mold in instant coffee are three-class sampling plan with n = 5, c = 2, m = 102 cfu/g and M = 103 cfu/g. Determination of microbiological criteria in canned food is irrelevant. Commercially sterile process food has a very low number of microorganisme that the criteria can not be applied.It is recommended to simply set adequacy compliance requirements with commercial sterilization process is the test incubation.
Keyword: CAC, microbiological criteria, regulations, sampling plan, standard

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