Judul: Studi Kasus di PT. Semen Baturaja, OKU Sumatra Selatan
Abstrak: Pabrik Semen merupakan industri yang menimbulkan pencemaran udara yaitu berupa debu yang mengandung silika. Debu semen yang teremisikan ke udara bebas mempengaruhi Iingkungan atmosfer. Partikel debu ini menyebabkan gangguan kesehatan manusia dan berpotensi menyebabkan penyakit sementosis.
Keyword: 

Judul: Estimasi Nilai Kerugian dari Emisi Industri Semen di Kelurahan Sukajadi Kecamatan Baturaja Timur Kabupaten OKU.
Abstrak: Keberadaan industri di Kelurahan Sukajadi menimbulkan eksternalitas positif dan eksternalitas negatif. Eksternalitas negatif yang terjadi berupa pencemaran lingkungan. Tujuan dari penelitian ini adalah 1) mengidentifikasi eksternalitas positif dan negatif yang dirasakan masyarakat akibat pencemaran udara industri semen di Kelurahan Sukajadi 2) mengestimasi nilai kerugian ekonomi yang ditanggung masyarakat akibat pencemaran udara industri semen. 3) mengetahui berapa besar estimasi nilai kompensasi yang bersedia diterima masyarakat (WTA). 4) mengidentifikasi faktor-faktor apa saja yang mempengaruhi besarnya Willingness to Accept masyarakat di sekitar Kelurahan Sukajadi akibat pencemaan industry. Metode yang digunakan adalah analisis deskriptif, replacement cost, cost of illness,Contingent Valuation Method (CVM) dan analisis linier berganda. Hasil dari penelitian ini menunjukkan bahwa eksternalitas negatif yang dirasakan oleh masyarakat yaitu pencemaran udara dan debu serta terganggunya kenyamanan masyarakat. Nilai total kerugian masyarakat akibat kegiatan industri semen diduga sebesar Rp182 333 357/tahun, sedangkan nilai total WTA masyarakat sebesar Rp1 052 903 280/tahun. Faktor-faktor yang berpengaruh nyata pada besarnya nilai WTA responden adalah tingkat pendidikan responden, lama tinggal responden, total kerugian responden, tingkat pendapatan responden dan dummy udara berdebu.
Keyword: eksternalitas, industri semen, Willingness to Accept (WTA)

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