Mechanistic and Adsorption Studies of Relevance to Photocatalysts on Titanium Grafted Mesoporous Silicalites

Abstract  

Ti-SBA-15 and Ti-MCM-41 were synthesized and evaluated as possible photocatalysts for the reduction of CO₂, and for the photo-Kolbe decomposition of acetic acid. UV-Raman was used to study the adsorption of carbon dioxide, water, formic acid, and acetic acid over Ti-MCM-41 by monitoring the UV enhanced resonance peak of the totally symmetric stretching band of the grafted Ti species at 1,085 cm⁻¹. Acetic and formic acid dissociate on Ti-SBA-15 and Ti-MCM-41 to form acetate and formate, respectively. The conjugate bases subsequently interact strongly with Ti sites. Water interacts with the Ti sites, while no change in the amplitude of the 1,085 cm⁻¹ band is observed in the presence of CO₂. Photocatalysis experiments indicate that these mesoporous silicalites are active in the photo-Kolbe decomposition of acetic acid. CO₂ is formed by reaction of a hole with the acetate carboxylate groups. The methyl radical co-products react with a surface proton and an electron to form methane. No products resulting from the dimerization of methyl radicals are observed, presumably because of the highly dispersed active sites.     

Operation of TEA CO2lasers with rough surface electrodes

In contrast with the normally accepted concepts in the construction of transversely excited atmospheric (TEA) CO2lasers it is found that homogeneously roughened electrodes perform better then polished ones.     

The educational electronic book as a tool for supporting children’s emergent literacy in low versus middle SES groups

The effects of an educational electronic book (e-book) on 149 five- to six-year-old kindergarteners’ emergent literacy levels were researched in two SES groups: low (LSES) (79 children) vs. middle (MSES) (70 children). In each SES group, children were randomly assigned to four groups. Three groups were assigned to work individually in one of three e-book activity modes: “Read story only”, “Read with dictionary”, or “Read and play” during three similar activity sessions and the fourth group served as a control which received the regular program of the kindergarten. Pre- and post-intervention emergent literacy measures included word meaning, word recognition, and phonological awareness. Results show that word meaning of children from both middle and low SES improved following the educational e-book activity, regardless of mode. Second, LSES children’s emergent literacy levels showed relatively greater improvement rates than did those of the MSES children. Third, children in the “Read with dictionary” and “Read and play” activity modes showed more improvement in their emergent literacy levels than did those in the “Read story only” mode. Implications for future research and for education are discussed.     

Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs

We present two efficient algorithms for the minimum-cost flow problem in which arc costs are piecewise-linear and convex. Our algorithms are based on novel algorithms of Orlin, which were developed for the case of linear arc costs. Our first algorithm uses the Edmonds-Karp scaling technique. Its complexity isO(M logU(m+n logM)) for a network withn vertices,m arcs, M linear cost segments, and an upper boundU on the supplies and the capacities. The second algorithm is a strongly polynomial version of the first, and it uses Tardos's idea of contraction. Its complexity isO(M logM(m+n logM)). Both algorithms improve by a factor of at leastM/m the complexity of directly applying existing algorithms to a transformed network in which arc costs are linear.The final stage of this work was performed while Ron Shamir was a visitor at DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), Rutgers University. Supported in part by National Science Foundation Grant NSF-STC88-09648, and by Air Force Grants AFOSR-89-0512 and AFOSR-90-0008.     

Algorithmic Aspects of Acyclic Edge Colorings

Abstract. A proper coloring of the edges of a graph G is called acyclic if there is no two-colored cycle in G . The acyclic edge chromatic number of G , denoted by a'(G) , is the least number of colors in an acyclic edge coloring of G . For certain graphs G , a'(G)\geq Δ(G)+2 where Δ(G) is the maximum degree in G . It is known that a'(G)≤ Δ + 2 for almost all Δ -regular graphs, including all Δ -regular graphs whose girth is at least cΔ log Δ . We prove that determining the acyclic edge chromatic number of an arbitrary graph is an NP-complete problem. For graphs G with sufficiently large girth in terms of Δ(G) , we present deterministic polynomial-time algorithms that color the edges of G acyclically using at most Δ(G)+2 colors.     

A set expression based inheritance system

This paper describes a new formalism for inheritance systems, based on the formal semantics of set expressions. Using the formalism, it is possible to define new semantic classes by arbitrary set expressions operating on previously defined classes. Thus generalizing bothIS-A links andIS-NOT-A links and adding the set intersection operation. We present an efficient algorithm which follows these definitions to deduce the properties implied by the inheritance network, i.e., the properties of the classes containing a given element. The application which motivated the development of the formalism, namely semantic disambiguation of natural language, is also described.