Calculation of electrostatic energy H-e(fd) on 4f(N-1)5d configurations for heavy lanthanide ions

For the 4f(N-1)5d configuration the Coulomb interaction between f and d electrons was parameterized by F-k(fd) with K = 2, 4, and G(K)(fd) with K = 1, 3, 5. The spin-orbit interaction for 4f and 5d electrons can be parameterized by xi (f) and xi (d) respectively, which can be compounded into one lambda : lambda = axi (f) + bxi (d), where a and b are the corresponding coefficients. The energy expressions of H-e(fd) of the chief low-energy levels of 4f(N-) (1)5d configuration for heavy lanthanide ions were calculated and the corresponding spin-orbit parameters lambda were also given in LS coupling, which are profitable in analyzing the spectra of the heavy lanthanide ions.

THE APPLICATION OF AN ULTRAMICROELECTRODE IN HOMOGENEOUS CATALYTIC REACTION .1. GENERAL CHARACTERISTIC OF A HOMOGENEOUS CATALYTIC REACTION AT AN ULTRAMICROELECTRODE WITH ARBITRARY GEOMETRY UNDER STEADY-STATE

A general characteristic of the electrochemical process coupling with a homogeneous catalytic reaction at an ultramicroelectrode under steady state is described. It was found that the electrochemical process coupling with homogeneous catalytic reaction has a similar steady state voltammetric wave at an ultramicroelectrode with arbitrary geometry. A method of determination for the kinetic constant of homogeneous catalytic reaction at an ultramicroelectrode with arbitrary geometry is proposed.

Dielectric responses of anisotropic graded granular composites having arbitrary inclusion shapes

The transformation field method (TFM) originated from Eshelby's transformation field theory is developed to estimate the effective permittivity of an anisotropic graded granular composite having inclusions of arbitrary shape and arbitrary anisotropic grading profile. The complicated boundary-value problem of the anisotropic graded composite is solved by introducing an appropriate transformation field within the whole composite region. As an example, the effective dielectric response for an anisotropic graded composite with inclusions having arbitrary geometrical shape and arbitrary grading profile is formulated. The validity of TFM is tested by comparing our results with the exact solution of an isotropic graded composite having inclusions with a power-law dielectric grading profile and good agreement is achieved in the dilute limit. Furthermore, it is found that the inclusion shape and the parameters of the grading profile can have profound effect on the effective permittivity at high concentrations of the inclusions. It is pointed out that TFM used in this paper can be further extended to investigate the effective elastic, thermal, and electroelastic properties of anisotropic graded granular composite materials.

Transformation field method for calculating the effective properties of isotropic graded composites having arbitrary shapes

A method of transformation field is developed to estimate the effective properties of graded composites whose inclusions have arbitrary shapes and gradient profiles by means of a periodic cell model. The boundary-value problem of graded composites having arbitrary inclusion shapes is solved by introducing the transformation field into the inclusion region. As an example, the effective dielectric response of isotropic graded composites having arbitrary shapes and gradient profiles is handled by the transformation field method (TFM). Moreover, TFM results are validated by the exact solutions of isotropic graded spherical inclusions having a power-law profile and good agreement is obtained in the dilute limit. Furthermore, it is found that the inclusion shapes and the parameters of the gradient profiles can have profound effect on the effective properties of composite systems at high concentration of inclusions.

A study on the dependence of the micro-pore configurations on the volatilization and the burn processes of the organic compounds in the matrix of molten carbonate fuel cells

The micro-pore configurations on the matrix surface were studied by SEM. The matrix of molten carbonate fuel cell (MCFC) performance was also improved by the better coordination between the reasonable radius of the micro-pores and the higher porosity of the cell matrix. The many and complicated micro-pore configurations in the cell matrix promoted the volatilization of the organic additives and the burn of polyvinyl butyral (PVB). The smooth volatilization of the organic additives and the complete burn of PVB were the significant factors for the improved MCFC performance. Oxygen diffusion controlled-burn mechanism of PVB in the cell matrix was proposed. (C) 2002 Published by Elsevier Science Ltd.

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.

Motion Planning with Six Degrees of Freedom

The motion planning problem is of central importance to the fields of robotics, spatial planning, and automated design. In robotics we are interested in the automatic synthesis of robot motions, given high-level specifications of tasks and geometric models of the robot and obstacles. The Mover's problem is to find a continuous, collision-free path for a moving object through an environment containing obstacles. We present an implemented algorithm for the classical formulation of the three-dimensional Mover's problem: given an arbitrary rigid polyhedral moving object P with three translational and three rotational degrees of freedom, find a continuous, collision-free path taking P from some initial configuration to a desired goal configuration. This thesis describes the first known implementation of a complete algorithm (at a given resolution) for the full six degree of freedom Movers' problem. The algorithm transforms the six degree of freedom planning problem into a point navigation problem in a six-dimensional configuration space (called C-Space). The C-Space obstacles, which characterize the physically unachievable configurations, are directly represented by six-dimensional manifolds whose boundaries are five dimensional C-surfaces. By characterizing these surfaces and their intersections, collision-free paths may be found by the closure of three operators which (i) slide along 5-dimensional intersections of level C-Space obstacles; (ii) slide along 1- to 4-dimensional intersections of level C-surfaces; and (iii) jump between 6 dimensional obstacles. Implementing the point navigation operators requires solving fundamental representational and algorithmic questions: we will derive new structural properties of the C-Space constraints and shoe how to construct and represent C-Surfaces and their intersection manifolds. A definition and new theoretical results are presented for a six-dimensional C-Space extension of the generalized Voronoi diagram, called the C-Voronoi diagram, whose structure we relate to the C-surface intersection manifolds. The representations and algorithms we develop impact many geometric planning problems, and extend to Cartesian manipulators with six degrees of freedom.

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.

On the positivity of the Jansen-He? operator for arbitrary mass

Iantchenko, A.; Jakuba?a-Amundsen, D.H., (2003) 'On the positivity of the Jansen-He? operator for arbitrary mass', Annales of the Institute Henri Poincar? 4 pp.1083-1099 RAE2008

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.