全文获取类型
收费全文 | 315篇 |
免费 | 5篇 |
国内免费 | 11篇 |
专业分类
化学 | 65篇 |
力学 | 6篇 |
数学 | 138篇 |
物理学 | 95篇 |
无线电 | 27篇 |
出版年
2022年 | 1篇 |
2021年 | 4篇 |
2020年 | 2篇 |
2019年 | 5篇 |
2018年 | 6篇 |
2017年 | 4篇 |
2016年 | 11篇 |
2015年 | 8篇 |
2014年 | 9篇 |
2013年 | 12篇 |
2012年 | 22篇 |
2011年 | 19篇 |
2010年 | 18篇 |
2009年 | 11篇 |
2008年 | 23篇 |
2007年 | 14篇 |
2006年 | 11篇 |
2005年 | 19篇 |
2004年 | 12篇 |
2003年 | 12篇 |
2002年 | 7篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 5篇 |
1996年 | 17篇 |
1995年 | 1篇 |
1994年 | 5篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 7篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1983年 | 5篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 3篇 |
1971年 | 1篇 |
1970年 | 3篇 |
排序方式: 共有331条查询结果,搜索用时 875 毫秒
41.
Suppose that we are given a function f : (0, 1)→(0,1) and, for some unknown p∈(0, 1), a sequence of independent tosses of a p-coin (i.e., a coin with probability p of “heads”). For which functions f is it possible to simulate an f(p)-coin? This question was raised by S. Asmussen and J. Propp. A simple simulation scheme for the constant function f(p)≡1/2 was described by von Neumann (1951); this scheme can be easily implemented using a finite automaton. We prove that in
general, an f(p)-coin can be simulated by a finite automaton for all p ∈ (0, 1), if and only if f is a rational function over ℚ. We also show that if an f(p)-coin can be simulated by a pushdown automaton, then f is an algebraic function over ℚ; however, pushdown automata can simulate f(p)-coins for certain nonrational functions such as
. These results complement the work of Keane and O’Brien (1994), who determined the functions f for which an f(p)-coin can be simulated when there are no computational restrictions on the simulation scheme.
* Supported by a Miller Fellowship.
† Supported in part by NSF Grant DMS-0104073 and by a Miller Professorship.
‡ This work is supported under a National Science Foundation Graduate Research Fellowship. 相似文献
42.
Transport through quantum dots in the Kondo regime obeys an effective low-temperature theory in terms of weakly interacting quasiparticles. Despite the weakness of the interaction, we find that the backscattering current and hence the shot noise are dominated by two-quasiparticle scattering. We show that the simultaneous presence of one- and two-quasiparticle scattering results in a universal average charge 5/3e as measured by shot-noise experiments. An experimental verification of our prediction would constitute a most stringent test of the low-energy theory of the Kondo effect. 相似文献
43.
We study the interplay of charge and spin (zero-mode) channels in quantum dots. The latter affects the former in the form of a distinct signature on the differential conductance. We also obtain both longitudinal and transverse spin susceptibilities. All these observables, underlain by spin fluctuations, become accentuated as one approaches the Stoner instability. The nonperturbative effects of zero-mode interaction are described in terms of the propagation of gauge bosons associated with charge [U(1)] and spin [SU(2)] fluctuations in the dot, while transverse spin fluctuations are analyzed perturbatively. 相似文献
44.
Ebenstein Y Yoskovitz E Costi R Aharoni A Banin U 《The journal of physical chemistry. A》2006,110(27):8297-8303
We investigate the modification of photoluminescence (PL) from single semiconductor nanocrystal quantum dots (NCs) in the proximity of metal and semiconducting atomic force microscope (AFM) tips. The presence of the tip alters the radiative decay rate of an emitter via interference and opens efficient nonradiative decay channels via energy transfer to the tip material. These effects cause quenching (or enhancement) of the emitter's PL intensity as a function of its distance from the interacting tip. We take advantage of this highly distance-dependent effect to realize a contrast mechanism for high-resolution optical imaging. AFM tips are optimized as energy acceptors by chemical functionalization with InAs NCs to achieve optical resolution down to 30 nm. The presented experimental scheme offers high-resolution optical information while maintaining the benefits of traditional AFM imaging. We directly measure the PL intensity of single NCs as a function of the tip distance. Our results are in good agreement with calculations made by a classical theoretical model describing an oscillating dipole interacting with a planar mirror. 相似文献
45.
Randomized algorithms provide solutions to two ubiquitous problems: (1) the distributed calculation of a principal component analysis or singular value decomposition of a highly rectangular matrix, and (2) the distributed calculation of a low-rank approximation (in the form of a singular value decomposition) to an arbitrary matrix. Carefully honed algorithms yield results that are uniformly superior to those of the stock, deterministic implementations in Spark (the popular platform for distributed computation); in particular, whereas the stock software will without warning return left singular vectors that are far from numerically orthonormal, a significantly burnished randomized implementation generates left singular vectors that are numerically orthonormal to nearly the machine precision. 相似文献
46.
Yuval Peres Gábor Pete Stephanie Somersille 《Calculus of Variations and Partial Differential Equations》2010,38(3-4):541-564
We prove that if ${U\subset \mathbb {R}^n}$ is an open domain whose closure ${\overline U}$ is compact in the path metric, and F is a Lipschitz function on ?U, then for each ${\beta \in \mathbb {R}}$ there exists a unique viscosity solution to the β-biased infinity Laplacian equation $$\beta |\nabla u| + \Delta_\infty u=0$$ on U that extends F, where ${\Delta_\infty u= |\nabla u|^{-2} \sum_{i,j} u_{x_i}u_{x_ix_j} u_{x_j}}$ . In the proof, we extend the tug-of-war ideas of Peres, Schramm, Sheffield and Wilson, and define the β-biased ${\epsilon}$ -game as follows. The starting position is ${x_0 \in U}$ . At the kth step the two players toss a suitably biased coin (in our key example, player I wins with odds of ${\exp(\beta\epsilon)}$ to 1), and the winner chooses x k with ${d(x_k,x_{k-1}) < \epsilon}$ . The game ends when ${x_k \in \partial U}$ , and player II pays the amount F(x k ) to player I. We prove that the value ${u^{\epsilon}(x_0)}$ of this game exists, and that ${\|u^\epsilon - u\|_\infty \to 0}$ as ${\epsilon \to 0}$ , where u is the unique extension of F to ${\overline{U}}$ that satisfies comparison with β-exponential cones. Comparison with exponential cones is a notion that we introduce here, and generalizing a theorem of Crandall, Evans and Gariepy regarding comparison with linear cones, we show that a continuous function satisfies comparison with β-exponential cones if and only if it is a viscosity solution to the β-biased infinity Laplacian equation. 相似文献
47.
While flavor symmetries are useful for studying hadronic B decays, symmetry relations for amplitudes and decay rates are usually violated by first order symmetry breaking corrections. We point out two cases in which first order symmetry breaking is suppressed by a small ratio of amplitudes: (1) An isospin sum rule for four B→Kπ decays, where isospin breaking is shown to be negligible. (2) An SU(3) sum rule for pairs of B→Kπ and B→Kη8, generalized to pairs of B→Kπ, B→Kη and B→Kη′. 相似文献
48.
Yuval Peres Alistair Sinclair Perla Sousi Alexandre Stauffer 《Probability Theory and Related Fields》2013,156(1-2):273-305
We consider the following dynamic Boolean model introduced by van den Berg et al. (Stoch. Process. Appl. 69:247–257, 1997). At time 0, let the nodes of the graph be a Poisson point process in ${\mathbb{R}^d}$ with constant intensity and let each node move independently according to Brownian motion. At any time t, we put an edge between every pair of nodes whose distance is at most r. We study three fundamental problems in this model: detection (the time until a target point—fixed or moving—is within distance r of some node of the graph); coverage (the time until all points inside a finite box are detected by the graph); and percolation (the time until a given node belongs to the infinite connected component of the graph). We obtain precise asymptotics for these quantities by combining ideas from stochastic geometry, coupling and multi-scale analysis. 相似文献
49.
We propose a protocol for a controlled experiment to measure a weak value of the electron's spin in a solid state device. The weak value is obtained by a two step procedure--weak measurement followed by a strong one (postselection), where the outcome of the first measurement is kept provided a second postselected outcome occurs. The setup consists of a double quantum dot and a weakly coupled quantum point contact to be used as a detector. Anomalously large values of the spin of a two electron system are predicted, as well as negative values of the total spin. We also show how to incorporate the adverse effect of decoherence into this procedure. 相似文献
50.
Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that in a digraph without parallel edges, the number of pairs of vertices having a common in-neighbor or a common out-neighbor is at least the number of edges. We deduce that for any simple group-grading, the dimension of the trivial component is maximal. 相似文献