A Neural Network Approach for Signal Detection in Digital Communications

In this paper, we propose a new approach for signal detection in wireless digital communications based on the neural network with transient chaos and time-varying gain (NNTCTG), and give a concrete model of the signal detector after appropriate transformations and mappings. It is well known that the problem of the maximum likelihood signal detection can be described as a complex optimization problem that has so many local optima that conventional Hopfield-type neural networks fail to solve. By refraining from the serious local optima problem of Hopfield-type neural networks, the NNTCTG makes use of the time-varying parameters of the recurrent neural network to control the evolving behavior of the network so that the network undergoes the transition from chaotic behavior to gradient convergence. It has richer and more flexible dynamics rather than conventional neural networks only with point attractors, so that it can be expected to have much ability to search for globally optimal or near-optimal solutions. After going through a transiently inverse-bifurcation process, the NNTCTG can approach the global optimum or the neighborhood of global optimum of our problem. Simulation experiments have been performed to show the effectiveness and validation of the proposed neural network based method for the signal detection in digital communications.     

Artificial neural networks for coordination and control: The portability of experiential representations

It is time to locate connectionist representation theory in the new wave of robotics research. The utility of representations developed in artificial neural networks (ANNs) during learning has been demonstrated in cognitive science research since the 1980s. The research reported here puts learned representations to work in a decentered control task, the disembodied arm problem, in which a mobile robot operates an arm fixed to a table to pick up objects. There is no physical linkage between the arm and the robot and so the robot's point of view must be decentered. This is done by developing a modular Artificial Neural Net system in three stages: (i) a classifier net is trained with laser scan data to output transformationally invariant position classes; (ii) an arm net is trained for picking up objects; (iii) an inter net is trained to communicate and coordinate the sensing and acting. The completed system is shown to create new nonsymbolic transformationally invariant representations in order to perform the effective generalization of decentered viewpoints.     

高氧化态（Ⅱ─Ⅳ）三核金属簇合物构型的人工神经网络判别方法

本文运用一典型的人工神经网络模型─“反向传播”模型，对高氧化态（Ⅱ─Ⅳ）三核金属簇合物的构型分布进行了分析，得到了较好的分类、预报结果为化合物结构分析提供了新的工具。     

Polymer networks based on α,ω-methacrylate-terminated poly(1,3-dioxolane)

α,ω-Methacrylate-terminated poly(1,3-dioxolane)s (polyDXL) were synthesized by cationic ring-opening polymerization of DXL in the presence of methylene-bis(oxyethylmethacrylate) as transfer agent. If the initiator concentration is small compared with the transfer agent concentration, the molecular weights of the polymers are governed by the ratio of the reacted monomer to the reacted transfer agent. The α,ω-methacrylate-terminated polyDXLs obtained undergo free radical polymerization with formation of polyacetal networks. The properties of the networks as function of the molecular weight of the corresponding prepolymers are reported.     

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.     

Issues in nonlinear stochastic grey box identification

Grey box identification refers to the practice of identifying dynamical systems in model structures exploiting partial prior information. This contribution reviews a method for stochastic grey box identification and surveys experiences and lessons of applying it to a number of industrial processes. Issues to be addressed include advantages and costs of introducing stochastics into the model, the question of what contribution must be expected from the model designer as opposed to what can be formalized in computer algorithms, and an outlook on future plans to resolve present shortcomings.     

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.