A local–global principle for algebras with involution and hermitian forms

 Weakly hyperbolic involutions are introduced and a proof is given of the following local–global principle: a central simple algebra with involution of any kind is weakly hyperbolic if and only if its signature is zero for all orderings of the ground field. Also, the order of a weakly hyperbolic algebra with involution is a power of two, this being a direct consequence of a result of Scharlau. As a corollary an analogue of Pfister's local–global principle is obtained for the Witt group of hermitian forms over an algebra with involution. Received: 29 October 2001; in final form: 9 August 2002 / Published online: 16 May 2003 Mathematics Subject Classification (2000): 16K20, 11E39     

A comparison of two methods for estimating DCE-MRI parameters via individual and cohort based AIFs in prostate cancer: A step towards practical implementation

Multi-parametric Magnetic Resonance Imaging, and specifically Dynamic Contrast Enhanced (DCE) MRI, play increasingly important roles in detection and staging of prostate cancer (PCa). One of the actively investigated approaches to DCE MRI analysis involves pharmacokinetic (PK) modeling to extract quantitative parameters that may be related to microvascular properties of the tissue. It is well-known that the prescribed arterial blood plasma concentration (or Arterial Input Function, AIF) input can have significant effects on the parameters estimated by PK modeling. The purpose of our study was to investigate such effects in DCE MRI data acquired in a typical clinical PCa setting. First, we investigated how the choice of a semi-automated or fully automated image-based individualized AIF (iAIF) estimation method affects the PK parameter values; and second, we examined the use of method-specific averaged AIF (cohort-based, or cAIF) as a means to attenuate the differences between the two AIF estimation methods.     

Precision measurements with LPCTrap at GANIL

The experimental achievements and the results obtained so far with the LPCTrap device installed at GANIL are presented. The apparatus is dedicated to the study of the weak interaction at low energy by means of precise measurements of the β ? ν angular correlation parameter in nuclear β decays. So far, the data collected with three isotopes have enabled to determine, for the first time, the charge state distributions of the recoiling ions, induced by shakeoff process. The analysis is presently refined to deduce the correlation parameters, with the potential of improving both the constraint deduced at low energy on exotic tensor currents (⁶He¹⁺) and the precision on the V _{u d} element of the quark-mixing matrix (³⁵Ar¹⁺ and ¹⁹Ne¹⁺) deduced from the mirror transitions dataset.     

Quantum Control in Foundational Experiments

We describe a new class of experiments designed to probe the foundations of quantum mechanics. Using quantum controlling devices, we show how to attain a freedom in temporal ordering of the control and detection of various phenomena. We consider wave–particle duality in the context of quantum-controlled and the entanglement-assisted delayed-choice experiments. Then we discuss a quantum-controlled CHSH experiment and measurement of photon’s transversal position and momentum in a single set-up.     

Quadratic geometric programming with application to machining economics

Geometric Programming is extended to include convex quadratic functions. Generalized Geometric Programming is applied to this class of programs to obtain a convex dual program. Machining economics problems fall into this class. Such problems are studied by applying this duality to a nested set of three problems. One problem is zero degree of difficulty and the solution is obtained by solving a simple system of equations. The inclusion of a constraint restricting the force on the tool to be less than or equal to the breaking force provides a more realistic solution. This model is solved as a program with one degree of difficulty. Finally the behavior of the machining cost per part is studied parametrically as a function of axial depth. This research was supported by the Air Force Office of Scientific Research Grant AFOSR-83-0234     

Growth and properties of Li,Ta modified (K,Na)NbO3 lead‐free piezoelectric single crystals

Li, Ta modified (K,Na)NbO₃ single crystals with the size of 18 mm × 18 mm × 10 mm were successfully grown by top‐seeded solution growth method, with orthorhombic–tetra‐gonal phase transition temperature ～79 °C and Curie temperature ～276 °C. The electromechanical coupling factors k₃₃ and k_t were found to be ～88% and ～65%, respectively. The piezoelectric coefficient d₃₃ for the [001]_c poled crystals reached 255 pC/N. In addition, the electromechanical coupling factor exhibited high stability over the temperature range of –50 °C to 70 °C, making these lead free crystals good candidates for electromechanical applications. (© 2014 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Singularities in Quasi-Banach Spaces with Applications to Semilinear Elliptic Equations I

The paper deals with the extension of the singularity theory which was elaborated for Banach spaces to quasi-Banach spaces. For general quasi-Banach spaces some striking tools fail: not locally convex, the dual space may be trivial,…. Applying the concept of dual rich quasi - Banach spaces and results about Fredholm maps some results of the classical theory can be carried over. As an application we show in the continuation of this part how one can use these results for the investigation of the solution structure of semilinear elliptic boundary value problems in function Rpaces of Besov - Triebel - Lizorkin type.     

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue). Their data structure, theFibonacci heap (or F-heap) supports arbitrary deletion inO(logn) amortized time and other heap operations inO(1) amortized time. In this paper we use F-heaps to obtain fast algorithms for finding minimum spanning trees in undirected and directed graphs. For an undirected graph containingn vertices andm edges, our minimum spanning tree algorithm runs inO(m logβ (m, n)) time, improved fromO(mβ(m, n)) time, whereβ(m, n)=min {i|log⁽ⁱ⁾ n ≦m/n}. Our minimum spanning tree algorithm for directed graphs runs inO(n logn + m) time, improved fromO(n log n +m log log log_(m/n+2) n). Both algorithms can be extended to allow a degree constraint at one vertex. Research supported in part by National Science Foundation Grant MCS-8302648. Research supported in part by National Science Foundation Grant MCS-8303139. Research supported in part by National Science Foundation Grant MCS-8300984 and a United States Army Research Office Program Fellowship, DAAG29-83-GO020.     

An extension of Hawkes theorem on the Hausdorff dimension of a Galton–Watson tree

Let ? be the genealogical tree of a supercritical multitype Galton–Watson process, and let Λ be the limit set of ?, i.e., the set of all infinite self-avoiding paths (called ends) through ? that begin at a vertex of the first generation. The limit set Λ is endowed with the metric d(ζ, ξ) = 2 ⁻ⁿ where n = n(ζ, ξ) is the index of the first generation where ζ and ξ differ. To each end ζ is associated the infinite sequence Φ(ζ) of types of the vertices of ζ. Let Ω be the space of all such sequences. For any ergodic, shift-invariant probability measure μ on Ω, define Ω_μ to be the set of all μ-generic sequences, i.e., the set of all sequences ω such that each finite sequence v occurs in ω with limiting frequency μ(Ω(v)), where Ω(v) is the set of all ω′?Ω that begin with the word v. Then the Hausdorff dimension of Λ∩Φ⁻¹ (Ω_μ) in the metric d is