Preparation, photo and electroluminescence properties of novel rare earth aromatic carboxylates

Novel soluble rare earth aromatic carboxylates were prepared. The triplet energy level of organic ligand was measured. The photoluminescence properties of the Tb3+ and EU3+ aromatic carboxylates and lifetimes were investigated, which indicated that these rare earth complexes have high quantum efficiency. Because of their excellent solubility, polymer-doping rare earth carboxylates were fabricated as thin Films by spin-coating method and their luminescence properties were studied. Some rare earth organic light-emitting diodes were successfully fabricated which performed high pure color. The maximum luminance of the device of ITO/PVK/PVK :Th (AS)(3)Phen: PBD/PBD/Al is 32 cd(.)m(-2) at 28 V.

The photo-induced decarbonylation of Cp ' M(NO)(CO)(2) (M = Cr, Mo, W) with diorgano dichalcogenides (R2E2; E = S, Se; R = Me, Ph)

The photo-induced decarbonylation of Cp'Cr(NO)(CO)(2) (1a) in MeCN solution in the presence of R2E2 (E = S, Se; R = Me, Ph) leads to the formation of chalcogenolato-bridged binuclear complexes Cp-2'Cr-2(NO)(2)(mu -ER)(2) [E = S; R = Me (2a), Ph (3a); E = Se, R = Me (4a), Ph (5a)] while reactions between Cp'M(NO)(CO)(2) [M = Mo (1b), W (1c)] and Ph2E2 (E = S, Se) result in mononuclear complexes Cp'M(NO)(EPh)(2) [M = Mo; E = S (9b), Se (10b); M = W, E = S (11c), Se (12c)]. The corresponding reactions of (1b) with Me2E2 (E = S, Se) yielded both mono and binuclear complexes: Cp'Mo(NO)(SeMe)(2) (8b), Cp-2'Mo-2(NO)(2)(mu -EMe)(2) [E = S (6b), Se (7b)]. The new complexes have been characterized by i.r., H-1-, C-13-n.m.r. spectra and by electron-impact mass spectrometry.

Sharing visual features for multiclass and multiview object detection

We consider the problem of detecting a large number of different classes of objects in cluttered scenes. Traditional approaches require applying a battery of different classifiers to the image, at multiple locations and scales. This can be slow and can require a lot of training data, since each classifier requires the computation of many different image features. In particular, for independently trained detectors, the (run-time) computational complexity, and the (training-time) sample complexity, scales linearly with the number of classes to be detected. It seems unlikely that such an approach will scale up to allow recognition of hundreds or thousands of objects. We present a multi-class boosting procedure (joint boosting) that reduces the computational and sample complexity, by finding common features that can be shared across the classes (and/or views). The detectors for each class are trained jointly, rather than independently. For a given performance level, the total number of features required, and therefore the computational cost, is observed to scale approximately logarithmically with the number of classes. The features selected jointly are closer to edges and generic features typical of many natural structures instead of finding specific object parts. Those generic features generalize better and reduce considerably the computational cost of an algorithm for multi-class object detection.

Robust Photo-topography by Fusing Shape-from-Shading and Stereo

Methods for fusing two computer vision methods are discussed and several example algorithms are presented to illustrate the variational method of fusing algorithms. The example algorithms seek to determine planet topography given two images taken from two different locations with two different lighting conditions. The algorithms each employ assingle cost function that combines the computer vision methods of shape-from-shading and stereo in different ways. The algorithms are closely coupled and take into account all the constraints of the photo-topography problem. The algorithms are run on four synthetic test image sets of varying difficulty.

Novel information sharing syntax for data sharing between police and community partners, using role-based security.

