Preparation and Characterization of Activated Carbon from Microwave and Conventional Heated Almond Shells Using Phosphoric Acid Activation

Activated carbon production from almond shells using phosphoric acid activation agent was achieved by applying both conventional heating and microwave heating in succession. The morphology and surface properties of activated carbon were studied using thermogravimetric and differential gravimetric analysis, Fourier-transform infrared spectroscopy, scanning electron microscopy, and Brunauer–Emmett–Teller analysis. A surface area of 1128 m²/g was achieved by optimizing the microwave power (500?W), microwave application time (15?minutes), conventional heating time (45?minutes), conventional heating temperature (500?°C), and the phosphoric acid:sample ratio (0.7:1). An adsorption capacity of methylene blue of 148?mg/g and an iodine value of 791?mg/g was obtained for the prepared activated carbon.     

3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λ_s(n)log³n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λ_s(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λ_s(n)log²n). The query time in the first problem is O(log⁴n), the query time in the second and third problems is O(log³n + klog²n), and the query time in the fourth problem is O(log³n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K₁, K₂ and K₁ lies vertically above K₂, then K₁ precedes K₂.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.     

Influence functions and efficiencies of the canonical correlation and vector estimates based on scatter and shape matrices

In this paper, the influence functions and limiting distributions of the canonical correlations and coefficients based on affine equivariant scatter matrices are developed for elliptically symmetric distributions. General formulas for limiting variances and covariances of the canonical correlations and canonical vectors based on scatter matrices are obtained. Also the use of the so-called shape matrices in canonical analysis is investigated. The scatter and shape matrices based on the affine equivariant Sign Covariance Matrix as well as the Tyler's shape matrix serve as examples. Their finite sample and limiting efficiencies are compared to those of the Minimum Covariance Determinant estimators and S-estimator through theoretical and simulation studies. The theory is illustrated by an example.     

A normalizing system of natural deduction for intuitionistic linear logic

 The main result of this paper is a normalizing system of natural deduction for the full language of intuitionistic linear logic. No explicit weakening or contraction rules for -formulas are needed. By the systematic use of general elimination rules a correspondence between normal derivations and cut-free derivations in sequent calculus is obtained. Normalization and the subformula property for normal derivations follow through translation to sequent calculus and cut-elimination. Received: 10 October 2000 / Revised version: 26 July 2001 / Published online: 2 September 2002 Mathematics Subject Classification (2000): 03F52, 03F05 Keywords or phrases: Linear logic – Natural deduction – General elimination rules     

Extended Rees algebras and mixed multiplicities

Partially supported by the general research fund at the University of Kansas     

Novel dinitroxide mediating agent for stable free‐radical polymerization

A novel dinitroxide mediating agent that was suitable for stable free‐radical polymerization was synthesized and used in the block copolymerization of styrene and t‐butyl styrene. Quantitative yields of a novel dinitroxide based on 1,6‐hexamethylene diisocyanate and 4‐hydroxy‐2,2,6,6‐tetramethyl‐1‐piperidinyloxy were obtained. Various experimental parameters, including the nitroxide‐to‐initiator molar ratio, were examined, and it was determined that the polymerization was most controlled under conditions similar to those of conventional 2,2,6,6‐tetramethyl‐1‐piperidinyloxy‐mediated stable free‐radical polymerization. Moreover, the dinitroxide mediator proved to be a viable route for the facile two‐step synthesis of triblock copolymers of styrene and t‐butyl styrene. However, the dinitroxide mediation process resulted in a higher than expected level of nitroxide decomposition, which resulted in polymers possessing a terminal alkoxyamine and an adjacent hydroxylamine rather than a preferred internal bisalkoxyamine. This decomposition resulted in the formation of diblock copolymer species during the triblock copolymer synthesis. Gel permeation chromatography was used to monitor the chain‐end decomposition kinetics, and the determined observed rate constant (5.89 × 10^?5 s^?1) for decomposition agreed well with previous studies for other dinitroxide mediating agents. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 1547–1556, 2004     

Simplicial trees are sequentially Cohen–Macaulay

This paper uses dualities between facet ideal theory and Stanley–Reisner theory to show that the facet ideal of a simplicial tree is sequentially Cohen–Macaulay. The proof involves showing that the Alexander dual (or the cover dual, as we call it here) of a simplicial tree is a componentwise linear ideal. We conclude with additional combinatorial properties of simplicial trees.     

Decision methods for linearly ordered Heyting algebras

The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable; a simple solution is here presented, inspired by related ideas in Gödel-Dummett logic.