煤直接液化油中混合酚的分离研究

利用分子筛择形特点，对煤直接液化油中的混合酚实施高效分离。本研究选取间甲酚和对甲酚作为分离煤直接液化油馏分段混合酚的模型化合物，采用化学液相沉积法对HZSM-5吸附剂的孔口结构进行改变，分析分子筛硅铝比及颗粒粒径对模型化合物间甲酚和对甲酚吸附分离性能的影响，以获得高性能固相吸附剂，并将其应用于180-190℃馏分段混合酚分离。结果表明，当分子筛硅铝比为25、粒径为3-5 μm时，分子筛的孔口结构调节效果最优；当正硅酸乙酯的最小用量为0.2 mL/g时，固相吸附剂的吸附量为0.03 g/g，对甲酚选择性高于95%。由于外表面沉积物对吸附剂的孔口结构变化，导致对甲酚选择性的提高。进一步采用HZSM-5（1）吸附剂对真实煤直接液化油混合酚的分离中发现，苯酚和对甲酚的选择性均达到100%。     

基于串联两阶段网络DEA模型的供应链规模收益分析

数据包络分析(DEA)是评价供应链系统(Supply chain system)间相对有效性的一种重要的工具,但是传统的DEA不考虑供应链的内部结构,对系统效率评价偏高;而本文所研究两阶段串联供应链系统,考虑把部分中间产品作为最终产品输出,增加额外中间投入的情形.基于所提出的供应链系统结构,本文建立相应的串联结构下的网络DEA模型,并针对所建立模型进行相关理论的研究,给出了串联结构下的生产可能集和规模收益情况判定方法.最后,进行数值实验,以验证我们提出的结论.     

Definition and detection of data-based uniqueness in evaluating bilinear (two-way) chemical measurements

Multivariate curve resolution methods, frequently used in analyzing bilinear data sets, result in ambiguous decomposition in general. Implementing the adequate constraints may lead to reduce the so-called rotational ambiguity drastically, and in the most favorable cases to the unique solution. However, in some special cases, non-negativity constraint as minimal information of the system is a sufficient condition to resolve profiles uniquely. Although, several studies on exploring the uniqueness of the bilinear non-negatively constrained multivariate curve resolution methods have been made in the literature, it has still remained a mysterious question. In 1995, Manne published his profile-based theorems giving the necessary and sufficient conditions of the unique resolution. In this study, a new term, i.e., data-based uniqueness is defined and investigated in details, and a general procedure is suggested for detection of uniquely recovered profile(s) on the basis of data set structure in the abstract space. Close inspection of Borgen plots of these data sets leads to realize the comprehensive information of local rank, and these argumentations furnish a basis for data-based uniqueness theorem. The reported phenomenon and its exploration is a new stage (it can be said fundament) in understanding and describing the bilinear (matrix-type) chemical data in general.     

Organic–Inorganic Hybrid Gold Halide Perovskites: Structural Diversity through Cation Size

Crystal structures of a series of organic–inorganic hybrid gold iodide perovskites, formulated as A₂[Au^II₂][Au^IIII₄] [A=methylammonium (MA) ( 1 ) and formamidinium (FA) ( 2 )], A′₂[I₃]_1−x[Au^II₂]_x[Au^IIII₄] [A′=imidazolium (IMD) ( 3 ), guanidinium (GUA) ( 4 ), dimethylammonium (DMA) ( 5 ), pyridinium (PY) ( 6 ), and piperizinium (PIP) ( 7 )], systematically changed depending on the cation size. In addition, triiodide (I₃⁻) ions were partly incorporated into the AuI₂⁻ sites of 3 – 7 , whereas they were not incorporated into those of 1 and 2 . Such a difference comes from the size of the organic cation. Optical absorption spectra showed characteristic intervalence charge-transfer bands from Au^I to Au^III species, and the optical band gap increased as the size of the cation became larger.     

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.     

Carathéodory's method for a class of dynamic games

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results.     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

Nonsensitiveness Regions for Threshold Ellipsoids

The problem is to determine nonsensitiveness regions for threshold ellipsoids within a regular mixed linear model.