Judul: Pengaruh pengasuhan orangtua dan teman sebaya terhadap perilaku konsumsi Napza pada remaja
Abstrak: Perilaku konsumsi narkotika, alkohol, psikotropika, dan zat adiktif atau biasa di sebut dengan napza sudah sangat mengkhawatirkan di Indonesia, khususnya pada kalangan remaja. Penelitian ini memiliki tujuan untuk mengetahui pengaruh gaya pengasuhan orang tua dan teman sebaya terhadap perilaku konsumsi napza pada remaja. Populasi dalam penelitian ini adalah siswa kelas sepuluh dan sebelas SMK X di Kota Bogor, dan melibatkan 61 contoh menggunakan purposive sampling dengan karakteristik yang pernah mengkonsumsi napza. Hasil penelitian frekuensi pengkonsumsian napza remaja berada pada kategori kurang dari satu kali dalam satu minggu, dengan proporsi terbesar jenis napza yang sering dikonsumsi adalah alkohol dan ganja. Hasil penelitian menunjukan lebih dari separuh (52.46%) ayah menerapkan gaya pengasuhan permisif, sedangkan lebih dari separuh ibu (63.93%) menerapkan gaya pengasuhan otoritatif. Hasil uji regresi menunjukan gaya pengasuhan otoritatif ayah berpengaruh positif terhadap perilaku konsumsi napza pada contoh. Pengaruh positif lain pada pengkonsumsian napza juga datang dari kedekatan teman sebaya. Sementara itu, gaya pengasuhan otoriter ibu berpengaruh negatif pada perilaku itu., Consumption behavior of narcotics, alcohol, psychotropic and addictive substance or commonly called drugs is very worrying in Indonesia, especially on adolescent. This study aimed to analyze the influence of parenting styles and peer groups on drugs consumption of adolescent behavior. The population of this study were students of class ten and eleven of SMK X in Bogor City, and involved 61 sample’s taken purposively with characteris tic have ever consumed drugs. Result showed drugs consumption frequency was on less than once in a week category, with highest proportion of most frequent drugs were alcohol and marijuana. Result showed that more than half of sample’s fathers applied permissive parenting, whereas more than half of sample’s mothers applied authoritative parenting style. Regression analysis discovered father’s authoritative parenting style positively effected on sample’s drugs consumption. Another positive influence on drugs consumption also came from peers. Meanwhile, mother’s authoritarian parenting style negatively influenced on that behavior.
Keyword: Gaya Pengasuhan, Napza, Teman Sebaya

Judul: Hubungan Pola Interaksi dengan Motif Penyalahgunaan Narkotika, Psikotropika, dan Zat Adiktif (Napza) Di Kalangan Remaja
Abstrak: Indonesia has a fairly long history on the issue of child and adolescent delinquency that has now entered the critical points. One of the worrying problem is the case of drug abuse (narcotics, psychotropic and addictive substances). This study aimed to describe the individual characteristics and family characteristics, patterns of interaction adolescent drug abusers, analyze motives drug abuse, as well as analyzing the interaction patterns of relationship with drug abuse patterns. This study examines two patterns of adolescent drug abusers, there are the family interaction patterns and friendship interaction pattern. The results showed that both family interaction patterns and interaction patterns of friendship has a relationship with drug abuse patterns.
Keyword: motifs of drug abuse, patterns of interaction, drug

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