Judul: Hubungan Stimulasi Psikososial dan Metode Sosialisasi dengan Karakter Disiplin dan Hormat Santun Remaja pada Keluarga Bercerai
Abstrak: Bogor divorce rate is increasing every year so that it can have an impact on the family life cycle. This study used cross-sectional design study aimed to analyze the relationship between psychosocial stimulation and socialization methods to adolescent mothers with the character of discipline and respect on teenager. The study was conducted at the Tanah Sareal and West Bogor. 50 adolescents in middle and high school ages 12 to 18 years was selected by convenience method. The results showed that in providing psychosocial stimulation and socialization methods of discipline and respect, more than half of mothers were in middle category. Even so with discipline and respect character, more than half of adolescents were in middle category. The results also showed no significant association between psychosocial stimulation with discipline and respect, but there was a significant relationship between the method of socialization with the character of discipline and respect of adolescent (p-value <0.01).
Keyword: 

Judul: Hubungan Tingkat Stres Ibu dan Pengasuhan Penerimaan-Penolakan dengan Konsep Diri Remaja pada Keluarga Bercerai
Abstrak: The divorce affects maternal stress and child development. This study aimed to analyze relationship between level of maternal stress and parental acceptance-rejection with adolescent’s self-concept on divorced family. This cross-sectional study designed research were located at Tanah Sareal and Bogor Barat, Bogor city. This research involved 50 adolescents around age 12-18 from divorced family and their mothers were selected conveniencely. The data were collected by interview and self-report using questionnaire. The level of maternal stress was measured by using symptoms of stress, parenting style measured by parental acceptance-rejection questionnaire (PARQ), while adolescents’s self concept was measured by adolescent self concept instrument. Result showed 80 percent of mothers had level of stress as mild categorize. Level of maternal stress was negatively significant correlated with level of education, family monthly income, and family size, while positively significant correlated with length of divorce. Most of the adolescents showed higher percentage (98%) of acceptance from their mothers. Age of adolescents significantly correlated positively with aggression and undifferentiated rejection. A higher percentage of adolescents showed positive self-concept (78%). The affection from mother was more strongly correlated positively with self-concept (p<0.01).
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