首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3895篇
  免费   116篇
  国内免费   29篇
化学   2479篇
晶体学   46篇
力学   70篇
数学   698篇
物理学   747篇
  2023年   25篇
  2021年   33篇
  2020年   58篇
  2019年   43篇
  2018年   51篇
  2017年   43篇
  2016年   88篇
  2015年   83篇
  2014年   78篇
  2013年   239篇
  2012年   201篇
  2011年   186篇
  2010年   114篇
  2009年   116篇
  2008年   195篇
  2007年   230篇
  2006年   218篇
  2005年   158篇
  2004年   145篇
  2003年   121篇
  2002年   119篇
  2001年   77篇
  2000年   83篇
  1999年   64篇
  1998年   41篇
  1997年   52篇
  1996年   76篇
  1995年   55篇
  1994年   57篇
  1993年   58篇
  1992年   54篇
  1991年   39篇
  1990年   39篇
  1989年   32篇
  1988年   35篇
  1986年   24篇
  1985年   48篇
  1984年   37篇
  1983年   24篇
  1981年   22篇
  1980年   23篇
  1979年   30篇
  1978年   26篇
  1977年   36篇
  1976年   39篇
  1975年   37篇
  1974年   41篇
  1973年   54篇
  1972年   28篇
  1971年   23篇
排序方式: 共有4040条查询结果,搜索用时 468 毫秒
1.
Journal of Solid State Electrochemistry - A novel material was developed using sol-gel chemistry and an environmental-friendly grafting process of clay nanoparticles. In a previous work of our...  相似文献   
2.
3.
Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that, on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination, that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that, properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a modified mechanism for hallucinations is implausibly ad hoc.  相似文献   
4.
One of the most ignored, but urgent and vital challenges confronting society today is the vulnerability of urban areas to extreme events. Current organization of response systems, predominantly based on a command and control model, limits their effectiveness and efficiency. Particularly, in decision‐making processes where a large number of actors may be involved. In this article, a new distributed collaborative decision‐making model is proposed to overcome command and control limitations encountered in stressful, hostile, chaotic, and large‐scale settings. This model was derived by borrowing concepts from the collective decision making of honeybees foraging, a successful process in solving complex tasks within complex settings. The model introduced in this article was evaluated through differential equations, i.e., continuous analysis, and difference equations, i.e., discrete analysis. The most important result found is that the best available option in any large‐scale decision‐making problem can be configured as an attractor, in a distributed and timely manner. We suggest that the proposed model has the potential to facilitate decision‐making processes in large‐scale settings. © 2005 Wiley Periodicals, Inc. Complexity 11:28–38, 2005  相似文献   
5.
Variational conditions with smooth constraints: structure and analysis   总被引:2,自引:0,他引:2  
 This is an expository paper about the analysis of variational conditions over sets defined in finite-dimensional spaces by fairly smooth functions satisfying a constraint qualification. The primary focus is on results that can provide quantitative and computable sensitivity information for particular instances of the problems under study, and our objective is to give a personal view of the state of current knowledge in this area and of gaps in that knowledge that require future work. The writing style is informal, in keeping with the objective of focusing the reader's attention on the basic concepts and the relationships between them, rather than on details of the particular results themselves. Received: December 1, 2002 / Accepted: April 25, 2003 Published online: May 28, 2003 Key words. variational condition – variational inequality – complementarity – sensitivity – stability – nondegeneracy Mathematics Subject Classification (2000): Primary: 90C31. Secondary: 47J20, 49J40, 49J53, 90C33  相似文献   
6.
The local adsorption geometry of CO adsorbed in different states on Ni(1 0 0) and on Ni(1 0 0) precovered with atomic hydrogen has been determined by C 1s (and O 1s) scanned-energy mode photoelectron diffraction, using the photoelectron binding energy changes to characterise the different states. The results confirm previous spectroscopic assignments of local atop and bridge sites both with and without coadsorbed hydrogen. The measured Ni–C bondlengths for the Ni(1 0 0)/CO states show an increase of 0.16 ± 0.04 Å in going from atop to bridge sites, while comparison with similar results for Ni(1 1 1)/CO for threefold coordinated adsorption sites show a further lengthening of the bond by 0.05 ± 0.04 Å. These changes in the Ni–CO chemisorption bondlength with bond order (for approximately constant adsorption energy) are consistent with the standard Pauling rules. However, comparison of CO adsorbed in the atop geometry with and without coadsorbed hydrogen shows that the coadsorption increases the Ni–C bondlength by only 0.06 ± 0.04 Å, despite the decrease in adsorption energy of a factor of 2 or more. This result is also reproduced by density functional theory slab calculations. The results of both the experiments and the density functional theory calculations show that CO adsorption onto the Ni(1 0 0)/H surface is accompanied by significant structural modification; the low desorption energy may then be attributed to the energy cost of this restructuring rather than weak local bonding.  相似文献   
7.
Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let AV. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.  相似文献   
8.
9.
10.
In the past 6 years changes have occurred in GCE A-levels. Inparticular, there have been several major changes in A-levelMathematics courses. As engineering students are usually requiredto have studied A-level Mathematics, or its equivalent, thesechanges have had an effect on their prior mathematical knowledge.Moreover, engineering students traditionally obtained a goodgrounding in mechanics as part of their A-level Mathematicsqualification. However, mechanics, which was once included inthe core syllabus, is now optional. This article investigatesthe current availability and uptake of mechanics modules withinA-level Mathematics courses in schools. Comparisons are drawnbetween these results and results of a survey of schools in2004 and surveys of first year engineering students conductedin 2004 and 2005. It is found that there is a decline in theavailability of mechanics modules and the uptake of more thanone mechanics module has also decreased. The implications ofthese findings for engineering educators are discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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