Judul: RISIKO PAPARAN KADMIUM DARI COKELAT BATANG PADA KONSUMEN DI INDONESIA
Abstrak: Cadmium is a common contaminant found in cocoa derivative products such as chocolate bars because it is carried away from the cocoa beans. The popularity of chocolate bars among Indonesian consumers may pose a health risk due to cadmium (Cd) content in chocolate bars. The present study aimed to obtain the cadmium (Cd) content in chocolate bars and its dietary exposure to the Indonesia population. Samples of 10 different varieties of chocolate bars were collected from markets in Indonesia and analyzed for their Cd content using Inductively Coupled Plasma-Mass Spectrometry (ICP-MS). The results show that Cd content in chocolate bars ranged between 0.00012 mg/kg to 0.12 mg/kg with the highest content was found in one variant of sweet dark chocolate bar. None of samples contained Cd above the maximum limits of Cd (0.5 mg/kg in chocolate bar products) as regulated by NADFC. The highest average consumption of chocolate bars was found in adolescence (13-18 years), followed by toddler (6-59 months) and children (5-12 years). The highest P95 exposure to Cd from chocolate bars was found in toddler (6-59 months), followed by children (5-12 years), 0.28733 μg/kg bw/day and 0.17846 μg/kg bw/day. The P95th exposures to Cd from chocolate bars in all age groups did not exceed its Provisional Tolerably Monthly Intake (PTMI), indicating that the exposure to Cd through chocolate bar products do not pose any potential risk to human health
Keyword: 

Judul: Estimation of Cadmium Risk from Milk Products Containing Cacao for Consumers of Children aged 1 to 5 Years, Pregnant and Lactating Women.
Abstrak: Kakao bubuk merupakan salah satu bahan hasil pengolahan biji kakao yang digunakan dalam produk susu untuk anak usia 1 hingga 5 tahun, ibu hamil dan ibu menyusui (IHIM). Sebagian besar biji kakao dan hasil olahannya yang berasal dari Amerika Latin ditemukan melebihi peraturan UE 2021/1323, yaitu maksimal 600 µg/kg (kakao bubuk yang dijual pada konsumen akhir atau sebagai bahan pada minuman cokelat). Penelitian ini bertujuan memperkirakan paparan dan risiko Cd dari produk susu yang mengandung kakao (susu rasa cokelat) pada konsumen rentan. Paparan Cd dilakukan dengan metode deterministik, yaitu menggunakan konsentrasi Cd, tingkat konsumsi dan berat badan konsumen. Data konsumsi diperoleh dari data SKMI tahun 2014. Karakterisasi risiko dilakukan dengan membandingkan paparan Cd dengan nilai PTMI-JECFA (25 µg/kg BB/bulan) dan TWI-EFSA (2,5 µg/kg BB/minggu). Penelitian dilakukan pada 63 produk susu rasa cokelat, yang terdiri dari susu bubuk anak usia 1 – 3 tahun (n=6), susu bubuk anak usia 3 – 5 tahun (n=12), susu cair (n=9), susu kental manis/SKM (n=9) dan susu bubuk IHIM (n=27). Pengujian kadar Cd juga dilakukan pada produk susu rasa non-cokelat (n=15). Kadar Cd pada produk susu diuji dengan metode SSA-TG, dengan limit deteksi 0,023 µg/kg. Kadar Cd dari kakao bubuk dari PT. XYZ (n=9) juga dianalisis dengan metode SSA, dengan limit deteksi 12 µg/kg. Hasil yang diperoleh masih memenuhi persyaratan BPOM (maksimal 850 µg/kg), yaitu dalam kisaran 284,8 – 781,5 µg/kg. Kadar Cd pada susu bubuk untuk anak usia 1 hingga 5 tahun, susu cair, dan SKM, masih memenuhi persyaratan BPOM, dengan kisaran 0,73 – 6,42 µg/kg. Namun, pada susu bubuk IHIM rasa cokelat, terdapat 17 dari 27 sampel (63%) melebihi regulasi BPOM (10 µg/kg) dengan kisaran 4,60 – 30,51 µg/kg. Susu bubuk IHIM rasa non-cokelat mempunyai kadar Cd yang lebih rendah (0,78 – 1,96 µg/kg). Paparan Cd pada produk susu rasa cokelat lebih tinggi daripada produk susu rasa non-cokelat. Paparan Cd per minggu dan per bulan pada P95 yang tertinggi terjadi pada susu bubuk anak usia 3 hingga 5 tahun yang mencapai 1,057 µg/kg BB/minggu dan 4,529 µg/kg BB/bulan. Pada konsumen IHIM, paparan Cd per minggu dan per bulan yang diperoleh mencapai 0,082 µg/kg BB/minggu dan 0,353 µg/kg BB/bulan. Nilai risiko terhadap PTMI dan TWI yang tertinggi terjadi pada susu bubuk anak usia 3 – 5 tahun rasa cokelat, dengan kontribusi 18,12 dan 42,27%. Risiko tertinggi berdasarkan konsumsi P95 (skenario A) diperoleh nilai 11,13 dan 25,98% (produk susu cair), sedangkan dari konsumsi tertinggi saran penyajian (skenario B) diperoleh 9,80 dan 22,86% (produk susu bubuk anak usia 1 hingga 3 tahun). Pada susu bubuk IHIM, nilai risiko PTMI dan TWI tertinggi mencapai 10,11 dan 23,60% (skenario B). Nilai ini masih di bawah 100%, sehingga dianggap ada kecenderungan untuk tidak menimbulkan masalah kesehatan pada konsumen anak-anak usia 1 hingga 5 tahun dan IHIM.
Keyword: cocoa powder, deterministic, exposure, milk products

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