数字程控交换机与专网中的多媒体通信

本文以一个多媒体通信应用VISIT为实例,介绍了多媒体通信在数字程控交换机及专网中的应用情况。     

模糊数学在电视机故障诊断中的应用

本文介绍了应用模糊数学方法进行计算机辅助诊断电视机的故障原因,这种方法有效性在于建立模型的因果关系正确性和自动搜索范围及速度。     

A fuzzy diagnosis approach using dynamic fault trees

By incorporating digraph models, fault trees and fuzzy inference mechanisms in a unified framework, a novel approach for fault diagnosis is developed in this work. To relieve the on-line computation load, the fault origins considered in diagnosis are limited to the basic events in the cut sets of a given fault tree. The symptom occurrence order associated with each root cause is derived from system digraph with the qualitative simulation techniques. The implied candidate patterns are enumerated according to two proposed theorems and then encoded in the inference system with IF-THEN rules. The simulation results show that the proposed approach is not only feasible but also capable of identifying the most likely cause(s) of a hazardous event at the earliest possible time.     

A combined queueing network and stochastic Petri-net approach for evaluating the performability of fault-tolerant computer systems

In this paper the performability analysis of fault-tolerant computer systems using a hierarchical decomposition technique is presented. A special class of queueing network (QN) models, the so-called BCMP [4], and generalized stochastic Petri nets (GSPN) [1] which are often used to separately model performance and reliability respectively, have been combined in order to preserve the best modelling features of both.

A conceptual model is decomposed into GSPN and BCMP submodels, which are solved in isolation. Then, the remaining GSPN portion of the model is aggregated with flow-equivalents of BCMP models, in order to compute performability measures. The substitutes of BCMP models are presented by means of simple GSPN constructs, thereby preserving the 1st and 2nd moments of the throughput. A simple example of a data communication system where failed transmissions are corrected, is presented.     

Predictive modeling of mercury speciation in combustion flue gases using GMDH-based abductive networks

Modeling mercury speciation is an important requirement for estimating harmful emissions from coal-fired power plants and developing strategies to reduce them. First-principle models based on chemical, kinetic, and thermodynamic aspects exist, but these are complex and difficult to develop. The use of modern data-based machine learning techniques has been recently introduced, including neural networks. Here we propose an alternative approach using abductive networks based on the group method of data handling (GMDH) algorithm, with the advantages of simplified and more automated model synthesis, automatic selection of significant inputs, and more transparent input–output model relationships. Models were developed for predicting three types of mercury speciation (elemental, oxidized, and particulate) using a small dataset containing six inputs parameters on the composition of the coal used and boiler operating conditions. Prediction performance compares favourably with neural network models developed using the same dataset, with correlation coefficients as high as 0.97 for training data. Network committees (ensembles) are proposed as a means of improving prediction accuracy, and suggestions are made for future work to further improve performance.     

Tree-shaped flow structures designed by minimizing path lengths

This paper outlines a direct route to the construction of effective tree-shaped flow structures. Dendritic flow structures dominate the design of natural and engineered flow systems, especially in thermal and fluid systems. The starting point is the optimization of the shape of each elemental area or volume, such that the length of the flow path housed by the element is minimized. Proceeding toward larger and more complex structures - from elements, to first constructs, second constructs, etc. - the paper develops tree-shaped flow structures between one point and a straight line, one point and a plane, a circle and its center, and a point and many points distributed uniformly over an area. In the latter, the construction method is applied to a fluid flow configuration with laminar fully developed flow. The constructions reveal several features that are supported by empirical observations of natural tree-shaped flows: asymmetry, flow rate imbalance, pairing or bifurcation, angles between branches, and Y-shaped constructs that lie in a plane. It is shown that these basic features are necessary because of “packing”, i.e., assembling optimized elements into a fixed space, and filling the space completely. For the flow between an area and one point, the best elemental shape is the regular hexagon. It is shown that the emergence of string-shaped links that connect two or more elements are necessary features, which are also required by packing. Strings cover some of the inner zones of the tree network, particularly the inner zones of large and complex trees. Dichotomous Y-shaped constructs dominate the tree structure, especially the peripheral zones of the tree canopy. The practical importance of the simplified design method is discussed.     

多判据模糊决策在工程爆破中的应用

本文介绍了多判据模糊决策的数学模型。该模型可广泛地用于工程爆破中的爆破方案比较,以及爆破试验中的最优爆破参数的决策。该模型的应用将有利于工程爆破试验及设计的计算机程序设计。     

GENERALIZED INVERSE GROUP OF SIGNAL AND ITS IMPLEMENTATION WITH NEURAL NETWORKS

A new concept, the generalized inverse group (GIG) of signal, is firstly proposed and its properties, leaking coefficients and implementation with neural networks are presented. Theoretical analysis and computational simulation have shown that (1) there is a group of finite length of generalized inverse signals for any given finite signal, which forms the GIG; (2) each inverse group has different leaking coefficients, thus different abnormal states; (3) each GIG can be implemented by a grouped and improved single-layer perceptron which appears with fast convergence. When used in deconvolution, the proposed GIG can form a new parallel finite length of filtering deconvolution method. On off-line processing, the computational time is reduced to O(N) from O(N2). And the less the leaking coefficient is, the more reliable the deconvolution will be.