Dynamics and topographic organization of recursive self-organizing maps

Recently there has been an outburst of interest in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, there is no general consensus as to how best to process sequences using topographicmaps, and this topic remains an active focus of neurocomputational research. The representational capabilities and internal representations of the models are not well understood. Here, we rigorously analyze a generalization of the self-organizingmap (SOM) for processing sequential data, recursive SOM (RecSOM) (Voegtlin, 2002), as a nonautonomous dynamical system consisting of a set of fixed input maps. We argue that contractive fixed-input maps are likely to produce Markovian organizations of receptive fields on the RecSOM map. We derive bounds on parameter β (weighting the importance of importing past information when processing sequences) under which contractiveness of the fixed-input maps is guaranteed. Some generalizations of SOM contain a dynamic module responsible for processing temporal contexts as an integral part of the model. We show that Markovian topographic maps of sequential data can be produced using a simple fixed (nonadaptable) dynamic module externally feeding a standard topographic model designed to process static vectorial data of fixed dimensionality (e.g., SOM). However, by allowing trainable feedback connections, one can obtain Markovian maps with superior memory depth and topography preservation. We elaborate on the importance of non-Markovian organizations in topographic maps of sequential data. © 2006 Massachusetts Institute of Technology.

Recursive self-organizing map as a contractive iterative function system

Recently, there has been a considerable research activity in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, the representational capabilities and internal representations of the models are not well understood. We rigorously analyze a generalization of the Self-Organizing Map (SOM) for processing sequential data, Recursive SOM (RecSOM [1]), as a non-autonomous dynamical system consisting off a set of fixed input maps. We show that contractive fixed input maps are likely to produce Markovian organizations of receptive fields o the RecSOM map. We derive bounds on parameter $\beta$ (weighting the importance of importing past information when processing sequences) under which contractiveness of the fixed input maps is guaranteed.

Affinity partitioning of plasmid DNA with a zinc finger protein

The affinity isolation of pre-purified plasmid DNA (pDNA) from model buffer solutions using native and poly(ethylene glycol) (PEG) derivatized zinc finger–GST (Glutathione-S-Transferase) fusion protein was examined in PEG–dextran (DEX) aqueous two-phase systems (ATPSs). In the absence of pDNA, partitioning of unbound PEGylated fusion protein into the PEG-rich phase was confirmed with 97.5% of the PEGylated fusion protein being detected in the PEG phase of a PEG 600–DEX 40 ATPS. This represents a 1322-fold increase in the protein partition coefficient in comparison to the non-PEGylated protein (Kc = 0.013). In the presence of pDNA containing a specific oligonucleotide recognition sequence, the zinc finger moiety of the PEGylated fusion protein bound to the plasmid and steered the complex to the PEG-rich phase. An increase in the proportion of pDNA that partitioned to the PEG-rich phase was observed as the concentration of PEGylated fusion protein was increased. Partitioning of the bound complex occurred to such an extent that no DNA was detected by the picogreen assay in the dextran phase. It was also possible to partition pDNA using a non-PEGylated (native) zinc finger–GST fusion protein in a PEG 1000–DEX 500 ATPS. In this case the native ligand accumulated mainly in the PEG phase. These results indicate good prospects for the design of new plasmid DNA purification methods using fusion proteins as affinity ligands.

A cost based complete partitioning congestion control strategy for multiservice OFDMA networks

In this paper, a congestion control mechanism is presented for multiservice wireless OFDMA networks. The revenue rate and the user SNR's are used to partition the bandwidth in accordance with a complete partitioning structure. Moreover, through the use of our scheme the QoS of any ongoing connections can be satisfied. Results show that the revenue rate plays an important role in prioritizing the different services. © 2013 Springer Science+Business Media New York.

The design and evaluation of an automated drug partitioning system for thermodynamic studies

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

Elemental partitioning and microstructural development in duplex stainless steel weld metal

A thermodynamic analysis which is capable of estimating the austenite/ferrite equilibria in duplex stainless steels has been carried out using the sublattice thermodynamic model. The partitioning of alloying elements between the austenite and ferrite phases has been calculated as a function of temperature. The results showed that chromium partitioning was not influenced significantly by the temperature. The molybdenum, on the other hand, was found to partition preferentially into ferrite phase as the temperature decreases. A strong partitioning of nickel into the austenite was observed to decrease gradually with increasing temperature. Among the alloying elements, average nitrogen concentration was found to have the most profound effect on the phase balance and the partitioning of nitrogen into the austenite. The partitioning coefficient of nitrogen (the ratio of the mole fraction of nitrogen in the austenite to that in the ferrite) was found to be as high as 7.0 around 1300 K. Consequently, the volume fraction of austenite was influenced by relatively small additions of nitrogen. The results are compared with the experimentally observed data in a duplex stainless steel weld metal in conjunction with the solid state δ → δ + γ phase transformation. Particular attention was given to the morphological instability of grain boundary austenite allotriomorphs. A compariso between the experimental results and calculations indicated that the instability associated with irregular austenite perturbations results from the high degree of undercooling. The results suggest that the model can be used successfully to understand the development of the microstructure in duplex stainless steel weld metals.

Cooperative greedy pursuit strategies for sparse signal representation by partitioning

Cooperative Greedy Pursuit Strategies are considered for approximating a signal partition subjected to a global constraint on sparsity. The approach aims at producing a high quality sparse approximation of the whole signal, using highly coherent redundant dictionaries. The cooperation takes place by ranking the partition units for their sequential stepwise approximation, and is realized by means of i)forward steps for the upgrading of an approximation and/or ii) backward steps for the corresponding downgrading. The advantage of the strategy is illustrated by approximation of music signals using redundant trigonometric dictionaries. In addition to rendering stunning improvements in sparsity with respect to the concomitant trigonometric basis, these dictionaries enable a fast implementation of the approach via the Fast Fourier Transform

Robust H.264/AVC video transmission using data partitioning and unequal loss protection

In this work, we present an adaptive unequal loss protection (ULP) scheme for H264/AVC video transmission over lossy networks. This scheme combines erasure coding, H.264/AVC error resilience techniques and importance measures in video coding. The unequal importance of the video packets is identified in the group of pictures (GOP) and the H.264/AVC data partitioning levels. The presented method can adaptively assign unequal amount of forward error correction (FEC) parity across the video packets according to the network conditions, such as the available network bandwidth, packet loss rate and average packet burst loss length. A near optimal algorithm is developed to deal with the FEC assignment for optimization. The simulation results show that our scheme can effectively utilize network resources such as bandwidth, while improving the quality of the video transmission. In addition, the proposed ULP strategy ensures graceful degradation of the received video quality as the packet loss rate increases. © 2010 IEEE.