Vibrations of a magnet levitated over a flat superconductor

Based on a dipole-dipole interaction model, we discuss the levitation force and related vibration problems to understand the effects of flux pinning in type-II superconductors, and the applications of levitation in superconducting systems.     

The effect of oxygen ordering through controlled exposure to oxygen on the superconductive properties of LaBa2Cu3Oy

In an effort to clarify the role of controlled oxygen exposure in the synthesis of LaBa₂Cu₃O_y samples which achieve zero resistivity above 90 K, we have prepared samples of La(_1+x)Ba(_2–x)Cu₃O_y with x approximately equal to 0 and with y varying between 6.22 and 7.00. We find that for large values of y, 6.88相似文献   

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.     

Rotational spectra of isotopic species of SO2F2: experimental and ab initio structures

The rotational spectra of ³⁴SO₂F₂ and S¹⁸O¹⁶OF₂ have been measured in their ground vibrational state between 9 and 110 GHz. Accurate rotational constants have been derived. Various experimental structures including the average structure have been determined. The ab initio structure has been calculated at the CCSD(T) level of theory. The different structures are compared and the best equilibrium structure is the ab initio structure: r_e(SO)=1.401 (3) Å, r_e(SF)=1.532 (3) Å, ∠_e(OSO)=124.91(20)°, ∠_e(FSF)=95.53 (20)°.     

Low Cost, High Efficiency, Gain Flattened L Band EDFA Using FBGs as C Band Seed Generators

A low cost, coolerless 980nm diode pumped, gain flattened L band EDFA with fast transient control, high pump efficiency and gain clamping effect was realized by using FBGs as C band seed generators.     

Chemisorption at interfaces between organic semiconductors and metals: role of the electron affinity

Chemisorption is a well-known phenomenon for many interfaces between organic semiconductors and metals. It is shown that many published data indicate that the occurrence of chemisorption can be rationalized upon the consideration of the metal work function versus the electron affinity of the organic semiconductor.     

Pattern formation on a nonlinear periodic electrical network

It is observed experimentally that a periodic array of resistively coupled LC-oscillators with ans-shaped nonlinearity exhibits stable non-uniform voltage and current distributions. The dependence of the resulting structure on the coupling resistance and the boundary conditions is investigated. The structure is rather insensitive to variations of the boundary values. The experiments are well described by a two-variable reaction-diffusion equation.     

Inhomogeneous Voter Models in One Dimension

We establish conditions for survival and extinction of types of one-dimensional voter models, and show that increasing the flip rates at a finite number of sites typically does not affect survival, unless the flipping mechanism is altered. We provide an example of a modified voter model that does not survive but can be made to survive simply by altering the flip mechanism at one site. We also show that a rather general class of such models have clustering behavior.     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.