Low rank Runge-Kutta methods, symplecticity and stochastic Hamiltonian problems with additive noise

In this paper we extend the ideas of Brugnano, Iavernaro and Trigiante in their development of HBVM($s,r$) methods to construct symplectic Runge-Kutta methods for all values of $s$ and $r$ with $s\geq r$. However, these methods do not see the dramatic performance improvement that HBVMs can attain. Nevertheless, in the case of additive stochastic Hamiltonian problems an extension of these ideas, which requires the simulation of an independent Wiener process at each stage of a Runge-Kutta method, leads to methods that have very favourable properties. These ideas are illustrated by some simple numerical tests for the modified midpoint rule.

Experimental and theoretical investigation of ligand effects on the synthesis of ZnO nanoparticles

ZnO nanoparticles with highly controllable particle sizes(less than 10 nm) were synthesized using organic capping ligands in Zn(Ac)2 ethanolic solution. The molecular structure of the ligands was found to have significant influence on the particle size. The multi-functional molecule tris(hydroxymethyl)-aminomethane (THMA) favoured smaller particle distributions compared with ligands possessing long hydrocarbon chains that are more frequently employed. The adsorption of capping ligands on ZnnOn crystal nuclei (where n = 4 or 18 molecular clusters of(0001) ZnO surfaces) was modelled by ab initio methods at the density functional theory (DFT) level. For the molecules examined, chemisorption proceeded via the formation of Zn...O, Zn...N, or Zn...S chemical bonds between the ligands and active Zn2+ sites on ZnO surfaces. The DFT results indicated that THMA binds more strongly to the ZnO surface than other ligands, suggesting that this molecule is very effective at stabilizing ZnO nanoparticle surfaces. This study, therefore, provides new insight into the correlation between the molecular structure of capping ligands and the morphology of metal oxide nanostructures formed in their presence.

Evidence for a dual function of EphB4 as tumor promoter and suppressor regulated by the absence or presence of the ephrin-B2 ligand

Overexpression of the receptor tyrosine kinase EphB4 is common in epithelial cancers and linked to tumor progression by promoting angiogenesis, increasing survival and facilitating invasion and migration. However, other studies have reported loss of EphB4 suggesting a tumor suppressor function in some cancers. These opposing roles may be regulated by (i) the presence of the primary ligand ephrin-B2 that regulates pathways involved in tumor suppression or (ii) the absence of ephrin-B2 that allows EphB4 signaling via ligand-independent pathways that contribute to tumor promotion. To explore this theory, EphB4 was overexpressed in the prostate cancer cell line 22Rv1 and the mammary epithelial cell line MCF-10A. Overexpressed EphB4 localized to lipid-rich regions of the plasma membrane and confirmed to be ligand-responsive as demonstrated by increased phosphorylation of ERK1/2 and internalization. EphB4 overexpressing cells demonstrated enhanced anchorage-independent growth, migration and invasion, all characteristics associated with an aggressive phenotype, and therefore supporting the hypothesis that overexpressed EphB4 facilitates tumor promotion. Importantly, these effects were reversed in the presence of ephrin-B2 which led to a reduction in EphB4 protein levels, demonstrating that ligand-dependent signaling is tumor suppressive. Furthermore, extended ligand stimulation caused a significant decrease in proliferation that correlated with a rise in caspase-3/7 and -8 activities. Together, these results demonstrate that overexpression of EphB4 confers a transformed phenotype in the case of MCF-10A cells and an increased metastatic phenotype in the case of 22Rv1 cancer cells and that both phenotypes can be restrained by stimulation with ephrin-B2, in part by reducing EphB4 levels.

An extension to the rank constraint for improving the reliability of stereo matching algorithms using the rank transform

