Demystifying terms for understanding bioelectrochemical systems towards sustainable wastewater treatment

Bioelectrochemical systems (BESs) have been intensively studied in the past decade, but precise understanding of BESs performance is hindered by unclear definition of several key parameters. Herein, we analyze and discuss three sets of terms about conversion efficiency, energy performance, and pilot scale. It is suggested that ‘Coulombic recovery’ can avoid the misleading results because of different organic removals, compared with ‘Coulombic efficiency.’ Power density is not a suitable term to describe energy performance of BESs, and energy production/consumption should be reported in the energy unit such as kWh. Pilot-scale BESs should meet several criteria, including hydraulic capacity, use of actual wastewater, non-laboratory condition, and long-term operation. Proper use of those terms is strongly encouraged and will be critically important to BESs research and development.     

A note on spectrum distribution of constraint preconditioned generalized saddle point matrices

In this note, results concerning the eigenvalue distribution and form of the eigenvectors of the constraint preconditioned generalized saddle point matrix and its minimal polynomial are given. These results extend previous ones that appeared in the literature. Copyright © 2009 John Wiley & Sons, Ltd.     

Peters v. Roseau: Resolution of a conflict on the classical beach problem

A discrepancy is uncovered between two well documented solutions, to the uniquely solvable classical linearised sloping beach problem, by Peters in 1952 and independently by Roseau also in 1952 (though subsequently adjusted by personal correspondence from Roseau and Lehman to authors Wehausen & Laitone in 1960). The source of the main error (and other more minor errors) is identified, quantified and corrected and a consequence is that a study by Morris in 1976 (on a generalisation where the line source is no longer confined to the origin) will also have suffered from this deficiency. That problem therefore requires a re-visit.     

Symmetric nonnegative realizability via partitioned majorization

A sufficient condition for symmetric nonnegative realizability of a spectrum is given in terms of (weak) majorization of a partition of the negative eigenvalues by a selection of the positive eigenvalues. If there are more than two positive eigenvalues, an additional condition, besides majorization, is needed on the partition. This generalizes observations of Suleǐmanova and Loewy about the cases of one and two positive eigenvalues, respectively. It may be used to provide insight into realizability of 5-element spectra and beyond.     

Implicit QR algorithms for palindromic and even eigenvalue problems

In the spirit of the Hamiltonian QR algorithm and other bidirectional chasing algorithms, a structure-preserving variant of the implicit QR algorithm for palindromic eigenvalue problems is proposed. This new palindromic QR algorithm is strongly backward stable and requires less operations than the standard QZ algorithm, but is restricted to matrix classes where a preliminary reduction to structured Hessenberg form can be performed. By an extension of the implicit Q theorem, the palindromic QR algorithm is shown to be equivalent to a previously developed explicit version. Also, the classical convergence theory for the QR algorithm can be extended to prove local quadratic convergence. We briefly demonstrate how even eigenvalue problems can be addressed by similar techniques. D. S. Watkins partly supported by Deutsche Forschungsgemeinschaft through Matheon, the DFG Research Center Mathematics for key technologies in Berlin.     

关于反中心对称矩阵的某些性质探讨

利用反中心对称矩阵的定义以及翻转矩阵等技巧,给出了反中心对称矩阵的伴随矩阵、特征值及特征向量的一些新结论.     

Consistency of regularized spectral clustering

Clustering is a widely used technique in machine learning, however, relatively little research in consistency of clustering algorithms has been done so far. In this paper we investigate the consistency of the regularized spectral clustering algorithm, which has been proposed recently. It provides a natural out-of-sample extension for spectral clustering. The presence of the regularization term makes our situation different from that in previous work. Our approach is mainly an elaborate analysis of a functional named the clustering objective. Moreover, we establish a convergence rate. The rate depends on the approximation property and the capacity of the reproducing kernel Hilbert space measured by covering numbers. Some new methods are exploited for the analysis since the underlying setting is much more complicated than usual. Some new methods are exploited for the analysis since the underlying setting is much more complicated than usual.     

Development of a multi‐scale ocean model by using particle Laplacian method for anisotropic mass transfer

The direct injection of CO₂ into the deep ocean is one of the feasible ways for the mitigation of the global warming, although there is a concern about its environmental impact near the injection point. To minimize its biological impact, it is necessary to make CO₂ disperse as quickly as possible, and it is said that injection with a pipe towed by a moving ship is effective for this purpose. Because the injection ship moves over a spatial scale of O(10²km), a mesoscale model is necessary to analyse the dispersion of CO₂. At the same time, since it is important to investigate high CO₂ concentration near the injection point, a small‐scale model is also required. Therefore, in this study, a numerical model was developed to analyse CO₂ dispersion in the deep ocean by using a fixed mesoscale and a moving small‐scale grid systems, the latter of which is nested and moves in the former along the trajectory of the moving ship. To overcome the artificial diffusion of mass concentration at the interface of the two different grid systems and to keep its spatial accuracy almost the same as that in the small‐scale, a particle Laplacian method was adopted and newly modified for anisotropic diffusion in the ocean. Copyright © 2010 John Wiley & Sons, Ltd.     

Connected signed graphs of fixed order,size, and number of negative edges with maximal index

In this paper we focus on connected signed graphs of fixed number of vertices, positive edges and negative edges that maximize the largest eigenvalue (also called the index) of their adjacency matrix. In the first step we determine these signed graphs in the set of signed generalized theta graphs. Concerning the general case, we use the eigenvector techniques for getting some structural properties of resulting signed graphs. In particular, we prove that positive edges induce nested split subgraphs, while negative edges induce double nested signed subgraphs. We observe that our concept can be applied when considering balancedness of signed graphs (the property that is extensively studied in both mathematical and non-mathematical context).