Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Abstract With the motivation to study how non-magnetic ion site disorder affects the quantum magnetism of Ba 3 CoSb 2 O 9 , a spin-1/2 equilateral triangular lattice antiferromagnet, we performed DC and AC susceptibility, specific heat, elastic and inelastic neutron scattering measurements on single crystalline samples of Ba 2.87 Sr 0.13 CoSb 2 O 9 with Sr doping on non-magnetic Ba 2+ ion sites. The results show that Ba 2.87 Sr 0.13 CoSb 2 O 9 exhibits (i) a two-step magnetic transition at 2.7 K and 3.3 K, respectively; (ii) a possible canted 120 degree spin structure at zero field withmore »Free, publicly-accessible full text available March 10, 2023
-
In an optimal design problem, we are given a set of linear experiments v1,…,vn∈Rd and k≥d, and our goal is to select a set or a multiset S⊆[n] of size k such that Φ((∑i∈Sviv⊤i)−1) is minimized. When Φ(M)=Determinant(M)1/d, the problem is known as the D-optimal design problem, and when Φ(M)=Trace(M), it is known as the A-optimal design problem. One of the most common heuristics used in practice to solve these problems is the local search heuristic, also known as the Fedorov’s exchange method (Fedorov, 1972). This is due to its simplicity and its empirical performance (Cook and Nachtrheim, 1980; Millermore »
-
In an optimal design problem, we are given a set of linear experiments v1,…,vn∈Rd and k≥d, and our goal is to select a set or a multiset S⊆[n] of size k such that Φ((∑i∈Sviv⊤i)−1) is minimized. When Φ(M)=Determinant(M)1/d, the problem is known as the D-optimal design problem, and when Φ(M)=Trace(M), it is known as the A-optimal design problem. One of the most common heuristics used in practice to solve these problems is the local search heuristic, also known as the Fedorov’s exchange method (Fedorov, 1972). This is due to its simplicity and its empirical performance (Cook and Nachtrheim, 1980; Millermore »
-
Free, publicly-accessible full text available December 1, 2022
-
Free, publicly-accessible full text available September 1, 2022
-
Free, publicly-accessible full text available March 1, 2023
-
Free, publicly-accessible full text available August 1, 2022
-
Free, publicly-accessible full text available August 1, 2022
-
Free, publicly-accessible full text available July 1, 2022
-
Free, publicly-accessible full text available January 1, 2023