The rank transform is one non-parametric transform which has been applied to the stereo matching problem The advantages of this transform include its invariance to radio metric distortion and its amenability to hardware implementation. This paper describes the derivation of the rank constraint for matching using the rank transform Previous work has shown that this constraint was capable of resolving ambiguous matches thereby improving match reliability A new matching algorithm incorporating this constraint was also proposed. This paper extends on this previous work by proposing a matching algorithm which uses a dimensional match surface in which the match score is computed for every possible template and match window combination. The principal advantage of this algorithm is that the use of the match surface enforces the left�right consistency and uniqueness constraints thus improving the algorithms ability to remove invalid matches Experimental results for a number of test stereo pairs show that the new algorithm is capable of identifying and removing a large number of in incorrect matches particularly in the case of occlusions

An accurate and reliable stereo matching algorithm incorporating the rank constraint

A fundamental problem faced by stereo vision algorithms is that of determining correspondences between two images which comprise a stereo pair. This paper presents work towards the development of a new matching algorithm, based on the rank transform. This algorithm makes use of both area-based and edge-based information, and is therefore referred to as a hybrid algorithm. In addition, this algorithm uses a number of matching constraints,including the novel rank constraint. Results obtained using a number of test pairs show that the matching algorithm is capable of removing a significant proportion of invalid matches. The accuracy of matching in the vicinity of edges is also improved.

A hybrid stereo matching algorithm incorporating the rank constraint

A fundamental problem faced by stereo vision algorithms is that of determining correspondences between two images which comprise a stereo pair. This paper presents work towards the development of a new matching algorithm, based on the rank transform. This algorithm makes use of both area-based and edge-based information, and is therefore referred to as a hybrid algorithm. In addition, this algorithm uses a number of matching constraints, including the novel rank constraint. Results obtained using a number of test pairs show that the matching algorithm is capable of removing most invalid matches. The accuracy of matching in the vicinity of edges is also improved.

A constraint to improve the reliability of stereo matching using the rank transform

The rank transform is a non-parametric technique which has been recently proposed for the stereo matching problem. The motivation behind its application to the matching problem is its invariance to certain types of image distortion and noise, as well as its amenability to real-time implementation. This paper derives an analytic expression for the process of matching using the rank transform, and then goes on to derive one constraint which must be satisfied for a correct match. This has been dubbed the rank order constraint or simply the rank constraint. Experimental work has shown that this constraint is capable of resolving ambiguous matches, thereby improving matching reliability. This constraint was incorporated into a new algorithm for matching using the rank transform. This modified algorithm resulted in an increased proportion of correct matches, for all test imagery used.

Estimating the probability of an invalid match for matching using the rank transform

A fundamental problem faced by stereo matching algorithms is the matching or correspondence problem. A wide range of algorithms have been proposed for the correspondence problem. For all matching algorithms, it would be useful to be able to compute a measure of the probability of correctness, or reliability of a match. This paper focuses in particular on one class for matching algorithms, which are based on the rank transform. The interest in these algorithms for stereo matching stems from their invariance to radiometric distortion, and their amenability to fast hardware implementation. This work differs from previous work in that it derives, from first principles, an expression for the probability of a correct match. This method was based on an enumeration of all possible symbols for matching. The theoretical results for disparity error prediction, obtained using this method, were found to agree well with experimental results. However, disadvantages of the technique developed in this chapter are that it is not easily applicable to real images, and also that it is too computationally expensive for practical window sizes. Nevertheless, the exercise provides an interesting and novel analysis of match reliability.

Rank and file : assessing research quality in Australia

In this paper, the author describes recent developments in the assessment of research activity and publication in Australia. Of particular interest to readers will be the move to rank academic journals. Educational Philosophy and Theory (EPAT) received the highest possible ranking, however, the process is far from complete. Some implications for the field, for this journal and particularly, for the educational foundations are discussed.

Rank minimization across appearance and shape for AAM ensemble fitting

Active Appearance Models (AAMs) employ a paradigm of inverting a synthesis model of how an object can vary in terms of shape and appearance. As a result, the ability of AAMs to register an unseen object image is intrinsically linked to two factors. First, how well the synthesis model can reconstruct the object image. Second, the degrees of freedom in the model. Fewer degrees of freedom yield a higher likelihood of good fitting performance. In this paper we look at how these seemingly contrasting factors can complement one another for the problem of AAM fitting of an ensemble of images stemming from a constrained set (e.g. an ensemble of face images of the same person).

