Stability for parametric implicit vector equilibrium problems

In this paper, we consider a class of parametric implicit vector equilibrium problems in Hausdorff topological vector spaces where a mapping f and a set K are perturbed by parameters is an element of and lambda respectively. We establish sufficient conditions for the upper semicontinuity and lower semicontinuity of the solution set mapping S : Lambda(1) x A(2) -> 2(X) for such parametric implicit vector equilibrium problems. (c) 2005 Elsevier Ltd. All rights reserved.

Scope for further analytical solutions for constant flux infiltration into a semi-infinite soil profile or redistribution in a finite soil profile

[1] We attempt to generate new solutions for the moisture content form of the one-dimensional Richards' [1931] equation using the Lisle [1992] equivalence mapping. This mapping is used as no more general set of transformations exists for mapping the one-dimensional Richards' equation into itself. Starting from a given solution, the mapping has the potential to generate an infinite number of new solutions for a series of nonlinear diffusivity and hydraulic conductivity functions. We first seek new analytical solutions satisfying Richards' equation subject to a constant flux surface boundary condition for a semi-infinite dry soil, starting with the Burgers model. The first iteration produces an existing solution, while subsequent iterations are shown to endlessly reproduce this same solution. Next, we briefly consider the problem of redistribution in a finite-length soil. In this case, Lisle's equivalence mapping is generalized to account for arbitrary initial conditions. As was the case for infiltration, however, it is found that new analytical solutions are not generated using the equivalence mapping, although existing solutions are recovered.

Implicit vector equilibrium problems with applications

Let X and Y be Hausdorff topological vector spaces, K a nonempty, closed, and convex subset of X, C: K--> 2(Y) a point-to-set mapping such that for any x is an element of K, C(x) is a pointed, closed, and convex cone in Y and int C(x) not equal 0. Given a mapping g : K --> K and a vector valued bifunction f : K x K - Y, we consider the implicit vector equilibrium problem (IVEP) of finding x* is an element of K such that f (g(x*), y) is not an element of - int C(x) for all y is an element of K. This problem generalizes the (scalar) implicit equilibrium problem and implicit variational inequality problem. We propose the dual of the implicit vector equilibrium problem (DIVEP) and establish the equivalence between (IVEP) and (DIVEP) under certain assumptions. Also, we give characterizations of the set of solutions for (IVP) in case of nonmonotonicity, weak C-pseudomonotonicity, C-pseudomonotonicity, and strict C-pseudomonotonicity, respectively. Under these assumptions, we conclude that the sets of solutions are nonempty, closed, and convex. Finally, we give some applications of (IVEP) to vector variational inequality problems and vector optimization problems. (C) 2003 Elsevier Science Ltd. All rights reserved.

Global behavior of positive solutions of nonlinear three-point boundary value problems

We investigate the structure of the positive solution set for nonlinear three-point boundary value problems of the form u('') + h(t) f(u) = 0, u(0) = 0, u(1) = lambdau(eta), where eta epsilon (0, 1) is given lambda epsilon (0, 1/n) is a parameter, f epsilon C ([0, infinity), [0, infinity)) satisfies f (s) > 0 for s > 0, and h epsilon C([0, 1], [0, infinity)) is not identically zero on any subinterval of [0, 1]. Our main results demonstrate the existence of continua of positive solutions of the above problem. (C) 2004 Elsevier Ltd. All rights reserved.

Current density mapping approach for design of clinical magnetic resonance imaging magnets

Novel current density mapping (CDM) schemes are developed for the design of new actively shielded, clinical magnetic resonance imaging (MRI) magnets. This is an extended inverse method in which the entire potential solution space for the superconductors has been considered, rather than single current density layers. The solution provides an insight into the required superconducting coil pattern for a desired magnet configuration. This information is then used as an initial set of parameters for the magnet structure, and a previously developed hybrid numerical optimization technique is used to obtain the final geometry of the magnet. The CDM scheme is applied to the design of compact symmetric, asymmetric, and open architecture 1.0-1.5 T MRI magnet systems of novel geometry and utility. A new symmetric 1.0-T system that is just I m in length with a full 50-cm diameter of the active, or sensitive, volume (DSV) is detailed, as well as an asymmetric system in which a 50-cm DSV begins just 14 cm from the end of the coil structure. Finally a 1.0-T open magnet system with a full 50-cm DSV is presented. These new designs provide clinically useful homogeneous regions and have appropriately restricted stray fields but, in some of the designs, the DSV is much closer to the end of the magnet system than in conventional designs. These new designs have the potential to reduce patient claustrophobia and improve physician access to patients undergoing scans. (C) 2002 Wiley Periodicals, Inc.

