大功率CO_2激光器非平衡态合成WO_3／Fe_2O_3新型陶瓷催化剂──Ⅱ．WO_3／Fe_2O_3烯烃歧化反应催化剂的催化活性

用大功率ＣＯ２激光器熔制ＷＯ３／Ｆｅ２Ｏ３新型烯烃歧化反应催化剂。考查了催化剂组成、激光功率及熔炼时间与丙烯歧化反应催化活性之间的关系。     

具有PDEB LB膜的声表面波湿度传感器

介绍一种新型聚炔离子导体湿敏材料－聚对二炔苯的Ｌａｎｇｍｕｉｒ－Ｂｏｌｄｇｅｔｔ成膜原理与制备，淀积有１０层ＰＤＥＢ ＬＢ膜层的声表面波延迟线型湿度传感器的特性。由于ＬＢ成膜技术拉制的膜可以在分子水平上进行定量控制，保证了膜的均匀性和一致性。     

Minimizing makespan on a single machine subject to random breakdowns

We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns. We identify a class of uptime distributions under which LPT minimizes expected makespan.     

无线传感器网络MAC层协议的对比研究

无线传感器网络是二十一世纪新兴的网络技术，它的出现使网络的发展进入一个新的阶段。针对无线传感器网络MAC层协议的研究一直是人们普遍关注的问题。总结了近年来的研究成果并针对TDMA，IEEE802．15．4，S—MAC，T—MAC几种典型的MAC层协议进行了对比分析，根据其各自的优点提出将来工作的方向和建议。     

Performance evaluation of fiber Bragg grating sensors by digital holographic technique, strain gauge measurement

In view of the growing interest for non-destructive tests of materials, geodynamical monitoring and in general remote sensing, there is a great effort to bring practical optical sensors from research labs to industrial and environmental applications. In this paper, we employ digital holographic technique as an efficient tool for evaluating the strain measurement capability of fiber Bragg gratings (FBG). A cantilever beam has been employed as a test structure under loading test. The strain measurements results obtained by fiber-based sensors have been compared to those obtained by using full-field digital holographic technique and point-wise strain gauge sensors glued on the same cantilever beam. A simple theoretical model is also presented to interpret and compare the experimental results coming from different techniques.     

硅尖阵列-敏感薄膜复合型阴极真空微电子压力传感器特性的测试

封装、测试了硅尖阵列-敏感薄膜复合型阴极的真空微电子压力传感器，在计算机模拟计算的基础上，对封装好的真空微电子压力传感器进行了实物测试，得出实物测试场发射电流曲线（开启电压低，发射电流曲线与计算机模拟曲线一样，电压45V时发射电流可达到86mA，平均每个硅尖为21μA）、压力特性曲线（呈线性变化，与计算机模拟计算的曲线相近）及灵敏度数据。电压1.5V即可测试并且其压力特性成线性变化，灵敏度为0.3μA/kPa。     

Optimal vaccine scheduling in cancer immunotherapy

Cancer immunotherapy aims at stimulating the immune system to react against cancer stealth capabilities. It consists of repeatedly injecting small doses of a tumor-associated molecule one wants the immune system to recognize, until a consistent immune response directed against the tumor cells is observed.

We have applied the theory of optimal control to the problem of finding the optimal schedule of injections of an immunotherapeutic agent against cancer. The method employed works for a general ODE system and can be applied to find the optimal protocol in a variety of clinical problems where the kinetics of the drug or treatment and its influence on the normal physiologic functions have been described by a mathematical model.

We show that the choice of the cost function has dramatic effects on the kind of solution the optimization algorithm is able to find. This provides evidence that a careful ODE model and optimization schema must be designed by mathematicians and clinicians using their proper different perspectives.     

Scheduling orders for multiple product types to minimize total weighted completion time

We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space.     

Utilization of carbohydrates by radiation processing

Upgrading and utilization of carbohydrates such as chitosan, sodium alginate, carrageenan, cellulose, pectin have been investigated for recycling these bio-resources and reducing the environmental pollution. These carbohydrates were easily degraded by irradiation and various kinds of biological activities such as anti-microbial activity, promotion of plant growth, suppression of heavy metal stress, phytoalexins induction, etc. were induced. On the other hand, some carbohydrate derivatives, carboxymethylcellulose and carboxymethylstarch, could be crosslinked under certain radiation condition and produce the biodegradable hydrogel for medical and agricultural use.     

FMS scheduling based on timed Petri Net model and reactive graph search

This paper presents a new scheduling method for manufacturing system based on the Timed Petri Net model and a reactive fast graph search algorithm. The following two typical problems are addressed in this paper. (1) Minimization of the maximum completion time. (2) Minimization of the total tardiness. As for the problem (1), a new search algorithm which combines the RTA^∗ and a rule-based supervisor is proposed. As for problem (2), the original Petri Net model is converted to its reverse model and the algorithm developed for the problem (1) is applied, regarding the due date as the starting time in the reverse model. Some numerical experiments are carried out to demonstrate usefulness of our algorithm.