通过需求分析及总体设计，对整个应用方案从数据流图到算法分析详细地给出了应用设计，在新的应用领域上进行了探讨和研究。
Through the analysis of demand and general design, It introduces the application from data stream to arithmetic analysis detailedly, discusses and researches this in a new applied field.
为了满足实时跟踪控制的需要，提高两幅图象之间对应点的匹配效率，提出了稀疏光流算法。
Sparse optical flow method was proposed for satisfying the requirement of real-time control and improving the efficiency of matching corresponding points in two im ages.
采用边缘提耳义算法给出了流场中激波在叶栅中分布的清晰轮廓图；
The legible outlines of the shock waves were given by using the edge detection algorithm.
该算法基于流图理论的基本原理和简单的集合运算，概念明确，易于掌握；
The algorithm is based on the principle of flow graph theory and set theory.
通过分析在数据流图(DFG)关键路径上生成PODCM的条件，给出了在DF G关键路径上生成PODCM的算法并建立了PODCM库。
After studying conditions for generating PODCM in the critical path of data flow graph (DFG), an algorithm was introduced to produce PODCM.
本文给出了一个数据流图的存贮模型。并在此基础上，给出了数据流图的操作算法。
This paper presents a memory model of the data flow diagram, and gives some operating algorithm of the data flow diagram.
文中采用生成函数流图法推导出了衰落信道下FSASE算法平均捕获时间的闭式解。
The mean acquisition time of the FSASE method is derived by the generating function flow graph technique for the fading channel.
最后，在行为级，本文提出了一种基于最小能量的算子调度算法，对折叠循环结构的控制数据流图进行算子调度。
At last, at the behavioral level, this dissertation proposes a minimal-energy based operator scheduling approach to perform operator scheduling for loop folding CDFG structure.
分析类的数据流，说明数据的定义-使用对；给出构造类的控制流图的一种算法。
The data flow testing of class is analysed, and the data definition-use pair is explanated.
给出构造类的控制流图的一种算法。
An algorithm to structure control procedure chart of class is offered.
首先对给定的数据流图进行单电压高层次综合，然后对单电压综合结果迭代地进行多电压调整；提取每次迭代时需要调整的网络流子图，对该子图运行最小费用最大流增量算法。
The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.
针对海洋动力学重要参数-海流，利用两台雷达的海洋表面径向流图，来生成海洋表面矢量流图的算法，并给出计算机模拟的结果。
In this paper we discuss the important parameter the ocean surface current and raise an algorithm to generate the vector current map in terms of data from two pieces of radial current map.
考虑到算法映射问题的NP复杂度和求解时间的指数性增加，本文主要研究两步规划方法，即先进行数据流图的最优规划，然后进行处理器的映射。
Because of the NP complexity of mapping problem, the thesis studies two-step method: optimal scheduling of data flow graph and optimal processor mapping.
本文提出了对软件工程中的图形文档进行布局处理的设计思想和布局规则，并且对数据流图和结构图这两类常用图形文档的布局给出了算法概述。
Design ideas and rules of graphic documents about layout processing in software engineering are described. An algorithm outline of ordinary DFD and sc layout is given.
本文提中一种最小费用流算法，实现从两个正交的一维投影重建图象。
A new minimum cost network flow algorithm is described for the image reconstruction from their two orthogonal 1-d projections.
本文提中一种最小费用流算法，实现从两个正交的一维投影重建图象。
A new minimum cost network flow algorithm is described for the image reconstruction from their two orthogonal 1-d projections.
应用推荐