Judul: Karakteristik Tanaman Yang Efektif Mereduksi Kebisingan
Abstrak: Bising (noise) adalah bentuk suara yang mengganggu baik secara jasmani dan rohani. Kebisingan juga merupakan bentuk suara yang tidak diinginkan dan dapat menimbulkan kerugian terhadap manusia dan lingkungan. Pengaruh kebisingan terhadap manusia dan lingkungan sangat besar . Kebisingan dapat mengakibatkan gangguan fisiologis dan psikologis. Di jalan, kebisingan dapat dikurangi dengan menggunakan barier berupa tanaman atau penghalang lainnya. Kualitas penyerapan bunyi pada beberapa jenis tanaman berbeda-beda menurut ukuran dan kepadatan daun.
Keyword: 

Judul: Studi peranan tanaman sebagai pereduksi kebisingan
Abstrak: Kebisingan adalah bentuk suara yang tidak diinginkan atau bentuk suara yang tidak sesuai dengan tempat dan waktunya. Dengan semakin padatnya kendaraan di jalan-jalan umum terutama di perkotaan, polusi menjadi makin tinggi terutama polusi udara dan kebisingan. Usaha yang mengarah kepada pengurangan kebisingan yang berasal dari lalu lintas jalan di daerah pemukiman sudah banyak dilakukan, baik dengan cara desain konstruksi yang mampu meredam kebisingan maupun dengan menggunakan peralatan yang relatif mahal. Penggunaan tanaman sebagai bahan pereduksi kebisingan selain murah juga memiliki nilai estetis lebih tinggi bila dibandingkan dengan pemakaian pagar tembok yang tebal, kokoh dan tinggi seperti benteng masif, karena pada hakekatnya tanaman memiliki nilai fungsional dan estetika yang dapat dimanfaatkan untuk peningkatan kualitas lingkungan ke arah yang lebih baik. Nilai fungsional tanaman antara lain sebagai kontrol visual, barrier fisik, kontrol iklim, pereduksi kebisingan, penyaring udara kotor, pencegah erosi clan juga sebagai habitat satwa. Sedangkan nilai estetisnya disajikan melalui warnanya, bentuknya, teksturnya clan skala perbandingannya dengan tanaman lain. Studi ini bertujuan untuk mengetahui kemampuan beberapa tanaman tertentu yang biasanya dipakai sebagai tanaman tepi jalan raya clalam kaitan fungsionalnya sebagai peredam kebisingan.
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