Judul: The Effectiveness of the Post-Covid-19 Marketing Communication Mix in the Sembungan Tourism Village, Wonosobo Regency, Central Java
Abstrak: Penelitian ini bertujuan untuk mendeskripsikan bentuk bauran komunikasi pemasaran yang diterima pengunjung, menganalisis efektivitas bauran komunikasi pemasaran, serta hubungan antara karakteristik dan keterdedahan pengunjung dengan efektivitas bauran komunikasi pemasaran. Kehadiran Covid-19 berdampak pada penurunan jumlah pengunjung Desa Wisata Sembungan sehingga perlu dilihat efektivitas bauran komunikasi pemasarannya pascapandemi Covid-19. Metode penelitian menggunakan survei dengan instrumen kuesioner kepada 60 responden yang dipilih menggunakan metode accidental sampling dan data diolah secara non- parametic statistics. Hasil penelitian menunjukkan bahwa kegiatan bauran komunikasi pemasaran yang dilakukan oleh pengelola Desa Wisata Sembungan masih belum efektif dan hanya media komunikasi pemasaran Word of Mouth, baik secara tatap muka maupun e-WOM, yang diterima pengunjung. Terdapat hubungan signifikan pada variabel usia dan jenis kelamin dengan aspek afektif, variabel motivasi dan frekuensi penerimaan pesan dengan aspek konatif, serta variabel informasi penerimaan pesan dengan aspek kognitif dan afektif., This study aims to describe the form of marketing communication mix received by visitors, analyze the effectiveness of the marketing communication mix, and the relationship between visitor characteristics and visitation with the effectiveness of the marketing communication mix. The presence of Covid-19 has an impact on the decline in the number of visitors to Sembungan Tourism Village so it is necessary to see the effectiveness of the marketing communication mix after the Covid-19 pandemic. The research method used a survey with a questionnaire instrument to 60 respondents selected using the accidental sampling method and the data were processed using non-parametric statistics. The results showed that the marketing communication mix activities carried out by the Sembungan Tourism Village manager were still ineffective and only Word of Mouth marketing communication media, both face-to-face and e-WOM, were received by visitors. There is a significant relationship between the variables of age and gender with affective aspects, the variables of motivation and frequency of message reception with conative aspects, and the variables of message reception information with cognitive and affective aspects.
Keyword: marketing communication mix, effectiveness, post-Covid-19

Judul: Efektivitas Media Komunikasi Pemasaran Wisata Sejarah Dan Budaya Oleh Pengelola Kompleks Candi Gedong Songo, Kabupaten Semarang
Abstrak: Efektivitas media komunikasi pemasaran adalah keberhasilan pelaksanaan komunikasi pemasaran dengan menggunakan alat media komunikasi pemasaran dalam mencapai tujuan-tujuan komunikasi pemasaran. Tujuan penelitian ini menganalisis karakteristik pengunjung Kompleks Candi Gedong Songo, menganalisis bentuk media komunikasi pemasaran dan menganalisis faktor-faktor yang mempengaruhi efektivitas media komunikasi pemasaran Wisata Candi dilihat dari aspek kognitif, afektif, dan konatif. Dalam penelitian ini unit candi yang diteliti adalah Kompleks Candi Gedong Songo. Penelitian ini menggunakan pendekatan kuantitatif dan didukung pendekatan kualitatif. Hasil penelitian ini menunjukkan efektivitas media komunikasi pemasaran berada di kategori tinggi dan sedang. Faktor-faktor yang mempengaruhi adalah variabel pendapatan dan frekuensi penerimaan pesan terhadap efektivitas media komunikasi pemasaran, tepatnya pada aspek kognitif, afektif dan konatif.
Keyword: efektivitas media, komunikasi pemasaran, wisata candi

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