Judul: Kajian Paparan tartrazin Dengan Metode Survei Frekuensi Konsumsi Pangan di Wilayah Jakarta Utara
Abstrak: Stipulating of maximum level of tartazin in food should be conducted to anticipate more usage of food additive, food safety issue and reference in food inspection. However to support adequate stipulating, the avaibility of exposure assesment to food additives stills very few in Indonesia. Tartrazine is one of the most food additives is often used in food product which have enlisted in National Agency for Drug and Food Control (NADFC). Therefore, the objective of this research was to conduct the exposure assesment of tartrazine from food products which have enlisted in NADFC by using food frequency method to respondent in North Jakarta. The steps of research were survey preparation, food consumtion survey, data processing and data analysis. The data of exposure assesment was cotained from food consumption survey to 150 respondents representing groups of children, teenagers and adults. The results of this research showed that mean value of food consumption containing tartrazine by all consumers in total population groups was 306.38 person/day. The higgest mean consumption in total population groups was by children due to their higher frequency and portion food consumption. The five highest food containing tartrazine which were consumed by all consumers in total population groups were instant noodles, powder concentrate for beverages, non-carbonated beverages, carbonated beverages and biscuits. All exposure assesment at this research did not exceed the Acceptable Daily Intake (ADI). The mean value of exposure by all consumers in total population groups was 231.24 miu g/kg BW (3.08%ADI). The highest mean value exposure in total population groups was by children due to their higher food consumption and their lower body weights. The major contributing foods to tartrazine exposure were instant noodles, non-carbonated beverages, powder concentrate for beverages, biscuits and snacks. Instant noodleshad the highest mean value of consumption and tartrazine exposure for all population groups in North Jakarta. Consumer which had the higest mean value of consumption and tartrazine exposure was by children. There were some foods which were relative low consumed but high tartrazine exposure such as snacks. It indicates that exposure assesment of tartrazine not only depends on food consumption containing tartrazine but also determined by tartrazine level in food
Keyword: 

Judul: Kajian Paparan Bahan Tambahan Pangan Berdasarkan Data Konsumsi Pangan Individu di Kabupaten Bogor
Abstrak: Kajian Paparan Bahan Tambahan Pangan (BTP) Berdasarkan Data Konsumsi Pangan Individu yang dilaksanakan di Kabupaten Bogor merupakan salah satu bentuk usaha Badan Pengawas Obat dan Makanan (Badan POM) dalam pengembangan metode kajian paparan serta merupakan bentuk tanggung jawab Badan POM sebagai institusi yang bertugas untuk mengawasi, mengendalikan peredaran dan penggunaan BTP di Indonesia. Tujuan kajian ini adalah memperkirakan tingkat konsumsi dan paparan BTl' yang meliputi benzoat, sakarin, siklamat dan beberapa pewarna. Keluaran kajian ini dapat digunakan sebagai dasar ilmiah (scientific based evidence) dalam evaluasi peraturan penggunaan BTP di Indonesia sekaligus memberikan basis data dalam pelaksanaan kajian paparan BTl' dengan metode TDS (Total Diet Study). Komponen utama dalam kajian paparan ini adalah data konsumsi pangan dan data konsentrasi BTl' pacta prod uk. Pengumpulan data konsumsi pangan dalam kajianpaparan ini dilaksanakan dalam kegiatan Survei Konsumsi Pangan untuk Kajian Paparan BTl' (SKp2003). Metode yang digunakan dalam pengumpulan data konsumsi pangan adalah metode mengingat-ingat konsumsi pangan (Dietmy Recall Method) yang dikombinasikan dengan metode buku harian konsumsi pangan (Food Dim)' Method) selama 3 hari berturut-turut. Responden sebanyak 270 orang dipilih dcngan teknik acak distratifikasi (strati/ied random sampling) yang proporsional dengan komposisi penduduk berdasarkan kelompok umur dan jenis kelamin di 10 blok sensus dalam 10 kecamatan terpilih di kabupaten Bogor. Penentuan konsentrasi BTl' pada produk, menggunakan metode estimasi konsentrasi BTP tertinggi yang diijinka!1 dalarn peraturan nasional (Permenkes No. 722/Menkes/Per/IXl1988) atau disebut level nasional dan GSFA (General Standard/or Food Additives) atau disebut level GSF A. Bahan pangan yang dikonsurnsi responden SKP2003 dikelompokkan dalam 16 kategori utama dan 69 sub-kategori pangan GSF A dan digunakan sebagai database pangan dalam penggunaan program (software) FACNEA (Food Additive, Contaminant and Nutrition Exposure Assessment). Keluaran program FACNEA yang menjadi bahasan utama dalam penelitian ini adalah tingkat konsumsi dan paparan BTl' seluruh responden dan responden anak-anak usia 6 - 12 tahun. Tingkat konsumsi dan paparan benzoat pada level nasional baik seluruh responden maupun kelompok anak-anak bel urn melarnpaui batas aman konsumsinya (JECFA ADI benzoat = 5 mglkg BB hari), namun pada level GSFA telah terlampaui oleh pengkonsurnsi tinggi (95th ) yang mencapai 13.48 mg/kg BB per hari (270 %) pada seluruh responden dan pada kelompok anak-anak mencapai 13.01 mglkg BB per hari (260 %). Sub kategori produk yang memberikan kontribusi yang besar terhadap paparan benzoat adalah pasta, mie dan produk sejcnisnya (06.4), roti atau bread dan sCJemsnya (07.1) serta mmuman tidak beralkohol (14.1). Tingkat konsumsi dan paparan sakarin pada level nasional belum me1ampaui nilai AD! sakarin (JECF A AD! sakarin = 5 mglkg BB hari) baik seluruh responden maupun kelompok anak-anak, namun pada level GSFA telah terlampaui pada tingkat konsumsi tinggi (95 tl1 ) yaitu 9.12 mglkg BB per hari (182 %). Rata-rata tingkat konsumsi dan paparan sakarin pada kclompok anak-anak lebih besar daripada seluruh responden baik pada level nasional maupun level GSFA. Evaluasi peraturan penggunaan sakarin GSFA disarankan perlu dilakukan pada sub kategori es yang dapat dimakan termasuk sherbet dan shorbet (03.0) dan minuman tidak beralkohol (14.1). Tingkat konsumsi dan paparan siklamat pada level nasional ternyata lebih besar dari pada level GSF A dan telah melampaui nilai AD! siklamat (JECF A AD! siklamat =
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