A similarity measure for graphs with low computational complexity

We present and analyze an algorithm to measure the structural similarity of generalized trees, a new graph class which includes rooted trees. For this, we represent structural properties of graphs as strings and define the similarity of two Graphs as optimal alignments of the corresponding property stings. We prove that the obtained graph similarity measures are so called Backward similarity measures. From this we find that the time complexity of our algorithm is polynomial and, hence, significantly better than the time complexity of classical graph similarity methods based on isomorphic relations. (c) 2006 Elsevier Inc. All rights reserved.

Information theoretic measures of UHG graphs with low computational complexity

We introduce a novel graph class we call universal hierarchical graphs (UHG) whose topology can be found numerously in problems representing, e.g., temporal, spacial or general process structures of systems. For this graph class we show, that we can naturally assign two probability distributions, for nodes and for edges, which lead us directly to the definition of the entropy and joint entropy and, hence, mutual information establishing an information theory for this graph class. Furthermore, we provide some results under which conditions these constraint probability distributions maximize the corresponding entropy. Also, we demonstrate that these entropic measures can be computed efficiently which is a prerequisite for every large scale practical application and show some numerical examples. (c) 2007 Elsevier Inc. All rights reserved.

‘The ‘Complexity of Imprisonment: The Northern Ireland Experience'

This article will examine the thesis that Northern Ireland experiences a relatively low level of crime. It will explore the possible reasons why crime in the North has not witnessed a dramatic increase. In light of this, the article will highlight the difficulties surrounding the current prison system and illustrate that once again Northern Ireland is experiencing a very different criminal justice system in comparison to Great Britain. Although the prisons are now being used predominately to deal with “ordinary’ crime”, they are still part of the political process.

Fabrication and Repair of Cartilage Defects with a Novel Acellular Cartilage Matrix Scaffold

The objectives of this study were to develop a three-dimensional acellular cartilage matrix (ACM) and investigate its possibility for use as a scaffold in cartilage tissue engineering. Bovine articular cartilage was decellularized sequentially with trypsin, nuclease solution, hypotonic buffer, and Triton x 100 solution; molded with freeze-drying process; and cross-linked by ultraviolet irradiation. Histological and biochemical analysis showed that the ACM was devoid of cells and still maintained the collagen and glycosaminoglycan components of cartilage. Scanning electronic microscopy and mercury intrusion porosimetry showed that the ACM had a sponge-like structure of high porosity. The ACM scaffold had good biocompatibility with cultured rabbit bone marrow mesenchymal stem cells with no indication of cytotoxicity both in contact and in extraction assays. The cartilage defects repair in rabbit knees with the mesenchymal stem cell-ACM constructs had a significant improvement of histological scores when compared to the control groups at 6 and 12 weeks. In summary, the ACM possessed the characteristics that afford it as a potential scaffold for cartilage tissue engineering.

Assessing software upgrades, plan properties and patient geometry using intensity modulated radiation therapy (IMRT) complexity metrics

Purpose: The aim of this study is to compare the sensitivity of different metrics to detect differences in complexity of intensity modulated radiation therapy (IMRT) plans following upgrades, changes to planning parameters, and patient geometry. Correlations between complexity metrics are also assessed.

Real-valued fixed-complexity sphere decoder for high dimensional QAM-MIMO systems

The development of high performance, low computational complexity detection algorithms is a key challenge for real-time Multiple-Input Multiple-Output (MIMO) communication system design. The Fixed-Complexity Sphere Decoder (FSD) algorithm is one of the most promising approaches, enabling quasi-ML decoding accuracy and high performance implementation due to its deterministic, highly parallel structure. However, it suffers from exponential growth in computational complexity as the number of MIMO transmit antennas increases, critically limiting its scalability to larger MIMO system topologies. In this paper, we present a solution to this problem by applying a novel cutting protocol to the decoding tree of a real-valued FSD algorithm. The new Real-valued Fixed-Complexity Sphere Decoder (RFSD) algorithm derived achieves similar quasi-ML decoding performance as FSD, but with an average 70% reduction in computational complexity, as we demonstrate from both theoretical and implementation perspectives for Quadrature Amplitude Modulation (QAM)-MIMO systems.

