The Chemical Mechanism of a Brown-Rot Decay Mimtic System and its Application in Paper Recycling Processes

This work is aimed at improving our current knowledge of the non-enzymatic inecl~anisins involved in brown-rot decay, as well as the exploration of potential applications of a brown-rot mimetic model system in paper recycling processes. The study was divided into two parts. The first part focussed on the chemical mechanisms involved in chelation and reduction of iron by a low molecular weight chelator (isolated from the brown-rot fungus Gloeophyllz~m tmbeum) and its model compound 2,3- dihydroxybenzoic acid (2,3-DHBA). Chelation as well as free radical generation mediated by this system were studied by ESR measurement. The results indicate that the effects of the chelator/iron ratio, the pH, and other reaction parameters on hydroxyl radical generation by a Fenton type system could be determined using ESR spin-trapping techniques. The results also support the hypothesis that superoxide radicals are involved in the chelator-mediated Fenton process. In the second part of the study, the effect of a chelator-mediated Fenton system for the improvement of deinking efficiency and the n~odification of fiber and paper properties was studied. For the deinking study, copy paper was laser printed with an identical standard pattern. Then repulping and flotation operations were performed to remove ink particles. Under properly controlled deinking conditions, the chelator mediated treatment (CMT) resulted in a reduction in dirt count over that of conventional deinking procedures with no significant loss of pulp strength. To study the effect of the chelator system treatment on the quality of pulp with different fines content, a fully bleached hardwood kraft pulp was beaten to different freeness levels and treated with the chelator-mediated free radical system. The result shows that virgin fiber and heavily beaten fiber respond differently to the free radical treatment. Unbeaten fibers become more flexible and easier to collapse after free radical treatment, while beaten fibers show a reduction in fines and small materials after mild free radical treatment.

A Mathematical Model for Simplifying Representations of Objects in a Geographic Information System

The study of operations on representations of objects is well documented in the realm of spatial engineering. However, the mathematical structure and formal proof of these operational phenomena are not thoroughly explored. Other works have often focused on query-based models that seek to order classes and instances of objects in the form of semantic hierarchies or graphs. In some models, nodes of graphs represent objects and are connected by edges that represent different types of coarsening operators. This work, however, studies how the coarsening operator "simplification" can manipulate partitions of finite sets, independent from objects and their attributes. Partitions that are "simplified first have a collection of elements filtered (removed), and then the remaining partition is amalgamated (some sub-collections are unified). Simplification has many interesting mathematical properties. A finite composition of simplifications can also be accomplished with some single simplification. Also, if one partition is a simplification of the other, the simplified partition is defined to be less than the other partition according to the simp relation. This relation is shown to be a partial-order relation based on simplification. Collections of partitions can not only be proven to have a partial- order structure, but also have a lattice structure and are complete. In regard to a geographic information system (GIs), partitions related to subsets of attribute domains for objects are called views. Objects belong to different views based whether or not their attribute values lie in the underlying view domain. Given a particular view, objects with their attribute n-tuple codings contained in the view are part of the actualization set on views, and objects are labeled according to the particular subset of the view in which their coding lies. Though the scope of the work does not mainly focus on queries related directly to geographic objects, it provides verification for the existence of particular views in a system with this underlying structure. Given a finite attribute domain, one can say with mathematical certainty that different views of objects are partially ordered by simplification, and every collection of views has a greatest lower bound and least upper bound, which provides the validity for exploring queries in this regard.