Judul: Pengembangan Pengelolaan Kawasan Taman Nasional dalam Era Otonomi Daerah (Suatu Studi  Kasus Di Taman Nasional Gunung Gede Pangrango)
Abstrak: Dengan adanya euforia reformasi, Taman Nasional mendapat tekanan dari dua sisi yaitu masyarakat sekitar kawasan dan Pemerintah Daerah selutar kawasan. Dari hasil penelitian yang dilakukan, terlihat bahwa tekanan terhadap Taman Nasional oleh masyarakat sekitar kawasan lebih disebabkan karena tingkat kesejahteraan masyarakat yang relatif rendah sehingga mereka melakukan tekanan pada Taman Nasional berupa perburuan liar, perambahan kawasan dan pengambilan hasil alam untuk memenuhi kebutuhan hidup. Sedangkan keinginan pemerintah daerah untuk mengelola Taman Nasional lebih disebabkan karena pemahaman tentang otonomi yang keliru.
Keyword: 

Judul: Analisa sosial ekonomi wilayah taman nasional dalam rangka mempertahankan kelangsungan pembangunan (Studi kasus Taman Nasional Gunung Gede Pangrango, Resort kawasan pelestraian alam cibodas, Desa Cimacan, Kecamatan Pacet, Kabupaten Cianjur, Jawa Barat)
Abstrak: Dasar kebijakan pembangunan dan pengelolaan dari Taman Nasional Gunung Gede-Pangrango (TNGP) adalah bahaa TNGP yang terdiri dari berbagai ekosistem hutan hujan tropis, seperti hutan Sub-montane, Montane, dan Sub-alpine, umumnya belum banyak terganggu oleh kegiatan manusia, dan secara keseluruhan TNGP ini mewakili tipe vegetasi hutan pegunungan di Pulau Jawa, beserta satwa-satwa yang nenghuninya. Areal ini juga nerupakan suaka alam pertana yang di tunjuk di Indonesia dan di kenal sebagai salah satu pusat penelitian botani.
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