Local Spin Susceptibility of the S=1/2 Kagome Lattice in ZnCu3(OD)6Cl2

We report single-crystal 2-D NMR investigation of the nearly ideal spin S=1/2 kagome lattice ZnCu3(OD)6Cl2. We successfully identify 2-D NMR signals originating from the nearest-neighbors of Cu2+ defects occupying Zn sites. From the 2-D Knight shift measurements, we demonstrate that weakly interacting Cu2+ spins at these defects cause the large Curie-Weiss enhancement toward T=0 commonly observed in the bulk susceptibility data. We estimate the intrinsic spin susceptibility of the kagome planes by subtracting defect contributions, and explore several scenarios.Comment: 4 figures; published in PR-B Rapid Communication

Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems

We introduce a new problem that combines the well known All Pairs Shortest Paths (APSP) problem and the All Pairs Bottleneck Paths (APBP) problem to compute the shortest paths for all pairs of vertices for all possible flow amounts. We call this new problem the All Pairs Shortest Paths for All Flows (APSP-AF) problem. We firstly solve the APSP-AF problem on directed graphs with unit edge costs and real edge capacities in $\tilde{O}(\sqrt{t}n^{(\omega+9)/4}) = \tilde{O}(\sqrt{t}n^{2.843})$ time, where $n$ is the number of vertices, $t$ is the number of distinct edge capacities (flow amounts) and $O(n^{\omega}) < O(n^{2.373})$ is the time taken to multiply two $n$-by-$n$ matrices over a ring. Secondly we extend the problem to graphs with positive integer edge costs and present an algorithm with $\tilde{O}(\sqrt{t}c^{(\omega+5)/4}n^{(\omega+9)/4}) = \tilde{O}(\sqrt{t}c^{1.843}n^{2.843})$ worst case time complexity, where $c$ is the upper bound on edge costs

Prediction of vertical bearing capacity of waveform micropile

This study proposes a predictive equation for bearing capacity considering the behaviour characteristics of a waveform micropile that can enhance the bearing capacity of a conventional micropile. The bearing capacity of the waveform micropile was analysed by a three-dimensional numerical model with soil and pile conditions obtained from the field and centrifuge tests. The load-transfer mechanism of the waveform micropile was revealed by the numerical analyses, and a new predictive equation for the bearing capacity was proposed. The bearing capacities of the waveform micropile calculated by the new equation were comparable with those measured from the field and centrifuge tests. This validated a prediction potential of the new equation for bearing capacity of waveform micropiles

A bi-level model of dynamic traffic signal control with continuum approximation

This paper proposes a bi-level model for traffic network signal control, which is formulated as a dynamic Stackelberg game and solved as a mathematical program with equilibrium constraints (MPEC). The lower-level problem is a dynamic user equilibrium (DUE) with embedded dynamic network loading (DNL) sub-problem based on the LWR model (Lighthill and Whitham, 1955; Richards, 1956). The upper-level decision variables are (time-varying) signal green splits with the objective of minimizing network-wide travel cost. Unlike most existing literature which mainly use an on-and-off (binary) representation of the signal controls, we employ a continuum signal model recently proposed and analyzed in Han et al. (2014), which aims at describing and predicting the aggregate behavior that exists at signalized intersections without relying on distinct signal phases. Advantages of this continuum signal model include fewer integer variables, less restrictive constraints on the time steps, and higher decision resolution. It simplifies the modeling representation of large-scale urban traffic networks with the benefit of improved computational efficiency in simulation or optimization. We present, for the LWR-based DNL model that explicitly captures vehicle spillback, an in-depth study on the implementation of the continuum signal model, as its approximation accuracy depends on a number of factors and may deteriorate greatly under certain conditions. The proposed MPEC is solved on two test networks with three metaheuristic methods. Parallel computing is employed to significantly accelerate the solution procedure

Augmenting bug localization with part-of-speech and invocation

Bug localization represents one of the most expensive, as well as time-consuming, activities during software maintenance and evolution. To alleviate the workload of developers, numerous methods have been proposed to automate this process and narrow down the scope of reviewing buggy files. In this paper, we present a novel buggy source-file localization approach, using the information from both the bug reports and the source files. We leverage the part-of-speech features of bug reports and the invocation relationship among source files. We also integrate an adaptive technique to further optimize the performance of the approach. The adaptive technique discriminates Top 1 and Top N recommendations for a given bug report and consists of two modules. One module is to maximize the accuracy of the first recommended file, and the other one aims at improving the accuracy of the fixed defect file list. We evaluate our approach on six large-scale open source projects, i.e. ASpectJ, Eclipse, SWT, Zxing, Birt and Tomcat. Compared to the previous work, empirical results show that our approach can improve the overall prediction performance in all of these cases. Particularly, in terms of the Top 1 recommendation accuracy, our approach achieves an enhancement from 22.73% to 39.86% for ASpectJ, from 24.36% to 30.76% for Eclipse, from 31.63% to 46.94% for SWT, from 40% to 55% for ZXing, from 7.97% to 21.99% for Birt, and from 33.37% to 38.90% for Tomcat

Ferrimagnetic spin-1/2 chain of alternating Ising and Heisenberg spins in arbitrarily oriented magnetic field

The ferrimagnetic spin-1/2 chain composed of alternating Ising and Heisenberg spins in an arbitrarily oriented magnetic field is exactly solved using the spin-rotation transformation and the transfer-matrix method. It is shown that the low-temperature magnetization process depends basically on a spatial orientation of the magnetic field. A sharp stepwise magnetization curve with a marked intermediate plateau, which emerges for the magnetic field applied along the easy-axis direction of the Ising spins, becomes smoother and the intermediate plateau shrinks if the external field is tilted from the easy-axis direction. The magnetization curve of a polycrystalline system is also calculated by performing powder averaging of the derived magnetization formula. The proposed spin-chain model brings an insight into high-field magnetization data of 3d-4f bimetallic polymeric compound Dy(NO_3)(DMSO)_2Cu(opba)(DMSO)_2, which provides an interesting experimental realization of the ferrimagnetic chain composed of two different but regularly alternating spin-1/2 magnetic ions Dy^{3+} and Cu^{2+} that are reasonably approximated by the notion of Ising and Heisenberg spins, respectively.Comment: 11 pages, 6 figure