Judul: The Level of Knowledge and Behaviour of People in Babakan Village Bogor Regency to Vector and Dengue Haemorrhagic Fever Problem.
Abstrak: Penyakit Demam Berdarah Dengue (DBD) sampai saat ini masih merupakan masalah di Indonesia. Penyakit DBD, disebabkan oleh virus dengue dan ditularkan oleh nyamuk Aedes aegypti dan Aedes albopictus. Berbagai upaya telah dilakukan untuk mengendalikan vektor penyakit tersebut, seperti fogging, larvasidasi dan Pemberantasan Sarang Nyamuk (PSN). Upaya-upaya tersebut tidak akan berhasil optimal apabila kesadaran masyarakat untuk mengendalikan penyakit tersebut masih kurang. Penelitian ini bertujuan untuk mengetahui tingkat pengetahuan dan perilaku masyarakat di desa Babakan, kabupaten Bogor terhadap masalah vektor dan penyakit DBD. Penelitian ini dilakukan pada Februari-Oktober 2010. Sebanyak 287 orang dipilih secara acak dan dijadikan sebagai responden yang mampu menjawab kuesioner (modifikasi DEPKES 2007). Jawaban responden diperoleh melalui wawancara langsung. Kategori pertanyaan terdiri atas data umum karakteristik responden, pengetahuan terhadap masalah vector dan penyakit DBD, perilaku pencegahan terhadap DBD dan bentuk penyuluhan yang diharapkan responden. Data mengenai kasus DBD diperoleh dari Puskesmas Cangkurawok dan Klinik Farfa, sedangkan data curah hujan dari BMKG Bogor. Hasil penelitian menunjukkan kasus DBD di Desa Babakan terjadi sepanjang tahun, dengan persentase tertinggi (37%) diderita oleh kelompok usia 19-40 tahun. Kebanyakan (68%) masyarakat Desa Babakan mempunyai tingkat pengetahuan terhadap masalah vektor dan penyakit DBD yang kurang, 30% sedang dan 2% baik. Selain itu, 53% masyarakat mempunyai perilaku terhadap pencegahan dan pengendalian DBD dalam kategori sedang, 45% buruk dan 2% baik. Adapun bentuk penyuluhan yang paling diharapkan oleh responden untuk penyampaian informasi DBD adalah melalui media televisi dengan bentuk iklan layanan masyarakat yang disampaikan oleh petugas kesehatan masyarakat.
Keyword: 

Judul: Pengetahuan, Sikap, dan Perilaku Masyarakat Desa Laladon Kabupaten Bogor terhadap Masalah Vektor dan Penyakit Demam Berdarah Dengue
Abstrak: Laladon village, Bogor Regency is a Dengue Haemorrhagic Fever (DHF) endemic areas, due to overcrowding, poor housing quality, and increasing transportation. This research aimed to measure the level of knowledge, attitudes, and practices of the community in Laladon village, Bogor Regency regarding to dengue fever. 196 respondents were interviewed using questionnaires contained questions about knowledge, attitudes, and practices. The data were analized with SPSS program version 16.0 to examine the relationship between knowledge, attitudes, and practices of respondents to DHF. The results indicated that most of the respondents have low score of knowledge, medium score of attitudes, and also medium score of practices. In addition, the relationship between the level of knowledge and the practices (p= 0.000, p<0.05) was positive, but there was no correlation between the level of knowledge with attitudes, and also between the attitudes with practices
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