unoriented texture

In view of the trait of present card,this paper proposes the idea of developing light-electric card with no direction,it studies on the theory and arithmetic of light-electric card which is no direction emphatically,then applies the arithmetic to the light-electric card we have designed,so well gets the function of card insertion with no direction.

在对目前几种常见卡的特点分析的基础上,介绍了光电卡识别传感器和传统光电卡,提出了开发基于识别传感器的无向插入式光电卡的思想,重点研究了无向插卡技术的原理和算法,并将此算法应用于所开发的光电卡,从而实现了无向插卡功能,为无向插入式光电卡的开发奠定了理论基础。

Techniques by compound branch and network ripping to find out all spanning trees of an undirected graph;

寻找无向图中全部生成树的复合支路和网络撕裂技术

On the decision algorithm of the unordered depth first spanning trees of an undirected graph;

无向图的无序深度优先生成树判定算法探究

The whole inking system was treated as a complicated undirected graph according to undi- rected graph theory.

基于无向图理论,将胶印机输墨系统视为一个复杂的无向图,建立了输墨系统的网络关系图,并采用邻接多重表进行存储。

Study on diagonal structures in a non-directed graph;

基于无向图的角联结构研究

To solve the path optimization problem in undirected network,genetic algorithm is presented and variable-length chromosomes(routing strings)and their genes(nodes) are used for encoding the problem.

为了解决无向网络的最短路径优化问题,采用遗传算法并使用可变长编码,在遗传算子操作中进行有效性判断,避免了传统交叉变异算子中无效路径的产生;网络数据存储采用链式存储结构,仅需存储各个节点信息,摒弃了传统的邻接矩阵方法。

In this paper,an applied algorithm is given by changing the description of the maximum flow problem in undirected network.

通过改变无向网络最大流问题的描述,给出了一种寻找无向网络最大流的适用算法,这种算法每迭代一次,就可以找出多条增量路径,因此,有较高的计算效率。

Let R(n,d) be a set of primitive symmetric digraphs of order n with exact d vertices having ring.

设Ｒ（ｎ，ｄ）表示由全体恰含ｄ个环点的ｎ（ｎ≥３）阶本原无向图所构成的集合，Ｆ（ｎ，ｄ，ｋ）为 Ｒ（ｎ，ｄ）中图的第 ｋ重上广义本原指数的最大值，１≤ｄ≤ｎ，２≤ｋ≤ｎ－１。

Evaluation method for terminal-pair reliability in undirected networks with unreliable Nodes;

具有不完全可靠节点的无向网络终端对可靠性评价方法

It is generalized that one type of constrained maximum cpapcity expansion path problem on networks to a type of constrained capacity expansion problem with setup cost on undirected networks,and a strongly polynomial algorithm is get.

将带约束的最大容量路问题扩展到约束条件含固定费用的无向网络的容量扩充问题 ,并给出了强多项式算法 。

In 2D parametric drawing, undigraph is always used for describing geometrical constraint model.

在充分分析现有无向图存储结构优缺点的基础上 ,结合二维工程图形的特点 ,提出了一种改进的无向图存储结构——分类邻接表存储结构。

The model is based on undigraph and the algorithm uses multi ploys to get the skeleton of an image.

该文提出了一种基于无向图的图像整体骨架表示模型 ,并基于这一模型设计实现了图像的骨架化算法 。