Optimum structure to carry a uniform load between pinned supports: Exact analytical solution

This article is available open access through the publisher’s website at the link below. Copyright @ 2010 The Royal Society.Recent numerical evidence indicates that a parabolic funicular is not necessarily the optimal structural form to carry a uniform load between pinned supports. When the constituent material is capable of resisting equal limiting tensile and compressive stresses, a more efficient structure can be identified, comprising a central parabolic section and networks of truss bars emerging from the supports. In the current article, a precise geometry for this latter structure is identified, avoiding the inconsistencies that render the parabolic form non-optimal. Explicit analytical expressions for the geometry, stress and virtual-displacement fields within and above the structure are presented. Furthermore, a suitable displacement field below the structure is computed numerically and shown to satisfy the Michell–Hemp optimality criteria, hence formally establishing the global optimality of this new structural form

Automated optimization of a reduced layer 5 pyramidal cell model based on experimental data.

The construction of compartmental models of neurons involves tuning a set of parameters to make the model neuron behave as realistically as possible. While the parameter space of single-compartment models or other simple models can be exhaustively searched, the introduction of dendritic geometry causes the number of parameters to balloon. As parameter tuning is a daunting and time-consuming task when performed manually, reliable methods for automatically optimizing compartmental models are desperately needed, as only optimized models can capture the behavior of real neurons. Here we present a three-step strategy to automatically build reduced models of layer 5 pyramidal neurons that closely reproduce experimental data. First, we reduce the pattern of dendritic branches of a detailed model to a set of equivalent primary dendrites. Second, the ion channel densities are estimated using a multi-objective optimization strategy to fit the voltage trace recorded under two conditions - with and without the apical dendrite occluded by pinching. Finally, we tune dendritic calcium channel parameters to model the initiation of dendritic calcium spikes and the coupling between soma and dendrite. More generally, this new method can be applied to construct families of models of different neuron types, with applications ranging from the study of information processing in single neurons to realistic simulations of large-scale network dynamics

Cocliques of maximal size in the prime graph of a finite simple group

In this paper we continue our investgation of the prime graph of a finite simple group started in http://arxiv.org/abs/math/0506294 (the printed version appeared in [1]). We describe all cocliques of maximal size for all finite simple groups and also we correct mistakes and misprints from our previous paper. The list of correction is given in Appendix of the present paper.Comment: published version with correction

Hemispheric lateralisation and immune function: A systematic review of human research

This is the post-print version of the final paper published in Journal of Neuroimmunology. The published article is available from the link below. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. Copyright @ 2011 Elsevier B.V.Past studies examined relationships between hemispheric lateralisation (HL) and immune system functioning. However, there has been no up-dated systematic review of this research area. This article reviews relevant published studies, evaluates study quality and effect sizes. Eleven studies were selected: three revealing a relationship between weaker left hemisphere function and poorer immune function, three describing a relationship between weaker right hemisphere function and stronger immune functioning, and five describing both relationships. Mean effect-size of the studies was r = 0.536 (range 0.280–0.866). Collectively, studies point at left-HL and stronger immunity relationships. Limitations, mechanisms and clinical implications are discussed

Dynamical Scaling from Multi-Scale Measurements

We present a new measure of the Dynamical Critical behavior: the "Multi-scale Dynamical Exponent (MDE)"Comment: 9 pages,Latex, Request figures from [email protected]

Synthesizing Imperative Programs from Examples Guided by Static Analysis

We present a novel algorithm that synthesizes imperative programs for introductory programming courses. Given a set of input-output examples and a partial program, our algorithm generates a complete program that is consistent with every example. Our key idea is to combine enumerative program synthesis and static analysis, which aggressively prunes out a large search space while guaranteeing to find, if any, a correct solution. We have implemented our algorithm in a tool, called SIMPL, and evaluated it on 30 problems used in introductory programming courses. The results show that SIMPL is able to solve the benchmark problems in 6.6 seconds on average.Comment: The paper is accepted in Static Analysis Symposium (SAS) '17. The submission version is somewhat different from the version in arxiv. The final version will be uploaded after the camera-ready version is read

Ultrasoft NLL Running of the Nonrelativistic O(v) QCD Quark Potential

Using the nonrelativistic effective field theory vNRQCD, we determine the contribution to the next-to-leading logarithmic (NLL) running of the effective quark-antiquark potential at order v (1/mk) from diagrams with one potential and two ultrasoft loops, v being the velocity of the quarks in the c.m. frame. The results are numerically important and complete the description of ultrasoft next-to-next-to-leading logarithmic (NNLL) order effects in heavy quark pair production and annihilation close to threshold.Comment: 25 pages, 7 figures, 3 tables; minor modifications, typos corrected, references added, footnote adde

Study of one-dimensional nature of (Sr,Ba)_2Cu(PO_4)_2 and BaCuP_2O_7 via 31P NMR

The magnetic behavior of the low-dimensional phosphates (Sr,Ba)_2 Cu(PO_4)_2 and BaCuP_2O_7 was investigated by means of magnetic susceptibility and ^{31}P nuclear magnetic resonance (NMR) measurements. We present here the NMR shift K(T), the spin-lattice 1/T_1 and spin-spin 1/T_2 relaxation-rate data over a wide temperature range 0.02 K < T < 300 K. The T-dependence of the NMR K(T) is well described by the S=1/2 Heisenberg antiferromagnetic chain model with an intrachain exchange of J/k_B = 165 K, 151 K, and 108 K in Sr_2Cu(PO_4)_2, Ba_2Cu(PO_4)_2, and BaCuP_2O_7, respectively. Our measurements suggest the presence of magnetic ordering at 0.8 K in BaCuP_2O_7 (J/k_B = 108 K). For all the samples, we find that 1/T_1 is nearly T-independent at low-temperatures (1 K < T < 10 K), which is theoretically expected for 1D chains when relaxation is dominated by fluctuations of the staggered susceptibility. At high temperatures, 1/T_1 varies nearly linearly with temperature

Evaluation of Directive-Based GPU Programming Models on a Block Eigensolver with Consideration of Large Sparse Matrices

Achieving high performance and performance portability for large-scale scientific applications is a major challenge on heterogeneous computing systems such as many-core CPUs and accelerators like GPUs. In this work, we implement a widely used block eigensolver, Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG), using two popular directive based programming models (OpenMP and OpenACC) for GPU-accelerated systems. Our work differs from existing work in that it adopts a holistic approach that optimizes the full solver performance rather than narrowing the problem into small kernels (e.g., SpMM, SpMV). Our LOPBCG GPU implementation achieves a 2.8$${\times }$$–4.3$${\times }$$ speedup over an optimized CPU implementation when tested with four different input matrices. The evaluated configuration compared one Skylake CPU to one Skylake CPU and one NVIDIA V100 GPU. Our OpenMP and OpenACC LOBPCG GPU implementations gave nearly identical performance. We also consider how to create an efficient LOBPCG solver that can solve problems larger than GPU memory capacity. To this end, we create microbenchmarks representing the two dominant kernels (inner product and SpMM kernel) in LOBPCG and then evaluate performance when using two different programming approaches: tiling the kernels, and using Unified Memory with the original kernels. Our tiled SpMM implementation achieves a 2.9$${\times }$$ and 48.2$${\times }$$ speedup over the Unified Memory implementation on supercomputers with PCIe Gen3 and NVLink 2.0 CPU to GPU interconnects, respectively

On right conjugacy closed loops of twice prime order

The right conjugacy closed loops of order 2p, where p is an odd prime, are classified up to isomorphism.Comment: Clarified definitions, added some remarks and a tabl