Search

Your search keyword '"Loh, S.-L."' showing total 12 results
Start Over Author "Loh, S.-L."
12 results on '"Loh, S.-L."'

6. Physiochemical properties of sago starch modified by acid treatment in alcohol

Author

Yiu, Pang Hung, Loh, S. L., Amarthalingam, Rajan, Wong, Sie Chuong, Bong, Choon Fah Joseph, Yiu, Pang Hung, Loh, S. L., Amarthalingam, Rajan, Wong, Sie Chuong, and Bong, Choon Fah Joseph

Abstract

Sago starch is usually chemically modified to overcome and improve the unstable properties of native sago starch during processing. In this study, sago starch was treated in hydrochloric acid in the presence of methanol, ethanol and 2-propanol at 45°C for 1 hour. Granule size, granular structure and solubility of the modified starch were investigated. Results showed that recovery yields of the modified starch were in excess of 57% with a maximum recovery of 94%, and the average granule size of the starch ranged from 24.8 to 30.1 µm. Images under light microscope revealed some internal fissures in starch granules after acid-alcohol treatment. Acid concentration had a pronounced effect on the degree of polymerization. The degree of polymerization progressively decreased as the carbon number of the alcohol increased. This study showed that sago starch can be modified through hydrolysis and alcoholysis to give various limit dextrins with high solubility.

Published
2008

11. Spanning tree transformation of connected graphs into Single-row networks

Author

Loh, S. L., Shaharuddin Salleh, and Sarmin, N. H.

Subjects
MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

A spanning tree of a connected graph is a tree which consists the set of vertices and some or perhaps all of the edges from the connected graph. In this paper, a model for spanning tree transformation of connected graphs into single-row networks, namely Spanning Tree of Connected Graph Modeling (STCGM) will be introduced. Path-Growing Tree-Forming algorithm applied with Vertex-Prioritized is contained in the model to produce the spanning tree from the connected graph. Paths are produced by Path-Growing and they are combined into a spanning tree by Tree-Forming. The spanning tree that is produced from the connected graph is then transformed into single-row network using Tree Sequence Modeling (TSM). Finally, the single-row routing problem is solved using a method called Enhanced Simulated Annealing for Single-Row Routing (ESSR).

Catalog

Books, media, physical & digital resources
See catalog results