CVC轧机冷轧宽带材板形控制特性的数值模拟

以六次偶函数拟合宽带材出口横向厚度分布，计算了ＣＶＣ轧机冷轧宽带材前张应力横向分布，首次以张应力横向分布的形式，模拟了ＣＶＣ轧机冷轧宽带材板形控制特性，模拟结果证明：ＣＶＣ轧机冷轧宽带材时具有很强的板形控制能力。     

三维方腔拖曳流的数值模拟

本文推导出一种适用于定常和不定常粘性不可压缩Navier-Stokes方程的分裂步方法。采用Taylor-Galerkin有限元格式进行求解，对有限元等式中关于速度的时间项进行三点向后差分，深入考虑粘性不可压缩流Navier-Stokes方程中对流项的作用，利用二阶Taylor展开完成时间项向空间项的转化，采用张量分析的方法推导了N-S方程分裂步方法的有限元离散格式，并采用低Reynolds数三维方腔拖曳粘性流^[23][24]作为基本算例，检验了这种分裂步方法的稳定性和有效性，同时与大涡模拟相结合对Reynolds数为10000的三维方腔拖曳湍流流场进行了相关的分析，进一步揭示了方腔回流运动的非定常非对称性、流动结构表现为竖轴环流与立面环流相叠加、流速沿垂线分布相对均匀等流动规律，显示了该方法与大涡模拟相结合能够有效地捕捉涡系及其时变过程。     

The equational theory of regular words

Courcelle introduced the study of regular words, i.e., words isomorphic to frontiers of regular trees. Heilbrunner showed that a nonempty word is regular iff it can be generated from the singletons by the operations of concatenation, omega power, omega-op power, and the infinite family of shuffle operations. We prove that the algebra of nonempty regular words on the set A, equipped with these operations, is freely generated by A in a variety which is axiomatizable by an infinite collection of some natural equations. We also show that this variety has no finite equational basis and that its equational theory is decidable in polynomial time.     

消息传递并行环境中全文换操作的发送接收序

传统的全交换操作实现未考虑消息的发送接收序对进程阻塞数目的影响.本文通过理论推导,证明其将导致单进程平均阻塞数、单进程最大阻塞数、所有进程平均阻塞数、所有进程最大阻塞数的量级分别为O(logN)、O(N)、O(NlogN)、O(N2);接着按优化程度提出了三种改进的发送接收序:任意发送层次接收、单一集中控制、层次多集中控制,其中层次多集中控制的后三个参数的量级分别减少至O(logN)、O(N)、O(N).     

入库钢板对齐技术的开发

针对影响入库钢板对齐度的几个难题，从理论和实践进行了分析，开发了入库钢板对齐新技术，从而解决了这一长期影响产品垛放外观形象的难题．     

A method for unit commitment with transmission losses and flow constraint

Researches on the unit commitment with transmission network have been reported recently. However, most of these researches mainly discussed the security constrained unit commitment, while the relationship between unit commitment and transmission losses was not considered. However, from the standpoint of operating reserve for ensuring power supply reliability, a unit commitment considering transmission losses is required. Further, under the deregulation and liberalization of the electric power industry, not only the line's security but also transmission losses are expected to play an important role in calculating the network access charge, and unit commitment taking into account transmission losses is also desired from this viewpoint. In this paper, a unit commitment approach with both transmission losses and line flow constraint is presented. Based on a heuristic iterative optimization method, first, an initial schedule is created by using a successively decommitting unit approach that is proposed in this paper. Then, we determine constraints included in the unit commitment schedule by a heuristic iterative optimization approach, in which an algorithm able to get rid of line overload by DC optimal power flow is developed. Through numerical simulations on two test power systems, the effectiveness of the proposed method is shown. © 2003 Wiley Periodicals, Inc. Electr Eng Jpn, 142(4): 9–19, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.10116     

Out of order quantifier elimination for Standard Quantified Linear Programs

In this paper, we present an out of order quantifier elimination algorithm for a class of Quantified Linear Programs (QLPs) called Standard Quantified Linear Programs (SQLPs). QLPs in general and SQLPs in particular are extremely useful constraint logic programming structures that find wide applicability in the modeling of real-time schedulability specifications; see Subramani [Subramani, K., 2005a. A comprehensive framework for specifying clairvoyance, constraints and periodicity in real-time scheduling. The Computer Journal 48 (3), 259–272]. Consequently any algorithmic advance in their solution has a strong practical impact. Prior to this work, the only known approaches to the solution of QLPs involved sequential variable elimination; see Subramani [Subramani, K., 2003b. An analysis of quantified linear programs. In: Calude, C.S. et al. (Eds.), Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science. DMTCS. In: Lecture Notes in Computer Science, vol. 2731. Springer-Verlag, pp. 265–277]. In the sequential approach, the innermost quantified variable is eliminated first, followed by the variable which then becomes the innermost quantified variable and so on, until we are left with a single variable from which the satisfiability of the original formula is easily deduced. This approach is applicable in both discrete and continuous domains; however, it is to be noted that the logic demanding the sequential approach requires that the variables are discrete-valued. To the best of our knowledge, the necessity for sequential elimination over continuous-valued variables has not been investigated in the literature. The techniques used in the development of our elimination algorithm may find applications in domains such as classical logic and finite model theory. The final aspect of our research concerns the structure-preserving nature of the algorithm that we introduce here; in general, it is not known whether discrete domains admit such elimination procedures.     

The use of a specific function to estimate maximum methane production in a batch‐fed anaerobic reactor

A readily biodegradable substrate was used to assess the value of using a mathematical function of y = y_maxexp^m/x as a simplified method of determining the maximum methane production (G_max) in a batch anaerobic reactor. Experimental results to test the method used three different initial substrate loadings in pre‐acclimatised completely mixed anaerobic reactors. Gas production was found to follow a typical trend that has previously been described by first order reaction kinetics; for the purpose of fitting the linearisation, it requires a value for maximum cumulative methane production. Use of the modified specific function to yield the equation G = G_maxexp^m/t showed that the experimental gas production curve could be estimated with a high degree of similarity. This was confirmed by a statistical analysis using the method of residuals which gave a correlation coefficient (R²) greater than 0.97 between experimental and estimated values. Using a graphical linearisation of the specific function produced a simplified method of predicting G_max. The value obtained was then used in a first order kinetic model to derive the specific coefficient rate (K_o), which was in agreement with other methods used for its determination. Copyright © 2004 Society of Chemical Industry     

正交复用QAM系统的定时和载波相位跟踪新算法

在数字信号传输系统中，正交复用ＱＡＭ（ＯＭＱＡＭ）是目前最有效的一种抗信道失真传输技术，但它对系统的定时偏移和载波相位误差非常敏感。本文基于高阶累积量技术，导出了一种新的ＯＭＱＡＭ系统定时和载波相位的跟踪算法。计算机仿真证实了这一理论分析结果，并同原有的Ｈｉｒｏｓａｋｉ算法做了比较     

“SEQ OF PAR”结构化并行程序设计

本文基于有关因果关系复合的Ｃｏｍｍｕｎｉｃａｔｉｏｎ Ｃｌｏｓｅｄ Ｌａｙｅｒ理论提出了一种结构化并行程序设计方法以支持不同并行平台的“通用”并行程序设计。该模型采用“ＳＥＱ ＯＦ ＰＡＲ”的层次化结构和基于伪同态的并行抽象数据类型来分析和刻画程序的并行行为。