Judul: Teknik Granulasi Dalam Pemanfataan Debu Teh Pada Produksi Teh Celup di PT Unilever Tbk Pabrik Tea Based Beverages Cikarang - Bekasi
Abstrak: Tea dust is one of the solid waste generated during manufacturing of tea bags in the Tea Based Beverage Factory, PT Unilever Indonesia Tbk, Cikarang - Bekasi. The amount of tea dust that is separated by dust collector at the tea factory is up to 500 kg per week. The tea dust could not be used in the tea bags production because of its particle size and light mass, so after separation by dust collector if then blended into the tea will affect the appearance and quality of the tea..This waste caused the factory loss its profit about 7 million rupiah per week. A process technique of granulation was used for tea dust to increase both the particle size and the mass. The granule form of the tea dust ensured that it could not be separated again by the dust collector after it was blended into the tea. Equipments such as cold extruder or fluidized bed granulator were used to form the granules and fluidized beddryer to dry the granules. After tea granules successfully formed, then it was mixed by blending the tea and filled it into a tea bag with a composition of 99.5% tea and 0.5% tea dust granules. Various kinds of test conducted to examine if the granulated tea dust would affect the quality of the tea bag, and the results showed that the granule was not affecting the quality of the tea bag based on the standard set by Unilever.
Keyword: 

Judul: Kajian Pembuatan Teh Celup Dengan Daun Pegagan (Centella Asiatica L. Urban)
Abstrak: Trend of back to nature has been widely developed in the world. One of the products from crop gotu kola is an herbal tea. Herbal tea contains powerful herbs for health. Packaging form of bags has been made to increase the added value of gotu kola tea. Tea bags are packaged processed food products in the packaging bag made from filterpaper that can be presented instantly and quickly. Gotu kola plant contains many chemical substances that useful to human’s health. Gotu kola can be clean the toxins blood from the body,improve digestive disorders and delay wrinkles. In addition it can helpimprove stamina, memory, mentally, and also help balancingthe energy levels, decrease symptoms of stress and depression. The active agent of this plant can also increase IQ, mental ability, such as mentally weak disorder in children. Making gotu kola tea bags in this study consisted of two types, namely sweet type and non sweet type, stevia is used to be sweetener. Through organoleptic test, panelist were asked to express they response to several tests of taste, aroma and color of a tea bag steeping of gotu kola. The results of analytical of chemical praresearch for raw materials of herbal tea ie gotu leaves, green tea leaves, citrus leaves and stevia leaves showed that the water content range ie 5,88-7,43 % w / w (SNI: max 8 % w / w) ash content, ie 4,65 - 5,76 % w / w (SNI: max 8 % w / w); and fiber content, ie 10,23 - 12,74 % w / w (SNI: max 16 % w / w). But all of the samples do not follow the standard of ISO, in terms of water soluble ash content, ie 35,63-41,22 % w / w (SNI min 45 % w / w). Results of quality analysis from all the selected samples showed that all of the samples have been met with SNI, which are not torn after soaking for about 15 minutes both cold water and hot water. Based on the results of statistical calculations can be obtained that the panelists preferred formulation for non sweet type is to the G formula, the composition are from 20% grams of gotu kola ; 60% of green tea; and 20% of citrus leaves. Where as for sweet type is preferred to the D formula, the composition are from 42,86% of gotu kola; 28,57% of green tea; 14,285% of citrus leaves; and 14,285% of stevia.
Keyword: 

Judul: Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11
Abstrak: A binary linear code of length n over q F is a subspace of n q F . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d ]-code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert- Varshamov bound, if a [n, k, d ]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we construct strongly optimal code with minimum distance 9 and 11. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound before we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 10 for d = 9 and k = 12 for d = 11.
Keyword: