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: Kajian Kesesuaian Iklan Produk Pangan di Media Cetak Terhadap Peraturan Perundang-undangan yang Berlaku: Studi Kasus pada Tabloid NOVA, Majalah Kartini, dan Majalah Ayahbunda Periode Penerbitan April – September 2012
Abstrak: Advertising is a form of marketing strategy done by company so that the product can be quickly recognized and accepted by society. Oversight of food advertising is necessary because the delivery of products information is often done incomplete or redundant, violating the ethics of advertising, consumer misleading, biased, or even mislead consumers with claims that are not scientifically proven. This study aims to build decision tree as evaluation tool based on several advertising regulations, to evaluate the suitability of food advertising in media using decision tree that has been built, and to evaluate the variety of violations occur on food advertising in print media selected. The research was done through post-market evaluation of food advertisements contained on three types of media selected, namely Tabloid NOVA, Magazines Kartini, and Ayahbunda Magazine during the period April to September 2012. The study produced decision tree for nine categories of general violations and five categories for specific violations based on eight food regulations. Evaluation on 457 food ads shows 139 ads (30,42%) 100% comply the legislations and the rest 318 (69,58%) do not 100% comply the legislations. The most dominating food category is category of dairy products and analogues (32,60% of the total ads evaluated) and the most dominating violation category is first category of violations for specific categories of food products (28,88% of the total ads evaluated are not 100% complied for the violation category). The high level of violation ads published in the print media, especially the tabloids and magazines evaluated due to the number of laws and regulations of food advertising which has not been supported by good socialization, lack of awareness of industry and advertising agencies on the importance of law enforcement, and the weak monitoring of compliance with the legislations.
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