Thermal latency of novel chelating borate catalysts as latent catalysts for epoxy–phenolic resins

Novel quaternary ammonium bis(2‐oxybenzoyloxy)borate salts ( 1a – 1c ) or quaternary ammonium bis(1,2‐benzenedioxy)borate salts ( 2a and 2b ) with tetra‐n‐butylammonium (TBA⁺), tetra‐n‐octylammonium (TOA⁺), or bis(triphenylphosphoranylidene)ammonium (PNP⁺) cations were synthesized as latent catalysts of epoxy/phenol–novolac resins by the complexation between boric acid and salicylic acid or catechol, followed by neutralization with quaternary ammonium hydroxide. Polyaddition reactions of diglycidyl ether of bisphenol A (DGEBA) and 4,4′‐bisphenol F (44BPF) or bisphenol F (BPF‐D) with the ammonium borates were investigated as model reactions of epoxy/phenol–novolac resin systems with respect to the thermal latency and storage stability of the catalyst. The polyaddition of DGEBA/44BPF with 1a – 1c in diglyme at 150 °C for 6 h proceeded up to 85–96% conversions and gave polymers with number‐average molecular weights of 4180–10,500, whereas the polyaddition at 80 °C for 6 h gave less than 8% conversions. However, the polyaddition with 2a containing TBA⁺ cation proceeded to only a 32% conversion at 150 °C for 6 h in diglyme and to a 64% conversion even at 180 °C for 6 h in triglyme and only gave low molecular weight oligomers, and no reaction proceeded in the polyaddition at 80 °C. However, polyaddition with 2b containing PNP⁺ cation proceeded up to a 96% conversion at 150 °C for 6 h in diglyme and gave a higher molecular weight polymer with a number‐average molecular weight of 8050, whereas the polyaddition at 80 °C for 6 h gave only a 5% conversion. The catalytic activity of ammonium borates 1a – 1c and 2a and 2b depended on the borate anion structure: 1a and 1c with bis(2‐oxybenzoyloxy)borate anion revealed higher activity than 2a and 2b with bis(1,2‐benzenedioxy)borate anion, respectively. In comparison with tetra‐n‐butylammonium bromide (TBAB) as a conventional ammonium salt or tetra‐n‐butylammonium tetrakis(benzoyloxy)borate (TBA‐TBB), 1a – 1c and 2b revealed better thermal latency. The catalytic activity of ammonium borates also depended on the bulkiness of the ammonium cation, and the order of activity was 1c (PNP⁺) > 1b (TOA⁺) ≧ 1a (TBA⁺) and 2b (PNP⁺) > 2a (TBA⁺). The storage stability of DGEBA/BPF‐D with the ammonium borate catalysts 1a – 1c and 2a and 2b in bulk at 40 °C was much better than that with TBAB and TBA‐TBB. © 2002 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 40: 2702–2716, 2002     

Two improved formulations for the minimum latency problem

In network problems, latency is associated with the metric used to evaluate the length of the path from a root vertex to each vertex in the network. In this work we are dealing with two applications or variations of the minimum latency problem known as the repairman problem and the deliveryman problem. We have developed two integer formulations for the minimum latency problem and compared them with other two formulations from the literature for the time-dependent traveling salesman problem. The present work highlights the similarities and differences between the different formulations. In addition, we discuss the convenience of including a set of constraints in order to reduce the computation time needed to reach the optimal solution. We have carried out extensive computational experimentation on asymmetrical instances, since they provide the characteristics of the deliveryman and repairman problems in a better way.     

A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

In this paper we consider the Cumulative Capacitated Vehicle Routing Problem (CCVRP), which is a variation of the well-known Capacitated Vehicle Routing Problem (CVRP). In this problem, the traditional objective of minimizing total distance or time traveled by the vehicles is replaced by minimizing the sum of arrival times at the customers. We propose a branch-and-cut-and-price algorithm for obtaining optimal solutions to the problem. To the best of our knowledge, this is the first published exact algorithm for the CCVRP. We present computational results based on a set of standard CVRP benchmarks and investigate the effect of modifying the number of vehicles available.     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

An improved approximation ratio for the minimum latency problem

