Enhancing the Water Stability of Al‐MIL‐101‐NH2 via Postsynthetic Modification

The resistance of metal–organic frameworks towards water is a very critical issue concerning their practical use. Recently, it was shown for microporous MOFs that the water stability could be increased by introducing hydrophobic pendant groups. Here, we demonstrate a remarkable stabilisation of the mesoporous MOF Al‐MIL‐101‐NH₂ by postsynthetic modification with phenyl isocyanate. In this process 86 % of the amino groups were converted into phenylurea units. As a consequence, the long‐term stability of Al‐MIL‐101‐URPh in liquid water could be extended beyond a week. In water saturated atmospheres Al‐MIL‐101‐URPh decomposed at least 12‐times slower than the unfunctionalised analogue. To study the underlying processes both materials were characterised by Ar, N₂ and H₂O sorption measurements, powder X‐ray diffraction, thermogravimetric and chemical analysis as well as solid‐state NMR and IR spectroscopy. Postsynthetic modification decreased the BET equivalent surface area from 3363 to 1555 m² g^?1 for Al‐MIL‐101‐URPh and reduced the mean diameters of the mesopores by 0.6 nm without degrading the structure significantly and reducing thermal stability. In spite of similar water uptake capacities, the relative humidity‐dependent uptake of Al‐MIL‐101‐URPh is slowed and occurs at higher relative humidity values. In combination with ¹H‐²⁷Al D ‐HMQC NMR spectroscopy experiments this favours a shielding mechanism of the Al clusters by the pendant phenyl groups and rules out pore blocking.     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

k-树的补图的最小填充和树宽

一个图的最小填充问题是寻求边数最少的弦母图,一个图的树宽问题是寻求团数最小的弦母图,这两个问题分别在稀疏矩阵计算及图的算法设计中有非常重要的作用．一个k-树G的补图G称为k-补树．本文给出了k-补树G的最小填充数f(G) 及树宽TW(G)．     

Affine-scaling for linear programs with free variables

The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual.     

Kalman filtering of a space-time Markov random field

In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.     

A search technique for global optimization in a chaotic environment

We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.