The exchange of information between the police and community partners forms a central aspect of effective community service provision. In the context of policing, a robust and timely communications mechanism is required between police agencies and community partner domains, including: Primary healthcare (such as a Family Physician or a General Practitioner); Secondary healthcare (such as hospitals); Social Services; Education; and Fire and Rescue services. Investigations into high-profile cases such as the Victoria Climbié murder in 2000, the murders of Holly Wells and Jessica Chapman in 2002, and, more recently, the death of baby Peter Connelly through child abuse in 2007, highlight the requirement for a robust information-sharing framework. This paper presents a novel syntax that supports information-sharing requests, within strict data-sharing policy definitions. Such requests may form the basis for any information-sharing agreement that can exist between the police and their community partners. It defines a role-based architecture, with partner domains, with a syntax for the effective and efficient information sharing, using SPoC (Single Point-of-Contact) agents to control in-formation exchange. The application of policy definitions using rules within these SPoCs is inspired by network firewall rules and thus define information exchange permissions. These rules can be imple-mented by software filtering agents that act as information gateways between partner domains. Roles are exposed from each domain to give the rights to exchange information as defined within the policy definition. This work involves collaboration with the Scottish Police, as part of the Scottish Institute for Policing Research (SIPR), and aims to improve the safety of individuals by reducing risks to the community using enhanced information-sharing mechanisms.

A novel Information sharing model using binary decision diagrams for redundancy, shadowing, generalisation and correlation.

This paper outlines a novel information sharing method using Binary Decision Diagrams (BBDs). It is inspired by the work of Al-Shaer and Hamed, who applied BDDs into the modelling of network firewalls. This is applied into an information sharing policy system which optimizes the search of redundancy, shadowing, generalisation and correlation within information sharing rules.

Evaluation of binary decision diagrams for redundancy, shadowing, generalisation and correlation in an Information sharing model.

This paper defines a structured methodology which is based on the foundational work of Al-Shaer et al. in [1] and that of Hamed and Al-Shaer in [2]. It defines a methodology for the declaration of policy field elements, through to the syntax, ontology and functional verification stages. In their works of [1] and [2] the authors concentrated on developing formal definitions of possible anomalies between rules in a network firewall rule set. Their work is considered as the foundation for further works on anomaly detection, including those of Fitzgerald et al. [3], Chen et al. [4], Hu et al. [5], among others. This paper extends this work by applying the methods to information sharing policies, and outlines the evaluation related to these.

Islamic corporate financing : does it promote profit and loss sharing?

Islamic financing instruments can be categorised into profit and loss/risk sharing and non-participatory instruments. Although profit and loss sharing instruments such as musharakah are widely accepted as the ideal form of Islamic financing, prior studies suggest that alternative instruments such as murabahah are preferred by Islamic banks. Nevertheless, prior studies did not explore factors that influence the use of Islamic financing among non-financial firms. Our study fills this gap and contributes new knowledge in several ways. First, we find no evidence of widespread use of Islamic financing instruments across non-financial firms. This is because the instruments are mostly used by less profitable firms with higher leverage (i.e., risky firms). Second, we find that profit and loss sharing instruments are hardly used, whilst the use of murabahah is dominant. Consistent with the prediction of moral-hazard-risk avoidance theory, further analysis suggests that users with a lower asset base (to serve as collateral) are associated with murabahah financing. Third, we present a critical discourse on the contentious nature of murabahah as practised. The economic significance and ethical issues associated with murabahah as practised should trigger serious efforts to steer Islamic corporate financing towards risk-sharing more than the controversial rent-seeking practice.

Structure Sharing and Parallelization in a GB Parser

By utilizing structure sharing among its parse trees, a GB parser can increase its efficiency dramatically. Using a GB parser which has as its phrase structure recovery component an implementation of Tomita's algorithm (as described in [Tom86]), we investigate how a GB parser can preserve the structure sharing output by Tomita's algorithm. In this report, we discuss the implications of using Tomita's algorithm in GB parsing, and we give some details of the structuresharing parser currently under construction. We also discuss a method of parallelizing a GB parser, and relate it to the existing literature on parallel GB parsing. Our approach to preserving sharing within a shared-packed forest is applicable not only to GB parsing, but anytime we want to preserve structure sharing in a parse forest in the presence of features.

