Judul: Kenyamanan Audial di Taman Kota Surabaya.
Abstrak: Kota Surabaya merupakan salah satu kota metropolitan di Indonesia. Luas RTH Kota Surabaya 20.74% dari luas total, sedangkan target luasan minimal yaitu 30% dari luas kota. Kondisi tersebut menimbulkan ketidaknyamanan lingkungan, salah satunya kebisingan. Taman kota dipercayai dapat mengendalikan kebisingan kota. Penelitian ini bertujuan mengukur tingkat kebisingan, menentukan efektivitas vegetasi, mengkaji persepsi dan preferensi pengunjung di taman kota. Pengukuran kebisingan diambil pada transek 2 taman kota (Taman Flora dan Kebun Bibit Wonorejo) dan lahan terbuka, transek tersebut tegak lurus dengan sumber bising yang dibedakan 3 titik pengukuran berdasarkan jarak 0 m, 25 m, 50 m dari sumber bising dan pengukuran faktor iklim yang mempengaruhi kebisingan. Alat yang digunakan yaitu sound level meter dan weather station. Berdasarkan hasil penelitian, nilai kebisingan menurun signifikan dari 0 m ke 50 m. Namun, vegetasi lebih efektif mereduksi kebisingan pada jarak 0 m ke 25 m, Taman Flora 41.27% dan Kebun Bibit Wonorejo 59.42%. Persepsi pengunjung di kedua lokasi merasa terganggu dengan kebisingan lalu lintas dan pengunjung lebih menginginkan upaya peningkatan kenyamanan audial dengan cara pembuatan taman kota.
Keyword: kebisingan, taman kota, vegetasi

Judul: Studi Tingkat Kebisingan dan Kenyamanan Audial Hutan Kota (Studi Kasus Hutan Kota Pekanbaru dan Taman Kota Dharma Wanita)
Abstrak: Pekanbaru adalah kota dengan pertumbuhan populasi dan ekonomi yang pesat, Hal tersebut menyebabkan aktivitas kendaraan dan kebisingan kota menjadi meningkat. Kebisingan dengan tingkat yang tinggi dapat mengganggu kenyamanan dan menyebabkan masalah kesehatan yang serius jika tidak ditangani dan dihindari. Keberadaan Hutan Kota Pekanbaru (HKP) dan Taman Kota Dharma Wanita (TKDW) bertujuan untuk mengatasi permasalahan kebisingan. Analisis sebaran tingkat kebisingan menunjukkan bahwa tingkat kebisingan pada sebagian besar areal di HKP dan TKDW sudah melebihi baku mutu tingkat kebisingan yang diatur oleh pemerintah untuk kawasan RTH, yaitu 50 dB. HKP memiliki kemampuan reduksi kebisingan yang lebih efektif dibanding TKDW. Hasil uji chi-square menunjukkan tidak ada hubungan antara gangguan fisiologis, psikologis, dan komunikasi yang dirasakan oleh pengunjung HKP dan TKDW dengan kenyamanan audial di HKP dan TKDW.
Keyword: kebisingan, hutan kota, ruang terbuka hijau, taman kota

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