Given a tour visitingn points in a metric space, thelatency of one of these pointsp is the distance traveled in the tour before reachingp. Theminimum latency problem (MLP) asks for a tour passing throughn given points for which the total latency of then points is minimum; in effect, we are seeking the tour with minimum average arrival time. This problem has been studied in the operations research literature, where it has also been termed the delivery-man problem and the traveling repairman problem. The approximability of the MLP was first considered by Sahni and Gonzalez in 1976; however, unlike the classical traveling salesman problem (TSP), it is not easy to give any constant-factor approximation algorithm for the MLP. Recently, Blum et al. (A. Blum, P. Chalasani, D. Coppersimith, W. Pulleyblank, P. Raghavan, M. Sudan, Proceedings of the 26th ACM Symposium on the Theory of Computing, 1994, pp. 163–171) gave the first such algorithm, obtaining an approximation ratio of 144. In this work, we develop an algorithm which improves this ratio to 21.55; moreover, combining our algorithm with a recent result of Garg (N. Garg, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 302–309) provides an approximation ratio of 10.78. The development of our algorithm involves a number of techniques that seem to be of interest from the perspective of the TSP and its variants more generally. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Supported by NSF contract 9302476-CCR and an NEC research grant.Author supported by an ONR Graduate Fellowship.     

Design of a Two layer Scalable Wavelength Routing Optical Interconnection Network

１　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｈｉｇｈｐｅｒｆｏｒｍａｎｃｅｐａｒａｌｌｅｌｃｏｍｐｕｔｉｎｇｐｌａｔｆｏｒｍｍａｄｅｕｐｏｆｗｏｒｋｓｔａｔｉｏｎｓｏｒｐｅｒｓｏｎａｌｃｏｍｐｕｔｅｒｓｉｎｔｅｒｃｏｎｎｅｃｔｅｄｂｙｎｅｔｗｏｒｋｈａｓｂｅｃｏｍｅｔｈｅｍａｉｎｄｅｖｅｌｏｐｍｅｎｔｓｔｒｅａｍｏｆｐａｒａｌｌｅｌｃｏｍｐｕｔｉｎｇｔｅｃｈｎｏｌｏｇｉｅｓ［１,２］．Ｗｉｔｈｔｈｅｅｎｈａｎｃｅｍｅｎｔｏｆｎｏｄｅｃｏｍｐｕｔｅｒｐｒｏｃｅｓｓｉｎｇｃａｐａｂｉｌｉｔｉｅｓ,ｉｔｂｅｃｏｍ…     

Structure–initiator activity dependence of aminimides as thermally latent initiators in the polymerization of glycidyl phenyl ether

Novel aliphatic aminimides were synthesized from the corresponding carboxylic acid esters, 1,1‐dimethylhydrazine, and epoxides in 54–95% yields. Bulk polymerization of glycidyl phenyl ether (GPE) with 3 mol % of the aminimides was evaluated by DSC as a model process for curing of epoxy resin. All the aminimides showed no exothermic DSC peak below 120 °C but showed sharp exothermic peaks above 137 °C, indicating good thermal latency. Good relationships were observed between the calculated bond length from the carbonyl carbon to the α‐carbon of the aliphatic group (R C), DSC onset temperatures, and the thermal dissociation temperatures (T_d 's) of the aminimides. The aminimide with a longer R C bond length showed lower T_d and DSC onset temperature, that is, higher activity. © 2000 John Wiley & Sons, Inc. J Polym Sci A: Polym Chem 38: 3428–3433, 2000     

货运列车的编组调度问题的研究

对于货运列车的编组调度问题,建立了以压缩中时和增加运量为双目标、多约束的0-1规划模型,采用逐步紧缩中时约束的方法得到了问题一的调度方案.在此基础上对装载特别物资的车辆施加更强的中时约束得到了问题二的调度方案.提出了列车匹配系数的概念并建立了列车最优配对原则,根据该原则对列车进行优化编组得到了问题三的调度方案.基于问题二的数据转换处理得到了问题四的调度方案.     

基于遗传算法的片上网络低功耗映射

随着片上网络(Network-on-Chip)集成度的提高,功耗逐渐成为设计的焦点.本文提出了一种在延时约束条件下,基于遗传算法的片上网络通信链路的低功耗映射算法.该算法使用数组方式编码染色体,并采用非常规码的交叉和变异运算因子.它充分利用遗传算法的群体优势,能快速有效地对通信功耗作优化.实验表明,该算法能平均减少50%左右的通信功耗.