Fabrication and characterisation of high resistivity SOI substrates for monolithic high energy physics detectors

Silicon on Insulator (SOI) substrates offer a promising platform for monolithic high energy physics detectors with integrated read-out electronics and pixel diodes. This paper describes the fabrication and characterisation of specially-configured SOI substrates using improved bonded wafer ion split and grind/polish technologies. The crucial interface between the high resistivity handle silicon and the SOI buried oxide has been characterised using both pixel diodes and circular geometry MOS transistors. Pixel diode breakdown voltages were typically greater than 100V and average leakage current densities at 70 V were only 55 nA/ sq cm. MOS transistors subjected to 24 GeV proton irradiation showed an increased SOI buried oxide trapped charge of only 3.45x1011cn-2 for a dose of 2.7Mrad

Characterization of Nickel Germanide Schottky Contacts for the Fabrication of Germanium p-channel MOSFETs

Nickel germanide Schottky contacts, formed by rapid thermal annealing of thin nickel films, have been characterized on n-type germanium wafers for a range of RTA temperatures. The highest Schottky barrier heights for electrons (= 0.6-0.7 eV) were obtained for RTA temperatures of approximately 300°C. For this RTA schedule, the corresponding barrier height for holes is close to zero, ideal for Schottky contacted p-channel germanium MOSFETs. When the RTA temperature was increased to 400oC, a dramatic reduction in electron barrier height (< 0.1 eV) was observed. This RTA schedule, therefore, appears ideal for ohmic source/drain contacts to n channel germanium MOSFETs. From sheet resistance measurements and XRD characterization, nickel germanide formation was found to occur at 300oC and above. The NiGe phase was dominant for RTA temperatures up to at least 435oC.

Low-complexity iterative method of equalization for single carrier with cyclic prefix in doubly selective channels

Orthogonal frequency division multiplexing (OFDM) requires an expensive linear amplifier at the transmitter due to its high peak-to-average power ratio (PAPR). Single carrier with cyclic prefix (SC-CP) is a closely related transmission scheme that possesses most of the benefits of OFDM but does not have the PAPR problem. Although in a multipath environment, SC-CP is very robust to frequency-selective fading, it is sensitive to the time-selective fading characteristics of the wireless channel that disturbs the orthogonality of the channel matrix (CM) and increases the computational complexity of the receiver. In this paper, we propose a time-domain low-complexity iterative algorithm to compensate for the effects of time selectivity of the channel that exploits the sparsity present in the channel convolution matrix. Simulation results show the superior performance of the proposed algorithm over the standard linear minimum mean-square error (L-MMSE) equalizer for SC-CP.

Structural similarity of directed universal hierarchical graphs: A low computational complexity approach

In the present paper we mainly introduce an efficient approach to measure the structural similarity of so called directed universal hierarchical graphs. We want to underline that directed universal hierarchical graphs can be obtained from generalized trees which are already introduced. In order to classify these graphs, we state our novel graph similarity method. As a main result we notice that our novel algorithm has low computational complexity. (c) 2007 Elsevier Inc. All rights reserved.

Fabrication of cerium oxide nanoparticles: Characterization and optical properties

Ceria (CeO2) is a technologically important rare earth material because of its unique properties and various engineering and biological applications. A facile and rapid method has been developed to prepare ceria nanoparticles using microwave with the average size 7 nm in the presence of a set of ionic liquids based on the bis (trifluoromethylsulfonyl) imide anion and different cations of 1-alkyl-3-methyl-imidazolium. The structural features and optical properties of the nanoparticles were determined in depth with X-ray powder diffraction, transmission electron microscope, N-2 adsorption-desorption technique, dynamic light scattering (DLS) analysis, FTIR spectroscopy, Raman spectroscopy, UV-vis absorption spectroscopy, and Diffuse reflectance spectroscopy. The energy band gap measurements of nanoparticles of ceria have been carried out by UV-visible absorption spectroscopy and diffuse reflectance spectroscopy. The surface charge properties of colloidal ceria dispersions in ethylene glycol have been also studied. To the best of our knowledge, this is the first report on using this type of ionic liquids in ceria nanoparticle synthesis. (C) 2011 Elsevier Inc. All rights reserved.