Judul: Kajian peluang pendirian industri papan partikel berdasarkan potensi bahan baku ampas tebu di daerah Cirebon, Jawa Barat
Abstrak: Ampas tebu dihasilkan dari pengolahan gula dengan proses ekstrak nira di pabrik gula. Proses pengolahan ini menghasilkan ampas sebanyak 35 40 persen dari bobot tebu. Pemanfaatan ampas tebu semula hanya sebagai bahan bakar dalam industri yang bersangkutan. Tetapi manfaatnya sebagai bahan bakar masih menghasilkan sisa ampas yang cukup banyak, yang memerlukan penanganan dalam pembuang- annya. Dengan teknologi proses dikembangkan pemanfaatan ampas tebu sebagai bahan baku papan partikel yang bernilai ekonomi tinggi. Tujuan penelitian ini adalah menganalisis peluang investasi pendirian industri papan partikel dari ampas tebu sebagai langkah awal untuk melakukan kajian kelayakan in- dustri. Ruang lingkup pengkajian meliputi analisis secara umum terhadap aspek pasar, bahan baku, teknis teknologis, manajemen operasi dan keuangan proyek. Metode yang digunakan adalah metode kuadrat terkecil untuk analisis pasar, metode pemulusan eksponensial untuk analisis ketersediaan bahan baku, metode perbandingan eksponensial untuk analisis lokasi dan analisis PBP, IRR dan kepekaan untuk analisis keuangan proyek. ...
Keyword: 

Judul: Pemanfaatan Ampas Teh dari Industri Teh Botol sebagai Bahan Baku Pembuatan papan Partikel
Abstrak: Industri minuman teh botol berkenbang sangat pesat di Indonesia. Jumlah produksi teh botol di Indonesia pada tahun 1989 tercatat 88 047 000 liter dengan nilai penjualan Rp 25 069 775 000 (BPS, 1991). Meskipun industri ini berkembanq pesat namun menghadapi masalah dengan limbahnya yang berupa ampas teh. Dalam rangka mewujudkan industri yang berwawasan lingkungan maka perlu dilakukan penelitian terhadap ampas teh tersebut.
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