Judul: Kajian Paparan Bisphenol-A dari Botol Susu Polikarbonat dalam ASI dan Air pada Bayi
Abstrak: Polycarbonate bottles milk is one of the packaging used to store breast milk. Polycarbonate is the result of polymerization of phosgene and bisphenol A (BPA) that can make plastic to be more transparent, stronger and moreimpact resistant. BPA is carcinogenic and then it can give bad damage for human health even if it is used in very small doses. The study was conducted to determine distribution of respondents who use polycarbonate bottles in Indonesia. It is also to find the effect of bottles pre-treatment before use, including method of sterilization, time and temperature to store the milk and method of milk preparing. Data of the average of baby food intake and baby drinking frequency was recorded and the value of the existing BPA exposure was estimated. From the calculated, it is known that the value of BPA exposure is about 0,00005 mg/kg body weight / day and 0,000002 mg/kg body weight / day for into breast milk water respectively. This value is still below standard tolerances established by the International European Food Safety Authority (EFSA) in 2006 amounted to 0,05 mg / kg body weight / day as Tolerable Daily Intake.
Keyword: 

Judul: Perbandingan migrasi monomer bisfenol A (BPA) pada air minum kemasan plastik polikarbonat (PC) dan polietilena tereftalat (PET): Kajian meta-analisis
Abstrak: Bisfenol A (BPA) merupakan bahan kimia yang umum digunakan dalam pembentukan plastik polikarbonat dan epoksi resin. Plastik tersebut kemudian dijadikan kemasan pangan seperti botol air minum dan botol susu bayi. BPA diketahui dapat bermigrasi dari kemasan botol polikarbonat (PC) dan polietilena tereftalat (PET) ke air minum. Batas toleransi (TDI) BPA awal menurut European Food Safety Authority adalah 50 μg/kg berat badan per hari dan direvisi menjadi 0,2 ng/kg berat badan per hari pada tahun 2023. Sementara tingkat migrasi BPA di botol PC dan PET ditemukan sangat beragam dengan masing-masing total migrasi d apat mencapai 6452,80 ng/L d an 269,87 ng/L. Penelitian ini bertujuan membandingkan jumlah migrasi BPA pada air minum kemasan PC dan PET dengan menggunakan metode meta-analisis. Hasil penelitian menunjukkan tingkat migrasi BPA yang lebih tinggi pada air yang dikemas menggunakan botol PET dengan nilai overall effect size -8,114. Terdapat berbagai variabel yang mempengaruhi migrasi BPA meliputi suhu, lama penyimpanan, perbedaan negara produsen botol air minum, volume air dan paparan sinar matahari. Uji bias publikasi pada funnel plot berbentuk simetris sehingga tidak ada bias publikasi pada penelitian ini. Hal tersebut diperkuat melalui perhitungan fail-safe number (Nft) yang memperoleh nilai Nft> 5N + 10 berarti bias publikasi rendah dan model meta-analisis kuat.
Keyword: bisphenol A (BPA), drinking water, monomer migration, polyethylene terephthalate (PET), polycarbonate (PET)

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