Judul: Pengaruh Gaya Pengasuhan dan Teman Sebaya terhadap Perilaku Konsumsi Rokok dan Minuman Beralkohol Siswa SMA di Kota Bogor.
Abstrak: Smoking and drinking are risky behavior for adolescence, and there are family, peer, and school that play a role in the formation of adolescent behavior. This research aimed to analyze the influence of parenting style and peer relations with smoking and drinking behavior among high school student in Bogor. This research was conducted in six schools and data was collected on May until June 2012. The sampling of this research was 200 adolescents consisted of 100 boys and 100 girls that was selected by random sampling technique. The sample criteria of this research were grade 10 students and came from an intact family. The Result showed , prevalence of adolescent’s smoking behavior was 18.5 percent and prevalence for adolescent’s drinking behavior was 13 percent. There was no relation between parenting style with adolescent’s smoking and drinking behavior. There was relation between peer drinking behavior with their’s drinking behavior. Gender was related with adolescent’s smoking and drinking behavior. Logistic Regression analyses showed that gender, peer relations, and perception to smoking and drinking significantly influenced to smoking and drinking behavior. Which means that boys riskier to smoking and drinking behavior, and the stronger peer relations and perception toward smoking and drinking behavior riskier to their’s smoking and drinking behavior. Meanwhile Family income positively influenced to drinking behavior.
Keyword: 

Judul: Pengaruh Keterlibatan Ayah dalam Pengasuhan, Interaksi Teman Sebaya, dan Motivasi Merokok Terhadap Perilaku Merokok Remaja
Abstrak: Penelitian ini bertujuan menganalisis pengaruh keterlibatan ayah dalam Pengasuhan, interaksi teman sebaya, dan motivasi merokok terhadap perilaku merokok remaja. Pengambilan data penelitian dilakukan di Kabupaten Bogor, Jawa Barat. Desain penelitian ini adalah cross-sectional study. Contoh dalam penelitian, yaitu remaja perokok berusia 13 sampai 20 tahun yang tinggal bersama ayah dan memiliki teman sebaya perokok. Jumlah contoh dalam penelitian ini adalah 42 remaja yang terpilih secara accidental sampling. Pengumpulan data dilakukan dengan wawancara menggunakan instrumen berupa kuesioner. Hasil penelitian menunjukkan bahwa lebih dari separuh ayah memiliki keterlibatan dengan kategori sedang dan lebih dari separuh contoh berinteraksi dengan teman sebaya pada kategori sedang. Lebih dari separuh contoh berada pada kategori rendah pada variabel motivasi merokok dan seluruh remaja berada pada kategori perokok ringan. Penelitian menemukan bahwa terdapat hubungan signifikan antara pendapatan ayah, usia remaja, variabel interaksi teman sebaya, dan motivasi merokok dengan perilaku merokok remaja. Perilaku merokok remaja dipengaruhi oleh variabel interaksi teman sebaya, motivasi merokok, dan pendapatan ayah.
Keyword: keterlibatan ayah, teman sebaya, motivasi merokok, perilaku merokok remaja.

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