THE ROLE OF COLLOIDAL SILICON DIOXIDE IN THE ENHANCEMENT OF THE DRYING OF HERBAL PREPARATIONS IN SUSPENDED STATE

Recently, some research groups have been developing studies aiming to apply spouted beds of inert particles for production of dried herbal extracts. However, mainly due to their complex composition, several problems arise during the spouted bed drying of herbal extracts such as bed instability, product accumulation, particle agglomeration, and bed collapse. The addition of drying carriers, like colloidal silicon dioxide, to the extractive solution can minimize these unwanted effects. The aim of this work was to study the influence of the addition of colloidal silicon dioxide on enhancement of the performance of the drying of hydroalcoholic extract of Bauhinia forficata Link on a spouted bed of inert particles. The physical properties of the herbal extract and of its mixture with colloidal silicon dioxide at several concentrations (20% to 80% related to solids content) were quantified by determination of the surface tension, rheological properties, density, pH, and contact angles with the inert surfaces. Drying performance was evaluated through determination of the elutriation ratio, product recovery ratio, and product accumulation. The product was characterized through determination of the thermal degradation of bioactive compounds and product moisture content. The results indicated that the rheological properties of the extracts and their preparations, the contact angle with inert material, and the work of adhesion play important roles in the spouted bed drying of herbal extracts. Higher concentration of the drying carrier significantly improved the spouted bed drying performance.

Algorithms for sequence analysis via mutagenesis

Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique.

Unlocking hidden genomic sequence

Despite the success of conventional Sanger sequencing, significant regions of many genomes still present major obstacles to sequencing. Here we propose a novel approach with the potential to alleviate a wide range of sequencing difficulties. The technique involves extracting target DNA sequence from variants generated by introduction of random mutations. The introduction of mutations does not destroy original sequence information, but distributes it amongst multiple variants. Some of these variants lack problematic features of the target and are more amenable to conventional sequencing. The technique has been successfully demonstrated with mutation levels up to an average 18% base substitution and has been used to read previously intractable poly(A), AT-rich and GC-rich motifs.

Common multiples of complete graphs

A graph H is said to divide a graph G if there exists a set S of subgraphs of G, all isomorphic to H, such that the edge set of G is partitioned by the edge sets of the subgraphs in S. Thus, a graph G is a common multiple of two graphs if each of the two graphs divides G.

Sampling phylogenetic tree space with the generalized Gibbs sampler

The generalized Gibbs sampler (GGS) is a recently developed Markov chain Monte Carlo (MCMC) technique that enables Gibbs-like sampling of state spaces that lack a convenient representation in terms of a fixed coordinate system. This paper describes a new sampler, called the tree sampler, which uses the GGS to sample from a state space consisting of phylogenetic trees. The tree sampler is useful for a wide range of phylogenetic applications, including Bayesian, maximum likelihood, and maximum parsimony methods. A fast new algorithm to search for a maximum parsimony phylogeny is presented, using the tree sampler in the context of simulated annealing. The mathematics underlying the algorithm is explained and its time complexity is analyzed. The method is tested on two large data sets consisting of 123 sequences and 500 sequences, respectively. The new algorithm is shown to compare very favorably in terms of speed and accuracy to the program DNAPARS from the PHYLIP package.

3,5-cycle decompositions

For all odd integers n and all non-negative integers r and s satisfying 3r + 5s = n(n -1)/2 it is shown that the edge set of the complete graph on n vertices can be partitioned into r 3-cycles and s 5-cycles. For all even integers n and all non-negative integers r and s satisfying 3r + 5s = n(n-2)/2 it is shown that the edge set of the complete graph on n vertices with a 1-factor removed can be partitioned into r 3-cycles and s 5-cycles. (C) 1998 John Wiley & Sons, Inc.

The effect of imposed and self-selected computer monitor height on posture and gaze angle

