弹塑性结构在外载和温度作用下的安定分析

本文在考虑外载和温度的缓慢变化下，提出了一个新的运动安定定理。同时，在此基础上，又导出了既简单又适用的增量破坏准则．文末也以实例说明了它的应用。     

An Incremental Algorithm for the Maximum Flow Problem

An incremental algorithm may yield an enormous computational time saving to solve a network flow problem. It updates the solution to an instance of a problem for a unit change in the input. In this paper we have proposed an efficient incremental implementation of maximum flow problem after inserting an edge in the network G. The algorithm has the time complexity of O((n)² m), where n is the number of affected vertices and m is the number of edges in the network. We have also discussed the incremental algorithm for deletion of an edge in the network G.     

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most ^p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =₁××_n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=₁××_n for a system of polymatroid inequalities does not exceed max{Q,^logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2^c(^c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}ⁿ, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides . This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20     

双非线性四边形平面应力单元分析石拱桥的极限承载力

采用共旋坐标法导出了四边形平面应力单元在大转动、小应变条件下的几何非线性和材料非线性的单元切线刚度矩阵;在此基础上编制相应的有限元FORTRAN程序;对交通部公路桥涵标准图中的23个单跨石拱桥的计算与分析表明:共旋坐标法四边形平面应力单元的列式、程序和求解器具有较强的非线性分析能力,能较好地分析石拱桥受力全过程的非线性性能.该计算结果提供了对中小跨度石拱桥非线性性能的更多的了解,可供工程设计人员参考.图8,表1,参10.     

Experimental investigation of incremental reactivity of di-tert-butyl peroxide

Large quantities of di-tert-butyl peroxide (DTBP) have been emitted into the troposphere due to human activities. Its role in the atmospheric photochemical reaction has not been understood. This study presents the results of the photochemical reactions of DTBP and NOx, which have been simulated in a self-made smog chamber under the temperature of (29±1)℃. Both the wall decays of ozone and NO2 could be neglected, compared to the results in simulative experiments. The effective intensity of UV light used in the experiments was 1.28×10-3 s-1, which was expressed by the rate constant of NO2 photolysis in purified air. The reaction mechanism was proposed according to our results and reports of other researchers. The maximum values of incremental reactivity (IR) in the three simulative ex- periments were 9.53×10-2, 5.23×10-2 and 3.78×10-2, respectively. The incremental reactivity decreased with the increase of initial concentrations of DTBP. The IR value of DTBP obtained in this study was comparable to that of acetylene reported in our previous research.     

关联规则挖掘算法及其在冷轧生产中的应用

针对Apriori算法在实际应用中无法发现关联规则变化趋势的问题,该文根据增量挖掘算法的优点对Apriori算法进行了改进。改进的Apriori算法能够在原算法的基础上,通过关联规则统计量的变化确定强规则与候选规则之间的转换,从而进一步发现关联规则的变化趋势,提高了依靠Apriori算法得到的关联规则对决策分析支持的可靠性。将改进算法应用于冷轧生产过程预测中,试验结果表明,改进算法相对于传统的Apriori算法对产量预测的精度提高了30%。     

边界约束下的增量式布图规划算法

快速地在局部范围内调整布图已经成为一种设计需要。该文提出了一种二阶段法来实现边界约束下的增量式布图规划算法。根据已有布图规划建立松弛推移图,直观描述各模块之间"空白区"和松弛量的情况;同时建立模块交换图,记录所有具有形状相似特征的模块集合,基于这2个图进行增量式布图规划。第1阶段,基于推移图和交换图调整布图规划,使其满足边界约束。第2阶段,再次利用交换图进行互连性能优化。实验结果表明该算法在较短的时间里不仅对原有布图规划进行了有效调整满足了给定的所有的几何约束,而且还保证了芯片的面积和线长效果。     

一种挖掘序列模式的增量式更新算法

讨论了当从序列数据库中删除某些信息时，序列模式的更新维护问题。提出了一种新的算法MA_D（Maintaining Algorithm while Deleting information）, 处理因数据库更新而引起的序列模式的维护问题。该算法充分利用在前次模式挖掘过程中得到的信息，降低了挖掘新的序列模式的开销。实验分析表明，该算法对于序列模式的维护是十分有效的。     

自动调线机控制系统选针器定位的实现

设计了一种基于单片机的自动调线机控制系统,介绍了系统的各个组成部分及工作原理,详细设计了增量式旋转编码器对自动调线机的选针器准确定位的方法,实例证明该定位方法能够使系统准确、稳定地工作。     

会计准则价值相关性研究综述

20世纪后期以来，国际学术界注重国际会计准则与本土会计准则披露的会计信息相关性的比较研究，关于会计准则相对价值相关性和增量价值相关性的研究，有利于各国会计制度的完善和外商投资策略的调整。