Judul: Glukosa Darah, Tekanan Darah, dan Konsumsi Energi Protein Anak Sekolah Dasar Penerima PMT-AS di Kabupaten Kupang Propinsi Nusa Tenggara Timur
Abstrak: Tujuan umum penelitian ini adalah untuk mengetahui glukosa darah, tekanan darah, dan konsumsi energi protein anak sekolah dasar penerima PMT-AS di Kabupaten Kupang Propinsi Nusa Tenggara Timur. Tujuan khususnya adalah untuk mengetahui glukosa darah, tekanan darah, konsumsi dan tingkat konsumsi energi dan protein responden pada hari kudapan dan hari tanpa kudapan. Selain itu untuk mengetahui hubungan antara konsumsi energi sarapan pagi dengan glukosa darah responden. Penelitian ini mempakan bagian dari penelitian yang dilakukan oleh Tim Peneliti dari Jurusan Gizi Masyarakat dan Sumberdaya Keluarga, Fakultas Pertanian, Institut Pertanian Bogor. Pengumpulan data dilakukan pada Bulan Oktober- November 1999 pada dua kecamatan di Kabupaten Kupang. Jumlah anak sekolah yang menjadi responden dalam penelitian ini sebanyak 234 orang yang dipilih dari tiga sekolah dasar untuk masing-masing kecamatan.
Keyword: 

Judul: Konsumsi Pangan dan Status Gizi Anak Sekolah Penerima PMT-AS di Daerah Pantai dan Pegunungan di Nusa Tenggara Timur
Abstrak: Penelitian ini bertujuan untuk mengetahui: (1) konsumsi pangan anak sekolah penerima PMT-AS di daerah pantai dan pegunungan, (2) kontribusi kudapan PMT-AS terhadap kecukupan energi dan protein anak sekolah di daerah pantai dan pegunungan, (3) status gizi anak sekolah penerima PMT-AS di daerah pantai dan pegunungan di Nusa Tenggara Timur (NTT). Desain penelitian ini menggunakan studi crossectional. Penelitian ini dilaksanakan di dua kabupaten di NTT, yaitu Kabupaten Kupang dan Kabupaten Timur Tengah Selatan (TTS). Penelitian ini dilaksanakan pada Bulan Oktober 1999 sampai Bulan November 1999.
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