脉冲氧活化测井技术

论述了脉冲氧活化测井技术的物理基础,测量原理和测量模型,介绍了脉冲活化测井应遵循的测井操作规程,给出了脉冲氧活化测井技术在水平井断裂口识别和聚合物注入工程有效性评价方面的应用实例。结果表明该技术具有显著的应用效果。     

An optimal algorithm for the on-line closest-pair problem

We give an algorithm that computes the closest pair in a set ofn points ink-dimensional space on-line, inO(n logn) time. The algorithm only uses algebraic functions and, therefore, is optimal. The algorithm maintains a hierarchical subdivision ofk-space into hyperrectangles, which is stored in a binary tree. Centroids are used to maintain a balanced decomposition of this tree.These authors were supported by the ESPRIT II Basic Research Actions Program, under Contract No. 3075 (project ALCOM).This author was supported in part by the National Science and Engineering Research Council of Canada.     

Note on the connectivity of line graphs

Let G be a connected graph with vertex set V(G), edge set E(G), vertex-connectivity κ(G) and edge-connectivity λ(G).A subset S of E(G) is called a restricted edge-cut if G−S is disconnected and each component contains at least two vertices. The restricted edge-connectivity λ₂(G) is the minimum cardinality over all restricted edge-cuts. Clearly λ₂(G)?λ(G)?κ(G).In 1969, Chartrand and Stewart have shown that

     

Model-based fault diagnosis in continuous dynamic systems

Traditional fault detection and isolation methods are based on quantitative models which are sometimes difficult and costly to obtain. In this paper, qualitative bond graph (QBG) reasoning is adopted as the modeling scheme to generate a set of qualitative equations. The QBG method provides a unified approach for modeling engineering systems, in particular, mechatronic systems. An input-output qualitative equation derived from QBG formalism performs continuous system monitoring. Fault diagnosis is activated when a discrepancy is observed between measured abnormal behavior and predicted system behavior. Genetic algorithms (GA's) are then used to search for possible faulty components among a system of qualitative equations. In order to demonstrate the performance of the proposed algorithm, we have tested it on a laboratory scale servo-tank liquid process rig. Results of the proposed model-based fault detection and diagnosis algorithm for the process rig are presented and discussed.     

关于"可移动Agent系统位置透明通信的一种实现"的一点注记

王红等人的文章“可移动Agent系统位置透明通信的一种实现”的结论是值得商榷的。文中指出该文的不足及欠明晰之处,对其结论进行了澄清。     

Resilient-optimal interactive consistency in constant time

For a complete network of n processors within which communication lines are private, we show how to achieve concurrently many Byzantine Agreements within constant expected time both on synchronous and asynchronous networks. As an immediate consequence, this provides a solution to the Interactive Consistency problem. Our algorithms tolerate up to (n-1)/3 faulty processors in both the synchronous and asynchronous cases and are therefore resilient-optimal. In terms of time complexity, our results improve a time bound of (for n concurrent agreements) which is immediately implied by the constant expected time Byzantine Agreement of Feldman and Micali (synchronous systems) and of Canetti and Rabin (asynchronous systems). In terms of resiliency, our results improve the resiliency bound of the constant time, -resilient algorithm of Ben-Or. An immediate application of our protocols is a constant expected time simulation of simultaneous broadcast channels over a network with private lines.Received: April 2001, Accepted: September 2002, Michael Ben-Or: Research supported by Israel Academy of Sciences and by United States - Israel Binational Science Foundation grant BSF-87-00082     

Enhanced fault tolerant routing algorithms using a concept of “balanced ring”

Fault rings can be used to guide messages bypass faulty nodes/links in a fault tolerant interconnection network. However, nodes on the fault ring become hot spots, thus causing uneven distribution of the traffic loads. To avoid such traffic congestion, a concept of the balanced ring is proposed in this paper. The proposed balanced ring, defined as concentric rings of a given fault ring, can be applied to the fault tolerant routing algorithms for mesh and torus topologies. By properly guiding messages to route on the balanced ring and the fault ring, more balanced link utilization and greatly reduced traffic congestion can be achieved on a fault tolerant network. Methods of applying the balanced ring concept to some published fault tolerant routing algorithms are discussed. Proof of deadlock and livelock freedom is also presented. The use of balanced ring does not need to add new virtual channels. The performance of two routing algorithms with and without the balanced ring is simulated and evaluated. The results indicate that routing algorithms with the balanced rings constantly yield larger throughput and smaller latency than those without.     

Detecting faults in heterogeneous and dynamic systems using DSP and an agent-based architecture

This paper demonstrates the use of multi-agent systems (MAS), firstly as a modelling technique for dynamic physical systems and secondly as the basis for a generic and powerful diagnostic system, which can support heterogeneous distributed systems. First an overview of the diagnostic techniques including those offered by the two communities fault detection and isolation (FDI ) and DX (based on intelligent techniques) is given. The use of digital signal processing (DSP) as a significant technique for improved fault diagnosis is illustrated. A rule-based engine is used to control the behaviours of the agents and also as a tool for diagnosis. Finally, the integration of DSP agents and the rule-based engine into MAS is demonstrated using a real-life application, a class-AB amplifier (a power electronic circuit). It is shown that the integration of DSP agents and rules into MAS provides a powerful tool for prognosis and for detection of abrupt (short and open circuit) and incipient faults.     

A method for calibrated maximum likelihood classification of forest types

A modification to the maximum likelihood algorithm was developed for classification of forest types in Sweden's part of the CORINE land cover mapping project. The new method, called the “calibrated maximum likelihood classification” involves an automated and iterative adjustment of prior weights until class frequency in the output corresponds to class frequency as calculated from objective (field-inventoried) estimates. This modification compensates for the maximum likelihood algorithm's tendency to over-represent dominant classes and under-represent less frequent ones. National forest inventory plot data measured from a five-year period are used to estimate relative frequency of class occurrence and to derive spectral signatures for each forest class. The classification method was implemented operationally within an automated production system which allowed rapid production of a country-wide forest type map from Landsat TM/ETM+ satellite data. The production system automated the retrieval and updating of forest inventory plots, a plot-to-image matching routine, illumination and haze correction of satellite imagery, and classification into forest classes using the calibrated maximum likelihood classification. This paper describes the details of the method and demonstrates the result of using an iterative adjustment of prior weights versus unadjusted prior weights. It shows that the calibrated maximum likelihood algorithm adjusts for the overclassification of classes that are well represented in the training data as well as for other classes, resulting in an output where class proportions are close to those as expected based on forest inventory data.     

XML在故障树分析软件中的应用

XML是树结构的文本文件，可以完整的保存故障树信息.本文时XML在故障树分析软件中的应用进行了研究，并试着给出了一个的XML构架和如何把故障树转化为XML文件。