Judul: Keberadaan Salmonella pada Daging Ayam yang Dijual di Pasar Tradisional di Kota Tangerang Selatan
Abstrak: This study was aimed to observe the presence of Salmonella in chicken meat sold in traditional markets in South Tangerang City. This research was conducted with survey method by interview the vendors of chicken meat as respondents, observation of markets condition using check-list, and sampling the chicken meat for Salmonella test. Total of 24 chicken meat samples was taken from three traditional markets, i.e., Modern Market, Bukit Market, and Jombang Market. The presence of Salmonella was performed using the isolation and identification test based on the Indonesian National Standard Number 2897:2008. The study showed that the Modern Market had the best criteria on the hygiene aspects compared to the other markets. The presence of Salmonella in chicken meat samples was 33.3% from Jombang Market (1 of 3 samples), 18.2% from Bukit Market (2 of 11 samples), and 10% from Modern Market (1 of 10 samples), with the total percentage of 16.7% (4 of 24 samples). The presence of Salmonella in chicken meat is associated with bad personal hygiene practices and the lack of cold chain from slaughterhouses to the markets. This condition requires attention from the government since Salmonella is the important foodborne pathogen that can threat the public health
Keyword: 

Judul: Cemaran Staphylococcus aureus pada Daging Ayam yang Dijual di Pasar-Pasar di Tangerang Selatan
Abstrak: The aim of this study was to observe the total of Staphylococcus aureus in chicken meat sold in markets in South Tangerang City. This study was conducted using survey method by interviewing the vendors of chicken meat as respondents and observation the condition of marketplaces using questionnaires and sampling the chicken meat for laboratory examination. Total of 24 chicken meat samples was obtained purposively from 3 traditional markets, i.e., Pasar Modern, Pasar Bukit, and Pasar Jombang, and was examined with the spread plate method (the plate count method). The result of observation showed that Pasar Modern had the best criteria of general hygienic practices. Nevertheless, the laboratory result found that the chicken meat samples from Pasar Modern showed the highest amount of S. aureus (1116.0 + 1461.0 cfu/gram) and it was followed by Pasar Bukit (618.2 + 1045.8 cfu/gram) and Pasar Jombang (433.3 + 665.8 cfu/gram), with the mean of 802.5 + 1194.2 cfu/gram. Compared to the maximum limit of microbial contamination according to the Indonesia National Standard (SNI 7688:2009), 80% of chicken samples from Pasar Modern were higher than the standard (maximum limit = 100 cfu/gram), and then 66.7% of samples from Pasar Jombang and 54.5% of samples from Pasar Bukit were higher than the standard. The high number of S. aureus contamination in chicken meat was supposed in relation with inadequate personal hygiene practices and lack of cold chain from poultry processing plant until marketplace. This condition should be considered as a risk of food intoxication for the consumers since the presence of S. aureus in food in high number could produce the toxin which is heat-stable.
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