The method of concentrating a substance from a solution in a stationary sorbent layer and its theoretical basis

The principle of concentrating a substance from a mixture flow in a stationary sorbent layer of infinite length that was previously developed for gas chromatography is extended to liquid chromatography. Translated fromIzevestiya Akademii Nauk. Seriya Khimicheskaya, No. 5, pp. 1063–1065, May, 1997.     

Problems, Models and Complexity. Part II: Application to the DLSP

In Part I of this study, we suggest to identify an operations research (OR) problem with the equivalence class of models describing the problem and enhance the standard computer-science theory of computational complexity to be applicable to this situation of an often model-based OR context. The Discrete Lot-sizing and Scheduling Problem (DLSP) is analysed here in detail to demonstrate the difficulties which can arise if these aspects are neglected and to illustrate the new theoretical concept. In addition, a new minimal model is introduced for the DLSP which makes this problem eventually amenable to a rigorous analysis of its computational complexity.     

Some remarks on the Jensen-Hadamard inequalities and applications

We provide some inequalities and integral inequalities connected to the Jensen-Hadamard inequalities for convex functions. In particular, we give some refinements to these inequalities. Some natural applications and further extensions are given.

---

Sunto Forniamo alcune diseguaglianze e diseguaglianze integrali connesse alle dise-gueglianze di Jensen-Hadamard per funzioni convesse. In particolare, diamo qualche miglioramento di queste diseguaglianze. Alcune applicazioni naturali ed ulteriori estensioni sono date.

     

Transesterification of an RNA model in buffer solutions in H2O and D2O

Transesterification of a phosphodiester bond of RNA models has been studied in various buffer solutions, under neutral and slightly alkaline conditions in H₂O and D₂O. The results show that imidazole is the only buffer system where a clear buffer catalysis on the cleavage of a phosphodiester bond is observed. The rate enhancement in sulphonic acid buffers is smaller, and a sulphonate base, particularly, is inactive as a catalyst. The rate‐enhancing effect of imidazole is, however, catalytic, and the catalytic inactivity of sulphonate buffers can be attributed to their structure and/or charge. The catalysis by imidazole is a complex system which, in addition to first‐order reactions, involves a process that shows a second‐order dependence in imidazole concentration. The latter reaction becomes significant in acidic imidazole buffers (pH < pK_a), as the buffer concentration increases. The kinetic solvent deuterium isotope effect k_H/k_D, referring to first‐order catalysis by imidazole base, is 2.3 ± 0.3. That referring to second‐order catalysis is most probably much larger, but an accurate value could not be obtained. Copyright © 2007 John Wiley & Sons, Ltd.     

Differentiators and the geometry of polynomials

In 1959, Davis introduced the concept of a differentiator of an operator on a finite-dimensional Hilbert space. We prove that every such operator possesses a differentiator. We also use the theory of differentiators to solve several problems in the geometry of polynomials. For instance, we answer in the affirmative a twenty year old unsolved conjecture of Schoenberg, a related conjecture of Katsoprinakis and a fifty year old unsolved conjecture of De Bruijn and Springer.     

关于可达矩阵的求法探讨

在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 .     

Entire radial solutions of elliptic systems and inequalities of the mean curvature type

In this paper we study first nonexistence of radial entire solutions of elliptic systems of the mean curvature type with a singular or degenerate diffusion depending on the solution u. In particular we extend a previous result given in [R. Filippucci, Nonexistence of radial entire solutions of elliptic systems, J. Differential Equations 188 (2003) 353-389]. Moreover, in the scalar case we obtain nonexistence of all entire solutions, radial or not, of differential inequalities involving again operators of the mean curvature type and a diffusion term. We prove that in the scalar case, nonexistence of entire solutions is due to the explosion of the derivative of every nonglobal radial solution in the right extremum of the maximal interval of existence, while in that point the solution is bounded. This behavior is qualitatively different with respect to what happens for the m-Laplacian operator, studied in [R. Filippucci, Nonexistence of radial entire solutions of elliptic systems, J. Differential Equations 188 (2003) 353-389], where nonexistence of entire solutions is due, even in the vectorial case, to the explosion in norm of the solution at a finite point. Our nonexistence theorems for inequalities extend previous results given by Naito and Usami in [Y. Naito, H. Usami, Entire solutions of the inequality div(A(|Du|)Du)?f(u), Math. Z. 225 (1997) 167-175] and Ghergu and Radulescu in [M. Ghergu, V. Radulescu, Existence and nonexistence of entire solutions to the logistic differential equation, Abstr. Appl. Anal. 17 (2003) 995-1003].     

Banach-Saks property in Marcinkiewicz spaces

We catalogue all Marcinkiewicz function and sequence spaces with the Banach-Saks property and present necessary and sufficient conditions for a wide subclass of spaces to possess the p-Banach-Saks property, 1<p<∞. We apply our results to several open problems.     

Direct Shooting Method for the Numerical Solution of Higher-Index DAE Optimal Control Problems

A method for the numerical solution of state-constrained optimal control problems subject to higher-index differential-algebraic equation (DAE) systems is introduced. For a broad and important class of DAE systems (semiexplicit systems with algebraic variables of different index), a direct multiple shooting method is developed. The multiple shooting method is based on the discretization of the optimal control problem and its transformation into a finite-dimensional nonlinear programming problem (NLP). Special attention is turned to the mandatory calculation of consistent initial values at the multiple shooting nodes within the iterative solution process of (NLP). Two different methods are proposed. The projection method guarantees consistency within each iteration, whereas the relaxation method achieves consistency only at an optimal solution. An illustrative example completes this article.