Judul: Analisis Ekonomi pengelolaan sampah di Kawasan Wisata Pantai Tanjung Bira, Sulawesi Selatan.
Abstrak: Pantai Tanjung Bira merupakan salah satu wisata bahari yang terletak di Kecamatan Bonto Bahari, Kabupaten Bulukumba, Sulawesi Selatan. Pengelolaan sampah yang sudah ada di kawasan wisata Pantai Tanjung Bira belum optimal, karena masih terdapat tumpukan sampah, khususnya pada lokasi pantai wisata. Tujuan penelitian ini adalah: ...
Keyword: nilai ekonomi, timbulan sampah, willingness to pay, wisata bahari

Judul: Analisis Ekonomi dan Kebijakan Pengembangan Wisata Bahari di Kawasan Ekonomi Khusus Mandalika, Lombok Tengah (Studi Kasus Pantai Kuta).
Abstrak: Kawasan Pantai Kuta merupakan salah satu Kawasan Wisata bahari yang sedang berkembang di Kabupaten Lombok Tengah dan sangat potensial untuk pengembangan pariwisata bahari, namun dalam pengelolaanya sampai saat ini belum optimal. Oleh karena itu, diperlukan kajian baik secara ekonomi, lingkungan dan sosial. Penelitian ini bertujuan untuk mengestimasi daya dukung (supply), mengestimasi kondisi demand dan nilai ekonomi kawasan, serta merumuskan strategi kebijakan pengembangan wisata bahari secara berkelanjutan di Pantai Kuta Lombok Tengah. Metode penelitian yang digunakan adalah metode survei, dengan metode pengambilan contoh purposive sampling. Metode analisis data yang digunakan adalah analisis penawaran wisata (supply) dengan pendekatan analisis daya dukung, analisis permintaan wisata dengan Travel Cost Method (TCM), Contingent Valuation Method (CVM), analisis kelayakan, analisis prospektif dan analisis dinamik. Hasil analisis supply berdasarkan nilai daya dukung fisik kawasan untuk wisata snorkeling 14.532 orang/hari, diving 45.977 orang/hari, wisata pantai dengan jumlah kunjungan yang dapat ditoleransi 43.880 orang/hari, wind surfing 49.600 orang/hari. Hasil analisis demand berdasarkan TCM dengan rata-rata surplus konsumen Rp 42.250 dan jumlah wisatawan pada tahun 2015 yaitu 203.899 orang sehingga diperkirakan nilai ekonomi kawasan yaitu Rp 8.614.874.595/tahun. Hasil analisis CVM sebesar nilai rata-rata WTP yang didapatkan adalah sebesar Rp 5.950,00/orang sehingga dapat digunakan sebagai dasar penetapan biaya tiket masuk kawasan sebesar Rp 6.000,00/orang. Berdasarkan analisis kelayakan finansial, didapatkan nilai NPV sebesar Rp 25.965.595.555; Net B/C sebesar 1,81 dan IRR sebesar 33,96%, yang menunjukkan bahwa pengelolaan wisata bahari Pantai Kuta layak secara finansial. Sedangkan hasil dari analisis kelayakan ekonomi didapatkan nilai NPV sebesar Rp 38.519.056.718; Net B/C sebesar 2,19 dan IRR sebesar 52,60%, yang menunjukkan bahwa pengelolaan wisata bahari Pantai Kuta layak secara ekonomi. Hasil analisis prospektif merekomendasikan beberapa kebijakan yang perlu dilaksanakan yakni : keamanan berinvestasi, zonasi wilayah, kualitas SDM, aktivitas ekonomi dan penegakan hukum. Analisis dinamik, menunjukkan bahwa Kawasan Wisata Pantai Kuta akan mencapai keberlanjutan dari dimensi ekologi, ekonomi dan sosial sekitar tahun 2031 pada skenario optimis.
Keyword: Kawasan ekonomi khusus, Model dinamik, Pantai Kuta, Travel cost method, Wisata bahari berkelanjutan

Judul: Algorithm construction of HLI hash function
Abstrak: Cryptography is a study of mathematical techniques related to aspects of information security regarding on confidentiality, data integrity, entity authentication, and data origin authentication. Data integrity is a service, which is associated with the conversion of data carried out by unauthorized parties. To maintain data integrity, one can use hash functions. An hash function is a computationally efficient function to map an arbitrary length bitstring to a fixed length bitstring called as hash value. The use of hash function in maintaining the information integrity and authentication is in digital signatures, virus protection, and software distribution. Illustration of the hash function in the integrity and authentication of information that is emailed as follow. The sender sends the information and hash value to the recipient. If the hash value of the information is equal to the hash value that is sent by the sender, then information has not been changed. Otherwise the information has been changed. An hash function has two properties, one way and collision resistance. An hash function is called one way if it is computationally infeasible to find any input such that when given any hash value . Meanwhile an hash function is called collision resistant if it is computationally infeasible to find any two inputs where such that . The purpose of this study is to construct a HLI hash function algorithm, to analyze the speed and security of the hash functions as a results of construction. Furthermore, it is to compare it with SWIFFT. Hash function is constructed based on the result of algebraic operations on modular polynomial ringwith . Modular polynomial ring noted as is a set of all polynomials of degree at most with coefficients in . can be represented as a set of integer vector of modulo in dimension . So, it is simple to implement in a computer. In vector operations, is lattice . Furthermore, alattice that is defined from certain polynomial ring is called ideal lattice. HLI hash function is consists of addition and multiplication algorithm in the ring. Addition algorithm consists of sumation operations of modulo and multiplication consists of multiplication operations of modulo . Generally, algorithm of HLI hash function consists of multiplication operations of modulo and addition operations of modulo . However, if the input is binary number then multiplication algorithm only consists of multiplication operation of modulo , so algorithm of HLI hash function consists of multiplication operations of modulo and addtion operations of modulo . An hash function is secured if it has two properties, i.e., one way and collision resistance. HLI hash function hash is one way, it is following the proof of Micciancio. It is has collision resistant because of polynomial is irreducible over and monic. Moreover, it is proved that for every unit vector , the vector is small vector. If the input of hash function is a binary number then HLI hash function only involves addition operations of modulo . So the time that used almost same with SWIFFT. The excellence of HLI hash function is the key size smaller than SWIFFT. This effect on
Keyword: hash function, modular polynomial ring, lattice