The authors describe GGI, a visual system that allows the user to execute an automatically generated dataflow graph containing code modules that perform natural language processing tasks. These code modules operate o...
详细信息
The authors describe GGI, a visual system that allows the user to execute an automatically generated dataflow graph containing code modules that perform natural language processing tasks. These code modules operate on text documents. GGI has a suite of text visualisation tools that allows the user useful views of the annotation data that is produced by the modules in the executable graph. GGI forms part of the GATE natural language engineering system.
In this paper the formal definition of a sequence control program used in a dataflow based programmable controller is proposed. A control program is described with a dataflow graph and from formalization of the grap...
详细信息
In this paper the formal definition of a sequence control program used in a dataflow based programmable controller is proposed. A control program is described with a dataflow graph and from formalization of the graph, the incidence matrix is defined. Using this matrix, the reachability property of the control program is analyzed. For the performance improvement of the dataflow based PC, a load balancing rule, which is obtained by matrix decomposition, is suggested.< >
Interaction protocols are essential elements for the integration of business processes. Usually, protocols have been agreed in advance by the participating organizations, playing each participant a predefined role. Ho...
详细信息
Interaction protocols are essential elements for the integration of business processes. Usually, protocols have been agreed in advance by the participating organizations, playing each participant a predefined role. However, it is also possible that processes need to use/to impose a concrete interaction pattern. The question for another process is to decide whether the interaction between them is possible, which can be seen as a problem of compatibility between roles: flow compatibility, related to the ordering of the exchanged messages, and data compatibility, related to the information exchanged in each message. In this paper we propose a method for checking compatibility questions in multi-party interaction protocols. Compatibility is stated and checked in terms of reachability properties of a Petri net model that includes control flow aspects (stated in terms of the Petri net definition) and dataflow aspects (stated in terms of an ontology-based description of the exchanged messages).
Synchronous dataflow graphs (SDFGs) have proven to be suitable for specifying and analyzing streaming applications that run on single- or multi-processor platforms. Streaming applications essentially continue their e...
详细信息
Synchronous dataflow graphs (SDFGs) have proven to be suitable for specifying and analyzing streaming applications that run on single- or multi-processor platforms. Streaming applications essentially continue their execution indefinitely. Therefore, one of the key properties of an SDFG is liveness, i.e., whether all parts of the SDFG can run infinitely often. Another elementary requirement is whether an implementation of an SDFG is feasible using a limited amount of memory. In this paper, we study two interpretations of this property, called boundedness and strict boundedness, that were either already introduced in the SDFG literature or studied for other models. A third and new definition is introduced, namely self-timed boundedness, which is very important to SDFGs, because self-timed execution results in the maximal throughput of an SDFG. Necessary and sufficient conditions for liveness in combination with all variants of boundedness are given, as well as algorithms for checking those conditions. As a by-product, we obtain an algorithm to compute the maximal achievable throughput of an SDFG that relaxes the requirement of strong connectedness in earlier work on throughput analysis
This paper firstly introduced the current status of Chinese flow industry, some difficulties to extract control rules in the course of modern industrial production, and then the paper presented a set of scheme about d...
详细信息
ISBN:
(纸本)9781424447411
This paper firstly introduced the current status of Chinese flow industry, some difficulties to extract control rules in the course of modern industrial production, and then the paper presented a set of scheme about data mining method based on rough set theory, the algorithm avoided the defects of previous association rule mining, and reduced the computationally efficient obviously. The scheme was put into effect by extracting control rules of decomposing furnace outlet's temperature in the course of cement production. The system designed by above-mentioned way achieves a satisfying effect by experimental verification. The results in this paper show that the scheme has merits such as rationality, effectiveness and improving executive efficiency.
The feasibility of using dataflow systems for running complex graph queries is studied in this paper. A general query optimization framework for parallel dataflow systems is also proposed. The proposed methods are use...
详细信息
The feasibility of using dataflow systems for running complex graph queries is studied in this paper. A general query optimization framework for parallel dataflow systems is also proposed. The proposed methods are used to optimize a suite of benchmark queries, and their effectiveness is evaluated. The performance of the optimized queries is measured on an actual parallel dataflow machine using a large semantic graph and compared to that of equivalent SQL queries on a high-end parallel relational database system. The study has revealed that dataflow system can achieve significant performance improvement over state-of-art database systems and can be a viable and scalable alternative to run large complex graph queries.
data-driven computers are scalable, highly concurrent machines. They have been proposed as an alternative to the conventional von Neumann computers to allow for maximal exploitation of parallelism in large-scale compu...
详细信息
data-driven computers are scalable, highly concurrent machines. They have been proposed as an alternative to the conventional von Neumann computers to allow for maximal exploitation of parallelism in large-scale computations. The authors describe a parallel implementation of the backpropagation learning algorithm on a data-driven computer using the Q-v1, a general-purpose data-driven processor. The implementation is successful as the parallelism of the neural network is explicitly expressed by the functional and asynchronous data-driven program and naturally exploited by the pipelined and scalable data-driven processors. The suitability of applying data-driven multiprocessors for efficient simulation of neural networks is demonstrated.< >
The language of regular expressions is used for the identification of constructors of definition-use chains. Activation of the chains is essential for all dataflow testing strategies. The algorithm is based on the no...
详细信息
The language of regular expressions is used for the identification of constructors of definition-use chains. Activation of the chains is essential for all dataflow testing strategies. The algorithm is based on the node-elimination method of J.A. Brzozowski and E.J. McCluskey (1963). It generates a regular expression that represents the (possibly infinite) set of all constructors of the chain involved. A particular path can then be derived from that expression. The algorithm has been implemented as an extension to STAD, a recently implemented system for testing and debugging.< >
暂无评论