Judul: Peran ayah dalam pengasuhan anak terhadap pencapaian pendidikan anak di keluarga BMP
Abstrak: Seorang ayah di keluarga Buruh Migran Perempuan harus menggantikan peran pengasuhan anak di keluarga saat ibu pergi menjadi Buruh Migran Perempuan. Pendidikan merupakan hak seorang anak yang harus dipenuhi oleh orang tua. Orang tua, khususnya ayah diharapkan dapat memberi perhatian terhadap perkembangan anak, baik melalui pendidikan formal dan informal. Tujuan dari penelitian ini adalah mengidentifikasi sejauh mana peran ayah dalam pengasuhan anak terhadap pencapaian pendidikan anak di keluarga Buruh Migran Perempuan. Peran ayah dalam pengasuhan anak terdiri dari provider, protector, child specialiser and educator, dan nurtured mother. Penelitian ini dilakukan dengan pendekatan kuantitatif dan menggunakan kuesioner, wawancara mendalam serta observasi lapang sebagai metode pengumpulan data. Hasil penelitian menujukkan peran ayah dalam pengasuhan anak berpengaruh terhadap pencapaian pendidikan anak, peran ibu dalam pengasuhan anak berpengaruh terhadap pencapaian pendidikan anak, dan peran extended family berpengaruh terhadap pencapaian pendidikan anak
Keyword: Female Migrant Worker, Family, Education, Parenting

Judul: The Influence of Paternal Self-Efficacy and Mother Support on Father Involvement of Circular Migrant Worker
Abstrak: Peran ayah dalam pengasuhan anak sangat menentukan perkembangan anak. Bagi ayah pekerja migran sirkuler yang tinggal jauh dari keluarga karena bekerja di luar daerah akan lebih sulit untuk menjalankan peran pengasuhan. Penelitian ini bertujuan menganalisis pengaruh paternal self-efficacy dan dukungan ibu terhadap keterlibatan ayah dalam pengasuhan pada pekerja migran sirkuler. Penelitian ini menggunakan pendekatan kuantitatif dengan desain penelitian eksplanatori. Pengambilan data dilakukan secara daring menggunakan Google Form dengan jumlah 41 responden ayah yang berstatus sebagai pekerja migran sirkuler. Data diolah menggunakan Microsoft Office Excel dan dianalisis menggunakan SPSS. Hasil penelitian menunjukkan bahwa usia ayah berhubungan positif signifikan dengan paternal self-efficacy, sedangkan paternal self-efficacy, dukungan ibu, dan keterlibatan ayah dalam pengasuhan saling berhubungan positif signifikan. Selanjutnya, pendidikan terakhir ayah berhubungan negatif signifikan terhadap paternal self-efficacy dan dukungan ibu. Hasil penelitian juga menunjukkan bahwa paternal self-efficacy dan dukungan ibu berpengaruh positif signifikan terhadap keterlibatan ayah dalam pengasuhan pada pekerja migran sirkuler., Fathering plays a very important role in child development. The circular migrant worker fathers who live in different region from their families will have many difficulties to carry out the parenting role. This study aimed to analyze the influence of paternal self-efficacy and mother support on father involvement in circular migrant worker. This study used a quantitative approach with an explanatory research design. Data collection was done online using Google Form with a total of 41 respondents of circular migrant worker fathers. The data was processed using Microsoft Office Excel and analyzed using SPSS. The results showed that the father's age was significant positively correlated with paternal self efficacy, while paternal self-efficacy, mother support, and father involvement have a significant positive relationship with each other. Furthermore, the education level of father has significant negative relationship with paternal self-efficacy and mother support. The results also show that paternal self-efficacy and mother support have a significant positive effect on father involvement.
Keyword: dukungan ibu, keterlibatan ayah, paternal self-efficacy, pengasuhan, pekerja migran sirkuler

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