逻辑程序的一种并行执行模型

本文基于静态相关性分析和动态调整相结合的方法，提出了一种逻辑程序的执行模型，它不仅开发了“与“并行，同进也开发了一定的“或“并行，从而有效地加速了逻辑程序的执行。     

改进的第三代相干算法及应用

在讨论相干技术发展及三代相干算法优缺点的基础上，介绍了改进的第三代相干算法。应用自行开发的相干软件对多个油气勘探和开发区块的三维地震资料进行处理、分析，对相干时窗长度、相关道数等参数对算法效果的影响及相干体对断层、异常地质体的识别，以及解释方法进行了探讨。应用实例证明，改进的第三代相干算法抗干扰能力强，横向分辨率高，不仅适用于倾斜地层，而且对断层尤其对小断层、异常地质体具有较高的检测能力，是油气勘探和开发的一项有效和实用的技术。     

GIS中矢量图形的结构分析与VC++中的实现

简要讨论了GIS各类矢量图形元素间的空间拓朴结构及基位置关系 ,并用VC 6 . 0及MFC具体分析了圆弧与多边形区域的相交关系及实现。为利用VC开发专用图形软件提供了有用帮助。     

Chromaticity contour map of the RGB cube: A simple algorithm

A simple algorithm (amenable to spreadsheets) is described for plotting a luminance contour map of the color gamut of an additive‐primary display given the chromaticities of its primaries and screen white. Each contour of the plot represents (in either r,g or x,y coordinates) the polygon of intersection of the RGB cube with a plane of constant Y. Each vertex on a contour is an intersection of 1 of the 12 edges of the RGB cube with the constant‐Y plane. Feasibility of an edge as a vertex of the polygon is tested through comparison of the computed r,g coordinates with functions of the luminosity coefficients of the primaries. By ordering the RGB‐cube edges in a particular way prior to scanning them for feasibility, one is guaranteed to retrieve the vertices of any constant‐Y polygon in convex order. This fact facilitates plotting of the polygons.     

转移法色交换

将图Ｇ的着色由一种变为中一种，通常用Ｋｅｍｐｅ法以交换。但是，对于某些情况，用此法无效。针对这个问题，本文提出了一种转移法色交换，它适用于平面图着色，方法直观，清晰且有效。     

Energy minimization and design for testability

The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables.     

Growth of CeO_2, Y_2O_3 Buffer Layers for YBCO Coated Conductor

~~Growth of CeO_2, Y_2O_3 Buffer Layers for YBCO Coated Conductor     

Linearly many faults in Cayley graphs generated by transposition trees

We prove that when linearly many vertices are deleted in a Cayley graph generated by a transposition tree, the resulting graph has a large connected component containing almost all remaining vertices.     

包装装潢中的图形创意

图形创意在商品包装装潢设计中起着重要的作用,图形的传统和现代的构成形式使产品更具风格,独创性是其生命力所在,而联想和想象又是创造力的主要源泉,这种联想和想象力通过自然形、抽象形和寓意图形来体现.所以包装设计需要突破,通过图形创意的不断完善,促销产品,使其为市场接受,被顾客赞誉.