Judul: Pengaruh Event Marketing terhadap Keputusan Pembelian dan Brand Image pada PT. Paragon Technology Innovation DC Bogor.
Abstrak: PT. Paragon merupakan perusahaan yang bergerak di industri kosmetik dengan salah satu brandnya yaitu Wardah. Dalam strategi promosinya, PT. Paragon Distribution Centre Bogor (cabang Bogor) sering kali mengadakan event marketing yang sering diselenggarakan di kampus ternama regional Bogor. Event marketing adalah salah satu kegiatan tim promosi DC Bogor yang mendapatkan omzet terendah selama tiga kuartal sampai pertengahan 2016 dibandingkan dengan kegiatan tim promosi lainnya. Penelitian ini bertujuan untuk mengetahui apakah event marketing yang diselenggarakan memberikan efek positif lain terutama dalam pembentukan brand image dan bagaimana kegiatan tersebut dapat mempengaruhi keputusan pembelian. Penelitian ini menggunakan metode SEM untuk mengolah data yang didapatkan dari seluruh audiens kegiatan Wardah On Wheels IPB. Dari data yang diolah, didapatkan bahwa event marketing memiliki pengaruh positif dan signifikan terhadap pembentukan citra merek dan selanjutnya citra merek memiliki pengaruh positif dan signifikan terhadap pembentukan keputusan pembelian.
Keyword: brand image, event marketing, SEM, Wardah On Wheels

Judul: Pengaruh Brand Equity Terhadap Keputusan Pembelian Produk Wardah Di Kota Bogor
Abstrak: Sejak tahun 2009 terjadi peningkatan penjualan pada industri kosmetik di Indonesia. Dalam mengikuti perkembangan yang terjadi pada masyarakat, Wardah hadir sebagai merek produk kecantikan yang dapat memenuhi keinginan masyarakat. Tujuan penelitian ini adalah: (1) mengidentifikasi karakteristik pengguna Wardah. (2) Menganalisis variabel yang berpengaruh signifikan terhadap keputusan pembelian produk wardah di kota Bogor. (3) Merumuskan strategi pemasaran yang efektif untuk produk Wardah. Variabel bebas dalam penelitian ini adalah loyalty measures, awareness measures, perceived quality, association measures, and market behavior.Data yang digunakan terdiri dari data primer (kuesioner) dan data sekunder (studi literatur) pengambilan sampel dilakukan dengan metode quota sampling. Metode pengolahan dan analisis data menggunakan analisis deskriptif dan analisis regresi linear berganda. Hasil penelitian menunjukkan secara simultan brand equity berpengaruh terhadap keputusan pembelian produk Wardah di kota Bogor. Secara parsial variabel loyalitas merek, kesadaran merek, dan asosiasi merek berpengaruh secara signifikasn terhadap keputusan pembelian.
Keyword: brand equity, keputusan pembelian, regresi linear berganda

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