Judul: Kajian Potensi Ekologi Situ Gede Dan Situ Burung Untuk Pengembangan Wisata Perairan.
Abstrak: Situ Gede dan Situ Burung merupakan situ yang berada di wilayah Bogor. Keduanya memiliki potensi sumberdaya alam yang cukup baik. Berbeda dari Situ Gede yang sudah dimanfaatkan sebagai kawasan wisata, Situ Burung belum dimanfaatkan. Oleh karena itu, keduanya memerlukan pengelolaan yang berbeda. Tujuan penelitian ini adalah untuk menganalisis potensi ekologi Situ Gede dan Situ Burung, menganalisis penilaian sumberdaya dan mengetahui permintaan wisata untuk menentukan pengembangan potensi wisata kedua situ tersebut. Penelitian ini dilakukan pada Bulan Februari hingga April 2016. Analisis yang digunakan diantaranya adalah kesesuaian wisata, daya dukung kawasan, Travel Cost Method, dan Willingness to Pay. Hasil penelitian menunjukkan bahwa kedua situ dikategorikan dalam keadaan baik dan sesuai dengan baku mutu kelas II untuk kegiatan wisata. Permintaan wisata Situ Gede lebih besar dibanding dengan situ Burung. Total daya dukung kawasan untuk kegiatan wisata Situ Gede adalah 346 orang/hari, sedangkan Situ Burung 149 orang/hari. Pengelolaan yang disarankan adalah perlu adanya peningkatan fasilitas wisata sesuai kebutuhan pengunjung. Pengelolaan dilakukan dengan merancang desain kawasan dengan memperhatikan konsep daya dukung.
Keyword: Ekowisata, Travel Cost Method, Situ Burung, Situ Gede

Judul: Development Strategy of Situ Gede Ecotourism, West Bogor District, Bogor City
Abstrak: Situ Gede merupakan kawasan ekowisata yang memanfaatkan situ sebagai objek wisata. Pengembangan ekowisata harus memperhatikan aspek-aspek ekologis, ekonomis dan sosial. Penelitian ini bertujuan merumuskan faktor-faktor yang memengaruhi kunjungan situ serta memberikan alternatif pengelolaan wisata di Situ Gede, Kecamatan Bogor Barat, Kota Bogor. Metode yang dilakukan dalam penelitian ini adalah fungsi permintaan, daya dukung kawasan, dan SWOT. Faktor yang memengaruhi kegiatan ekowisata secara signifikan adalah biaya perjalanan dan jarak. Total daya dukung kawasan Situ Gede sebesar 476 orang/hari dengan kunjungan wisata yang masih kurang atau undervisit. Alternatif pengelolaan untuk pengembangan ekowisata Situ Gede adalah memperluas akses jalan dan lahan parkir, melengkapi sarana dan prasarana yang mendukung dan kurang lengkap, serta melakukan kemitraan., Situ Gede is an ecotourism area that uses situ as a tourist attraction. Ecotourism development must pay attention to ecological, economic, and social aspects. This study aims to formulate the factors that influence visits to situ and provide alternative tourism management in Situ Gede, West Bogor District, Bogor City. The methods used in this research were demand function, carrying capacity, and SWOT analysis. Factors that affect ecotourism activities significantly are travel costs and distance. The total carrying capacity of Situ Gede area is 476 people/day with tourist visits that are still lacking or undervisit. The alternative managements used for the development of ecotourism are expanding access roads and parking lots, completing supporting and incomplete facilities and infrastructure, and establishing partnerships.
Keyword: carrying capacity, ecotourism, Situ Gede, SWOT

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