Current air quality analytics and monitoring: A review

This review summarizes the different tools and concepts that are commonly applied in air quality monitoring. The monitoring of atmosphere is extremely important as the air quality is an important problem for large communities. Main requirements for analytical devices used for monitoring include a long period of autonomic operation and portability. These instruments, however, are often characterized by poor analytical performance. Monitoring networks are the most common tools used for monitoring, so large-scale monitoring programmes are summarized here. Biomonitoring, as a cheap and convenient alternative to traditional sample collection, is becoming more and more popular, although its main drawback is the lack of standard procedures. Telemonitoring is another approach to air monitoring, which offers some interesting opportunities, such as ease of coverage of large or remote areas, constituting a complementary approach to traditional strategies; however, it requires huge costs.     

Donor-acceptor copolymers from cyclopentannulation polymerizations with dicyclopenta[cd,jk]pyrene and dicyclopenta[cd,lm] perylene acceptors

A series of donor-acceptor copolymers with dicyclopenta[cd,jk]pyrene and dicyclopenta[cd,lm]perylene acceptor units was prepared via palladium catalyzed cyclopenta-annulation reactions. The acceptor units were paired with diethynyl containing donor groups based on benzo[1,2-b:4,5-b’]dithiophene, thieno[3,2-b]thiophene, and 4-octyl-4H-dithieno[3,2-b:2′,3′-d]pyrrole to create six polymer variants. The cyclopentannulation polymerization resulted in copolymers with molecular weights (Mn) of 6–14 kDa and broad light absorption in the visible region with band gaps of 1.38–1.85 eV. The synthetic methodology, as well as optoelectronic properties, including thin-film absorption and cyclic voltammetry, of the donor-acceptor copolymers are presented.     

Convex functions, subdifferentiability and renormings

This paper through discussing subdifferentiability and convexity of convex functions shows that a Banach space admits an equivalent uniformly [locally uniformly, strictly] convex norm if and only if there exists a continuous uniformly [locally uniformly, strictly] convex function on some nonempty open convex subset of the space and presents some characterizations of super-reflexive Banach spaces. Supported by NSFC     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

The Hahn–Banach Theorem for Partially Ordered Totally Convex, Positively Convex and Superconvex Modules

The Hahn–Banach Theorem for partially ordered totally convex modules [3] and a necessary and sufficient condition for the existence of an extension of a morphism from a submodule C ₀ of a partially ordered totally convex module C (with the ordered unit ball of the reals as codomain) to C, are proved. Moreover, the categories of partially ordered positively convex and superconvex modules are introduced and for both categories the Hahn–Banach Theorem is proved.     

线性分式规划最优解集的求法

本文使用多面集的表示定理，导出了线性分式规划最优解集的结构，并给出确定全部最优解的计算步骤。     

Global and uniform convergence of subspace correction methods for some convex optimization problems

This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.