982 resultados para SATURATION PHYSICS
Resumo:
Inference and optimisation of real-value edge variables in sparse graphs are studied using the tree based Bethe approximation optimisation algorithms. Equilibrium states of general energy functions involving a large set of real edge-variables that interact at the network nodes are obtained for networks in various cases. These include different cost functions, connectivity values, constraints on the edge bandwidth and the case of multiclass optimisation.
Resumo:
Recent advances in our ability to watch the molecular and cellular processes of life in action-such as atomic force microscopy, optical tweezers and Forster fluorescence resonance energy transfer-raise challenges for digital signal processing (DSP) of the resulting experimental data. This article explores the unique properties of such biophysical time series that set them apart from other signals, such as the prevalence of abrupt jumps and steps, multi-modal distributions and autocorrelated noise. It exposes the problems with classical linear DSP algorithms applied to this kind of data, and describes new nonlinear and non-Gaussian algorithms that are able to extract information that is of direct relevance to biological physicists. It is argued that these new methods applied in this context typify the nascent field of biophysical DSP. Practical experimental examples are supplied.
Resumo:
Networking encompasses a variety of tasks related to the communication of information on networks; it has a substantial economic and societal impact on a broad range of areas including transportation systems, wired and wireless communications and a range of Internet applications. As transportation and communication networks become increasingly more complex, the ever increasing demand for congestion control, higher traffic capacity, quality of service, robustness and reduced energy consumption requires new tools and methods to meet these conflicting requirements. The new methodology should serve for gaining better understanding of the properties of networking systems at the macroscopic level, as well as for the development of new principled optimization and management algorithms at the microscopic level. Methods of statistical physics seem best placed to provide new approaches as they have been developed specifically to deal with nonlinear large-scale systems. This review aims at presenting an overview of tools and methods that have been developed within the statistical physics community and that can be readily applied to address the emerging problems in networking. These include diffusion processes, methods from disordered systems and polymer physics, probabilistic inference, which have direct relevance to network routing, file and frequency distribution, the exploration of network structures and vulnerability, and various other practical networking applications. © 2013 IOP Publishing Ltd.
Resumo:
Optimizing paths on networks is crucial for many applications, ranging from subway traffic to Internet communication. Because global path optimization that takes account of all path choices simultaneously is computationally hard, most existing routing algorithms optimize paths individually, thus providing suboptimal solutions. We use the physics of interacting polymers and disordered systems to analyze macroscopic properties of generic path optimization problems and derive a simple, principled, generic, and distributed routing algorithm capable of considering all individual path choices simultaneously. We demonstrate the efficacy of the algorithm by applying it to: (i) random graphs resembling Internet overlay networks, (ii) travel on the London Underground network based on Oyster card data, and (iii ) the global airport network. Analytically derived macroscopic properties give rise to insightful new routing phenomena, including phase transitions and scaling laws, that facilitate better understanding of the appropriate operational regimes and their limitations, which are difficult to obtain otherwise.
Resumo:
DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT
Resumo:
Back in 2003, we published ‘MAX’ randomisation, a process of non-degenerate saturation mutagenesis using exactly 20 codons (one for each amino acid) or else any required subset of those 20 codons. ‘MAX’ randomisation saturates codons located in isolated positions within a protein, as might be required in enzyme engineering, or else on one face of an alpha-helix, as in zinc finger engineering. Since that time, we have been asked for an equivalent process that can saturate multiple, contiguous codons in a non-degenerate manner. We have now developed ‘ProxiMAX’ randomisation, which does just that: generating DNA cassettes for saturation mutagenesis without degeneracy or bias. Offering an alternative to trinucleotide phosphoramidite chemistry, ProxiMAX randomisation uses nothing more sophisticated than unmodified oligonucleotides and standard molecular biology reagents. Thus it requires no specialised chemistry, reagents nor equipment and simply relies on a process of saturation cycling comprising ligation, amplification and digestion for each cycle. The process can encode both unbiased representation of selected amino acids or else encode them in pre-defined ratios. Each saturated position can be defined independently of the others. We demonstrate accurate saturation of up to 11 contiguous codons. As such, ProxiMAX randomisation is particularly relevant to antibody engineering.
Resumo:
ProxiMAX randomisation achieves saturation mutagenesis of contiguous codons without degeneracy or bias. Offering an alternative to trinucleotide phosphoramidite chemistry, it uses nothing more sophisticated than unmodified oligonucleotides and standard molecular biology reagents and as such, requires no specialised chemistry, reagents nor equipment. When particular residues are known to affect protein activity/specificity, their combinatorial replacement with all 20 amino acids, or a subset thereof, can provide a rapid route to generating proteins with desirable characteristics. Conventionally, saturation mutagenesis replaced key codons with degenerate ones. Although simple to perform, that procedure resulted in unnecessarily large libraries, termination codons and inherent uneven amino acid representation. ProxiMAX randomisation is an enzyme-based technique that can encode unbiased representation of all or selected amino acids or else can provide required codons in pre-defined ratios. Each saturated position can be defined independently of the others. ProxiMAX randomisation is achieved via saturation cycling: an iterative process comprising blunt end ligation, amplification and digestion with a Type IIS restriction enzyme. We demonstrate both unbiased saturation of a short 6-mer peptide and saturation of a hypervariable region of a scfv antibody fragment, where 11 contiguous codons are saturated with selected codons, in pre-defined ratios. As such, ProxiMAX randomisation is particularly relevant to antibody engineering. The development of ProxiMAX randomisation from concept to reality is described.
Resumo:
Back in 2003, we published ‘MAX’ randomisation, a process of non-degenerate saturation mutagenesis using exactly 20 codons (one for each amino acid) or else any required subset of those 20 codons. ‘MAX’ randomisation saturates codons located in isolated positions within a protein, as might be required in enzyme engineering, or else on one face of an alpha-helix, as in zinc finger engineering. Since that time, we have been asked for an equivalent process that can saturate multiple, contiguous codons in a non-degenerate manner. We have now developed ‘ProxiMAX’ randomisation, which does just that: generating DNA cassettes for saturation mutagenesis without degeneracy or bias. Offering an alternative to trinucleotide phosphoramidite chemistry, ProxiMAX randomisation uses nothing more sophisticated than unmodified oligonucleotides and standard molecular biology reagents. Thus it requires no specialised chemistry, reagents nor equipment and simply relies on a process of saturation cycling comprising ligation, amplification and digestion for each cycle. The process can encode both unbiased representation of selected amino acids or else encode them in pre-defined ratios. Each saturated position can be defined independently of the others. We demonstrate accurate saturation of up to 11 contiguous codons. As such, ProxiMAX randomisation is particularly relevant to antibody engineering.
Resumo:
Fe3O4 GaAs hybrid structures have been studied using reflection high-energy electron diffraction (RHEED), x-ray photoelectron spectroscopy (XPS), x-ray magnetic circular dichroism (XMCD), and low-temperature vibrating-sample magnetometry (VSM). The samples were prepared by oxidizing epitaxial Fe thin films in a partial pressure of 5× 10-5 mbar of oxygen at 500 K for 180 s. Clear RHEED patterns were observed, suggesting the epitaxial growth of Fe oxides with a cubic structure. The XPS spectra show that the oxides were Fe3O4 rather than γ- Fe2O3, as there were no shake-up satellites between the two Fe 2p peaks. This was further confirmed by the XMCD measurements, which show ferromagnetic coupling between the Fe cations, with no evidence of intermixing at the interface. The VSM measurements show that the films have a magnetic uniaxial anisotropy and a "quick" saturation property, with the easy axes along the [011] direction. This detailed study offers further insight into the structure, interface, and magnetic properties of this hybrid Fe3O4 GaAs (100) structure as a promising system for spintronic application. © 2005 American Institute of Physics.
Resumo:
The genesis of a catalytically active model Pt/Al2O3/NiAl{110} oxidation catalyst is described. An ultrathin, crystalline γ-Al2O3 film was prepared via direct oxidation of a NiAl{110} single-crystal substrate. The room-temperature deposition of Pt clusters over the γ-Al2O3 film was characterised by LEED, AES and CO titration and follows a Stranski–Krastanov growth mode. Surface sulfation was attempted via SO2/O2 adsorption and thermal processing over bare and Pt promoted Al2O3/NiAl{110}. Platinum greatly enhances the saturation SOx coverage over that of bare alumina. Over clean Pt/γ-Al2O3 surfaces some adsorbed propene desorbs molecularly [similar]250 K while the remainder decomposes liberating hydrogen. Coadsorbed oxygen or sulfate promote propene combustion, with adsorbed sulfoxy species the most efficient oxidant. The chemistry of these alumina-supported Pt clusters shows a general evolution from small polycrystalline clusters to larger clusters with properties akin to low-index, Pt single-crystal surfaces.
Resumo:
We review the main physical and mathematical properties of dispersion-managed (DM) optical solitons. Theory of DM solitons can be presented at two levels of accuracy: first, simple, but nevertheless, quantitative models based on ordinary differential equations governing evolution of the soliton width and phase parameter (the so-called chirp); and second, a comprehensive path-average theory that is capable of describing in detail both the fine structure of DM soliton form and its evolution along the fiber line. An analogy between DM soliton and a macroscopic nonlinear quantum oscillator model is also discussed. © 2003 Académie des sciences/Éditions scientifiques et médicales Elsevier SAS. All rights reserved.
Resumo:
Advances in statistical physics relating to our understanding of large-scale complex systems have recently been successfully applied in the context of communication networks. Statistical mechanics methods can be used to decompose global system behavior into simple local interactions. Thus, large-scale problems can be solved or approximated in a distributed manner with iterative lightweight local messaging. This survey discusses how statistical physics methodology can provide efficient solutions to hard network problems that are intractable by classical methods. We highlight three typical examples in the realm of networking and communications. In each case we show how a fundamental idea of statistical physics helps solve the problem in an efficient manner. In particular, we discuss how to perform multicast scheduling with message passing methods, how to improve coding using the crystallization process, and how to compute optimal routing by representing routes as interacting polymers.