Relationship between differential retention of Escherichia coli and Enterococcus faecalis and variations in enzyme activity in the scallop Patinopecten yessoensis

Uptake of Escherichia coli and Enterococcus faecalis and variations of trypsin amylase activity acid phosphatase and superoxide dismutase in tissue of the scallop Patinopecten yessoensis were detected. The results showed that P. yessoensis accumulated E. faecalis in larger numbers and more rapidly than E. coli, both with the highest concentration in the digestive tract and lowest in hemolymph. Compared to E. coil, all scallops exposed to E. faecalis showed significantly higher trypsin and AMS activity. SOD activity in hemocytes and ACP activity in hemolymph was significantly higher in the treatments with 5 log(10)CFU/ml E. colt than with E. faecalis. But no significant differences in ACP activity of P. yessoensis exposed to a 3 log(10)CFU/ml inoculum of both bacteria were recorded. In conclusion, the mass retention of gut microflora in P. yessoensis is positively correlated with digestive enzymes activity and negatively correlated with ACP activity in the hemocyte. (C) 2010 Published by Elsevier Ltd.

Genetic mapping of laminaria japonica and l. longissima using amplified fragment length polymorphism markers in a "two-way pseudo-testcross" strategy

With a "two-way pseudo-testcross" mapping strategy, we applied the amplified fragment length polymorphism (AFLP) markers to construct two moderate density genetic linkage maps for Laminaria. The linkage maps were generated from the 60 progenies of the F, cross family (Laminaria longissima Aresch. x L. japonica Miyabe) with twenty pairs of primer combinations. Of the 333 polymorphic loci scored in 60 progenies, 173 segregated in a 1:1 ratio, corresponding to DNA polymorphisms heterozygous in a single parent, and the other 58 loci existing in both parents followed a 3:1 Mendelian segregation ratio. Among the loci with 1:1 segregating ratios, 79 loci were ordered in 14 linkage groups (648.6 cM) of the paternal map, and 72 loci were ordered in 14 linkage groups (601.9 cM) of the maternal map. The average density of loci was approximately 1 per 8 cM. To investigate the homologies between two parental maps, we used 58 loci segregated 3:1 for further analysis, and deduced one homologous linkage group. The linkage data developed in these maps will be useful for detecting loci-controlling commercially important traits for Laminaria.

Analysis of Differential and Matching Methods for Optical Flow

Several algorithms for optical flow are studied theoretically and experimentally. Differential and matching methods are examined; these two methods have differing domains of application- differential methods are best when displacements in the image are small (<2 pixels) while matching methods work well for moderate displacements but do not handle sub-pixel motions. Both types of optical flow algorithm can use either local or global constraints, such as spatial smoothness. Local matching and differential techniques and global differential techniques will be examined. Most algorithms for optical flow utilize weak assumptions on the local variation of the flow and on the variation of image brightness. Strengthening these assumptions improves the flow computation. The computational consequence of this is a need for larger spatial and temporal support. Global differential approaches can be extended to local (patchwise) differential methods and local differential methods using higher derivatives. Using larger support is valid when constraint on the local shape of the flow are satisfied. We show that a simple constraint on the local shape of the optical flow, that there is slow spatial variation in the image plane, is often satisfied. We show how local differential methods imply the constraints for related methods using higher derivatives. Experiments show the behavior of these optical flow methods on velocity fields which so not obey the assumptions. Implementation of these methods highlights the importance of numerical differentiation. Numerical approximation of derivatives require care, in two respects: first, it is important that the temporal and spatial derivatives be matched, because of the significant scale differences in space and time, and, second, the derivative estimates improve with larger support.

Coordinate-Independent Computations on Differential Equations

This project investigates the computational representation of differentiable manifolds, with the primary goal of solving partial differential equations using multiple coordinate systems on general n- dimensional spaces. In the process, this abstraction is used to perform accurate integrations of ordinary differential equations using multiple coordinate systems. In the case of linear partial differential equations, however, unexpected difficulties arise even with the simplest equations.

A Modern Differential Geometric Approach to Shape from Shading

