首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1329篇
  免费   52篇
  国内免费   26篇
化学   730篇
晶体学   20篇
力学   23篇
数学   359篇
物理学   275篇
  2023年   5篇
  2022年   15篇
  2021年   20篇
  2020年   24篇
  2019年   25篇
  2018年   11篇
  2017年   17篇
  2016年   33篇
  2015年   32篇
  2014年   32篇
  2013年   72篇
  2012年   85篇
  2011年   69篇
  2010年   50篇
  2009年   45篇
  2008年   73篇
  2007年   84篇
  2006年   92篇
  2005年   84篇
  2004年   74篇
  2003年   53篇
  2002年   65篇
  2001年   14篇
  2000年   31篇
  1999年   19篇
  1998年   23篇
  1997年   16篇
  1996年   19篇
  1995年   13篇
  1994年   24篇
  1993年   20篇
  1992年   18篇
  1991年   13篇
  1990年   14篇
  1989年   13篇
  1987年   5篇
  1986年   8篇
  1985年   11篇
  1984年   5篇
  1983年   7篇
  1982年   8篇
  1981年   7篇
  1980年   14篇
  1979年   3篇
  1978年   9篇
  1977年   5篇
  1976年   4篇
  1975年   6篇
  1973年   7篇
  1972年   3篇
排序方式: 共有1407条查询结果,搜索用时 15 毫秒
921.
922.
923.
High-quality InGaAs/AlGaAs laser diode bars emitting at 940 nm have been fabricated by low-pressure metal-organic chemical vapor deposition (LP-MOCVD). Two hundred and ten Watts maximum continuous-wave output power and a maximum power conversion efficiency of 60% at an output power of 72 W have been demonstrated for a single 1-cm-wide laser bar. These bars exhibit a very good beam quality of 5.7°×27.2° (full-width at half-maximum). Reliability test have been carried out for over 2000 h at 58 W at room temperature. Under these conditions, the extrapolated lifetime is 100,000 h, which suggests that AlGaAs-based lasers of proper designs could have similar long-term reliability as their Al-free counterpart.  相似文献   
924.
SDML: A Multi-Agent Language for Organizational Modelling   总被引:1,自引:0,他引:1  
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of its functionality. The language is SDML, a strictly declarative modelling language which has object-oriented features and corresponds to a fragment of strongly grounded autoepistemic logic. The virtues of SDML include the ease of building complex models and the facility for representing agents flexibly as models of cognition as well as modularity and code reusability. Two representations of cognitive agents within organizational structures are reported and a Soar-to-SDML compiler is described. One of the agent representations is a declarative implementation of a Soar agent taken from the Radar-Soar model of Ye and Carley (1995). The Ye-Carley results are replicated but the declarative SDML implementation is shown to be much less computationally expensive than the more procedural Soar implementation. As a result, it appears that SDML supports more elaborate representations of agent cognition together with more detailed articulation of organizational structure than we have seen in computational organization theory. Moreover, by representing Soar-cognitive agents declaratively within SDML, that implementation of the Ye-Carley specification is necessarily consistent and sound with respect to the formal logic to which SDML corresponds.  相似文献   
925.
926.
Inelastic scattering of α-particles can excite the isovector giant dipole resonance (GDR) via the Coulomb interaction. In spite of their isoscalar nature α-particles can also excite the GDR via the nuclear interaction due to the difference in the radii of the neutron and proton density distributions. The absolute cross section to excite the GDR in inelastic α-scattering is therefore a measure of this radial difference, the so-called neutron-skin thickness. Furthermore, since the GDR strength distribution has a centroid energy which depends on the nuclear radius, these studies, when performed in deformed nuclei, can measure the neutron-skin thickness along both the short and the long axes independently. Results of an experiment performed at KVI atE α=120 MeV and small scattering angles, including 0°, to determine the neutron-skin thickness in208Pb,116Sn,124Sn, and the deformed150Nd are discussed and compared to earlier measurements and theoretical predictions. Future improvements in the experimental set-up are also discussed.  相似文献   
927.
928.
The first high-statistics measurement of dilepton and double-photon yields in proton—proton scattering below the pion threshold has been performed. The data obtained allow a detailed study of off-shell effects in the proton—proton interaction.  相似文献   
929.
We analyze the shock formation process for the 3D nonisentropic Euler equations with the ideal gas law, in which sound waves interact with entropy waves to produce vorticity. Building on our theory for isentropic flows in [3, 4], we give a constructive proof of shock formation from smooth initial data. Specifically, we prove that there exist smooth solutions to the nonisentropic Euler equations which form a generic stable shock with explicitly computable blowup time, location, and direction. This is achieved by establishing the asymptotic stability of a generic shock profile in modulated self-similar variables, controlling the interaction of wave families via: (i) pointwise bounds along Lagrangian trajectories, (ii) geometric vorticity structure, and (iii) high-order energy estimates in Sobolev spaces. © 2022 Wiley Periodicals LLC.  相似文献   
930.
Given a permutation , construct a graph G π on the vertex set {1, 2,..., n} by joining i to j if (i) i < j and π(i) < π(j) and (ii) there is no k such that i < k < j and π(i) < π(k) < π(j). We say that π is forest-like if G π is a forest. We first characterize forest-like permutations in terms of pattern avoidance, and then by a certain linear map being onto. Thanks to recent results of Woo and Yong, these show that forest-like permutations characterize Schubert varieties which are locally factorial. Thus forest-like permutations generalize smooth permutations (corresponding to smooth Schubert varieties). We compute the generating function of forest-like permutations. As in the smooth case, it turns out to be algebraic. We then adapt our method to count permutations for which G π is a tree, or a path, and recover the known generating function of smooth permutations. Received March 27, 2006  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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