Judul: Pengaruh penggunaan zat pengatur tumbuh dan unsur mikro terhadap buah - jadi pada kelapa
Abstrak: Penelitian ini bertujuan untuk mengetahui . pengaruh zat pengatur tumbuh (2,4-D, NAA, Kinetin) dan unsur milkro (Mikrofied Fe 132, Mikombi Super) (fruit-set) kelapa, terhadap "buah-jadi". Penelitian dilaksanakan di Kebun Percobaan Balai Penelitian Kelapa PaniRi, Kabupaten Minahasa, mulai pada bulan Mei sampai pertengahan Oktober 1987. Penelitian ini terdiri dari tiga percobaan Iapang. Percobaan I adalah pengujian perlaRuan Rombinasi zat penga tur tumbul1 2, 4-D ctengan unsur mi Rro terhactap Jumlah buah-Jadi Relapa. Taraf Ronsentrasi 2,4-D ialah O (D0), 30 (D1J dan 60 ppm (D2), sedangkan taraf unsur mikro ialah tanpa unsur mikro (Mo ), Mikrofied Fe 132 (M1) dan Mikombi Super (M2). Konsentrasi M1 dan M2 masing-masing 1 gram/liter air. Terdapat sembilan perlakuan kombinasi yang di uji. Percobaan II adalah pengujian sembilan perlakuan dominasi antara zat pengatur tumbuh NAA dengan unsur mikro terhadap Jumlah buah jadi Kelapa, ...
Keyword: 

Judul: Pengaruh zat pengatur tumbuh dan kofaktor pengakaran terhadap pertumbuhan bibit manggis (Garcinia mangostana L.)
Abstrak: Penelitian ini bertujuan untuk mengetahui pengaruh zat pengatur tumbuh (ZPT) IBA dan triakontanol, dan kofaktor pengakaran yang terdapat dalam air kelapa, urine sapi dan vitamin B₁ terhadap pertumbuhan bibit manggis. Percobaan ini dilakukan di kebun percobaan Balai Penelitian Hortikultura Cipaku, Bogor dengan ketinggian tempat 250 m dpl. Percobaan ini berlangsung dari bulan Februari 1990 sampai Juni 1990. Percobaan ini merupakan percobaan faktorial dengan rancangan acak kelompok, terdiri dari dua faktor, yaitu ZPT dan kofaktor pengakaran. ZPT yang dicoba terdiri dari 5 perlakuan, yaitu kontrol (AO), IBA 1000 ppm (A1), IBA 2000 ppm (A2), IBA 3000 ppm (A3) dan triakontanol 1 ppm (A4). Kofaktor pengakaran terdiri dari 4 perlakuan, yaitu kontrol (BO), air kelapa muda 25% (B1), urine sapi 25% (B2) dan vitamin B1 5 %. Terdapat 20 kombinasi perlakuan, masing-masing terdiri dari 4 ulangan dengan 4 tanaman un- tuk masing-masing ulangan. Hasil percobaan menunjukkan pemberian ZPT dan kofak- tor pengakaran tidak berpengaruh nyata terhadap pertumbuh- an tajuk bibit manggis sampai 4 bulan pengamatan. Pemberian ZPT dan kofaktor mempengaruhi pertumbuhan akar bibit manggis sampai 4 bulan pengamatan. Perlakuan ZPT (IBA dan trikontanol) berpengaruh nyata pada jumlah akar tersier dan jumlah akar kuarter tetapi tidak berpe- ngaruh pada panjang akar primer, jumlah akar sekunder, bo- bot kering akar dan nisbah tajuk-akar. Tanaman yang men- dapat perlakuan IBA 3000 ppm memiliki rata-rata jumlah akar tersier dan kuarter terbaik, yaitu 78 dan 40.13 helai akar. Pemberian kofaktor pengakaran berpengaruh pada panjang akar primer dan jumlah akar kuarter tetapi belum ber- pengaruh pada jumlah akar sekunder, jumlah akar tersier, bobot kering akar dan nisbah tajuk-akar. Pemberian air kelapa 25 % menunjukkan pengaruh terbaik pada pertumbuhan panjang akar primer dan jumlah akar kuarter, yaitu 26.4 cm dan 35 akar…
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