Random graph coloring:Statistical physics approach

The problem of vertex coloring in random graphs is studied using methods of statistical physics and probability. Our analytical results are compared to those obtained by exact enumeration and Monte Carlo simulations. We critically discuss the merits and shortcomings of the various methods, and interpret the results obtained. We present an exact analytical expression for the two-coloring problem as well as general replica symmetric approximated solutions for the thermodynamics of the graph coloring problem with p colors and K-body edges. ©2002 The American Physical Society.

Typical case behaviour of spin systems in random graph and composite ensembles

This thesis includes analysis of disordered spin ensembles corresponding to Exact Cover, a multi-access channel problem, and composite models combining sparse and dense interactions. The satisfiability problem in Exact Cover is addressed using a statistical analysis of a simple branch and bound algorithm. The algorithm can be formulated in the large system limit as a branching process, for which critical properties can be analysed. Far from the critical point a set of differential equations may be used to model the process, and these are solved by numerical integration and exact bounding methods. The multi-access channel problem is formulated as an equilibrium statistical physics problem for the case of bit transmission on a channel with power control and synchronisation. A sparse code division multiple access method is considered and the optimal detection properties are examined in typical case by use of the replica method, and compared to detection performance achieved by interactive decoding methods. These codes are found to have phenomena closely resembling the well-understood dense codes. The composite model is introduced as an abstraction of canonical sparse and dense disordered spin models. The model includes couplings due to both dense and sparse topologies simultaneously. The new type of codes are shown to outperform sparse and dense codes in some regimes both in optimal performance, and in performance achieved by iterative detection methods in finite systems.

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.

A socio-economic approach to online vision graph generation and handover in distributed smart camera networks

In this paper we propose an approach based on self-interested autonomous cameras, which exchange responsibility for tracking objects in a market mechanism, in order to maximise their own utility. A novel ant-colony inspired mechanism is used to grow the vision graph during runtime, which may then be used to optimise communication between cameras. The key benefits of our completely decentralised approach are on the one hand generating the vision graph online which permits the addition and removal cameras to the network during runtime and on the other hand relying only on local information, increasing the robustness of the system. Since our market-based approach does not rely on a priori topology information, the need for any multi-camera calibration can be avoided. © 2011 IEEE.

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.

Socio-economic vision graph generation and handover in distributed smart camera networks

In this article we present an approach to object tracking handover in a network of smart cameras, based on self-interested autonomous agents, which exchange responsibility for tracking objects in a market mechanism, in order to maximise their own utility. A novel ant-colony inspired mechanism is used to learn the vision graph, that is, the camera neighbourhood relations, during runtime, which may then be used to optimise communication between cameras. The key benefits of our completely decentralised approach are on the one hand generating the vision graph online, enabling efficient deployment in unknown scenarios and camera network topologies, and on the other hand relying only on local information, increasing the robustness of the system. Since our market-based approach does not rely on a priori topology information, the need for any multicamera calibration can be avoided. We have evaluated our approach both in a simulation study and in network of real distributed smart cameras.

Outlier-resisting graph embedding

Graph embedding is a general framework for subspace learning. However, because of the well-known outlier-sensitiveness disadvantage of the L2-norm, conventional graph embedding is not robust to outliers which occur in many practical applications. In this paper, an improved graph embedding algorithm (termed LPP-L1) is proposed by replacing L2-norm with L1-norm. In addition to its robustness property, LPP-L1 avoids small sample size problem. Experimental results on both synthetic and real-world data demonstrate these advantages. © 2009 Elsevier B.V. All rights reserved.

On Graph-Based Cryptography and Symbolic Computations

We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed graphs of large girth and their cryptographical applications. It contains new explicit algebraic constructions of in finite families of such graphs. We show that they can be used for the implementation of secure and very fast symmetric encryption algorithms. The symbolic computations technique allow us to create a public key mode for the encryption scheme based on algebraic graphs.