Judul: Peluang Terjadinya Diare Akibat Konsumsi Produk Hewani di Kecamatan Bogor Barat
Abstrak: Diarrhea is still one of public health’s major problems in Indonesia, both in terms of morbidity or death. The main risk factor of diarrhea and foodborne disease cases is due to consumption of animal products with poor handling, including cross contamination from raw food to cooked products, insufficient cold storage temperature, insufficient temperature and cooking time, and poor handling process after the cooking process. Therefore, it is necessary to determine exposure opportunities because of animal products. Those exposure opportunities are calculated based on the number of attack risk (AR), which shows the percentage of exposed people who get diarrhea when they are eating or not eating certain types of animal products. While the relative risk of animal products that can cause diarrhea is calculated based on comparison attack risk (AR) an exposed people who eating or not eating certain types of animal food products. It is also known as relative risk (RR). Based on survey on 400 respondens (housewifes) in West Bogor, there are six main animal food products that cause diarrhea. There products are baked fish, seasoning chicken, and semur meat. The result showed that the animal food products infection are baked fish (RR=4.11), seasoning chicken (RR=3.58), semur meat (RR=1.85), baked chicken (RR=1.76), seasoning fish (RR=1.53), and salt fish (RR=1.31). The highest RR value has great effect to cause numbers of diarrhea incidence due to consumption of animal products.
Keyword: 

Judul: Bakteri Enteropatogen pada Penderita Diare dan Kondisi Higiene Sanitasi Lingkungan Inang di Kecamatan Cigudeg Kabupaten Bogor
Abstrak: Diarrhea is still be one of the top ten disease that occur in Indonesia. Some bacterial enteropathogens are diarrhea-causing bacteria, such as Salmonella sp., Shigella sp., and Vibrio cholerae. The spread of diarrheal diseases caused by poor personal hygiene and environmental sanitation. This study aims to assess the presence of bacterial enteropathogens, personal hygiene, and environmental sanitation of diarrheal patients in Cigudeg District of Bogor Regency West Java. Stool samples from 50 diarrheal patients have been identified the presence of its bacterial enteropathogen. Personal hygiene observations conducted on 50 diarrheal patients and its settlements environmental-sanitation. The results of the stool’s identification of diarrheal patients showed 2 isolates of Salmonella sp., and 2 isolates of Shigella sp., but there were no V. cholerae. Analysis of personal hygiene showed as much as 60.1% of respondents did not wash their hands with soap before eating. Hygiene’s data of food and beverage sanitation behavior suggested that as many as 85.1% of respondents eat their food about 1-12 hours after it been cooked. Observations showed the state of environmental sanitation related sanitary sewer waste water was not good.
Keyword: Shigella sp., V. cholerae, sanitation, Salmonella sp., Diarrhea

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