Predicting fault-prone software modules with rank sum classification

The detection and correction of defects remains among the most time consuming and expensive aspects of software development. Extensive automated testing and code inspections may mitigate their effect, but some code fragments are necessarily more likely to be faulty than others, and automated identification of fault prone modules helps to focus testing and inspections, thus limiting wasted effort and potentially improving detection rates. However, software metrics data is often extremely noisy, with enormous imbalances in the size of the positive and negative classes. In this work, we present a new approach to predictive modelling of fault proneness in software modules, introducing a new feature representation to overcome some of these issues. This rank sum representation offers improved or at worst comparable performance to earlier approaches for standard data sets, and readily allows the user to choose an appropriate trade-off between precision and recall to optimise inspection effort to suit different testing environments. The method is evaluated using the NASA Metrics Data Program (MDP) data sets, and performance is compared with existing studies based on the Support Vector Machine (SVM) and Naïve Bayes (NB) Classifiers, and with our own comprehensive evaluation of these methods.

Integrin-functionalized artificial membranes as test platforms for monitoring small integrin ligand binding by surface plasmon-enhanced fluorescence spectroscopy

The design and synthesis of molecularly or supramolecularly defined interfacial architectures have seen in recent years a remarkable growth of interest and scientific research activities for various reasons. On the one hand, it is generally believed that the construction of an interactive interface between the living world of cells, tissue, or whole organisms and the (inorganic or organic) materials world of technical devices such as implants or medical parts requires proper construction and structural (and functional) control of this organism–machine interface. It is still the very beginning of generating a better understanding of what is needed to make an organism tolerate implants, to guarantee bidirectional communication between microelectronic devices and living tissue, or to simply construct interactive biocompatibility of surfaces in general. This exhaustive book lucidly describes the design, synthesis, assembly and characterization, and bio-(medical) applications of interfacial layers on solid substrates with molecularly or supramolecularly controlled architectures. Experts in the field share their contributions that have been developed in recent years.

Using the quantum probability ranking principle to rank interdependent documents

A known limitation of the Probability Ranking Principle (PRP) is that it does not cater for dependence between documents. Recently, the Quantum Probability Ranking Principle (QPRP) has been proposed, which implicitly captures dependencies between documents through “quantum interference”. This paper explores whether this new ranking principle leads to improved performance for subtopic retrieval, where novelty and diversity is required. In a thorough empirical investigation, models based on the PRP, as well as other recently proposed ranking strategies for subtopic retrieval (i.e. Maximal Marginal Relevance (MMR) and Portfolio Theory(PT)), are compared against the QPRP. On the given task, it is shown that the QPRP outperforms these other ranking strategies. And unlike MMR and PT, one of the main advantages of the QPRP is that no parameter estimation/tuning is required; making the QPRP both simple and effective. This research demonstrates that the application of quantum theory to problems within information retrieval can lead to significant improvements.

Is intent-aware expected reciprocal rank sufficient to evaluate diversity?

In this paper we define two models of users that require diversity in search results; these models are theoretically grounded in the notion of intrinsic and extrinsic diversity. We then examine Intent-Aware Expected Reciprocal Rank (ERR-IA), one of the official measures used to assess diversity in TREC 2011-12, with respect to the proposed user models. By analyzing ranking preferences as expressed by the user models and those estimated by ERR-IA, we investigate whether ERR-IA assesses document rankings according to the requirements of the diversity retrieval task expressed by the two models. Empirical results demonstrate that ERR-IA neglects query-intents coverage by attributing excessive importance to redundant relevant documents. ERR-IA behavior is contrary to the user models that require measures to first assess diversity through the coverage of intents, and then assess the redundancy of relevant intents. Furthermore, diversity should be considered separately from document relevance and the documents positions in the ranking.