Judul: Kajian sumberdaya danau untuk pengembangan wisata danau diatas, kabupaten solok, Sumatera Barat
Abstrak: Danau Diatas merupakan salah satu dari empat danau di Kabupaten Solok, Sumatera Barat. Terletak di dua kecamatan yaitu Kecamatan Lembah Gumanti dan Kecamatan Danau Kembar, dan merupakan bagian dari Danau Kembar yaitu Danau Diatas dan Danau Dibawah yang berdampingan dengan jarak sejauh 1 Km. Kawasan Danau Diatas dengan luas ±1720 Ha, memiliki panorama alam yang sangat indah dan udara yang sejuk, sehingga sangat berpotensi untuk pengembangan kegiatan ekowisata. Ekowisata merupakan kegiatan wisata yang berorientasi pada lingkungan untuk menjembatani kepentingan perlindungan sumberdaya alam dan industri kepariwisataan. Penelitian ini bertujuan untuk mengkaji potensi sumberdaya dan permasalahan di kawasan wisata Danau Diatas, Mengkaji kesesuaian potensi sumberdaya di kawasan danau untuk pengembangan ekowisata, serta merumuskan alternatif strategi pengelolaan kawasan wisata Danau Diatas. Hasil penelitian ini diharapkan dapat memberikan informasi mengenai potensi sumberdaya danau, dan menjadi bahan pertimbangan dalam penyusunan rencana pengembangan dan pengelolaan kawasan wisata Danau Diatas berdasarkan konsep ekowisata.
Keyword: 

Judul: Analisis permintaan dan strategi pengembangan pariwisata kawasan Danau Singkarak, Kabupaten Solok, Provinsi Sumatera Barat
Abstrak: Danau Singkarak merupakan salah satu danau yang ada di Provinsi Sumatera Barat, tepatnya di Kabupaten Solok yang ramai dikunjungi wisatawan pada akhir pekan dan libur nasional. Kawasan ini menjadi objek wisata unggulan Kabupaten Solok dalam menarik wisatawan baik domestik maupun mancanegara. Penelitian ini bertujuan untuk mengetahui potensi dan kondisi kawasan objek wisata, mengetahui karakteristik, persepsi dan kesan para pengunjung terhadap objek wisata, mengetahui industri kepariwisataan, mengetahui permintaan wisata dan merencanakan serta menyusun strategi pengembangan pariwisata Danau Singkarak.
Keyword: pariwisata, analisis permintaan, strategi pengembangan

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