电脑提花圆机图案的设计与开发

应用当前景流行的图形设计软件Coredraw9.0和Photoshop5.0，设计针织面料T恤花型，进一步利用SCC4F-548型电脑提花圆机相配套的图形设计软件Aupaint处理，生成提花花型图案，为夏季T恤花型图案设计提供了一条简便快捷的设计方法和新的设计思路。     

电视机监督检验电磁兼容结果分析和对策

本文讨论了电磁兼容对电视机的技术要求和相应对策。     

数字化制模新技术

数字化制模技术是将三维CAD模型直接转化成为铸造用模的新技术。文中介绍了华中科技大学开发的HRP系列数字化制模技术的原理及制模工艺。与传统制模方法相比 ,具有制模速度快、精度高、质量好、价格便宜等优点。文中还以制作轿车制动器卡钳体模样、搅拌叶片模样、蜗壳凸样为例说明了运用数字化制模新技术的优点     

三峡地下电站变顶高尾水洞水动力特性

在国内首次应用模型水轮发电机组对三峡地下电站变顶高尾水洞方案进行水力过渡过程试验研究。对水轮机导叶实行分段关闭 ,并求出了二段关闭的最佳拐点 ,试验证实了二段关闭对减小尾水管进口的负压和机组转速上升有明显的作用。通过有关水力参数的测试 ,认为变顶高尾水洞可以满足各项技术要求 ,是一个减少山体开挖、节省投资的新型设计方案。在地下电站中具有广泛的应用前景     

应用遗传神经网络研究低渗透储层成岩储集相—以胜利渤南油田三区沙河街组为例

以渤南油田三区沙河街组为例,应用遗传人工神经网络模式识别方法,开展了低渗透储层成岩储集相的研究。该工作是在储集层沉积相、成岩作用研究的基础上,选用流动层带指标、孔隙度、渗透率、粒度中值、泥质含量、孔喉半径均值和变异系数等7项参数,采用神经网络模式识别方法,通过建立遗传神经网络的学习及预测模型,对渤南油田三区沙河街组进行了成岩储集相识别,识别出4类成岩储集相:不稳定组分强溶解次生孔隙成岩储集相、碳酸盐胶结物溶解次生孔隙成岩储集相、强压实强胶结残余粒间孔成岩储集相和极强压实强胶结致密成岩储集相。Ⅰ类储集相的储集性能最好,Ⅳ类最差,为非储层或差储层。     

The solution of the inverse problem of gravitational potential using a set of measurements of different field elements

A numerical solution of the inverse problem of the gravitational field at a single point is obtained using six field elements for a point, a spherical cap, a differential spherical sector and a vertical segment. In the system of six equations obtained, the unknowns are the mass of the body, the depth of its center, and the second, third, and fourth degree moments. The accuracy of the solution of this system is ten times higher than when using three field elements. __________ Translated from Izmeritel’naya Tekhnika, No. 5, pp. 3–8, May, 2007.     

神经网络在缺陷识别中的应用

为了准确、快速地进行缺陷识别，介绍了一种新型的前馈神经网络模型，即径向基概率神经网络。与以往的算法相比，该方法具有分类识别精度高且速度快的优点。仿真获得了很好的结果。     

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.     

Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations

A method is considered to solve a conditional optimization problem with a linear-fractional objective function over permutations. The performance of sub algorithms to solve this problem is evaluated. The practical efficiency of the algorithm is analyzed by conducting numerical experiments. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 133–146, July–August 2007.