نتایج جستجو برای: consistent algorithm
تعداد نتایج: 1052416 فیلتر نتایج به سال:
An MCHF atomic-structure package is presented based on dynamic memory allocation, sparse matrix methods, and a recently developed angular library. It is meant for large-scale calculations in a basis of orthogonal orbitals for groups of LS terms of arbitrary parity. For Breit-Pauli calculations, all operators – spin-orbit, spin-other orbit, spin-spin, and orbit-orbit – may be included. For trans...
III. Homonuclear Diatomics: Second-Row Elements 14 A. The diatomic boron molecule 16 1. Σg state 16 2. Σg state 19 B. The diatomic oxygen and carbon molecules in their lowest states 20 1. O2 20 2. Reflection symmetry 21 3. Electron repulsion 23 4. MCSCF calculations for O2 24 5. The C2 molecule 25 C. Spectroscopic notation for diatomic molecules 28 D. States of other homonuclear diatomic molecu...
The synthesis of write-ahead logging has developed redundancy, and current trends suggest that the investigation of the Ethernet will soon emerge. Given the current status of clientserver models, cyberneticists predictably desire the construction of systems, which embodies the confirmed principles of theory [114, 114, 188, 62, 70, 62, 179, 68, 95, 68, 54, 152, 191, 114, 59, 168, 148, 54, 99, 58...
An introduction is given to an algebraic formulation and generalisation of the consistent histories approach to quantum theory. The main technical tool in this theory is an orthoalgebra of history propositions that serves as a generalised temporal analogue of the lattice of propositions of standard quantum logic. Particular emphasis is placed on those cases in which the history propositions can...
We elaborate on the distinction between geometric and dynamical phase in quantum theory and we show that the former is intrinsically linked to the quantum mechanical probabilistic structure. In particular, we examine the appearance of the Berry phase in the consistent histories scheme and establish that it is the basic building block of the decoherence functional. These results are consequences...
Enabling Efficient Dynamic Resizing of Large DRAM Caches via A Hardware Consistent Hashing Mechanism
Die-stacked DRAM has been proposed for use as a large, high-bandwidth, last-level cache with hundreds or thousands of megabytes of capacity. Not all workloads (or phases) can productively utilize this much cache space, however. Unfortunately, the unused (or under-used) cache continues to consume power due to leakage in the peripheral circuitry and periodic DRAM refresh. Dynamically adjusting th...
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
In designing structured P2P networks, scalability, resilience, and load balancing are features that are needed to be handled meticulously. The P2P overlay has to handle large scale of nodes while maintaining minimized path lengths in performing lookups. It has also to be resilient to nodes’ failure and be able to distribute the load uniformly over its participant. In this paper, we introduce SH...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید