Dynamical considerations of network properties

Elasticity is discussed as an aspect of viscoelasticity, which is described by the tube model. The effects of both crosslinks and entanglements contribute to this model and a discussion of how these effects can be quantified is given. At high enough concentration, entanglements ensure the existence of elastic effects even without crosslinks, and a theory is presented on how this dynamical phase change comes about.     

Image processing using cellular neural networks based on multi-valued and universal binary neurons

Multi-valued and universal binary neurons (MVN and UBN) are the neural processing elements with the complex-valued weights and high functionality. It is possible to implement an arbitrary mapping described by partially defined multiple-valued function on the single MVN. An arbitrary mapping described by partially defined or fully defined Boolean function, which can be non-threshold, may be implemented on the single UBN. The quickly converging learning algorithms exist for both types of neurons. Such features of the MVN and UBN may be used for solving the different problems. One of the most successful applications of the MVN and UBN is their usage as basic neurons in the Cellular Neural Networks (CNN). It opens the new effective opportunities in nonlinear image filtering and its applications to noise reduction, edge detection and solving of the super resolution problem. A number of experimental results are presented to illustrate the performance of the proposed algorithms.An erratum to this article can be found at     

Network topology and the theory of rubber elasticity

The earliest investigations on rubber elasticity, commencing in the 19th century, were necessarily limited to phenomenological interpretations. The realisation that polymers consist of very long molecular chains. commencing c. 1930, gave impetus to the molecular theory of rubber elasticity (1932-). according to which the high deformability of an elastomer, and the elastic force generated by deformation, stem from the configurations accessible to long molecular chains. Theories of rubber elasticity put forward from 1934-1946 relied on the assumption that the junctions of the rubber network undergo displacements that are affine in macroscopic strain. The theory of James and Guth (1947) dispensed with this premise, and demonstrated instead that the mean positions of the junctions of a ‘phantom’ network consisting of Gaussian chains devoid of material properties are affine in the strain. The vital significance of the distinction between the actual distribution of chain vectors in a network and their distribution if the junctions would be fixed at their mean positions went unnoticed for nearly 30 years. Experimental investigations, commencing with the incisive work of Gee in 1946. revealed large departures from the relationship of stress to strain predicted by the theories cited. This discrepancy prompted extensive studies, theoretical and experimental, during succeeding years. Inquiry into the fundamentals of polymer networks, formed for example by interlinking very long polymer molecules, exposed the need to take account of network imperfections, typically consisting of chains attached at only one end to a network junction. Various means were advocated to make corrections for these imperfections. The cycle rank ζ of the network has been shown (1976) to be the fundamental measure of its connectivity, regardless of the junction functionality and pattern of imperfections. Often overlooked is the copious interpenetration of the chains comprising typical elastomeric networks. Theories that attempt to represent such networks on a lattice are incompatible with this universal feature. Moreover, the dense interpenetration of chains may limit the ability of junctions in real networks to accommodate the fluctuations envisaged in the theory of phantom networks. It was suggested in 1975 that departures from the form predicted for the elastic equation of state are due to constraints on the fluctuations of junctions whose effect diminishes with deformation and with dilation. Formulation of a self-consistent theory based on this suggestion required recognition of the non-affine connection between the chain vector distribution function and the macroscopic strain in a real network, which may partake of characteristics of a phantom network in some degree. Implementation of the idea was achieved through postulation of domains of constraint affecting the equilibrium distribution of fluctuations of network junctions from their mean positions. This led in due course to a theory that accounts for the relationship of stress to strain virtually throughout the ranges of strain accessible to measurement. The theory establishes connections between structure and elastic properties. This is achieved with utmost frugality in arbitrary parameters.     

Specification methods for material-handling control algorithms in flexible manufacturing systems

Good methods are needed to specify, test, and debug material-handling control logic. This article surveys a number of representative methods for defining and describing control algorithms for programmable material-handling equipment used in flexible manufacturing systems. The methods are evaluated with regard to their suitability for communication between people and as bases for interfaces to automatic program generators. It is concluded that no single method is entirely satisfactory. Three methods (position diagrams, function block diagrams, and operation networks) have potential to be combined into an effective hybrid approach that minimizes the need for the user to switch between various conceptual models.     

Synthesis and characterization of an interpenetrating polymer network composed of poly(methacrylic acid) and poly(vinyl alcohol)

Temperature and pH‐responsive interpenetrating polymer network (IPN) hydrogels, constructed with poly(methacrylic acid) (PMAA) and poly(vinyl alcohol) (PVA), by a sequential IPN method, were studied. The characterization of IPN hydrogels was investigated by Fourier‐transform infrared spectroscopy, differential scanning calorimetry (DSC) and swelling under various conditions. The IPN hydrogels exhibited relatively high swelling ratios, in the range 230–380 %, at 25 °C. The swelling ratios of the PMAA/PVA IPN hydrogels were pH and temperature dependent. DSC was used for the quantitative determination of the amounts of freezing and non‐freezing water. The amount of free water increased with increasing PMAA content in the IPN hydrogels. Copyright © 2004 Society of Chemical Industry     

地震勘探技术在焉耆盆地勘探开发中的合理应用探讨

地震勘探技术应用可以分为以二维地震研究构造为主的地震勘探初级阶段、以地震地层学为主的地震勘探中级阶段、以三维地震油藏静态描述为主的地震勘探高级阶段、以地震储层研究为主的开发地震妆级阶段和以四维地震进行油藏监测为主的开发地震高级阶段。针对5个不同阶段的地质条件和地质任务，选择使用合理的地震勘探技术是有效提高勘探开发效益的重要途径。焉耆盆地的勘探开发体现了以地震勘探为主的思路，在勘探开发过程中重视了针对不同勘探开发阶段和不同的地质 地震技术，因此，在早期勘探开发中取得了很好的经济效益。     

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.     

Interval based MINLP superstructure synthesis of mass exchange networks

A new simultaneous synthesis approach for mass exchange networks (MENs) is presented. The technique is adapted from the interval based mixed integer non-linear program (MINLP) superstructure (IBMS) synthesis of heat exchanger networks (HENs). The superstructure interval boundary compositions are defined by the supply and target compositions of either the rich or lean set of streams. Each rich and lean stream in the superstructure has the potential of exchanging mass with streams of opposite kind in each interval based on mass transfer feasibility. The model harnesses the strengths of the stagewise superstructure and the pinch technology methods for mass exchange network synthesis (MENS). The IBMS approach simultaneously trades-off the capital and operating costs for MENs. The superstructure composition interval defining approach introduced in this paper enforces the mixing of split streams at equal compositions, hence there is no need to include mixing equations in the model. Fixing the interval boundaries helps to eliminate the complexities involved in initialisations, thus the region of search for the optimum solution is reduced. The IBMS model is applied to MENS problems involving continuous contact and staged columns. It is also extended to problems involving multiple mass separating agents (MSAs) and regeneration. The results obtained compare well with those in the literature.     

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.