Judul: Analisis Kepuasan Nasabah Asuransi Kesehatan PT. Central Asia Raya
Abstrak: PT. Central Asia Raya (PT. CAR) as one of the insurance companies with asset and premium income the highest namely 15 large of 44 companies the insurance. Innovative products to meet customers' needs continue to launch one of which is health insurance products, which are intended for individuals who want to secure their health. Since the year 2010, number insurance customers of health in PT. CAR experiencing penurunan.Tahun 2009 the number of customers' is a number of 220. In 2010 as many as 178, and in 2011 to 132. In an effort maintain its existence in the market, PT. CAR need to know the how much the level of satisfaction its customers against waiters who given. Through this study, companies can obtain information on the attributes desired by consumers and look at its performance in meeting these attributes, so that in the future may provide input to improve and enhance consumer satisfaction. Destination who want to be achieved from this research is (1) Identifying characteristics insurance clients health PT. CAR, (2) Analyzing the level of of satisfaction insurance clients health PT. CAR, (3) Analyze the relationship characteristics of customers to customer satisfaction customer health insurance PT. CAR. Sampling was conducted using convenience sampling, a number of 60 respondents. The method used to analyze data on the quality level of customer satisfaction health insurance PT. CAR is a method of Importance and Performance Analysis. This method determines whether or not the attributes considered important by consumers, and whether the attributes satisfy the consumer or not, so that priorities can increase performance for each attribute. Based on the results of the IPA CSI, insurance PT. Central Asia Raya need improvement or performance improvement on accuracy attributes provide solutions and services with established procedures and policies. To enhance or improve the performance of insurance should the management of PT. Central Asia Raya revisit to the customer services and claims.
Keyword: 

Judul: Analisis Efektifitas Strategi Bauran Pemasaran Terhadap Kepuasan Asuransi Perjalanan pada PT XYZ.
Abstrak: PT XYZ merupakan perusahaan asuransi yang menawarkan produk asuransi perjalanan. Untuk memenangkan persaingan dalam penjualan asuransi perjalanan, diperlukan strategi bauran pemasaran yang efektif. Bauran pemasaran yang efektif dapat meraih tujuan yaitu kepuasan konsmen. Penelitian ini bertujuan untuk; (1) mengidentifikasi bauran pemasaran produk asuransi perjalanan yang diterapkan oleh PT XYZ (2) menganalisis kepuasan konsumen terhadap strategi bauran pemasaran produk asuransi perjalanan PT XYZ (3) menyusun rekomendasi strategi untuk meningkatkan efektifitas strategi bauran pemasaran. Data yang digunakan pada penelitian ini adalah primer dan data sekunder. Data primer diperoleh melalui kuesioner yang diberikan kepada manajemen internal dan konsumen. Analisis menggunakan metode Importance Perfomance Analysis, analisis kesenjangan, dan tabulasi silang. Hasill penelitian menunjukan bauran pemasaran PT XYZ cukup efektif dalam meningkatkan kepuasan, namun diperlukan perbaikan kinerja pada indikator fitur produk, harga pertanggungan, dan proses klaim. Pebaikan kinerja indikator harga pertanggungan dilakukan pembedaan berdasarkan pendapatan perbulan, perbaikan kinerja proses klaim dapat dilakukan dengan mempercepat proses klaim, dan perbaikan kinerja fitur produk dilakukan dengan memberikan fitur tambahan dengan memanfaatkan fitur produk dari aplikasi mobile yang sudah tersedia.
Keyword: analisis kesenjangan, bauran pemasaran, efektifitas, IPA, tabulasi silang

Judul: The Exploration of Discrete Logarithm over Finite Field GF(3m)
Abstrak: The security of many public~key algorithms is based on the problem of finding discrete logarithms. The generalized discrete logarithm problem is the following: given a finite cyclic group G of order n, a generator a of G, and an element fl E G, find the integer x, 0 ~ x ~ n - 1, such that 0: = fl. Algorithm for discrete logarithm problem focused on Menezes et al. (1997) that consist of exhaustive search algorithm, the baby-step giant-step algorithm, Pollard's rho algorithm, Pohlig-Hellman algorithm, and index-calculus algorithm. These algorithms are explorated to be used in discrete logarithm problem over finite field GF(3m ). The exploration also produces some algorithms, i.e. naif negative algorithm, baby-step mother-step algorithm, baby-step mother free-step algorithm, and baby-step free-step algorithm. All algorithms implemented using Maple 11. The Pohlig-Hellman and baby-step giant-step algorithms are efficient enough to be used in discrete logarithm problem over finite field GF(3m ) for m < 20.
Keyword: