钻井液振动筛叠层筛网透筛率的研究

从理论上详细论述了钻井液振动筛叠层筛网对固相颗粒分离的影响 ,首次提出用透筛率的概念定量地描述这一影响 ,并进行了实例计算。研究表明 ,当上下层筛网随机叠加时对透筛率的影响有以下几种情况 :(1)当上下层筛网开孔尺寸相除的余数为零 ,任意组合叠层筛网的透筛率分别为某一常数 ;(2 )上层筛网目数一定时 ,下层筛网目数越大 ,则透筛率越小 ;(3)上下层筛网的目数相差越小 ,透筛率越小 ;(4 )任意目数的上下层筛网随机叠加后 ,其透筛率仅在一个小范围内变化 ,因此任一叠层筛网有其固有的透筛率属性。     

Adaptive control of siso plants with unmodelled dynamics

In this paper we pursue a twofold aim. First we want to simplify the complexity of the classical Monopoli's scheme, the so-called ‘Augmented error signal control scheme’. Then we also wish to cope with the realistic situation in which the presence of unmodelled dynamics has to be taken into account. This latter problem has been faced in the literature by suitably modifying the adaptation mechanism in order to avoid undesired phenomena as well as to obtain an attractive stability region for the state trajectories starting from any point in a predefined initial condition set. In our case the necessity of introducing any sort of modification in the adaptation mechanism is completely avoided, but we still obtain asymptotic stability of the output error signal.     

阳平关砂金矿精选厂尾矿综合回收的研究

本文详细的介绍了陕西省阳平关砂金矿精选厂尾矿金和其他可利用的矿物综合回收方法和最佳分选流程。     

Response level crossing rate of a linear system excited by a partially specified Gaussian load process

The problem of determining the maximum mean response level crossing rate of a linear system driven by a partially specified Gaussian load process has been considered. The partial specification of the load is given only in terms of its total average energy. The critical input power spectral (PSD) function, which maximizes the mean response level crossing rate, is obtained. The critical input PSD turns out to be highly narrow-banded which fails to capture the erratic nature of the excitation. Consequently, the trade-off curve between the maximum mean response level crossing rate and the maximum disorder in the input process, quantified in terms of its entropy rate, has been generated. The method of Pareto optimization is used to tackle the conflicting objectives of the simultaneous maximization of the mean response level crossing rate and the input entropy rate. The non-linear multi-objective optimization has been carried out using a recently developed multi-criteria genetic algorithm scheme. Illustrative example of determining the critical input of an axially vibrating rod, excited by a partially specified stationary Gaussian load process, has been considered.     

Optimal Solutions for the Temporal Precedence Problem

Abstract. In this paper we refer to the Temporal Precedence Problem on Pure Pointer Machines . This problem asks for the design of a data structure, maintaining a set of stored elements and supporting the following two operations: insert and precedes . The operation insert (a) introduces a new element a in the structure, while the operation precedes (a,b) returns true iff element a was inserted before element b temporally. In [11] a solution was provided to the problem with worst-case time complexity O (log log n ) per operation and O(n log log n) space, where n is the number of elements inserted. It was also demonstrated that the precedes operation has a lower bound of Ω (log log n ) for the Pure Pointer Machine model of computation. In this paper we present two simple solutions with linear space and worst-case constant insertion time. In addition, we describe two algorithms that can handle the precedes (a,b) operation in O (log log d ) time, where d is the temporal distance between the elements a and b .     

国外钻井液和完井液用聚合物

９０年代以来，国外钻井液和完井液用聚合物添加剂的发展取得长足进步。本文介绍了国外目前用于钻井液和完井液的聚合物添加剂的类型及作用。     

Experimental densities for compressed R134a

This paper reports densities of compressed R134a (1,1,1,2-tetrafluoroethane) determined by using a contiuously weighed pycnometer at 20 K intervals between 180 and 380 K at pressures from slightly greater than the vapour pressure to 70 MPa. The results are accurate to within ±0.1%. Saturated liquid densities derived by extrapolation from the experimental values agree with other reported values to within ±0.3%.     

Dynamics of Solidification in 2% Corn Starch-Water Mixtures: Effect of Variations in Freezing Rate on Product Homogeneity

Directional solidification studies of gelatinized corn starch-water mixtures were undertaken in order to examine, in situ, the freezing behavior of this food model. The solidification rate was controlled by varying sample cell velocity as it moved from a 25°C hot stage to a -25°C cold stage. While freezing at cell velocities ≤7.5 μm/sec, starch granules were alternately pushed or entrapped by the advancing solid-liquid interface producing a segregated structure consisting of alternating high-starch and low-starch bands. At a cell velocity of 10 μm/sec, the frozen product was homogeneous. The relationship between the solid-liquid interface velocity and segregation behavior was quantified and compared to an existing model of particle-interface interactions.     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

The rank one mixed μ problem and ‘kharitonov-type’ analysis

The general mixed μ problem has been shown to be NP hard, so that the exact solution of the general problem is computationally intractable, except for small problems. In this paper we consider not the general problem, but a particular special case of this problem, the rank one mixed μ problem. We show that for this case the mixed μ problem is equivalent to its upper bound (which is convex), and it can in fact be computed easily (and exactly). This special case is shown to be equivalent to the so-called ‘affine parameter variation’ problem (for a polynomial with perturbed coefficients) which has been examined in detail in the literature, and for which several celebrated ‘Kharitonov-type’ results have been proven.