Judul: Analisis willingness to pay dan willingness to accept masyarakat terhadap tempat pembuangan akhir sampah Pondok Rajeg Kabupaten Bogor
Abstrak: Sampah merupakan masalah utama yang dihadapi oleh masyarakat karena dapat emenyebabkan kotornya lingkungan yang pada akhirnya akan menurunkan kualitas lingkungan hidup. Sejalan dengan perkembangan wilayah, volume sampah menunjukkan peningkatan yang signifikan dengan berbagai ragam dan jenis sampah. Berdasarkan data Dinas Cipta Karya Kabupaten Bogor bulan Januari tahun 2006, timbunan sampah yang dihasilkan dari seluruh wilayah pelayanan TPA sampah Pondok Rajeg mencapai 199,1 m3/hari. Keberadaan TPA sampah selama 12 tahun telah membawa dampak yang cukup besar bagi masyarakat Pondok Rajeg. Dampak yang dirasakan oleh warga meliputi bau tak sedap dari sampah, hinggapnya lalat-lalat di atap rumah, serta terjangkitnya penyakit kulit dan pencernaan. Para penduduk yang mengalami kerugian akibat keberadaan TPA sampah harus memperoleh ganti rugi. Ganti rugi ini merupakan kompensasi atas kerusakan lingkungan yang digunakan untuk lokasi TPA sampah. Selama keberadaan TPA sampah di Kelurahan Pondok Rajeg, masyarakat tidak memperoleh kompensasi baik dalam bentuk tunai maupun non tunai.
Keyword: 

Judul: Analisis willingness to accept masyarakat terhadap tempat pembuangan akhir sampah bantargebang dengan pendekatan contingent valuation method (kasus Kelurahan Udik Kecamatan Bantargebang Kota Bekasi)
Abstrak: Penduduk dengan segala aktivitasnya merupakan salah satu komponen penting dalam permasalahan lingkungan. Salah satu permasalahan lingkungan yang sangat terkait dengan aktivitas penduduk adalah sampah. Berdasarkan data Dinas kebersihan DKI Jakarta tahun 2005, setiap hari sampah di Jakarta telah mencapai 25. 687 m3 atau setara dengan 6.000 ton. Seluruh sampah yang dihasilkan wilayah DKI Jakarta dibuang ke Tempat Pembuangan Akhir (TPA) Sampah Bantargebang Bekasi yang memiliki luasan tanah sebesar 108 hektar. Karena setiap harinya sekitar 6.000 ton sampah di buang ke TPA sampah Bantargebang, maka di tempat tersebut terdapat gunungan sampah yang tingginya mencapai 25 meter. Gunungan sampah ini telah menghasilkan kerugian sosial yang tidak kecil bagi warga sekitar TPA Sampah.
Keyword: 

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