Judul: Case Studies on Ayahbunda, Femina and Kartini Magazine, Nova and Nakita In The Period January – December 2009
Abstrak: One important aspect of food control is food labeling and advertising control. In Indonesia, control for the food advertising is done by National Agency of Drug and Food Control (NADFC). Based on our data, many adverstisement of food products do not comply with the formal regulation on labelling and advertising. . Analysis on 925 advertisements collected, 507 of advertisements (55%) were comply with the requirement and 418 of advertisements were not comply with the requirement. Among 425 of advertisements which were not comply with requirement complementary breast feeding (50,59%) were the most dominant, followed by soft drink (13,41%), and milk and its processed product (11,7%). The most dominant category of violations is an advertisement that containing incorrect and misleading information related to nutrition, health benefits and food safety (72,86%).
Keyword: 

Judul: Materi konsultasi gizi dan klaim iklan makanan di majalah dan tabloid Nasional
Abstrak: Iklan produk makanan terdiri dari 27,6% makanan, 47,7% minuman, 13,8% suplemen dan 10,9% bahan makanan. Umumnya sasaran iklan adalah masyarakat umum dan wanita. Jenis klaim yang paling sering dijumpai adalah 'lezat atau enak' dan 'gizi tepat'. 'Lezat atau enak' dan 'gizi tepat' diklaim oleh 40,8% produk, 'zat dengan fungsi khusus' diklaim oleh 28,7% produk, 'praktis' diklaim oleh 6,9% pro­ duk dan 'aman' diklaim oleh 6,3% produk. Terdapat dua iklan yang melanggar pasal 35 Peraturan Menteri Kesehatan No.79/MENKES/PER/ Ill/1978 tentang Label dan Periklanan serta Keputusan Men­ teri Kesehatan Nomor 386/ MENKES/SK/IV/1994 tentang Pedoman Peiklanan Obat Bebas, Obat Tradisional, Alat Kesehatan, Kosmetika, Perbekalan Rumah Tangga dan Makanan-Minuman pada Lampiran 4 yang menyebutkan bahwa periklanan makanan tidak boleh menjurus ke pendapat, bahwa makanan yang bersangkutan berkhasiat sebagai obat. Produk di atas berarti melanggar Undang-undang Pangan pasal 33 ayat J karena telah memberikan keterangan yang tidak benar dan menyesatkan yaitu mengklaim dapat mengatasi penyakit.
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