Judul: Hubungan antara karakteristik mahasiswa dengan persepsi terhadap kemasan acara, minat dan perilaku mahasiswa menonton acara pendidiakan di televisi : kasus mahasiswa Fakultas Pertanian, Institut Pertanian Bogor
Abstrak: Acara pendidikan di televisi lebih di "cap" sebagai acara televisi yang paling membosankan. Karena itu tidak banyak pemirsa televisi yang menonton acara pendidikan di televisi, padahal acara pendidikan sangat penting bagi masyarakat. Mahasiswa sebagai kaum intelektual membutuhkan beragam ilmu pengetahuan yang dapat mendukung studinya. Acara pendidikan televisi saat ini sudah mengalami perubahan yang besar dengan tujuan dapat memenuhi kebutuhan pendidikan bagi masyarakat luas khususnya kaum intelektual. Namun, tidak semua mahasiswa mengetahui adanya perubahan tersebut. Minat untuk menonton acara pendidikan dipengaruhi oleh kemasan acara pendidikan tersebut. Bila kemasan acara tidak menarik maka acara tersebut tidak akan di lihat, padahal dengan perubahan yang selalu terjadi setiap harinya, pemirsa televisi membutuhkan pengetahuan (pendidikan). Mahasiswa dalam hal ini memiliki kemampuan yang baik untuk menilai dan mengkritisi acara pendidikan di televisi, mengingat bahwa mahasiswa merupakan orang yang bergerak dalam bidang akademis dan memiliki latar belakang pendidikan yang tinggi. Tujuan dari penelitian ini adalah (1). Untuk mengetahui sejauhmana hubungan antara karakteristik mahasiswa dengan persepsi mahasiswa terhadap kemasan acara pendidikan di televisi, (2) Untuk mengetahui sejauhmana hubungan antara karakteristik mahasiswa dengan minat mahasiswa untuk menonton acara ..dst
Keyword: 

Judul: Hubungan Motivasi Dan Pola Menonton Dengan Tingkat Kepuasan Mahasiswa Terhadap Program Berita Tv One (Kasus Mahasiswa Departemen Sains Komunikasi Dan Pengembangan Masyarakat, Fakultas Ekologi Manusia Institut Pertanian Bogor).
Abstrak: Television is most effective mass media to transfer information to audience than print media. Recently, people use television not only to get entertainment but also information. One of television programme that content more information and knowledge is news programme. TV One becomes one option which can be a source of recent information and science for the audiences. Based on uses and gratification theory, the audiences were looked actively in using mass media to fulfill their need. It means that someone uses mass media because of a certain motive. Mass media aplication offer expectable satisfaction for the audience. The audiences behaviour in applying media continually will increase day after day, in which they get satisfaction. It called by pattern of watching. Therefore, this reseach examines relationship between motivation, patterns of watching and satisfactory rate of college student on TV One news program. This research was done by a quantitative survey using a descriptive correlational design. Respondents were college student in Bogor Agriculture University and it selected by proportional stratified random sampling technique. Data were processed by the frequency distribution table and mean scores, chi square analysis and rank Spearman correlation test with SPSS for windows version 17. The patterns of watching such as duration and shows option had a significant relation (p<0,05) with whole aspects of motivation for each of them. But, frequency had a possitive significant relation (p<0,05) with entertainment satisfaction. Motivation of information, integration and social interaction had a highly possitive significant relation (p<0,01) with satisfaction rate of information, personal identity, integration, social interaction and entertainment. Motivation of personal identity had a highly significant relation (p<0,01) in motivation of information, personal identity, integration and social interaction. Motivation of entertainment had highly significant relation (p<0,01) with satisfaction of personal identity, integration, social interaction and entertainment.
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