Stochastic molecular descriptors for polymers. 4. Study of complex mixtures with topological indices of mass spectra spiral and star networks: The blood proteome case

The Quantitative Structure-Property Relationships (QSPRs) based on Graph or Network Theory are important for predicting the properties of polymeric systems. In the three previous papers of this series (Polymer 45 (2004) 3845-3853; Polymer 46 (2005) 2791-2798; and Polymer 46 (2005) 6461-6473) we focused on the uses of molecular graph parameters called topological indices (TIs) to link the structure of polymers with their biological properties. However, there has been little effort to extend these TIs to the study of complex mixtures of artificial polymers or biopolymers such as nucleic acids and proteins. In this sense, Blood Proteome (BP) is one of the most important and complex mixtures containing protein polymers. For instance, outcomes obtained by Mass Spectrometry (MS) analysis of BP are very useful for the early detection of diseases and drug-induced toxicities. Here, we use two Spiral and Star Network representations of the MS outcomes and defined a new type of TIs. The new TIs introduced here are the spectral moments (π_k) of the stochastic matrix associated to the Spiral graph and describe non-linear relationships between the different regions of the MS characteristic of BP. We used the MARCH-INSIDE approach to calculate the π_k(SN) of different BP samples and S2SNet to determine several Star graph TIs. In the second step, we develop the corresponding Quantitative Proteome-Property Relationship (QPPR) models using the Linear Discriminant Analysis (LDA). QPPRs are the analogues of QSPRs in the case of complex biopolymer mixtures. Specifically, the new QPPRs derived here may be used to detect drug-induced cardiac toxicities from BP samples. Different Machine Learning classification algorithms were used to fit the QPPRs based on π_k(SN), showing J48 decision tree classifier to have the best performance. These results suggest that the present approach captures important features of the complex biopolymers mixtures and opens new opportunities to the application of the idea supporting classic QSPRs in polymer sciences.     

Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.     

Optimal and self‐tuning fusion Kalman filters for discrete‐time stochastic singular systems

Based on the optimal fusion estimation algorithm weighted by scalars in the linear minimum variance sense, a distributed optimal fusion Kalman filter weighted by scalars is presented for discrete‐time stochastic singular systems with multiple sensors and correlated noises. A cross‐covariance matrix of filtering errors between any two sensors is derived. When the noise statistical information is unknown, a distributed identification approach is presented based on correlation functions and the weighted average method. Further, a distributed self‐tuning fusion filter is given, which includes two stage fusions where the first‐stage fusion is used to identify the noise covariance and the second‐stage fusion is used to obtain the fusion state filter. A simulation verifies the effectiveness of the proposed algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

A novel distributed approach to robust fault detection and identification

In this paper, we propose a novel distributed robust fault detection and identification (RFDI) scheme for a class of nonlinear systems. Firstly, a detection and identification estimator—robust fault tracking approximator (RFTA) is designed for online health monitoring. A novel feature of the RFTA is that it can simultaneously detect and accurately identify the shape and magnitude of the fault and disturbance. Moreover, it takes less online training time compared with the traditional neural network based fault diagnosis schemes. For some distributed systems, a network of distributed estimators is constructed where the RFTA is embedded into each estimator. Then we use consensus filter to filter the outputs of each estimator. One of the most important merits of the consensus filter is that its outputs can dramatically improve the accuracy of fault detection and identification. Next, the stability of the distributed RFDI scheme is rigorously investigated. Finally, two numerical examples are given to illustrate the feasibility and effectiveness of the proposed approach.     

炼铁生产环境负荷分析和预测研究

利用寿命周期评价的思想，计算了炼铁生产过程中的环境负荷，并分析了各因素对环境负荷的影响，运用神经网络对炼铁生产过程环境负荷进行了预测。     

Integrated Smart Sensor Calibration

In many applications electronic sensors are used toimprove performance and reliability of measurement systems. Suchsensors should provide a correct transfer from the physical signalto be measured to the electrical output signal. One importantstep to achieve this, is to calibrate each sensor by applyingdifferent reference input signals and adjusting the sensor transferaccordingly. Besides expensive reference equipment the calibrationprocess takes much time and attention per individual sensor,which means a considerable increase in sensor production costs.By including at the sensor or sensor interface chip a programmablecalibration facility the calibration of such smart sensors caneasily be automated and can be executed for a batch of sensorsat a time, thus minimizing the calibration time and costs. Thispaper presents a calibration method and options for integrationin the smart sensor concept, in hardware as well as in software.An advantage of the proposed method is that it does not needa large matrix of calibration data, which needs to be storedin a look-up table or converted into a correction formula, butinstead it uses a step-by-step approach to correct the sensortransfer at each calibration measurement until the error is sufficientlysmall.     

Theoretical Analysis of Critical period in Microbend Fiberoptic Sensor

1IntrodctionThesdV8fltsg6Sofffi1CY0bCfldf山CY0ptlCS6fiS0f8f6lflt6llSltyffiDdU18tlflgsliddCtCCtlflg，simpletechnique，highrellabllltyandlowprice，thereformlcrobendfiberoptlcsensorIswidelyusedtomeasurementofstrain，stressandv比rationetc．Inpractice，thesensltlvltyofsensorIsaveryimportantparameter，andthesensltlvltyofmlcrobendf山eroptlcsensorIsmainlyrelat-6dtofoil0WlflgthY66f8CtofS［‘-：ffilCfob6fldsffiplltlld6：fillffib6yofthlCY0b6fldS6Ct10llSsfldffil-crobendperiod，andmlcrobendperio…     

Reliability and performance analysis of time – space – time switching networks with multiple separated space switches

Since electronic switching systems usually require very strict reliability requirements as well as good performance objectives, we need to jointly analyse the performance and reliability of switching systems. In this paper, we compare conventional time–space–time switches with single space switches with those with multiple separated space switches, from the viewpoints of reliability and performance. We consider time–space–time switching networks which consist of N incoming time switches, i.e. one NxN space switch, two (N/2)x(N/2) space switches, and four (N/4)x(N/4) space switches. We introduce a Markov reliability model to study the effect of failures and analyse the reliability and performance of three different types of switching networks in terms of average blocking probability and the mean time to unreliable operation, as we vary the offered traffic. As a result, T–S–T switching networks with multiple separated space switches exhibit better performance and reliability than those with single space switches.     

Distributed memory systems for simulating artificial neural networks

In executing tasks involving intelligent information processing, the human brain performs better than the digital computer. The human brain derives its power from a large number [O(10¹¹)] of neurons which are interconnected by a dense interconnection network [O(10⁵) connections per neuron]. Artificial neural network (ANN) paradigms adopt the structure of the brain to try to emulate the intelligent information processing methods of the brain. ANN techniques are being employed to solve problems in areas such as pattern recognition, and robotic processing. Simulation of ANNs involves implementation of large number of neurons and a massive interconnection network. In this paper, we discuss various simulation models of ANNs and their implementation on distributed memory systems. Our investigations reveal that communication-efficient networks of distributed memory systems perform better than other topologies in implementing ANNs.     

SMS——智能网的业务管理系统

本文叙述了智能网的业务管理系统所实现的３种功能：业务管理功能，网络管理功能和业务管理访问功能，还介绍了业务管理和网络管理之间的关系，ＳＭＳ的集中式和分布式两种体系结构及业务管理功能的设计方法和进一步研究方向。