On a new class of dynamic Hardy-type inequalities and some related generalizations

Aequationes mathematicae - In this paper, we establish a new class of dynamic inequalities of Hardy’s type which generalize and improve some recent results given in the literature. More...     

Resolution of Some Open Problems Concerning Multiple Zeta Evaluations of Arbitrary Depth

We prove some new evaluations for multiple polylogarithms of arbitrary depth. The simplest of our results is a multiple zeta evaluation one order of complexity beyond the well-known Broadhurst–Zagier formula. Other results we provide settle three of the remaining outstanding conjectures of Borwein, Bradley, and Broadhurst. A complete treatment of a certain arbitrary depth class of periodic alternating unit Euler sums is also given.     

An improved synthesis of rhinocerotinoic acid

The stereoselective synthesis of E-rhinocerotinoic acid has been achieved in five steps from (−)-sclareol in an overall yield of 32%. This constitutes a significant improvement on the previous synthesis of this anti-inflammatory compound.     

Ishihara's proof technique in constructive analysis

Two surprising constructive lemmas of Ishihara, with extremely useful proof techniques, are placed in a general setting. This both clarifies the ideas underlying those lemmas and raises the possibility that some other applications of their proof techniques in constructive analysis are, in fact, corollaries of our general results.     

Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings

Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social networks. We introduce a novel approach to distinguishing different network macro-structures in terms of cohesive subsets and their overlaps. We develop a vocabulary that relates different forms of network cohesion to field properties as opposed to organizational constraints on ties and structures. We illustrate differences in probabilistic attachment processes in network evolution that link on the one hand to organizational constraints versus field properties and to cohesive network topologies on the other. This allows us to identify a set of important new micro-macro linkages between local behavior in networks and global network properties. The analytic strategy thus puts in place a methodology for Predictive Social Cohesion theory to be developed and tested in the context of informal and formal organizations and organizational fields. We also show how organizations and fields combine at different scales of cohesive depth and cohesive breadth. Operational measures and results are illustrated for three organizational examples, and analysis of these cases suggests that different structures of cohesive subsets and overlaps may be predictive in organizational contexts and similarly for the larger fields in which they are embedded. Useful predictions may also be based on feedback from level of cohesion in the larger field back to organizations, conditioned on the level of multiconnectivity to the field.     

Point load determination of static elastic moduli using laser speckle interferometry

Electronic speckle interferometry (ESPI) is used to determine the Young's modulus E and Poisson ratio ν of an isotropic material. Micron scale deformations of the surface of the block of polymethyl-methacrylate (PMMA) are induced by normal application of a known near-point force. These deformations are recorded in speckle interferometric fringe patterns. An iterative minimum error inversion technique is developed to obtain the elastic properties from the positions of fringe peaks and troughs observed in the fringe patterns. Sensitivity tests of the method on calculated fringe patterns using measured experimental uncertainties suggest the technique will provide measures of the elastic moduli to better than 5%. In an experimental test on a bloc of PMMA (acrylic) the technique gave values of E and ν that differed from corresponding measures obtained using more conventional strain-gauge methods by less than 4%.     

Magnetic-Field-Dependent Electronic Relaxation of Gd3+ in Aqueous Solutions of the Complexes [Gd(H2O)8]3+, [Gd(propane-1,3-diamine-N,N,N′,N′-tetraacetate)(H2O)2]−, and [Gd(N,N′-bis[(N-methylcarbamoyl)methyl]-3-azapentane-1,5-diamine-3,N,N′-triacetate)(H2O)] of interest in magnetic-resonance imaging

EPR Spectra have been measured for aqueous solutions of a series of Gd³⁺ complexes at variable temperature and a range of magnetic fields; S-band (0.14 T), X-band (0.34 T), Q-band (1.2 T), and 2-mm-band (5.0 T). The major contribution to the observed line widths is magnetic-field-dependent and is interpreted as being due to the modulation of the zero-field splitting produced by distortion of the complexes from perfect symmetry. The transverse and longitudinal relaxation matrices for an ⁸S ion with such an interaction have been calculated using Redfield theory with vector-coupling methods, and diagonalised numerically to obtain relaxation rates and intensities for the degenerate transitions which contribute to the multiplet. The observed line width, which is inversely proportional to the magnetic field at low temperatures, is best described by the intensity-weighted mean transverse relaxation time for the four transitions with non-zero intensity. A least-squares fit of the data yields the square of the zero-field splitting tensor, Δ², and a correlation time, τ_v, with activation energy, E_v. The physical significance of these parameters and the extent of validity of the theoretical approach are considered. The parameters are used to predict the magnetic-field dependence of the longitudinal and transverse electronic relaxation times, which are discussed in the context of their relevance to ¹H-NMR relaxivity.     

Some Fixed-Point Results for the Dynamic Assignment Problem

In previous work the authors consider the dynamic assignment problem, which involves solving sequences of assignment problems over time in the presence of uncertain information about the future. The algorithm proposed by the authors provides generally high-quality but non-optimal solutions. In this work, though, the authors prove that if the optimal solution to a dynamic assignment problem in one of two problem classes is unique, then the optimal solution is a fixed point under the algorithm.