Towards realistic simulations of lava dome growth using the level set method

The level set method has been implemented in a computational volcanology context. New techniques are presented to solve the advection equation and the reinitialisation equation. These techniques are based upon an algorithm developed in the finite difference context, but are modified to take advantage of the robustness of the finite element method. The resulting algorithm is tested on a well documented Rayleigh–Taylor instability benchmark [19], and on an axisymmetric problem where the analytical solution is known. Finally, the algorithm is applied to a basic study of lava dome growth.

Superconducting Correlations in Metallic Nanoparticles: Exact Solution of the BCS Model by the Algebraic Bethe Ansatz

Superconducting pairing of electrons in nanoscale metallic particles with discrete energy levels and a fixed number of electrons is described by the reduced Bardeen, Cooper, and Schrieffer model Hamiltonian. We show that this model is integrable by the algebraic Bethe ansatz. The eigenstates, spectrum, conserved operators, integrals of motion, and norms of wave functions are obtained. Furthermore, the quantum inverse problem is solved, meaning that form factors and correlation functions can be explicitly evaluated. Closed form expressions are given for the form factors and correlation functions that describe superconducting pairing.

A demonstration of artificial dissipation effects in some finite volume solution methods for the Navier-Stokes equations

The artificial dissipation effects in some solutions obtained with a Navier-Stokes flow solver are demonstrated. The solvers were used to calculate the flow of an artificially dissipative fluid, which is a fluid having dissipative properties which arise entirely from the solution method itself. This was done by setting the viscosity and heat conduction coefficients in the Navier-Stokes solvers to zero everywhere inside the flow, while at the same time applying the usual no-slip and thermal conducting boundary conditions at solid boundaries. An artificially dissipative flow solution is found where the dissipation depends entirely on the solver itself. If the difference between the solutions obtained with the viscosity and thermal conductivity set to zero and their correct values is small, it is clear that the artificial dissipation is dominating and the solutions are unreliable.

Solution structure and proposed binding mechanism of a novel potassium channel toxin kappa-conotoxin PVIIA

Background: kappa-PVIIA is a 27-residue polypeptide isolated from the venom of Conus purpurascens and is the first member of a new class of conotoxins that block potassium channels. By comparison to other ion channels of eukaryotic cell membranes, voltage-sensitive potassium channels are relatively simple and methodology has been developed for mapping their interactions with small-peptide toxins, PVIIA, therefore, is a valuable new probe of potassium channel structure. This study of the solution structure and mode of channel binding of PVIIA forms the basis for mapping the interacting residues at the conotoxin-ion channel interface. Results: The three-dimensional structure of PVIIA resembles the triple-stranded beta sheet/cystine-knot motif formed by a number of toxic and inhibitory peptides. Subtle structural differences, predominantly in loops 2 and 4, are observed between PVIIA and other conotoxins with similar structural frameworks, however. Electrophysiological binding data suggest that PVIIA blocks channel currents by binding in a voltage-sensitive manner to the external vestibule and occluding the pore, Comparison of the electrostatic surface of PVIIA with that of the well-characterised potassium channel blocker charybdotoxin suggests a likely binding orientation for PVIIA, Conclusions: Although the structure of PVIIA is considerably different to that of the alpha K scorpion toxins, it has a similar mechanism of channel blockade. On the basis of a comparison of the structures of PVIIA and charybdotoxin, we suggest that Lys19 of PVIIA is the residue which is responsible for physically occluding the pore of the potassium channel.

Three-dimensional solution structure of alpha-conotoxin MII by NMR spectroscopy: Effects of solution environment on helicity

alpha-Conotoxin MII, a 16-residue polypeptide from the venom of the piscivorous cone snail Conus magus, is a potent and highly specific blocker of mammalian neuronal nicotinic acetylcholine receptors composed of alpha 3 beta 2 subunits. The role of this receptor type in the modulation of neurotransmitter release and its relevance to the problems of addiction and psychosis emphasize the importance of a structural understanding of the mode of interaction of MII with the alpha 3 beta 2 interface. Here we describe the three-dimensional solution structure of MIT determined using 2D H-1 NMR spectroscopy. Structural restraints consisting of 376 interproton distances inferred from NOEs and 12 dihedral restraints derived from spin-spin coupling constants were used as input for simulated annealing calculations and energy minimization in the program X-PLOR. The final set of 20 structures is exceptionally well-defined with mean pairwise rms differences over the whole molecule of 0.07 Angstrom for the backbone atoms and 0.34 Angstrom for all heavy atoms. MII adopts a compact structure incorporating a central segment of alpha-helix and beta-turns at the N- and C-termini. The molecule is stabilized by two disulfide bonds, which provide cross-links between the N-terminus and both the middle and C-terminus of the structure. The susceptibility of the structure to conformational change was examined using several different solvent conditions. While the global fold of MII remains the same, the structure is stabilized in a more hydrophobic environment provided by the addition of acetonitrile or trifluoroethanol to the aqueous solution. The distribution of amino acid side chains in MII creates distinct hydrophobic and polar patches on its surface that may be important for the specific interaction with the alpha 3 beta 2 neuronal nAChR. A comparison of the structure of MII with other neuronal-specific alpha-conotoxins provides insights into their mode of interaction with these receptors.