Objective: The objectives were to determine the postural consequences of varying computer monitor height and to describe self-selected monitor heights and postures. Design: The design involved experimental manipulation of computer monitor height, description of self-selected heights, and measurement of posture and gaze angles. Background. Disagreement exists with regard to the appropriate height of computer monitors. It is known that users alter both head orientation and gaze angle in response to changes in monitor height; however the relative contribution of atlanto-occipital and cervical flexion to the change in head rotation is unknown. No information is available with regard to self-selected monitor heights. Methods. Twelve students performed a tracking task with the monitor placed at three different heights. The subjects then completed eight trials in which monitor height was first self-selected. Sagittal postural and gaze angle data were determined by digitizing markers defining a two-dimensional three-link model of the trunk, cervical spine and head. Results. The 27 degrees change in monitor height imposed was, on average, accommodated by 18 degrees of head inclination and a 9 degrees change in gaze angle relative to the head. The change in head inclination was achieved by a 6 degrees change in trunk inclination, a 4 degrees change in cervical flexion, and a 7 degrees change in atlanto-occipital flexion. The self-selected height varied depending on the initial monitor height and inclination. Conclusions. Self-selected monitor heights were lower than current 'eye-level' recommendations. Lower monitor heights are likely to reduce both visual and musculoskeletal discomfort. Relevance Musculoskeletal and visual discomfort may be reduced by placing computer monitors lower than currently recommended. (C) 1998 Elsevier Science Ltd. All rights reserved.

Generalized optimal lattice covering of finite-dimensional Euclidean space

A generalization of the classical problem of optimal lattice covering of R-n is considered. Solutions to this generalized problem are found in two specific classes of lattices. The global optimal solution of the generalization is found for R-2. (C) 1998 Elsevier Science Inc. All rights reserved.

5-cycle systems of K-v-F with a hole

Recently the problem of the existence of a 5-cycle system of K-v with a hole of size u was completely solved. In this paper we prove necessary and sufficient conditions on v and u for the existence of a 5-cycle system of K-v - F, with a hole of size u.

(m,n)-cycle systems

We describe a method which, in certain circumstances, may be used to prove that the well-known necessary conditions for partitioning the edge set of the complete graph on an odd number of vertices (or the complete graph on an even number of vertices with a 1-factor removed) into cycles of lengths m(1),m(2),...,m(t) are sufficient in the case \{m(1), m(2), ..., m(t)}\=2. The method is used to settle the case where the cycle lengths are 4 and 5. (C) 1998 Elsevier Science B.V. All rights reserved.

Maximal sets of Hamilton cycles in Kn,n

In this article, we prove that there exists a maximal set of m Hamilton cycles in K-n,K-n if and only if n/4 < m less than or equal to n/2. (C) 2000 John Wiley & Sons, Inc.

The biologically active iron chelators 2-pyridylcarboxaldehyde isonicotinoylhydrazone, 2-pyridylcarboxaldehyde benzoylhydrazone monohydrate and 2-furaldehyde isonicotinoylhydrazone

In the crystal structures of the respective title compounds, C12H10N4O, C13H11N3O . H2O and C11K9N3O2, variations in the torsion angles of the aromatic pyridyl and benzoyl groups are observed, and the disposition of the heterocyclic aldehyde is shown to be influenced by the ring size of this group.

Maximum packings of K-v-K-u with triples

We construct, for all positive integers u, and v with u less than or equal to v, a decomposition of K-v - K-u (the complete graph on v vertices with a. hole of size u) into the maximum possible number of edge disjoint triangles.

Ni-II and Zn-II complexes of the hexadentate macrocyclic ligand cis-6,13-dimethyl-1,4,8,11-tetraazacyclotetra- decane-6,13-diamine

The title pendent-arm macrocyclic hexaamine ligand binds stereospecifically in a hexadentate manner, and we report here its isomorphous Ni-II and Zn-II complexes (both as perchlorate salts), namely (cis-6,13-dimethyl-1,4,8,11-tetraazacyclotetradecane-6,13-diamine-kappa(6)N)nickel(II) diperchlorate, [Ni(C12H30N6)](ClO4)(2), and (cis-6,13-dimethyl-1,4,8,11-tetraazacyclotetradecane-6,13-diamine-kappa(6)N)zinc(II) diperchlorate, [Zn(C-12 H30N6)](ClO4)(2). Distortion of the N-M-N valence angles from their ideal octahedral values becomes more pronounced with increasing metal-ion size and the present results are compared with other structures of this ligand.