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.     

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

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

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.     

Adaptive control of siso plants with unmodelled dynamics

In this paper we pursue a twofold aim. First we want to simplify the complexity of the classical Monopoli's scheme, the so-called ‘Augmented error signal control scheme’. Then we also wish to cope with the realistic situation in which the presence of unmodelled dynamics has to be taken into account. This latter problem has been faced in the literature by suitably modifying the adaptation mechanism in order to avoid undesired phenomena as well as to obtain an attractive stability region for the state trajectories starting from any point in a predefined initial condition set. In our case the necessity of introducing any sort of modification in the adaptation mechanism is completely avoided, but we still obtain asymptotic stability of the output error signal.     

媒体网关控制技术及其在Alcatel 5020 MGC中的应用

分析了目前公用交换电话网(PSTN)中存在的问题和下一代网络(NGN)的优越性,分析了NGN中的关键技术媒体网关控制技术,探讨了媒体网关控制技术在Alcatel5020MGC中的实际应用,讨论了Alcatel5020MGC的软硬件系统架构。最后强调了在PSTN向NGN发展过程中基于演进产品的方法的重要性。     

Prediction of Final Product Properties After Cocurrent Spray Drying

The effect of drying and atomization conditions on the physical properties of powders for agglomerate-like materials and skin-forming material are studied in this article. A neural model is used for powder bulk and tapped density predictions.     

Validation of a Method of Determination of Apparent Diffusivity Versus Composition in Solids

A method is presented for computing the values of apparent diffusivity in solids with respect to the concentration of the diffusing substance (water or sodium chloride). This method does not require any assumption upon the mathematical relationship between diffusivity and concentration. It can be applied to experimental measurements of local concentration versus position within the solid (profiles) with relatively few measurements (circa 10) and a mathematical smoothing of the experimental data by using an artificial neural network model. The method was first validated on simulated data obtained by using a constant diffusivity value and on experimental profiles when the relation between diffusivity and concentration was given. It was then applied to original experimental moisture profiles obtained by putting gelatin gels with different initial moisture contents into contact for up to 14 days. The method was also successfully applied to five sets of experimental moisture and sodium chloride profiles taken from the literature and obtained from different food products. Apparent diffusivities calculated by our method were found in agreement with those obtained by authors using different numerical methods to compute the diffusivity values.     

Self-learning inductive inference machines

Self-knowledge is a concept that is present in several philosophies. In this article, we consider the issue of whether or not a learning algorithm can in some sense possess self-knowledge. The question is answered affirmatively. Self-learning inductive inference algorithms are taken to be those that learn programs for their own algorithms, in addition to other functions.
La connaissance de soi est un concept qui se retrouve dans plusieurs philosophies. Dans cet article, les auteurs s'interrogent à savoir si un algorithme d' apprentissage peut dans une certaine mesure posséder la connaissance de soi. lis apportent une reponse positive a cette question. Les algorithmes d'inference inductive autodidactes sont ceux qui font l'apprentissage de programmes pour leurs propres algorithmes, en plus d' autres fonctions.