Contour Generator Points for Threshold Selection and a Novel Photo-Consistency Measure for Space Carving

Space carving has emerged as a powerful method for multiview scene reconstruction. Although a wide variety of methods have been proposed, the quality of the reconstruction remains highly-dependent on the photometric consistency measure, and the threshold used to carve away voxels. In this paper, we present a novel photo-consistency measure that is motivated by a multiset variant of the chamfer distance. The new measure is robust to high amounts of within-view color variance and also takes into account the projection angles of back-projected pixels. Another critical issue in space carving is the selection of the photo-consistency threshold used to determine what surface voxels are kept or carved away. In this paper, a reliable threshold selection technique is proposed that examines the photo-consistency values at contour generator points. Contour generators are points that lie on both the surface of the object and the visual hull. To determine the threshold, a percentile ranking of the photo-consistency values of these generator points is used. This improved technique is applicable to a wide variety of photo-consistency measures, including the new measure presented in this paper. Also presented in this paper is a method to choose between photo-consistency measures, and voxel array resolutions prior to carving using receiver operating characteristic (ROC) curves.

Improving the Performance of Overlay Routing and P2P File Sharing using Selfish Neighbor Selection

A foundational issue underlying many overlay network applications ranging from routing to P2P file sharing is that of connectivity management, i.e., folding new arrivals into the existing mesh and re-wiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific applications designed to work well in real deployments, and providing abstractions for the underlying problem that are tractable to address via theoretical analyses, especially game-theoretic analysis. Our work unifies these two thrusts first by distilling insights gleaned from clean theoretical models, notably that under natural resource constraints, selfish players can select neighbors so as to efficiently reach near-equilibria that also provide high global performance. Using Egoist, a prototype overlay routing system we implemented on PlanetLab, we demonstrate that our neighbor selection primitives significantly outperform existing heuristics on a variety of performance metrics; that Egoist is competitive with an optimal, but unscalable full-mesh approach; and that it remains highly effective under significant churn. We also describe variants of Egoist's current design that would enable it to scale to overlays of much larger scale and allow it to cater effectively to applications, such as P2P file sharing in unstructured overlays, based on the use of primitives such as scoped-flooding rather than routing.

Characterisation of bifunctional ruthenium(ii) complexes, potential DNA photo-probes. Presence of folded and unfolded conformers

Novel bifunctional ruthenium(n) complexes, [Ru(TAP)2(POQ-Nmet)]2+ and [Ru(BPY)2(POQ-Nmet)]2+(la, 2a), containing a metallic and an organic moiety, have been prepared as photoprobes and photoreagents of DNA(TAP = 1,4,5,8-tetraazaphenanthrene, POQ-Nmet = 5-[6-(7-chloroquinolin-4-yl)-3-thia-6-azaheptanamido]-l,10phenanthroline). The ES mass spectrometry and 'H NMR data in organic solvents indicate that the quinoline moiety exists in both the protonated and non-protonated form. Moreover, the comparison of the NMR data with those of the corresponding monofunctional complexes(without quinoline) evidences that [Ru(TAP).2(POQ-Nmet)]2+ and [Ru(BPY)J(POQ-Nmet)]2+ are unfolded when the quinoline unit is protonated whereas deprotonation permits folding of the molecule. In the folded state the spatial proximity of the electron donor(the organic moiety) and electron acceptor(the metallic moiety) in [Ru(TAP)2(POQ-Nmet)]2+ favours intramolecular photo-induced electron transfer, which has been shown in a previous study to be responsible for the very low luminescence of la in non-protonating solutions. The restoration of the luminescence by protonation of the quinoline moiety as observed previously is in agreement with the unfolding of the molecule demonstrated in this work. The existence of such folding-unfolding processes related to protonation is crucial for studies of la with DNA. © The Royal Society of Chemistry 2000.