نتایج جستجو برای: physical bound
تعداد نتایج: 836792 فیلتر نتایج به سال:
We obtain an analytical bound on the efficiency of wireless power transfer to a weakly coupled device. The optimal source is solved for a multilayer geometry in terms of a representation based on the field equivalence principle. The theory reveals that optimal power transfer exploits the properties of the midfield to achieve efficiencies far greater than conventional coil-based designs. As a ph...
We report on the realization of a heavy "Bohr atom," through the spectroscopic observation of a Rydberg series of bound quantum states at principal quantum numbers n=140 to 230. The system is made heavy by replacing an electron inside a hydrogen atom by a composite H- particle, thus forming a H+H- Coulombically bound system obeying the physical laws of a generalized atom with appropriate mass s...
The resonances for the Dirichlet and Neumann Laplacian are studied on compactly perturbed waveguides. In the absence of resonances, an upper bound is proven for the localised resolvent. This is then used to prove that the existence of a quasimode whose asymptotics is bounded away from the thresholds implies the existence of resonances converging to the real axis. The following upper bound to th...
This paper explores and clarifies several issues surrounding Zeno machines and the issue of running a Turing machine for infinite time. Without a minimum hypothetical bound on physical conditions, any magical machine can be created, and therefore, a thesis on the bound is formulated. This paper then proves that the halting problem algorithm for every Turing-recognizable program and every input ...
We present a variational renormalization group approach using deep generative model composed of bijectors. The model can learn hierarchical transformations between physical variables and renormalized collective variables. It can directly generate statistically independent physical configurations by iterative refinement at various length scales. The generative model has an exact and tractable li...
in linguistics morphology, clitics are considered as a set of special units which cannot be categorized under free or bound morphemes, and therefore, seriously question the traditional view of dividing morphemes into the two groups of free and bound morphemes. clitics represent some characteristics of words and simultaneously, possess some important properties of the bound morphemes as well. th...
In this paper, minimizing the number of tardy jobs in two-machine flowshop scheduling with non-simultaneous job entrance is discussed. It is proven that the complexity of the problem is NP_hard. Therefore, a heuristic algorithm is proposed to solve the large scale problems. Besides, an exact branch and bound algorithm with utilizing heuristic algorithm as upper bound proposed to achieve optimal...
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
We elucidate the physical basis for the upper bound on high energy neutrino fluxes implied by the observed cosmic ray flux. We stress that the bound is valid for neutrinos produced either by p ,g reactions or by p 2p(n) reactions in sources which are optically thin for high energy protons to photo-meson and nucleonmeson interactions. We show that the upper bound is robust and conservative. The ...
Cooperativity plays an important role in the action of proteins bound to DNA. A simple, mechanical mechanism for cooperativity, in the form of a tension-mediated interaction between proteins bound to DNA at two different locations, is proposed. These proteins are not in direct physical contact. DNA segments intercalating bound proteins are modeled as a Worm-Like Chain, which is free to deform i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید