聚苯氧基磷酸联苯二酚酯/聚磷酸铵膨胀阻燃剂对环氧树脂阻燃性能影响研究

以聚苯氧基磷酸联苯二酚酯(PBPP)与聚磷酸铵(APP)组成复合阻燃剂,对环氧树脂(EP)进行阻燃改性.通过氧指数(LOI)、垂直燃烧(UL-94)、热失重(TGA)、锥形量热(CONE)和扫描电镜(SEM)等方法研究改性环氧树脂的阻燃性能和阻燃机理.结果表明,PBPP/APP体系对EP具有较好的阻燃性能,阻燃剂添加量为10%时能使环氧树脂的氧指数提高到29.6%,垂直燃烧等级达到UL94 V-0级,残炭量大大增加;平均热释放速率下降45.7%,热释放速率峰值下降51.0%,有效燃烧热平均值下降21.1%;TGA、CONE、SEM等综合分析显示了PBPP/APP改性后的环氧树脂比纯环氧树脂具有更高的热稳定性,燃烧后能够形成连续、致密、封闭、坚硬的焦化炭层,在聚合物表面产生有效覆盖、隔绝了氧气,改善了环氧树脂的燃烧性能.     

Splitting extragradient-like algorithms for strongly pseudomonotone equilibrium problems

In this paper, two splitting extragradient-like algorithms for solving strongly pseudomonotone equilibrium problems given by a sum of two bifunctions are proposed. The convergence of the proposed methods is analyzed and the R-linear rate of convergence under suitable assumptions on bifunctions is established. Moreover, a noisy data case, when a part of the bifunction is contaminated by errors, is studied. Finally, some numerical experiments are given to demonstrate the efficiency of our algorithms.     

Finite <Emphasis Type="Italic">p</Emphasis>-groups with a class of complemented normal subgroups

Assume G is a finite group and H a subgroup of G. If there exists a subgroup K of G such that G = HK and H ∩ K = 1, then K is said to be a complement to H in G. A finite p-group G is called an NC-group if all its proper normal subgroups not contained in Φ(G) have complements. In this paper, some properties of NC-groups are investigated and some classes of NC-groups are classified.     

Measuring analogousness in picture fuzzy sets: from picture distance measures to picture association measures

In this paper, we extend the basic distance measure in picture fuzzy sets to the new measures called generalized picture distance measures and picture association measures. Some properties of these measures are examined. An application to clustering problem is given to illustrate applicability of the proposed works.     

Monotonicity,uniqueness, and stability of traveling waves in a nonlocal reaction‐diffusion system with delay

The purpose of this paper is to study the traveling wave solutions of a nonlocal reaction‐diffusion system with delay arising from the spread of an epidemic by oral‐faecal transmission. Under monostable and quasimonotone it is well known that the system has a minimal wave speed c* of traveling wave fronts. In this paper, we first prove the monotonicity and uniqueness of traveling waves with speed c ?c _?. Then we show that the traveling wave fronts with speed c >c _? are exponentially asymptotically stable.     

Contraction of the proximal mapping and applications to the equilibrium problem

In this paper, we introduce a new definition of Lipschitz-type continuity of a bifunction. Using this definition, we prove the contraction of the proximal mapping and apply it to the equilibrium problem over the fixed-point set of a nonexpansive mapping. We present a new algorithm for this problem. Under classical conditions, the convergence of the algorithm is proved. Finally, we present some numerical results for the proposed algorithm.     

Certain properties related to well posedness of switching diffusions

This work is devoted to switching diffusions that have two components (a continuous component and a discrete component). Different from the so-called Markovian switching diffusions, in the setup, the discrete component (the switching) depends on the continuous component (the diffusion process). The objective of this paper is to provide a number of properties related to the well posedness. First, the differentiability with respect to initial data of the continuous component is established. Then, further properties including uniform continuity with respect to initial data, and smoothness of certain functionals are obtained. Moreover, Feller property is obtained under only local Lipschitz continuity. Finally, an example of Lotka–Volterra model under regime switching is provided as an illustration.     

Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization

Nonnegative matrix factorization (NMF) is a powerful technique for dimension reduction, extracting latent factors and learning part-based representation. For large datasets, NMF performance depends on some major issues such as fast algorithms, fully parallel distributed feasibility and limited internal memory. This research designs a fast fully parallel and distributed algorithm using limited internal memory to reach high NMF performance for large datasets. Specially, we propose a flexible accelerated algorithm for NMF with all its \(L_1\) \(L_2\) regularized variants based on full decomposition, which is a combination of exact line search, greedy coordinate descent, and accelerated search. The proposed algorithm takes advantages of these algorithms to converges linearly at an over-bounded rate \((1-\frac{\mu }{L})(1 - \frac{\mu }{rL})^{2r}\) in optimizing each factor matrix when fixing the other factor one in the sub-space of passive variables, where r is the number of latent components, and \(\mu \) and L are bounded as \(\frac{1}{2} \le \mu \le L \le r\). In addition, the algorithm can exploit the data sparseness to run on large datasets with limited internal memory of machines, which is is advanced compared to fast block coordinate descent methods and accelerated methods. Our experimental results are highly competitive with seven state-of-the-art methods about three significant aspects of convergence, optimality and average of the iteration numbers.     

Constructive Solution of Inverse Parametric Linear/Quadratic Programming Problems

Parametric convex programming has received a lot of attention, since it has many applications in chemical engineering, control engineering, signal processing, etc. Further, inverse optimality plays an important role in many contexts, e.g., image processing, motion planning. This paper introduces a constructive solution of the inverse optimality problem for the class of continuous piecewise affine functions. The main idea is based on the convex lifting concept. Accordingly, an algorithm to construct convex liftings of a given convexly liftable partition will be put forward. Following this idea, an important result will be presented in this article: Any continuous piecewise affine function defined over a polytopic partition is the solution of a parametric linear/quadratic programming problem. Regarding linear optimal control, it will be shown that any continuous piecewise affine control law can be obtained via a linear optimal control problem with the control horizon at most equal to 2 prediction steps.     

On the Stability and Solution Sensitivity of a Consumer Problem

We present a continuous-time generalization of the seminal research and development model of d’Aspremont and Jacquemin (Am Econ Rev 78(5):1133–1137, 1988) to examine the trade-off between the benefits of allowing firms to cooperate in research and the corresponding increased potential for product market collusion. We show the existence of a solution to the optimal investment problem using a combination of results from viscosity theory and the theory of planar dynamical systems. In particular, we show that there is a critical level of marginal cost at which firms are indifferent between doing nothing and starting to develop the technology. We find that colluding firms develop further a wider range of initial technologies, pursue innovations more quickly, and are less likely to abandon a technology. Product market collusion could thus yield higher total surplus.