On a large-gain theorem

The aim of this paper is to give a general quantitative requirement which the loop gain must satisfy in order to stabilize a given unstable (possibly nonlinear and time-varying) plant, namely that the gain must exceed one.     

利用先进的结构试验系统进行发动机构件的仿真疲劳试验

本文介绍一套先进的构件实验设备的功能及其在发动机构件疲劳试验方面的具体应用实例．通过对几种受力较复杂构件的受力分析设计出实验方法，使构件在实验室中受力情况与构件实际受力情况相似或相同，这样，得出的试验数据就可为构件的可靠性分析工作提供较好的依据．     

非标准工况下空分设备增产氩的研究与实践

文章对非标准工况下的空分设备增产氩措施进行了研究。以宝钢6#60000m3/h空分设备为例,通过设计型算法和校核型算法,建立了空分设备精馏的数学模型,通过改变数学模型的参数,分析了在非标准工况下精馏塔内的组分浓度分布,并提出了优化后的操作方案和操作参数,实施后提高了空分设备的氩提取率,取得了显著的经济效益。     

40000m~3/h空分设备主换热器的设计及制造

通过对进口 4 0 0 0 0m3 /h空分设备主换热器进行结构分析及对比模拟计算 ,用国产传热翅片进行设计、采用真空钎焊工艺制造的主换热器 ,经并网运行 ,设计指标优于原空分设备 ,为今后成套大型空分设备板翅式换热器国产化设计、制造创造了条件。     

大型居住区设计探索——“深圳市新亚洲花园”设计回顾

通过对大型住宅区“深圳市新亚洲花园”工程规划及建筑方案创作构思的分析,实现住宅提升人们生活品质的设计思想,同时,在规划设计上对住宅开发在经济市场上如何提升竞争力做了有益探索。     

The complexity of oblivious plans for orienting and distinguishing polygonal parts

In the problem ofparts feeding we are given a class of feasible operations for reorienting a part, and we are asked to find a fixed sequence of these operations which is guaranteed to bring the part into a known goal orientation from any possible initial orientation. Goldberg addressed this problem in [2], and showed that, for planar polygonal parts, there is always a sequence of simple operations which can be performed by a simple parallel-jaw gripper, which is guaranteed to orient the part (up to symmetry) without the use of any sensor information; he also conjectured thatO(n) steps are sufficient.In this paper we prove Goldberg's conjecture by explicitly constructing plans of at most2n – 1 steps for orienting polygonal parts in this model. We also give a lower bound on the number of steps required for such plans to show that this upper bound is tight.Finally, we extend these results to the problem ofdistinguishing among a finite set of parts using minimal sensing. Specifically, we assume that we are given a set of known polygonal parts, and a parallel-jaw gripper able to sense the distance between its jaws upon closure. We construct a simple oblivious plan of linear complexity which, when presented with a polygonal part, determines the index of this part.This research was supported in part by the NSF under Grant CCR-9207422, and by a Zumberge Fellowship. A preliminary version of this paper appeared in theProceedings of the Fourth Canadian Conference on Computational Geometry [1].     

BYJ型防喷脱接器的设计与应用

本文介绍了BYJ型防喷脱接器的结构和工作原理。它既有抽油杆与大泵活塞脱接功能,又能实现不压井作业施工,是大型抽油泵理想的配套工具。现场应用表明,该防喷脱接器对接成功率较高,并实现了大泵井不压井施工。     

Graph‐Theory Approach to Eigenvalue Problem of Large Space Structures

The dynamic analysis and control system design of large space structures involve the solution of the large‐dimensional generalized matrix eigenvalue problem. The computational effort involved is proportional to the third power of the dimension of the matrices involved. To minimize the computational time a graph‐theory approach to reduce a matrix to lower‐ordered submatrices is proposed. The matrix‐reduction algorithm uses the Boolean matrices corresponding to the original numerical matrices and, thus, the computational effort to reduce the original matrix is nominal. The computational savings directly depend upon the number of submatrices into which the original matrix is reduced. A free‐free square plate is considered as an example to illustrate the technique. In this example a matrix of 16th order is reduced to three scalars corresponding to three rigid‐body modes, and three matrices of order three and one matrix of order four.