首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   359篇
  免费   7篇
  国内免费   3篇
化学   106篇
晶体学   1篇
力学   14篇
数学   197篇
物理学   51篇
  2021年   3篇
  2018年   3篇
  2017年   8篇
  2016年   2篇
  2015年   5篇
  2014年   8篇
  2013年   12篇
  2012年   14篇
  2011年   23篇
  2010年   15篇
  2009年   13篇
  2008年   16篇
  2007年   11篇
  2006年   8篇
  2005年   6篇
  2004年   13篇
  2003年   18篇
  2002年   10篇
  2001年   3篇
  2000年   4篇
  1999年   9篇
  1998年   2篇
  1997年   7篇
  1996年   7篇
  1994年   4篇
  1993年   4篇
  1992年   2篇
  1991年   5篇
  1990年   2篇
  1989年   5篇
  1988年   3篇
  1987年   6篇
  1985年   13篇
  1984年   10篇
  1983年   8篇
  1982年   6篇
  1981年   13篇
  1980年   4篇
  1979年   6篇
  1978年   9篇
  1977年   8篇
  1976年   4篇
  1975年   4篇
  1974年   5篇
  1973年   5篇
  1972年   4篇
  1971年   3篇
  1970年   2篇
  1967年   3篇
  1965年   2篇
排序方式: 共有369条查询结果,搜索用时 31 毫秒
181.
Violation of Lorentz invariance (VLI) has been suggested as an explanation of the superluminal velocities of muon neutrinos reported by OPERA. In this Letter, we show that the amount of VLI required to explain this result poses severe difficulties with the kinematics of the pion decay, extending its lifetime and reducing the momentum carried away by the neutrinos. We show that the OPERA experiment limits α=(ν(ν)-c)/c<4×10(-6). We then take recourse to cosmic-ray data on the spectrum of muons and neutrinos generated in Earth's atmosphere to provide a stronger bound on VLI: (ν-c)/c<10(-12).  相似文献   
182.
We demonstrate that a quantum particle, initially prepared in a quantum well, can propagate through a reservoir with a continuous spectrum and reappear in a distant well without being registered in the reservoir. It is shown that such a passage through the reservoir takes place even if the latter is continuously monitored. We discuss a possible experimental realization of such a teleportation phenomenon in mesoscopic systems.  相似文献   
183.
In this paper we discuss the notion of singular vector tuples of a complex-valued \(d\) -mode tensor of dimension \(m_1\times \cdots \times m_d\) . We show that a generic tensor has a finite number of singular vector tuples, viewed as points in the corresponding Segre product. We give the formula for the number of singular vector tuples. We show similar results for tensors with partial symmetry. We give analogous results for the homogeneous pencil eigenvalue problem for cubic tensors, i.e., \(m_1=\cdots =m_d\) . We show the uniqueness of best approximations for almost all real tensors in the following cases: rank-one approximation; rank-one approximation for partially symmetric tensors (this approximation is also partially symmetric); rank- \((r_1,\ldots ,r_d)\) approximation for \(d\) -mode tensors.  相似文献   
184.
Quasi-Affinity in certain Classes of Operators   总被引:1,自引:0,他引:1  
The family of operators S + V (, C, Re > 0), where V isan injective S-Volterra operator (that is, [S, V[ = V2) and— AV–1 generates a uniformly bounded C0-semigroup,is studied in the context of similarity and of the weaker quasi-affinityrelation. It is shown that S is similar to S + V for all , C,Re > 1, and is a quasi-affine transform of S + tV for allt 0 and 0 < < 1.  相似文献   
185.
The “Volterra relation” is the commutation relation [S,V]⊂V 2, where S is a not necessarily bounded operator, V is a bounded operator leaving D(S) invariant, and [⋅,⋅] is the Lie product. When S,V are so related, and in addition iS generates a bounded C 0-group of operators and V has some general property, it is known that S+α V (α∈ℂ) is similar to S if and only if α=0 (cf. Theorem 11.17 in Kantorovitz, Spectral Theory of Banach Space Operators, Springer, Berlin, 1983). In particular, SV is not similar to S. However, it is shown in this note that (without any restriction on V and on the group S(⋅) generated by iS), the perturbations (SV)+P are similar to S for all P in the similarity sub-orbit {S(a)VS(−a);a∈ℝ} of V. When S is bounded, the above perturbations are similar to S for all P in the wider similarity sub-orbit {e aS Ve aS ;a∈ℂ}.  相似文献   
186.
We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We numerically analyze various ensembles of linear programming problems and obtain, for each of these ensembles, the probability distribution functions of certain quantities which measure the computational complexity, known as the convergence rate, the barrier and the computation time. We find that in the limit of very large problems these probability distributions are universal scaling functions. In other words, the probability distribution function for each of these three quantities becomes, in the limit of large problem size, a function of a single scaling variable, which is a certain composition of the quantity in question and the size of the system. Moreover, various ensembles studied seem to lead essentially to the same scaling functions, which depend only on the variance of the ensemble. These results extend analytical and numerical results obtained recently for the Gaussian ensemble, and support the conjecture that these scaling functions are universal.  相似文献   
187.
We propose a new class of R-parity violating extension of MSSM with type II seesaw mechanism for neutrino masses where an unstable gravitino is the dark matter of the Universe. It decays predominantly into three leptons final states, thereby providing a natural explanation of the positron excess but no antiproton excess in the PAMELA experiment. The model can explain neutrino masses without invoking any high scale physics while keeping the pre-existing baryon asymmetry of the universe in tact.  相似文献   
188.
189.
 One of the classical problems concerning the peg solitaire game is the feasibility issue. Tools used to show the infeasibility of various peg games include valid inequalities, known as pagoda-functions, and the so-called rule-of-three. Here we introduce and study another necessary condition: the solitaire lattice criterion. While the lattice criterion is shown to be equivalent to the rule-of-three for the classical English 33-board and French 37-board as well as for any m×n board, the lattice criterion is stronger than the rule-of-three for games played on more complex boards. In fact, for a wide family of boards presented in this paper, the lattice criterion exponentially outperforms the rule-of-three. Received: February 22, 1999?Final version received: June 19, 2000  相似文献   
190.
The fragmentation pathways of RDX in chemical ionization mass spectrometry have been rationalized, using data from different reagent gases, including CD4 and iso-C4D10. The dependence of spectra taken with different gases on the acid strength of the reactant ions in the gases is accounted for.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号