Preparation of 1,1,1,3,3-pentafluoropropane (HFC-245fa) by using a SbF5-attached catalyst

In this report, a simple process for preparing HFC-245fa through the reaction of 1,1,1,3,3-pentachloropropane (PCP) and anhydrous HF via two-step vapor-phase catalytic fluorination is described. The antimony pentafluoride catalyst was supported on inert porous materials to improve the catalytic activity. The resulting process catalyst not only exhibited high catalytic activity and excellent thermo-stability, but also improved the performance of SbF₅, in terms of hygroscopicity and corrosion.     

Vapor pressure of R227ea + ethanol at 343.13 K by molecular simulation

A new molecular model for 1,1,1,2,3,3,3-heptafluoropropane (R227ea) was developed on the basis of quantum chemical calculations and optimized using experimental vapor pressure and bubble density data. In combination with an existing model for ethanol, a molecular model for the binary mixture R227ea + ethanol was defined, using the Lorentz–Berthelot combining rule. It was validated at 283.17 K, where, considering the statistical uncertainties, it agrees to the experimental vapor pressure. The vapor–liquid equilibrium, comprising both bubble line and dew line data, was predicted at 343.13 K by molecular simulation. The Peng–Robinson equation of state fails for this system.     

Cr2O3和CrO3/Cr2O3催化剂的2-氯-1,1,1-三氟乙烷气相氟化反应的活性物种和失活

采用沉淀法和浸渍法制备了2种铬基（Cr₂O₃和CrO₃/Cr₂O₃）催化剂,用于气相氟化2-氯-1,1,1-三氟乙烷合成1,1,1,2-四氟乙烷。研究发现含有低价铬（Cr³⁺）物种的Cr₂O₃催化剂上2-氯-1,1,1-三氟乙烷的稳态转化率为18.5%,而含有高价铬（Cr⁶⁺）物种和低价铬（Cr³⁺）物种的CrO₃/Cr₂O₃催化剂初始转化率达到30.6%,然而存在明显的失活。含有Cr⁶⁺物种的CrO₃/Cr₂O₃催化剂的2-氯-1,1,1-三氟乙烷氟化反应初始TOF值为1.71×10^-4 mol_HCFC-133a·mol_Cr（Ⅵ）^-1·s^-1,高于含有Cr³⁺物种的Cr₂O₃催化剂（4.16×10^-5 mol_HCFC-133a·mol_Cr（Ⅲ）^-1·s^-1）。Cr₂O₃催化剂在氟化反应前后催化剂的物相结构保持不变;而含有高价铬物种的CrO₃/Cr₂O₃催化剂经HF反应后生成了CrO_xF_y活性物种。然而,CrO_xF_y物种在反应中挥发或转化成稳定但无活性的CrF₃,从而导致催化剂失活。     

High-power continuous-wave operation of a diode-pumped laser at

The continuous-wave laser properties of an efficient diode-pumped Nd:GdVO₄ crystal operating at formed with a simple plane-concave cavity have been studied. With the incident pump power of 21 W, an output power of 6.9 W was obtained, giving an optical conversion efficiency of 32.8% and a slope efficiency of 35.3%. The laser characterization of two different Nd³⁺-doped concentration of Nd:GdVO₄ crystals were studied.     

Detecting communities in clustered networks based on group action on set

In this paper, we propose a well targeted algorithm (GAS algorithm) for detecting communities in high clustered networks by presenting group action technology on community division. During the processing of this algorithm, the underlying community structure of a clustered network emerges simultaneously as the corresponding partition of orbits by the permutation groups acting on the node set are achieved. As the derivation of the orbit partition, an algebraic structure r-cycle can be considered as the origin of the community. To be a priori estimation for the community structure of the algorithm, the community separability is introduced to indicate whether a network has distinct community structure. By executing the algorithm on several typical networks and the LFR benchmark, it shows that this GAS algorithm can detect communities accurately and effectively in high clustered networks. Furthermore, we compare the GAS algorithm and the clique percolation algorithm on the LFR benchmark. It is shown that the GAS algorithm is more accurate at detecting non-overlapping communities in clustered networks. It is suggested that algebraic techniques can uncover fresh light on detecting communities in complex networks.     

Riesz means associated with certain product type convex domain

In this paper we study the maximal operators and the convolution operators Tδ associated with multipliers of the form

     

beta-Barrel transmembrane proteins: Geometric modelling, detection of transmembrane region, and structural properties

The location of the membrane lipid bilayer relative to a transmembrane protein structure is important in protein engineering. Since it is not present on the determined structures, it is essential to automatically define the membrane embedded protein region in order to test mutation effects or to design potential drugs. beta-Barrel transmembrane proteins, present in nature as outer membrane proteins (OMPs), comprise one of the two transmembrane protein fold classes. Lately, the number of their determined structures has increased and this enables the implementation and evaluation of structure-based annotation methods and their more comprehensive study. In this paper, we propose two new algorithms for (i) the geometric modelling of beta-barrels and (ii) the detection of the transmembrane region of a beta-barrel transmembrane protein. The geometric modelling algorithm combines a non-linear least square minimization method and a genetic algorithm in order to find the characteristics (axis, radius) of a shape with axial symmetry which best models a beta-barrel. The transmembrane region is detected by profiling the external residues of the beta-barrel along its axis in terms of hydrophobicity and existence of aromatic and charged residues. TbB-Tool implements these algorithms and is available in . A non-redundant set of 22 OMPs is used in order to evaluate the algorithms implemented and the results are very satisfying. In addition, we quantify the abundance of all amino acids and the average hydrophobicity for external and internal beta-stranded residues along the axis of beta-barrel, thus confirming and extending other researchers' results.     

Precoloring extension on unit interval graphs

In the precoloring extension problem a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper k-coloring of the graph. Answering an open question of Hujter and Tuza [Precoloring extension. III. Classes of perfect graphs, Combin. Probab. Comput. 5 (1) (1996) 35-56], we show that the precoloring extension problem is NP-complete on unit interval graphs.     

Relations between some basic results derived from two kinds of topologies for a random locally convex module

The purpose of this paper is to exhibit the relations between some basic results derived from the two kinds of topologies (namely the (ε,λ)-topology and the stronger locally L⁰-convex topology) for a random locally convex module. First, we give an extremely simple proof of the known Hahn-Banach extension theorem for L⁰-linear functions as well as its continuous variant. Then we give the relations between the hyperplane separation theorems in [D. Filipovi?, M. Kupper, N. Vogelpoth, Separation and duality in locally L⁰-convex modules, J. Funct. Anal. 256 (2009) 3996-4029] and a basic strict separation theorem in [T.X. Guo, H.X. Xiao, X.X. Chen, A basic strict separation theorem in random locally convex modules, Nonlinear Anal. 71 (2009) 3794-3804]: in the process we also obtain a very useful fact that a random locally convex module with the countable concatenation property must have the same completeness under the two topologies. As applications of the fact, we prove that most of the previously established principal results of random conjugate spaces of random normed modules under the (ε,λ)-topology are still valid under the locally L⁰-convex topology, which considerably enriches financial applications of random normed modules.     

On the packing chromatic number of some lattices

For a positive integer k, a k-packing in a graph G is a subset A of vertices such that the distance between any two distinct vertices from A is more than k. The packing chromatic number of G is the smallest integer m such that the vertex set of G can be partitioned as V₁,V₂,…,V_m where V_i is an i-packing for each i. It is proved that the planar triangular lattice T and the three-dimensional integer lattice Z³ do not have finite packing chromatic numbers.