Judul: Persepsi dan motivasi pengunjung dalam kegiatan ekoturisme di Taman Nasional Gunung Gede-Pangrango
Abstrak: Seiring dengan berkembangnya ekoturisme, di Indonesia minat masyarakat untuk melakukan kegiatan wisata ke tempat-tempat yang masih asli dan alami, jauh dari keramaian semakin berkembang. Dewasa ini tampak semakin banyak anak-anak muda yang melakukan kegiatan seperti mendaki gunung atau menyusuri pantai dimana kegiatan-kegiatan semacam itu sebenarnya banyak mengandung resiko dan banyak mengeluarkan energi serta biaya yang tidak sedikit. Meskipun demikian kegiatan-kegiatan tersebut ternyata sebagian masih disertai dengan adanya pencemaran dan perusakan terhadap lingkungan alam. Sampah sisa perbekalan yang dibuang sembarangan salah satunya yang paling banyak terlihat. Dengan demikian terlihat ada kontradiksi bahwa minat untuk melakukan kegiatan-kegiatan ekoturisme semakin berkembang tetapi dampak yang ditimbulkannya masih belum sesuai dengan apa yang diharapkan dari kegiatan ekoturisme. Untuk itu diperlukan penelitian mengenai bagaimana persepsi dan motivasi pengunjung dalam kegiatan ekoturisme.
Keyword: 

Judul: Analisis keterkaitan peraturan berkunjung dengan perilaku pengunjung di taman nasional gunung gede pangrango
Abstrak: TNGP memiliki keragaman jenis tumbuhan dan satwa, fenomena alam yang nyaman dan hawanya yang sejuk serta obyek wisata yang sangat menarik. Keadaan tersebut telah menarik banyak pengunjung terutama yang berusia muda. Untuk mewujudkan terselenggaranya kegiatan wisata tanpa menggangu lingkungan maka peraturan pengunjung di TNGP ini telah diterapkan oleh pihak pengelola dengan ketat. Namun demikian dengan adanya peningkatan jumlah pengunjung dari tahun ke tahun dan aktifitas yang dilakukan akan menimbulkan dampak seperti vandalisme, sampah, perusakan vegetasi, erosi, polusi dan pencurian. Saat ini masalah tersebut menjadi masalah yang dihadapi oleh pihak pengelola. Penelitian ini bertujuan untuk mengetahui keterkaitan peraturan berkunjung dengan perilaku pengunjung nusantara di TNGP.
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