How the visual system extracts shape information from a single grey-level image can be approached by examining how the information about shape is contained in the image. This technical report considers the characteristic equations derived by Horn as a dynamical system. Certain image critical points generate dynamical system critical points. The stable and unstable manifolds of these critical points correspond to convex and concave solution surfaces, giving more general existence and uniqueness results. A new kind of highly parallel, robust shape from shading algorithm is suggested on neighborhoods of these critical points. The information at bounding contours in the image is also analyzed.

Automatic Qualitative Analysis of Ordinary Differential Equations Using Piecewise Linear Approximations

This paper explores automating the qualitative analysis of physical systems. It describes a program, called PLR, that takes parameterized ordinary differential equations as input and produces a qualitative description of the solutions for all initial values. PLR approximates intractable nonlinear systems with piecewise linear ones, analyzes the approximations, and draws conclusions about the original systems. It chooses approximations that are accurate enough to reproduce the essential properties of their nonlinear prototypes, yet simple enough to be analyzed completely and efficiently. It derives additional properties, such as boundedness or periodicity, by theoretical methods. I demonstrate PLR on several common nonlinear systems and on published examples from mechanical engineering.

Representations and evolutionary operators for the scheduling of pump operations in water distribution networks.

Reducing the energy consumption of water distribution networks has never had more significance. The greatest energy savings can be obtained by carefully scheduling the operations of pumps. Schedules can be defined either implicitly, in terms of other elements of the network such as tank levels, or explicitly by specifying the time during which each pump is on/off. The traditional representation of explicit schedules is a string of binary values with each bit representing pump on/off status during a particular time interval. In this paper, we formally define and analyze two new explicit representations based on time-controlled triggers, where the maximum number of pump switches is established beforehand and the schedule may contain less switches than the maximum. In these representations, a pump schedule is divided into a series of integers with each integer representing the number of hours for which a pump is active/inactive. This reduces the number of potential schedules compared to the binary representation, and allows the algorithm to operate on the feasible region of the search space. We propose evolutionary operators for these two new representations. The new representations and their corresponding operations are compared with the two most-used representations in pump scheduling, namely, binary representation and level-controlled triggers. A detailed statistical analysis of the results indicates which parameters have the greatest effect on the performance of evolutionary algorithms. The empirical results show that an evolutionary algorithm using the proposed representations improves over the results obtained by a recent state-of-the-art Hybrid Genetic Algorithm for pump scheduling using level-controlled triggers.

Augmenting an artificial immune network using ordering, self-recognition and histo-compatibility operators.

Timmis J Neal M J and Hunt J. Augmenting an artificial immune network using ordering, self-recognition and histo-compatibility operators. In Proceedings of IEEE international conference of systems, man and cybernetics, pages 3821-3826, San Diego, 1998. IEEE.

A Framework for the Scoring of Operators on the Search Space of Equivalence Classes of Bayesian Network Structures

R. Daly and Q. Shen. A Framework for the Scoring of Operators on the Search Space of Equivalence Classes of Bayesian Network Structures. Proceedings of the 2005 UK Workshop on Computational Intelligence, pages 67-74.

Boundary triplets and M-functions for non-selfadjoint operators, with applications to elliptic PDEs and block operator matrices

B.M. Brown, M. Marletta, S. Naboko, I. Wood: Boundary triplets and M-functions for non-selfadjoint operators, with applications to elliptic PDEs and block operator matrices, J. London Math. Soc., June 2008; 77: 700-718. The full text of this article will be made available in this repository in June 2009 Sponsorship: EPSRC,INTAS

Public service employment and the public-private wage differential in British regions

Thomas, Dennis, Henley, Andrew, 'Public service employment and the public-private wage differential in British regions', Regional Studies (2001) 35(3) pp.229-240 RAE2008

Singular perturbation of quantum stochastic differential equations with coupling through an oscillator mode

Gough, John; Van Handel, R., (2007) 'Singular perturbation of quantum stochastic differential equations with coupling through an oscillator mode', Journal of Statistical Physics 127(3) pp.575-607 RAE2008