基于OpenGL和MFC的石油井管道的绘制

介绍了O penGL的知识和石油井的基本概念,利用O penGL实现石油井管道的绘制,包括石油井数据的变换和管道起始点的跟踪和角度的旋转。纹理光照效果增强图形生动性,交互操作改变图形视角。并且利用DAO数据库和L istv iew控件实现数据保存和修改。该程序能够完成石油井的管道绘制和数据保存。     

智能电动机控制器在电收尘通风机上的应用

对智能电动机控制器的情况作了介绍，结合工作实践提出了维护要点和建议，并对该控制器的参数设置进行了说明，这对使用该设备的工业企业有一定的指导意义。     

电潜泵大修打捞配套工具研制

随着采液时间的延长,电潜泵井事故不断增加,仅辽河油田每年就有30口左右的电泵井需要转大修.由于没有专用的打捞工具,作业设备的能力有限,其处理事故的周期往往较长,效果不理想.因此,在已有φ139.7mm套管内电泵打捞工具的基础上,研制开发了φ177.8 mm套管内电泵打捞工具,解决了油田电泵打捞的难题.     

Tri-Gate Bulk MOSFET Design for CMOS Scaling to the End of the Roadmap

A tri-gate bulk MOSFET design utilizing a low-aspect-ratio channel is proposed to provide an evolutionary pathway for CMOS scaling to the end of the roadmap. 3-D device simulations indicate that this design offers the advantages of a multi-gate FET (reduced variability in performance and improved scalability) together with the advantages of a conventional planar MOSFET (low substrate cost and capability for dynamic threshold-voltage control).     

Optimal and self‐tuning fusion Kalman filters for discrete‐time stochastic singular systems

Based on the optimal fusion estimation algorithm weighted by scalars in the linear minimum variance sense, a distributed optimal fusion Kalman filter weighted by scalars is presented for discrete‐time stochastic singular systems with multiple sensors and correlated noises. A cross‐covariance matrix of filtering errors between any two sensors is derived. When the noise statistical information is unknown, a distributed identification approach is presented based on correlation functions and the weighted average method. Further, a distributed self‐tuning fusion filter is given, which includes two stage fusions where the first‐stage fusion is used to identify the noise covariance and the second‐stage fusion is used to obtain the fusion state filter. A simulation verifies the effectiveness of the proposed algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

Evolving artificial neural network ensembles

Using a coordinated group of simple solvers to tackle a complex problem is not an entirely new idea. Its root could be traced back hundreds of years ago when ancient Chinese suggested a team approach to problem solving. For a long time, engineers have used the divide-and-conquer strategy to decompose a complex problem into simpler sub-problems and then solve them by a group of solvers. However, knowing the best way to divide a complex problem into simpler ones relies heavily on the available domain knowledge. It is often a manual process by an experienced engineer. There have been few automatic divide-and-conquer methods reported in the literature. Fortunately, evolutionary computation provides some of the interesting avenues to automatic divide-and-conquer methods. An in-depth study of such methods reveals that there is a deep underlying connection between evolutionary computation and ANN ensembles. Ideas in one area can be usefully transferred into another in producing effective algorithms. For example, using speciation to create and maintain diversity had inspired the development of negative correlation learning for ANN ensembles, and an in-depth study of diversity in ensembles. This paper will review some of the recent work in evolutionary approaches to designing ANN ensembles.     

Structured optimal and robust control with multiple criteria: a convex solution

In this paper, the design of controllers that incorporate structural and multiobjective performance requirements is considered. The control structures under study cover nested, chained, hierarchical, delayed interaction and communications, and symmetric systems. Such structures are strongly related to several modern-day and future applications including integrated flight propulsion systems, platoons of vehicles, micro-electro-mechanical systems, networked control, control of networks, production lines and chemical processes. It is shown that the system classes presented have the common feature that all stabilizing controllers can be characterized by convex constraints on the Youla-Kucera parameter. Using this feature, a solution to a general optimal performance problem that incorporates time domain and frequency domain constraints is obtained. A synthesis procedure is provided which at every step yields a feasible controller together with a measure of its performance with respect to the optimal. Convergence to the optimal performance is established. An example of a multinode network congestion control problem is provided that illustrates the effectiveness of the developed methodology.     

Two‐phase production of cyclohexene and cyclooctene oxides in water as an approach to pollution prevention

Liquid–liquid two‐phase epoxidation from cyclohexene and cyclooctene in aqueous potassium peroxymonosulfate (commercially available as Oxone^®) solution was studied as an application in pollution prevention. To avoid potential emissions of volatile organic compounds an aqueous solution was employed to replace the usual chlorinated solvents used in epoxide production. A droplet column reactor and stirred tank reactor were used to investigate two‐phase synthesis of epoxide. An aqueous Oxone^® solution was used to oxidize a dispersion of alkene droplets and form epoxide. The study of aqueous epoxidation in both reactors showed that the epoxidation of alkenes can be represented as a first order reaction with respect to alkene. The salting out effect of Oxone^® concentration was studied in both reactors and found to be very similar at optimal conditions. In comparing the two reactors, it was found that the droplet column reactor produces larger quantities of product per unit reactor volume for the same reaction time. The objective of this study is to provide an alternative reactor design and synthesis route that can meet pollution prevention goals. Copyright © 2004 Society of Chemical Industry     

Evaluation of image similarity by histogram intersection

Colour is the most widely used attribute in image retrieval and object recognition. A technique known as histogram intersection has been widely studied and is considered to be effective for color‐image indexing. The key issue of this algorithm is the selection of an appropriate color space and optimal quantization of the selected color space. The goal of this article is to measure the model performance in predicting human judgment in similarity measurement for various images, to explore the capability of the model with a wide set of color spaces, and to find the optimal quantization of the selected color spaces. Six color spaces and twelve quantization levels are involved in evaluating the performance of histogram intersection. The categorical judgment and rank order experiments were conducted to measure image similarity. The CIELAB color space was found to perform at least as good as or better than the other color spaces tested, and the ability to predict image similarity increased with the number of bins used in the histograms, for up to 512 bins (8 per channel). With more than 512 bins, further improvement was negligible for the image datasets used in this study. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 265–274, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20122