Judul: Hubungan Keterdedahan Media Komunikasi dengan Perilaku Komunikasi Anggota Gabungan Kelompok Tani
Abstrak: Media communication has an important role in distributing information about agriculture, especially in rural areas. Communication media can influence the communication behavior of farmers. The issues raised in this research are: 1) How do the characteristics of individual farmers, farmers exposure the communication media and communication behavior of farmers in gapoktan Jaya Mandiri?, 2) the extent of individual characteristics affecting the relationship exposure farmers on communication media?, 3) the extent of the relationship farmers communication media exposure influence the communication behavior of farmers?. The research was conducted using survey research methods. The results obtained are characteristic gapoktan member farmers such as gender, age, duration of farming, land, education and access to communication media influence farmers expoure to communication media. Meanwhile, the internet exposure related to interpersonal communication behavior of farmers and radio exposure, meeting gapoktan exposure.
Keyword: 

Judul: Tingkat Penggunaan Media Massa dan Peran Komunikasi Anggota Kelompok Peternak dalam Jaringan Komunikasi Penyuluhan
Abstrak: The cattle agribusiness extension activities, similar with other types of extension are supposed to undergo a communication structure change. The communication pattern is no longer in the form of “oil droplets” extension having a top down outline, or relying on the “LAKU (visiting and training)” extension system which has a dyadic pattern integrating the top down and bottom up interest with an interpersonal or group communication approach. However, turning to participation and exchange of knowledge and experiences through “farmer as partner” communication pattern, (therefore) the advance technology and local traditions are forming a synergy. It is suspected that the cattle farmer communication pattern in cattle extension no longer relies on interpersonal. The objectives of this research are (1) to show communication behavior of cattle farmers in getting information, (2) analyze the level of participation of cattle farmers from the standpoint of performing communication roles in a cattle communication network, (3) devulge the closeness between personal characteristics relationship, interpersonal communication behavior and the usage of mass media with cattle farmer communication role in communication network, (4) formulate the communication extension model. Selected samples amount to 125 cattle farmer respondents, consisting of two highly developed cattle farmers group s, and two lesser developed cattle farmers groups. The research was designed as a correlated descriptive survey, and was conducted from December 14, 2004 until February 16, 2005. The results of research show: (1) there is a significant difference in the communication behavior among the advanced cattle farmers group and the less advanced group, indicating (the circumstance) a level of mass media usage by cattle farmers in getting information. From prioritised the interpersonal communication relationship in receiving and diffusing information to the media communication behavior, particularly in behavior impact of television broadcast and newspapers. The communication behavior of two cattle farmers group members have changed from the usage of interpersonal communication to impersonal communication (radio dan television). However, the use of mass media dominantly for news and entertainment, and for technical matters they still rely on communication network; (2) the level of cattle farmers communication role in a cattle communication network comprising of star, mutual pairs and neglectee, did not indicate a communication role as isolate. The advanced cattle farmers group members were more distribution communication role as neglectee, while the less advanced group were more distribution role of mutual pairs. The role of the star, was found more in the less advanced group compared with the advanced group; (3) there is formal education characteristic relationship significantly with tv and radio impact behavior, and the formal education characteristic relationship significantly with newspaper impact behavior...dst
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