Hydrocarbon specificity in the selective catalytic reduction of NOx over Cu-ZSM-5 and Co-ZSM-5 catalysts

Transformation of surface nitrates under CH₄ (CH₄+O₂) was found to ensure steady-state activity of Co-ZSM-5 in the selective catalytic reduction of nitrogen oxides by methane (CH₄-SCR). For Cu-ZSM-5, such species are mainly converted into NO. Relaxation of the coordination sphere due to oxygen and NO adsorption, stability of C,N-containing intermediates and activation routes of hydrocarbons (methane, propane) were analyzed as factors determining catalytic properties of Cu and Co cations.     

Traffic noise reduction due to the porous road surface

Porous road surfaces reduce road traffic noise. A new method of noise reduction assessment is proposed. The noise generated by a few vehicles was measured two times: on an old surface with the dense asphalt and on a new surface with the porous asphalt. Subjective assessments of drive-by noise suggest that the sound exposure and the road surface coefficient can be used as the acoustical characteristics of a road surface. Their average values, with the average number of vehicles passing the receiver during a day or night, makes it possible to predict the equivalent continuous A-weighted sound pressure level for the new road surface. This is the main objective of this paper.     

Evaluations of initial ideals and Castelnuovo-Mumford regularity

This paper characterizes the Castelnuovo-Mumford regularity by evaluating the initial ideal with respect to the reverse lexicographic order.

     

A PRECONDITIONER FOR COUPLING SYSTEM OF NATURAL BOUNDARY ELEMENT AND COMPOSITE GRID FINITE ELEMENT

1. IntroductionThe coupling of boundary elemellts and finite elements is of great imPortance for the nu-mercal treatment of boundary value problems posed on unbounded domains. It permits us tocombine the advanages of boundary elements for treating domains extended to infinity withthose of finite elemenis in treating the comP1icated bounded domains.The standard procedure of coupling the boundary elemeni and finite elemeni methods isdescribed as follows. First, the (unbounded) domain is divided…     

On the worst case complexity of potential reduction algorithms for linear programming

There are several classes of interior point algorithms that solve linear programming problems in O(√nL) iterations. Among them, several potential reduction algorithms combine both theoretical (O(√nL) iterations) and practical efficiency as they allow the flexibility of line searches in the potential function, and thus can lead to practical implementations. It is a significant open question whether interior point algorithms can lead to better complexity bounds. In the present paper we give some negative answers to this question for the class of potential reduction algorithms. We show that, even if we allow line searches in the potential function, and even for problems that have network structure, the bound O(√nL) is tight for several potential reduction algorithms, i.e., there is a class of examples with network structure, in which the algorithms need at least Θ(√nL) iterations to find an optimal solution. The research of the author was partially supported by a Presidential Young Investigator Award DDM-9158118 with matching funds from Draper Laboratory.     

Regioselective reductive demethoxylation of 3,4,5-trimethoxystilbenes

Selective removal of the 4-methoxy group of 3,4,5-trimethoxystilbenes was performed under electron transfer conditions from Na metal in THF. Careful control of reaction conditions and quenching procedure allowed the synthesis of either (E)-3,5-dimethoxystilbenes or 3,5-dimethoxybibenzyls.     

On the Hardness of Computing Intersection,Union and Minkowski Sum of Polytopes

For polytopes P ₁,P ₂⊂ℝ ^d , we consider the intersection P ₁∩P ₂, the convex hull of the union CH(P ₁∪P ₂), and the Minkowski sum P ₁+P ₂. For the Minkowski sum, we prove that enumerating the facets of P ₁+P ₂ is NP-hard if P ₁ and P ₂ are specified by facets, or if P ₁ is specified by vertices and P ₂ is a polyhedral cone specified by facets. For the intersection, we prove that computing the facets or the vertices of the intersection of two polytopes is NP-hard if one of them is given by vertices and the other by facets. Also, computing the vertices of the intersection of two polytopes given by vertices is shown to be NP-hard. Analogous results for computing the convex hull of the union of two polytopes follow from polar duality. All of the hardness results are established by showing that the appropriate decision version, for each of these problems, is NP-complete.     

An analysis of single-index model with monotonic link function

The single-index model with monotonic link function is investigated. Firstly, it is showed that the link function h（.） can be viewed by a graphic method. That is, the plot with the fitted response y on the horizontal axis and the observed y on the vertical axis can be used to visualize the link function. It is pointed out that this graphic approach is also applicable even when the link function is not monotonic. Note that many existing nonparametric smoothers can also be used to assess h（.）. Therefore, the I-spline approximation of the link function via maximizing the covariance function with a penalty function is investigated in the present work. The consistency of the criterion is constructed. A small simulation is carried out to evidence the efficiency of the approach proposed in the paper.