A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements

To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.

Solution of a two-leg spin ladder system

A model for a spin-1/2 ladder system with two legs is introduced. It is demonstrated that this model is solvable via the Bethe ansatz method for arbitrary values of the rung coupling J. This is achieved by a suitable mapping from the Hubbard model with appropriate twisted boundary conditions. We determine that a phase transition between gapped and gapless spin excitations occurs at the critical value J(c) = 1/2 of the rung coupling.

Fine mapping of the tomato I-3 gene for fusarium wilt resistance and elimination of a co-segregating resistance gene analogue as a candidate for I-3

The I-3 gene from the wild tomato species Lycopersicon pennellii confers resistance to race 3 of the devastating vascular wilt pathogen Fusarium oxysporum f. sp. lycopersici. As an initial step in a positional cloning strategy for the isolation of I-3, we converted restriction fragment length polymorphism and conserved orthologue set markers, known genes and a resistance gene analogue (RGA) mapping to the I-3 region into PCR-based sequence characterised amplified region (SCAR) and cleaved amplified polymorphic sequence (CAPS) markers. Additional PCR-based markers in the I-3 region were generated using the randomly amplified DNA fingerprinting (RAF) technique. SCAR, CAPS and RAF markers were used for high-resolution mapping around the I-3 locus. The I-3 gene was localised to a 0.3-cM region containing a RAF marker, eO6, and an RGA, RGA332. RGA332 was cloned and found to correspond to a putative pseudogene with at least two loss-of-function mutations. The predicted pseudogene belongs to the Toll interleukin-1 receptor-nucleotide-binding site-leucine-rich-repeat sub-class of plant disease resistance genes. Despite the presence of two RGA332 homologues in L. esculentum, DNA gel blot and PCR analysis suggests that no other homologues are present in lines carrying I-3 that could be alternative candidates for the gene.

A First Order Predicate Logic Formulation of the 3D Reconstruction Problem and its Solution Space

This paper defines the 3D reconstruction problem as the process of reconstructing a 3D scene from numerous 2D visual images of that scene. It is well known that this problem is ill-posed, and numerous constraints and assumptions are used in 3D reconstruction algorithms in order to reduce the solution space. Unfortunately, most constraints only work in a certain range of situations and often constraints are built into the most fundamental methods (e.g. Area Based Matching assumes that all the pixels in the window belong to the same object). This paper presents a novel formulation of the 3D reconstruction problem, using a voxel framework and first order logic equations, which does not contain any additional constraints or assumptions. Solving this formulation for a set of input images gives all the possible solutions for that set, rather than picking a solution that is deemed most likely. Using this formulation, this paper studies the problem of uniqueness in 3D reconstruction and how the solution space changes for different configurations of input images. It is found that it is not possible to guarantee a unique solution, no matter how many images are taken of the scene, their orientation or even how much color variation is in the scene itself. Results of using the formulation to reconstruct a few small voxel spaces are also presented. They show that the number of solutions is extremely large for even very small voxel spaces (5 x 5 voxel space gives 10 to 10(7) solutions). This shows the need for constraints to reduce the solution space to a reasonable size. Finally, it is noted that because of the discrete nature of the formulation, the solution space size can be easily calculated, making the formulation a useful tool to numerically evaluate the usefulness of any constraints that are added.

Evaluation of unsupervised semantic mapping of natural language with Leximancer concept mapping

The Leximancer system is a relatively new method for transforming lexical co-occurrence information from natural language into semantic patterns in an unsupervised manner. It employs two stages of co-occurrence information extraction-semantic and relational-using a different algorithm for each stage. The algorithms used are statistical, but they employ nonlinear dynamics and machine learning. This article is an attempt to validate the output of Leximancer, using a set of evaluation criteria taken from content analysis that are appropriate for knowledge discovery tasks.