Judul: Sikap dan perilaku ibu dalam mendampingi anak menonton televisi (Kasus Desa Bojong, Kecamatan Tenjo, Kabupaten Bogor, Jawa Barat)
Abstrak: Suatu data menyebutkan, anak Indonesia televisi rata-rata lima jam per hari. Tidak hanya program televisi yang menanggapi kebutuhan anak-anak, para pengusaha televisi lebih memusatkan perhatian pada kemampuan menghibur, sehingga banyak tayangan anak yang mengumbar kekerasan, dan pelecehan seksual. Dalam konteks ini, orang tua memegang peranan yang cukup penting. Orang tau harus bersedia membimbing dan memberi tahu soal rambu-rambu dalam menonton televisi. Hal ini perlu dilakukan para orang tua agar anak-anak tidak terpengaruh oleh dampak negatif dari media massa yang terus mengalir lewat teknologi komunikasi yang hanya mempertontonkan hiburan yang tidak bermanfaat.
Keyword: 

Judul: Perilaku menonton televisi dan pengaruhnya terhadap kegiatan anak sehari-hari perbandingan antara anak yang tinggal di Desa dan di kota: Kasus siswa SDN 02 Depok, Kecamatan Pangkah dan siswa SDN 05 Slawi, Kecamatan Slawi. Kabupaten Tegal
Abstrak: Maraknya dunia petielevisian di Indonesia dengan semakin luasnya jangkauan siaran televisi swasta, membuat banyak kalangan menyoroti dampak sosial yang ditimbulkan oleh isi siarannya. Kontroversipun muncul mengenai sejauhmana televisi dapat mempengaruhi perilaku pemirsanya, tak terkecuali pengaruhnya terhadap anak. Penelitian ini bertujuan untuk : (1) mengidentifikasi perilaku anak dalam menonton televisi, (2) melihat perbedaan perilaku menonton televisi antara anak yang tinggal di desa dan di kota, (3) mengidentifikasikan pengaruh siaran televisi terhadap anak, dan (4) melihat perbedaan pengaruh yang ditimbulkan akibat menonton televisi antara anak yang tinggal di desa dan di kota. Responden penelitian adalah siswa SDN 02 Depok, Kecamatan Pangkah dan siswa SDN 05 Slawi, Kecamatan Slawi, Kabupaten Tega!. Responden awal penelitian untuk SDN 02 Depok sebanyak 33 anak dan untuk SDN 05 Slawi sebanyak 44 anak. Selanjutnya dipilih secara acak untuk SDN 02 Depok sebanyak 30 anak dan untuk SDN 05 Slawi sebanyak 40 anak. Data yang dikumpulkan berupa data sekunder dari pemerintahan desa/kelurahan dan sekolah, sedangkan data primer diperoleh dari wawancara dengan anak-anak dan orangtua anak-anak. Data tersebut meliputi karakteristik individu, karakteristik keluarga, motivasi menonton acara televisi, pola penggunaan televisi, dan dampak siaran televisi.
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