Judul: Pengaruh Gaya Pengasuhan dan Pola Asuh Moral Ibu terhadap Karakter Menghargai dan Tanggung Jawab Anak.
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh gaya pengasuhan dan pola asuh moral terhadap karakter menghargai dan tanggung jawab anak. Lokasi penelitian yaitu di Desa Ciasmara, Kecamatan Pamijahan, Kabupaten Bogor. Penelitian ini melibatkan 75 anak usia sekolah beserta ibunya yang dipilih secara purposive. Kriteria contoh pada penelitian ini adalah anak usia sekolah kelas 4 dan 5 yang tinggal bersama orang tua kandung dan bertempat tinggal dekat dengan sekolah. Data dikumpulkan dengan teknik wawancara dan self administered questionnaire menggunakan kuesioner. Hasil penelitian menunjukkan gaya pengasuhan yang diterapkan ibu adalah otoritatif. Namun, pola asuh moral ibu dan karakter menghargai dan tanggung jawab anak berada pada kategori rendah. Hasil uji korelasi pearson menunjukkan tidak ada hubungan antara karakteristik keluarga, karakteristik anak, gaya pengasuhan ibu, pola asuh moral ibu, dan karakter menghargai dan tanggung jawab anak. Hasil uji regresi linear berganda menemukan pengaruh negatif usia ibu terhadap karakter anak, sementara itu, pola asuh moral tolerance ibu berpengaruh positif terhadap karakter anak.
Keyword: gaya pengasuhan, karakter menghargai, karakter tanggung jawab, pola asuh moral

Judul: Pengaruh Gaya Pengasuhan dan Metode Sosialisasi Orang Tua terhadap Karakter Jujur dan Tanggung Jawab Siswa SMA di Kota Bogor
Abstrak: Parenting style and methods of socialization are believed to be determining factors of a successful child development. The purpose of this research was to analyze the influence of parenting style and methods of socialization on character of high school students in Bogor, especially character of honesty and responsibility. This research was conducted at six schools representing public and vocational high schools with total sample of 200 adolescents consisted of 100 male and 100 female adolescents. The sample criteria were grade 10 students and came from an intact family. The data was collected from May until June 2012. The result showed that there were positive significant correlations between family income and father’s permissive parenting style and mother’s authoritarian parenting style; authoritative parenting style of both parents and methods of socialization of both parents; authoritative parenting style of both parents and adolescent’s character; and between methods of socialization of both parents and adolescent’s character. Contrary to that, significant negative correlations were found between permissive parenting style of both parents and methods of socialization of both parents, and between permissive parenting style of both parents and adolescent’s character. Regression analyses (R2 = 0.267) showed that authoritative parenting style and methods of socialization of mothers were dominant variables which influenced adolescent’s character positively, while permissive parenting style of mothers influenced adolescent’s character negatively.
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