Numerical simulation of solid tumor blood perfusion and drug delivery during the “vascular normalization window” with antiangiogenic therapy

This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2011 Hindawi PublishingTo investigate the influence of vascular normalization on solid tumor blood perfusion and drug delivery, we used the generated blood vessel network for simulations. Considering the hemodynamic parameters changing after antiangiogenic therapies, the results show that the interstitial fluid pressure (IFP) in tumor tissue domain decreases while the pressure gradient increases during the normalization window. The decreased IFP results in more efficient delivery of conventional drugs to the targeted cancer cells. The outcome of therapies will improve if the antiangiogenic therapies and conventional therapies are carefully scheduled

The definability criterions for convex projective polyhedral reflection groups

Following Vinberg, we find the criterions for a subgroup generated by reflections \Gamma \subset \SL^{\pm}(n+1,\mathbb{R}) and its finite-index subgroups to be definable over $\mathbb{A}$ where $\mathbb{A}$ is an integrally closed Noetherian ring in the field $\mathbb{R}$. We apply the criterions for groups generated by reflections that act cocompactly on irreducible properly convex open subdomains of the $n$-dimensional projective sphere. This gives a method for constructing injective group homomorphisms from such Coxeter groups to \SL^{\pm}(n+1,\mathbb{Z}). Finally we provide some examples of \SL^{\pm}(n+1,\mathbb{Z})-representations of such Coxeter groups. In particular, we consider simplicial reflection groups that are isomorphic to hyperbolic simplicial groups and classify all the conjugacy classes of the reflection subgroups in \SL^{\pm}(n+1,\mathbb{R}) that are definable over $\mathbb{Z}$. These were known by Goldman, Benoist, and so on previously.Comment: 31 pages, 8 figure

Symmetries and Lie algebra of the differential-difference Kadomstev-Petviashvili hierarchy

By introducing suitable non-isospectral flows we construct two sets of symmetries for the isospectral differential-difference Kadomstev-Petviashvili hierarchy. The symmetries form an infinite dimensional Lie algebra.Comment: 9 page

On tree-preserving constraints

© Springer International Publishing Switzerland 2015. Tree convex constraints are extensions of the well-known row convex constraints. Just like the latter, every path-consistent tree convex constraint network is globally consistent. This paper studies and compares three subclasses of tree convex constraints which are called chain-, path- and tree-preserving constraints respectively. While the tractability of the subclass of chain-preserving constraints has been established before, this paper shows that every chain- or path-preserving constraint network is in essence the disjoint union of several independent connected row convex constraint networks, and hence (re-)establish the tractability of these two subclasses of tree convex constraints. We further prove that, when enforcing arc- and path-consistency on a tree-preserving constraint network, in each step, the network remains tree-preserving. This ensures the global consistency of the tree-preserving network if no inconsistency is detected. Moreover, it also guarantees the applicability of the partial path-consistency algorithm to tree-preserving constraint networks, which is usually more efficient than the path-consistency algorithm for large sparse networks. As an application, we show that the class of treepreserving constraints is useful in solving the scene labelling problem

On tree-preserving constraints

© 2017, Springer International Publishing Switzerland. The study of tractable subclasses of constraint satisfaction problems is a central topic in constraint solving. Tree convex constraints are extensions of the well-known row convex constraints. Just like the latter, every path-consistent tree convex constraint network is globally consistent. However, it is NP-complete to decide whether a tree convex constraint network has solutions. This paper studies and compares three subclasses of tree convex constraints, which are called chain-, path-, and tree-preserving constraints respectively. The class of tree-preserving constraints strictly contains the subclasses of path-preserving and arc-consistent chain-preserving constraints. We prove that, when enforcing strong path-consistency on a tree-preserving constraint network, in each step, the network remains tree-preserving. This ensures the global consistency of consistent tree-preserving networks after enforcing strong path-consistency, and also guarantees the applicability of the partial path-consistency algorithms to tree-preserving constraint networks, which is usually much more efficient than the path-consistency algorithms for large sparse constraint networks. As an application, we show that the class of tree-preserving constraints is useful in solving the scene labelling problem

New Experimental Limit on the Electric Dipole Moment of the Electron in a Paramagnetic Insulator

We report results of an experimental search for the intrinsic Electric Dipole Moment (EDM) of the electron using a solid-state technique. The experiment employs a paramagnetic, insulating gadolinium gallium garnet (GGG) that has a large magnetic response at low temperatures. The presence of the eEDM would lead to a small but non-zero magnetization as the GGG sample is subject to a strong electric field. We search for the resulting Stark-induced magnetization with a sensitive magnetometer. Recent progress on the suppression of several sources of background allows the experiment to run free of spurious signals at the level of the statistical uncertainties. We report our first limit on the eEDM of $(-5.57 \pm 7.98 \pm 0.12)\times$10$^{-25}$e$\cdot$cm with 5 days of data averaging.Comment: 9 pages, 9 figures, Revtex 4.