In 1953, Mason introduced the signal flow graph in the analysis of linear systems.
在1953年，梅森在线性系统分析中引进了信号流图。
The flow graph shown in figure 1-5 depicts dynamics of a typical inner-100p design problem.
图1 -5所示的流程图描述了一个典型的内环设计问题的动特性。
This paper describes the method of analysis of active circuits including nullors with signal flow graph.
本文叙述了用信号流图来分析含有零极子的有源网络的方法。
The task data flow graph(DFG) was partitioned into several sub-modules under hardware resource constraint.
在可重构硬件资源约束条件下，将任务的数据流图划分成数个子模块。
This paper gives a topological method for calculating the sensitivity by means of signal flow graph theory.
本文提出用信号流图理论求灵敏度的一个拓扑方法。
This paper presents a method and implementation techniques to generate control flow graph from source program.
本文给出了一种由源程序生成其对应的控制流图的方法和实现技术。
Most systems use the task flow graph model to model software process because this kind of model is very intuitive.
因为任务控制流的图示表示办法直观方便，因此大多系统都采用这种定义方式为软件过程建模。
The GENERIC trees are converted into GIMPLE form and a subsequent control flow graph to support SSA-based optimizations.
generic树被转换成GIMPLE形式，进而转换成控制流图，以支持基于SSA的优化。
When the two basic devices can't be directly shown, Kirchhoff's current law may be used to make its signal flow graph.
在不能直接用这两个基本部件表示时，提出用克希荷夫电流定律来作出其信号流图。
This paper introduces a parallelization compiler, and in the course of its development control flow graph is visualized.
介绍了并行化编译器，在研制并行化编译器过程中，实现了一种开放式软件研制环境。
A new method to reconstruct the lossy multi-layered media is presented by using a time domain signal flow graph technique.
借助于时域信号流图提出一种重建有耗多层媒质的新方法。
CDFG (control data flow graph) can be used in system modeling, software and hardware partition, synthesis and verification.
控制数据流图可用于系统建模、软硬件功能划分、系统综合与验证等多个环节。
The strong time constraints are the time constraints when the delay time of Control Data Flow Graph (CDFG)is not satisfied.
强时间约束是指控制数据流图CDFG的延迟时间无法满足的时间约束。
After the analysis of the principle and structure of the IMU, its multi-signal model is built based on multi-signal flow graph.
基于多信号流图，文章详细分析了某惯测组合的工作原理和结构，建立了多信号模型。
The mean acquisition time of the FSASE method is derived by the generating function flow graph technique for the fading channel.
文中采用生成函数流图法推导出了衰落信道下FSASE算法平均捕获时间的闭式解。
The switching between author and reader levels and their intercommunication with the system may be described by a data flow graph.
系统的数据流程图描述了作者层与读者层两个工作层面之间相互切换以及它们同系统之间相互通讯的关系。
The 2b-Signal flow graph is reduced to a state matrix flow graph, by means of which the state equations can be written out directly.
信号流图被化简为一种状态矩阵流图，籍助此流图状态方程可直接写出。
The results show that it is very convenient to find the transfer function of the active SCF by means of the signal-flow graph approach.
结果表明，用本文提出的信号流图法，可非常方便地求得有源scf的传递特性。
After studying conditions for generating PODCM in the critical path of data flow graph (DFG), an algorithm was introduced to produce PODCM.
通过分析在数据流图(DFG)关键路径上生成PODCM的条件，给出了在DF G关键路径上生成PODCM的算法并建立了PODCM库。
It is possible to use the Flow Graph to create full screen effects. This document explains the nodes and functions for making these effects.
使用流程图建立完整的画面特效。本文档中介绍了这些制作特效的节点和功能。
The result is that the delay-Jitter-SPF algorithm and the flow graph of the building of the multicast tree with QoS constraints are proposed.
结果是提出了基于延迟和延迟抖动约束的SPF算法，并给出了完整的建立组播树的流程图。
Computerized central control systems typically provide this information, usually on a "flow graph" screen that displays nightly flow and run times.
电脑中控系统可以代表的提供这些数据信息，通常是在流量表的窗口里展示每晚流量以及运行的时间。
In this paper, based on the DTS_CPP framework, we add the global type analysis, and improve the control flow graph about the exception path analysis.
本文在DTS_CPP框架基础上，增加了全局类型分析，并完善了控制流图中关于异常路径的分析。
The idea, methods of class testing, such as service-based, OSD-based (Object State Diagram), flow graph-based and specification-based, are discussed.
文章从基于服务的、基于对象动态测试模型的、基于流图的以及基于规约的四个方面论述了类测试的思想和方法。
Because of the NP complexity of mapping problem, the thesis studies two-step method: optimal scheduling of data flow graph and optimal processor mapping.
考虑到算法映射问题的NP复杂度和求解时间的指数性增加，本文主要研究两步规划方法，即先进行数据流图的最优规划，然后进行处理器的映射。
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.
首先对给定的数据流图进行单电压高层次综合，然后对单电压综合结果迭代地进行多电压调整；提取每次迭代时需要调整的网络流子图，对该子图运行最小费用最大流增量算法。
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.
首先对给定的数据流图进行单电压高层次综合，然后对单电压综合结果迭代地进行多电压调整；提取每次迭代时需要调整的网络流子图，对该子图运行最小费用最大流增量算法。
应用推荐