Looking into DNA breathing dynamics via quantum physics

We study generic aspects of bubble dynamics in DNA under time dependent perturbations, for example temperature change, by mapping the associated Fokker-Planck equation to a quantum time-dependent Schroedinger equation with imaginary time. In the static case we show that the eigenequation is exactly the same as that of the $\beta$-deformed nuclear liquid drop model, without the issue of non-integer angular momentum. A universal breathing dynamics is demonstrated by using an approximate method in quantum mechanics. The calculated bubble autocorrelation function qualitatively agrees with experimental data. Under time dependent modulations, utilizing the adiabatic approximation, bubble properties reveal memory effects.Comment: 5 pages, 1 figur

Operational solar forecasting for the real-time market

Despite the significant progress made in solar forecasting over the last decade, most of the proposed models cannot be readily used by independent system operators (ISOs). This article proposes an operational solar forecasting algorithm that is closely aligned with the real-time market (RTM) forecasting requirements of the California ISO (CAISO). The algorithm first uses the North American Mesoscale (NAM) forecast system to generate hourly forecasts for a 5-h period that are issued 12 h before the actual operating hour, satisfying the lead-time requirement. Subsequently, the world's fastest similarity search algorithm is adopted to downscale the hourly forecasts generated by NAM to a 15-min resolution, satisfying the forecast-resolution requirement. The 5-h-ahead forecasts are repeated every hour, following the actual rolling update rate of CAISO. Both deterministic and probabilistic forecasts generated using the proposed algorithm are empirically evaluated over a period of 2 years at 7 locations in 5 climate zones

An ALMA Dynamical Mass Estimate of the Proposed Planetary-mass Companion FW Tau C

Dynamical mass estimates down to the planet-mass regime can help to understand planet formation. We present Atacama Large Millimeter/submillimeter Array (ALMA) 1.3 mm observations of FW Tau C, a proposed ~10 $M_{\rm Jup}$ planet-mass companion at ~330 au from the host binary FW Tau AB. We spatially and spectrally resolve the accretion disk of FW Tau C in ${}^{12}$CO (2-1). By modeling the Keplerian rotation of gas, we derive a dynamical mass of ~0.1 $M_\odot$. Therefore, FW Tau C is unlikely a planet, but rather a low-mass star with a highly inclined disk. This also suggests that FW Tau is a triple system consisting of three ~0.1 $M_\odot$ stars.Comment: Accepted for publication in ApJ

Orbital ordering in the ferromagnetic insulator Cs2_2AgF4_4 from first principles

We found, using density-functional theory calculations within the generalized gradient approximation, that Cs$_2$AgF$_4$ is stabilized in the insulating orthorhombic phase rather than in the metallic tetragonal phase. The lattice distortion present in the orthorhombic phase corresponds to the $x^2-z^2$/$y^2-z^2$ hole-orbital ordering of the Ag$^{2+}$ $4d^9$ ions, and this orbital ordering leads to the observed ferromagnetism, as confirmed by the present total-energy calculations. This picture holds in the presence of moderate 4d-electron correlation. The results are compared with the picture of ferromagnetism based on the metallic tetragonal phase.Comment: 5 pages, 4 figures, 1 table; a few energy/moment entries in Table I are corrected due to a proper treatment of the Ag 4s semicore stat

Comment on "Quantitative Condition is Necessary in Guaranteeing the Validity of the Adiabatic Approximation" [arXiv:1004.3100]

Recently, the authors of Ref.1[arXiv:1004.3100] claimed that they have proven the traditional adiabatic condition is a necessary condition. Here, it is claimed that there are some mistakes and an artificial over-strong constraint in [1], making its result inconvincible.Comment: 1 pag

Layout-driven allocation for high level synthesis

We propose a hypergraph model and a new algorithm for hardware allocation. The use of a hypergraph model facilitates the identification of sharable resources and the calculation of interconnect costs. Using the hyper graph model, the algorithm performs interconnect optimization by taking into account interdependent relationships between three allocation subtasks: register, operation, and interconnect allocations simultaneously. Previous algorithms considered these three tasks serially. Another novel contribution of our algorithm is the exploration of design space by trading off storage units and interconnects. We also demonstrate that traditional cost functions using the number of registers and the number of mux-inputs can not guarantee the minimal area. To rectify the problem, we introduce a new layout area cost function and compare it to the traditional cost functions. Our experiments show that our algorithm is superior to previously published algorithms under traditional cost functions