PES-C,(PP/Bis-T)PES的次级松驰与转变

描述了酚酞型聚芳醚砜(PES-C)的次级松驰和转变与其结构的关系.TBA和动态力学实验结果表明:PES-C及其共聚物(PP/Bis-T)PES分别在0～50℃和-100℃附近呈现出两个次级松驰峰;双酚T单元的引入导致了PES-C在0～50℃之间的次级松驰位置改变.证实了Cardo侧基的存在对-100℃的次级松驰有较大的贡献.     

Fuzzy格上的Urysohn度量化定理

当Ｌ是Ｆｕｚｚｙ格时,证明了一个ＣⅡ拓扑分子格（Ｌ,η）可点式ｐ．度量化当且仅当其是正则的;可点式度量化当且仅当其是正则Ｔ１的．     

Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee

The paper presents a general method of designing constant-factor approximation algorithms for some discrete optimization problems with assignment-type constraints. The core of the method is a simple deterministic procedure of rounding of linear relaxations (referred to as pipage rounding). With the help of the method we design approximation algorithms with better performance guarantees for some well-known problems including MAXIMUM COVERAGE, MAX CUT with given sizes of parts and some of their generalizations.     

Solving the part families problem in discrete-parts manufacture by simulated annealing

In the production planning and control of discrete-parts manufacture, aggregation of parts into families, on the basis of similarity, is carried out to ease both long-horizon planning and short-horizon scheduling. Additional advantages are related to those of group technology (GT), such as simplifying the flow of parts and tools and reducing both set-up and production costs. The problem of formally forming part families is presented and discussed. Previous work is reviewed and assessed. Two solution approaches, one based on a location model, the other on simulated annealing, are presented and compared along with test results. The location formulation, which results in an integer programming model solved by Lagrangian relaxation, proved capable of producing solutions of excellent quality, but only for relatively small problem instances. In contrast, simulated annealing, which is a general heuristic approach to combinatorial optimization, produced solutions of comparable quality and could handle realistically large problem instances. However, careful design of the simulated annealing algorithm is crucially important. An effective design is presented.     

Bounding Optimal Expected Revenues for Assortment Optimization under Mixtures of Multinomial Logits

We consider assortment problems under a mixture of multinomial logit models. There is a fixed revenue associated with each product. There are multiple customer types. Customers of different types choose according to different multinomial logit models whose parameters depend on the type of the customer. The goal is to find a set of products to offer so as to maximize the expected revenue obtained over all customer types. This assortment problem under the multinomial logit model with multiple customer types is NP‐complete. Although there are heuristics to find good assortments, it is difficult to verify the optimality gap of the heuristics. In this study, motivated by the difficulty of finding optimal solutions and verifying the optimality gap of heuristics, we develop an approach to construct an upper bound on the optimal expected revenue. Our approach can quickly provide upper bounds and these upper bounds can be quite tight. In our computational experiments, over a large set of randomly generated problem instances, the upper bounds provided by our approach deviate from the optimal expected revenues by 0.15% on average and by less than one percent in the worst case. By using our upper bounds, we are able to verify the optimality gaps of a greedy heuristic accurately, even when optimal solutions are not available.     

A combinatorial study of two-periodic random walks

Two-periodic random walks have up-steps and down-steps of one unit as usual, but the probability of an up-step is α after an even number of steps and β = 1 ? α after an odd number of steps, and reversed for down-steps. This concept was studied by Böhm and Hornik^{[2 Böhm, W.; Hornik, K. On two-periodic random walks with boundaries. Stoch. Models 2010, 26, 165–194.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]]}. We complement this analysis by using methods from (analytic) combinatorics. By using two steps at once, we can reduce the analysis to the study of Motzkin paths, with up-steps, down-steps, and level-steps. Using a proper substitution, we get the generating functions of interest in an explicit and neat form. The parameters that are discussed here are the (one-sided) maximum (already studied by Böhm and Hornik^{[2 Böhm, W.; Hornik, K. On two-periodic random walks with boundaries. Stoch. Models 2010, 26, 165–194.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]]}) and the two-sided maximum. For the asymptotic evaluation of the average value of the two-sided maximum after n random steps, more sophisticated methods from complex analysis (Mellin transform, singularity analysis) are required. The approach to transfer the analysis to Motzkin paths is, of course, not restricted to the two parameters under consideration.     

Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration

We present a few comments on the paper Attacking the market split problem with lattice point enumeration by A. Wasserman, published in Journal of Combinatorial Optimization, vol. 6, pp. 5–16, 2002.     

Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem

This paper introduces tight upper bounds for the daily photograph scheduling problem of earth observation satellites. These bounds, which were unavailable until now, allow us to assess the quality of the heuristic solutions obtained previously. These bounds are obtained with a partition-based approach following the divide and pas conquer principle. Dynamic programming and tabu search are conjointly used in this approach. We present also simplex-based linear programming relaxation and a relaxed knapsack approach for the problem.     

卤化物的稳定性

本文利用热力学原理,计算晶格能和自由能变,根据晶格能及自由能变来判断离子型卤化物的稳定性。     

一般信息系统的PoClustering与概念格

传统聚类方法生成的子集,一般来说都是不相交的.而严格的不相交分类结构,不能充分表现象本体这样的事物间丰富的类关系.在基因本体中,类与子类既不是简单的树也不是格结构,而是一个有向非循环图,其任何子女都可能有多个父结点.PoClustering是相异数据的一种无损聚类方法,概念格则反映了数据的对象和属性的对应关系.采用了PoClustering方法,在保持尽量多的信息的前提下建立一般数据集(信息系统)的属性确定下的概念化分类,讨论了它的算法,从概念格的角度研究了这种类的结构特征.