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: Paparan Btp Pengawet Dan Pemanis Pada Pangan Yang Dikonsumsi Anak Usia Sekolah Di Kota Pekanbaru, Riau
Abstrak: Bahan Tambahan Pangan (BTP) adalah bahan yang ditambahkan ke dalam pangan untuk mempengaruhi sifat atau bentuk pangan, tidak dimaksudkan untuk dikonsumsi secara langsung/tidak diperlakukan sebagai bahan baku pangan, baik yang mempunyai nilai gizi atau tidak. Jenis BTP yang banyak terdapat didalam produk pangan adalah pengawet dan pemanis terutama pada produk pangan industri yang biasa dikonsumsi oleh kelompok anak usia sekolah. Adanya peningkatan konsumsi suatu produk pangan, maka asupan BTP juga akan meningkat. Apabila BTP dikonsumsi secara berlebihan maka akan berdampak negatif terhadap kesehatan. Dengan memperhatikan hal tersebut diatas, untuk mengantisipasi penggunaan BTP dalam pangan yang semakin meluas, adanya isu keamanan pangan mengenai jenis pengawet dan pemanis yang digunakan, serta sebagai acuan dalam pengawasan, perlu dilakukan kajian paparan mengenai jenis BTP pengawet dan pemanis yang paling banyak dikonsumsi serta bagaimana paparan, dan analisis risikonya, sehingga dapat ditentukan apakah perlu atau tidaknya pengawasan lebih lanjut. Mengingat masih sedikitnya data kajian paparan BTP di tingkat nasional untuk menunjang penetapan batas maksimum BTP yang memadai. Penelitian ini bertujuan untuk mengetahui paparan BTP pengawet dan pemanis yang paling banyak dikonsumsi, karakteristik risikonya, dan kategori produk pangan apa yang paling berkontribusi berdasarkan nilai Theoretical Maximum Daily Intake (TMDI) untuk BTP pengawet dan pemanis serta nilai Estimated Daily Intake (EDI) untuk BTP pemanis yang diperoleh. Penelitian ini dilakukan melalui proses wawancara menggunakan metode 24-hours recall. BTP yang akan dipilih nantinya juga akan mempertimbangkan nilai ADI. Hasil penelitian menunjukkan bahwa secara umum rata-rata paparan BTP pengawet dan pemanis dari keseluruhan responden tingkat SD, SMP, dan SMA masih dibawah nilai ADI. Tetapi, jika dilihat berdasarkan TMDI per-responden terdapat total 103 responden (22.78%) dengan rincian: 77 responden SD (26.83%), 23 responden SMP (21.90%), dan 3 responden SMA (5.00%) yang tergolong risiko tinggi terhadap paparan benzoat dengan TMDI rata-rata 242.91 mg/org/hari (145.80% ADI). Sepuluh responden SD (3.48%) tergolong risiko tinggi terhadap paparan siklamat berdasarkan EDI atau berdasarkan kadar siklamat yang terdapat didalam produk dengan EDI rata-rata 344.41 mg/org/hari (120.88% ADI). Selain itu, terdapat 5 responden yang tergolong risiko tinggi terhadap paparan benzoat dan siklamat dengan rata-rata konsumsi benzoat 226.96 mg/org hari, dan konsumsi siklmat 362.42 mg/org/hari. Risiko yang diperoleh bisa lebih tinggi daripada hasil penelitian ini. Dalam penelitian ini, data yang diperoleh hanya berdasarkan produk pangan yang memiliki keterangan akan komposisi (ingredient) yang digunakan. Kategori produk pangan yang paling berkontribusi terhadap paparan BTP benzoat berasal dari kategori produk minuman kopi atau teh (64.30%) dan untuk pemanis siklamat berasal dari minuman serbuk (60.21%).
Keyword: kajian paparan, pemanis, pengawet, anak usia sekolah

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