热交联法制备低含氧量碳化硅纤维初步研究

通过对低预氧化程度的聚碳硅烷 (PCS)纤维进行热交联处理 ,降低SiC纤维中的氧含量 ,经过二步烧成法制备出机械性能及高温耐氧化性能优良的连续SiC纤维。通过IR、XRD、SEM、元素分析仪等分析手段系统研究了研究了热交联碳化硅纤维的热交联处理的工艺条件、烧成工艺 ,研究了热交联碳化硅纤维的组成、微观结构及其与纤维的力学性能、高温抗氧化性能的关系     

Neighborhood search heuristics for selecting hierarchically well‐formulated subsets in polynomial regression

The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

方差分量的Bayes二次无偏估计及可容许估计的非负性

对于有P 个方差分量的线性模型,本文导出了方差分量线性函数的Bayes 不变二次无偏估计的显示表达式,证明了Bayes 不变二次无偏估计类形成了可容许的不变二次无偏估计的完全类。在可容许的不变二次无偏估计类中,讨论了非负参数函数的非负估计问题,给出了可容许的非负定估计存在的充要条件。     

一类高次多项式系统极限环的讨论

通过变换将一类高次多项式系统化为Lienard系统,利用Hopf分枝定理和张芷芬唯一性定理,证明了该类系统极限环的存在性与唯一性。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

海峡两岸出入境管理问题研究

从出入境管理的角度，分析两岸人员往来管理工作的现状及存在的问题，提出海峡两岸出入境管理工作要适应当前出入境人员大进大出、快进快出的形势，简化出入境手续，切实保障海峡两岸“三通”的顺利进行，进而推动两岸的交流与合作。     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

算术映射交织器设计的改进

首先分析算术二次同余映射的原理 ,然后在此基础上对交织器的映射关系加以保奇偶序限制和移位运算 ,从而得到两个改进型的算术映射交织算法。通过仿真对改进型交织器的性能进行验证 ,结果说明在复杂度可比的情况下 ,改进后的交织器比传统分组交织器具有更好的译码性能。     

谈网络理论与现代控制论的交叉结合

当前计算机技术的飞速发展和多学科的交叉结合,给复杂网络的设计和计算等带来了深刻的变化。"现代控制论"与"现代网络理论"一直紧密地联系着,控制论的要领与方法已渗透到网络分析中,可以认为网络理论是受基尔霍夫定律约束的系统理论的子学科。     

球约束凸二次规划的一个算法

针对球约束凸二次规划问题,利用Lagrange对偶将其转化为无约束优化问题,然后运用单纯形法对其求解,获得原问题的最优解。最后,对文中给出的算法给出了论证。