Judul: Efektivitas Komunikasi Pemasaran Produk Olahan Pertanian Institut Pertanian Bogor di Serambi Botani, Mal Gandaria City
Abstrak: Marketing communication is an attempt to convey the message to the public, especially to the consumer, about the existence of the product in the market. The purpose of this study is to analyze the factors that affect marketing communications. This study also aims to identify the characteristics of visitors and the implementation which done by the company. In this study the business units studied were Serambi Botani, Gandaria City Mall. Serambi Botani is one of business unit under the supervision of the Direktorat Bisnis dan Kewirausahaan Institut Pertanian Bogor (DITBK IPB) that sells processed agricultural products. The results of this study demonstrate the influence of the characteristics of marketing communications to the effectiveness of marketing communications, precisely on affective and conative aspects. Cognitive aspect is not affected by the characteristics of the visitors, the characteristics of marketing communications, nor the level of visitor’s exposure.
Keyword: 

Judul: Efektivitas komunikasi pemasaran produk olahan Pertanian Sop Duren Lodaya, Bogor
Abstrak: Komunikasi pemasaran merupakan suatu proses menyampaikan informasi mengenai produk atau jasa kepada masyarakat secara menyeluruh, dengan upaya dapat menyebabkan perubahan perilaku pada konsumen. Perubahan perilaku mengacu pada aspek kognitif, afektif, dan konatif. Tujuan penelitian ini adalah menganalisis karakteritik pengunjung dan karakteristik komunikasi pemasaran dalam mempengaruhi efektivitas komunikasi pemasaran yang dilakukan oleh Sop Duren Lodaya. Metode yang digunakan dalam penelitian adalah metode survey dengan didukung data kuantitaif dan kualitatif. Dalam penelitian ini, unit usaha yang diteliti adalah Sop Duren Lodaya, Bogor. Hasil penelitian ini menunjukkan adanya pengaruh karakteristik pengunjung dan karakteristik komunikasi pemasaran terhadap efektivitas komunikasi pemasaran pada aspek kognitif, afektif, dan konatif., Marketing communications is a process of delivering a whole information about a product or service to the community, the effort may lead to changes in consumer behavior. Behavior changes refer to the cognitive, affective, and conative aspects. The purpose of this research is to analyze the customers characteristic and marketing communications characteristic in influencing effectiveness of marketing communications conducted by Sop Duren Lodaya. The method used the study is a survey method supported by quantitative and qualitative data. In this study, the research subject is Sop Lodaya Duren, Bogor. The results of this study showed that consumer characteristics and the marketing communication characteristic influence effectiveness of marketing communications in cognitive, affective, and conative aspect.
Keyword: efektivitas, komunikasi pemasaran, produk olahan pertanian

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