Judul: The Influence of Parental Attachment and Friendship Quality on Adolescents Character in Bogor City.
Abstrak: Karakter yang terbentuk pada diri seseorang dipengaruhi oleh berbagai aspek baik dari dalam maupun dari luar diri seseorang. Keluarga dan teman sebaya merupakan lingkungan terdekat bagi seorang remaja yang memengaruhi pembentukan karakternya, salah satunya melalui kelekatan yang diberikan orang tua dan kualitas pertemanan yang dimiliki oleh remaja. Penelitian ini bertujuan untuk menganalisis pengaruh kelekatan orang tua dan kualitas pertemanan terhadap karakter remaja di Kota Bogor. Penelitian ini menggunakan metode purposive sampling dengan melibatkan 229 responden yang merupakan siswa SMA dari empat sekolah di Kota Bogor yang masing-masing terdiri dari dua sekolah di Kecamatan Bogor Tengah dan di Kecamatan Bogor Selatan. Responden pada penelitian ini didominasi oleh siswa perempuan dengan persentase sebesar 60,7 persen, sedangkan responden laki-laki sebesar 39,3 persen. Hasil penelitian menemukan adanya hubungan antara kualitas pertemanan dengan karakter yang dimiliki remaja dan secara konsisten, peningkatan kualitas pertemanan memengaruhi peningkatan karakter. Sementara itu, pada kelekatan orang tua tidak ditemukan adanya hubungan dan pengaruh terhadap karakter remaja di Kota Bogor., The character that is formed in a person is influenced by various aspects both from within and from outside a person. Family and peers are the closest environment for a teenager that influences the formation of his character, one of which is through the attachment provided by parents and the quality of friendship owned by adolescents. This study aims to analyze the influence of parental attachment and friendship quality on the adolescent character in Bogor City. This study used a purposive sampling method involving 229 high school respondents from four schools in Bogor City, each consisting of two schools in Central Bogor Subdistrict and South Bogor Subdistrict. Respondents in this study were dominated by female students with a percentage of 60.7 percent, while male respondents amounted to 39.3 percent. The results found that there was a relationship between the quality of friendship and character possessed by adolescents and consistently, an increase in the quality of friendship influenced the improvement of character. Meanwhile, on parental attachment, there was no relationship and influence on the character of adolescents in Bogor City.
Keyword: Adolescents, Character, City, Friendship quality, Parental attachment

Judul: The Influence of Parenting Style and Friendship Quality on Aggressivity among Adolescents in Bogor City
Abstrak: Agresivitas merupakan kecenderungan yang mengarah pada tingkah laku individu dalam bentuk tindak kekerasan secara fisik atau verbal dan dilakukan dengan tujuan untuk melukai atau menyakiti orang lain. Penelitian ini bertujuan untuk menganalisis pengaruh karakteristik remaja, karakteristik keluarga, gaya pengasuhan, dan kualitas pertemanan terhadap agresivitas remaja di Kota Bogor. Penelitian berlokasi di empat SMA di Kota Bogor yang ditentukan secara purposive. Penelitian melibatkan 229 siswa yang berasal dari sekolah yang mewakili kecamatan di tengah kota dan kecamatan di pinggiran kota. Hasil uji hubungan menemukan bahwa gaya pengasuhan komposit berhubungan negatif signifikan dengan agresivitas. Dimensi kehangatan gaya pengasuhan ditemukan berhubungan dengan kualitas pertemanan komposit. Hasil uji hubungan juga menemukan bahwa dimensi konflik kualitas pertemanan berhubungan dengan agresivitas. Hasil uji pengaruh model 1 menemukan hanya gaya pengasuhan yang secara konsisten memberikan pengaruh lebih besar terhadap agresivitas remaja. Sementara itu, hasil uji pengaruh model 2 menemukan adanya pengaruh yang lebih besar dari usia ibu, dimensi permusuhan, ketidakpedulian, dan konflik terhadap agresivitas remaja dibandingkan variabel lain yang diteliti pada model regresi.
Keyword: gaya pengasuhan, kualitas pertemanan, perilaku agresif, remaja, teman  sebaya

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