Judul: Pola mendengar siaran radio kisi 93.4 FM dan pengaruhnya terhadap perilaku remaja : kasus pengaruh program siaran kisi-kisi kita terhadap siswa SMUN 7
Abstrak: Dengan berbekal berbagai macam keistimewaannya, radio sebagai media audio memiliki jangkauan khalayak yang luas terutama dari kalangan remaja. Remaja dalam melaksanakan interaksi sosial sehari-hari dengan sesamanya memerlukan pertukaran informasi yang salah satunya didapat dari radio sebagai sumber informasi. Hal ini akan menyebabkan siaran radio dapat memberikan pengaruh terhadap aspek-aspek pengetahuan (cognitive), sikap (affective) dan tindakan (conative) pada remaja. Berdasarkan hal tersebut di atas, tujuan utama penelitian ini adalah untuk mengetahui pola mendengar siaran radio KISI 93.4 FM dan pengaruhnya terhadap perilaku remaja. Tujuan penelitian ini secara rinci adalah sebagai berikut: (1) mengetahui pola mendengar siaran radio pada remaja; (2) mengetahui faktor- faktor yang mempengaruhi perilaku remaja dalam mendengar siaran radio dan (3) mengetahui pengaruh mendengar siaran radio, khususnya program siaran Kisi- Kisi Kita di Radio KISI 93.4 FM terhadap aspek-aspek pengetahuan (cognitive) dan sikap (affective) pada remaja. Penelitian ini dilakukan pada pelajar Sekolah Menengah Umum Negeri (SMUN) 7 Bogor yang merupakan pendengar radio KISI di Kelurahan Bantarjati, Kecamatan Bogor Utara, Kota Bogor, Propinsi Jawa Barat. Kelas yang dipilih untuk kerangka sampling adalah kelas II SMUN 7, yang berusia 16 sampai 18 tahun. Kelas ini dipilih dengan pertimbangan bahwa siswa di kelas tersebut tidak sedang menghadapi ujian. Kemudian dari seluruh kelas II dipilih empat dari sembilan kelas secara purposive. Pemilihan kelas dibantu oleh Kepala Bidang Kurikulum SMUN 7 Bogor. Dari pemilihan tersebut diperoleh kelas terpilih, yaitu kelas II-1, II-5, II-7 dan II-9...dst
Keyword: 

Judul: Perilaku Remaja dalam Mendengarkan Radio Komunitas (Kasus Pendengar BeTe Radio di Kelurahan Tegal Gundil, Kecamatan Bogor Utara, Kota Bogor, Provinsi Jawa Barat)
Abstrak: This research aimed to analyze the relation between teenager behaviors on community radio listening activity. This research goals are (1) to identify the pattern of listening activity on community radio among teenager (2) to analyze the relation between listeners characteristics and broadcast format assessment by listening community radio (3) to analyze the relation between community radio listeners pattern with the teenager behaviors, and (4) to identify the listeners expectations towards community radio. The main method of this research is quantitative approach, and qualitative approach as supporting. Research and observationshow that the teenagers who are listening to the BeTe community radio have low level of listening activity pattern. Affective level and social network were also relatively low. Related to the listeners characteristics, the research result showed that gender does not have any relation with the pattern of radio listening activity. Beside that, age, media ownership, and main activities have significant relation towards pattern of radio listening activity. To assess broadcast format variable, pshycological proximity does not have any relation significantly with the pattern of radio listening activity. In the pattern of radio listening activity variable which is consist of listening frequency, listening duration, program choices, participation on the program have significant relation with to point of view, affective, and social network of BeTe Radio listeners.
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