Judul: Uji berbagai kondisi lingkungan selama simulasi pengangkutan tanaman Dracaena godseffiana 'Florida Beauty'
Abstrak: Percobaan ini berlangsung mulai bulan Juli 1994 hingga Januari 1995 di laboratorium PT Aneka Gas Industri Jakarta Pusat dan di Robby and Kerst Plant Nursery Gadog-Bogor. Tujuan percobaan ini adalah untuk mencari media terbaik selama simulasi pengangkutan dan mengetahui pengaruh pemberian penyerap etilen (KMnO4), dan pemberian hormon tumbuh (Kinetin) terhadap pertumbuhan dan kualitas tanaman Dracaena godseffiana 'Florida Beauty'. Alasan pelaksanaannya adalah selain peraturan ekspor internasional mengharuskan penggunaan media non- tanah dalam wadah tanaman yang akan diekspor sehingga perlu dipikirkan bebera- pa alternatif bahan media pengganti tanah selama pengangkutan, juga kerusakan tanaman akibat kondisi yang tidak optimum selama masa pengangkutan masih tinggi. Kerusakan ini terutama disebabkan suhu terlalu tinggi dalam periode yang berkepanjangan, kurangnya cahaya matahari, dan kadar etilen yang meningkat dalam container selama masa pengangkutan. Percobaan ini dilakukan di dalam cool storage berukuran 0.6 m (1) x 1 m (p) x 1.5 m (t) yang bersuhu 13-15°C dan RH 85-90%.
Keyword: 

Judul: Simulasi lingkungan selama masa transportasi tanaman hias dan pengaruhnya terhadap pertumbuhan dan kualitas dracaena dan puring pascatransportasi
Abstrak: Percobaan ini bertujuan mengetahui pengaruh kondisi simulasi lingkungan transportasi berupa penyimpanan tanam- an pada berbagai periode penyimpanan dengan media berbeda terhadap tingkat kerusakan tanaman, daya hidup serta kua- litas tanaman hias setelah periode simulasi pengangkutan. Percobaan dilakukan di kebun percobaan IPB Baranangsiang, Bogor dan Laboratoriun PN Aneka Gas Industri, Departemen Perindustrian Jakarta. Simulasi kondisi pengangkutan tanaman hias dilakukan dengan penyimpanan dalam cooling box berukuran 2 m x 0.6 m x 0.5 m dengan suhu 13-15°C dan RH 85-90%. Rancangan percobaan yang digunakan adalah Rancangan Acak Lengkap dengan satu faktor perlakuan yaitu kombinasi media tanaman (tanah, pasir, kompos; serbuk sabut kelapa; arang sekam) dengan periode simpan 0, 3, 7, 11 dan 15 hari. Penyimpanan tanaman Dracaena godseffiana 'Florida Beauty' berpengaruh terhadap penampakan warna daun tanaman setelah penyimpanan. Kerontokan daun dan perubahan jumlah buku berdaun selama penyimpanan serta pertambahan tinggi tanaman, pertambahan jumlah cabang, pertambahan tunas dan munculnya tunas-tunas baru selama tahap penyembuhan tidak dipengaruhi oleh lamanya penyimpanan, baik dengan media arang sekam maupun serbuk sabut kelapa. Penyimpanan tanaman Codiaeum variegatum berpengaruh nyata terhadap kerontokan daun selama penyimpanan, tanaman dengan media arang sekam hanya dapat melindungi tanaman dari kerontokan daun selama 3 hari penyimpanan, sedangkan media serbuk sabut kelapa dapat melindungi tanaman dari kerontokan daun sampai 15 hari penyimpanan. Kualitas tanaman yang mengalami penyimpanan tidak berbeda dengan tanaman yang disimpan. Kualitas dan pertumbuhan tanaman ju- ga tidak berbeda dalam berbagai periode simpan….
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