Judul: Analisis tingkat kepuasan konsumen terhadap mutu produk dan pelayanan warung tenda ayam bakar (Studi Kasus di Warung Tenda Ayam BAkar Panas Taman Kencana, Bogor)
Abstrak: This study took place of Warung Tenda Ayam Bakar Panas Taman Kencana. The objectives of this study are (1) to identify the characteristics of consumers, (2) to analyze the conformity between the importance and performance of this tend food seal and (3) to recomanded the strategy to increase consumers's satisfaction in Warung Tenda Ayam Bakar Panas Taman Kencana. The data was collected in November 1-30 2007. Case study was used as study design with descriptive analysis and Importance and Performance Anlysis (IPA) as tools of analysis. The responders interviewed were between 16-57 years old, majority of responders were high school and college students, live in Bogor area, not yet married and have medium income category. The consumers did not feel satisfaction on the attributes hygiene. The owner of Warung Tenda Ayam Bakar Panas Taman Kencana should be more aware of attributes hygiene to increase the satisfaction of their consumers
Keyword: 

Judul: Analisis penyelenggaraan makanan dan tingkat kepuasan konsumen di Restoran Sate Tegal Laka-laka
Abstrak: Penelitian ini bertujuan untuk menganalisis penyelenggaraan makanan dan tingkat kepuasan konsumen di Restoran Sate Tegal Laka-laka. Penelitian ini bersifat studi kasus dan menggunakan analisis deskriptif. Metode penarikan sampel dilakukan secara purposive dan 91 konsumen digunakan dalam penelitian ini. Restoran Sate Tegal Laka-laka merupakan salah satu contoh penyelenggaraan makanan komersial dengan menu utama sate. Penyelenggaraan makanan di Restoran Sate Tegal Laka-laka terdiri dari perencanaan (anggaran) dan pelaksanaan (pengadaan bahan makanan, penerimaan, penyimpanan, pengolahan, dan penyajian). Penilaian higiene dan sanitasi merujuk pada Kepmenkes nomor 1098/Menkes/SK/VII/2003 tentang Persyaratan Higiene Sanitasi Rumah Makan dan Restoran. Restoran Sate Tegal Laka-laka mendapatkan skor 902 yang termasuk dalam tingkat mutu A. Berdasarkan hasil analisis Importance Performance Analysis (IPA) menunjukkan bahwa atribut cita rasa makanan/minuman yang disajikan dirasa paling penting dan dinilai paling tinggi tingkat kinerjanya. Berdasarkan Customer Satisfaction Index (CSI), diperoleh nilai kepuasan sebesar 77.79 (puas). Hasil uji korelasi menunjukkan adanya hubungan yang signifikan (p<0.05) antara tingkat pendidikan dengan penilaian atribut mutu produk., This research aimed to analyze food service and level of customers satisfaction in Sate Tegal Laka-laka Restaurant. Case study design was applied in this study and analyzed using descriptive analysis. Sampling method of purposive sampling was carried out and number of subjects used was 91 customers. Sate Tegal Laka-laka Restaurant is one example of the commercial food service with satay as the main menu. Food services in Sate Tegal Laka-laka Restaurant consist of planning (budget) and implementation (purchasing, receiving, storing, processing, and distributing). Assessment of hygiene and sanitation were based on Kepmenkes No. 1098/Menkes/SK/VII/2003 about Requirements of Hygiene Sanitation Restaurant. Sate Tegal Laka-laka Restaurant got score 902 were categorized in the quality level A. The result of analysis based on Importance Performance Analysis (IPA) showed that the taste of food/beverages served attributes was considered as the most important and had the highest rate performance levels. Based on the Customer Satisfaction Index (CSI), the satisfaction value was 77.79 (satisfied). There was a significant (p<0.05) correlation between education level with quality of the product.
Keyword: CSI, IPA, kepuasan konsumen, penyelenggaraan makanan

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