首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   92777篇
  免费   3133篇
  国内免费   3226篇
化学   35638篇
晶体学   1028篇
力学   7560篇
综合类   272篇
数学   33560篇
物理学   21078篇
  2023年   190篇
  2022年   371篇
  2021年   449篇
  2020年   522篇
  2019年   599篇
  2018年   10819篇
  2017年   10667篇
  2016年   6776篇
  2015年   1628篇
  2014年   1205篇
  2013年   1484篇
  2012年   5116篇
  2011年   11816篇
  2010年   6766篇
  2009年   7151篇
  2008年   7821篇
  2007年   9925篇
  2006年   1366篇
  2005年   2194篇
  2004年   2272篇
  2003年   2621篇
  2002年   1652篇
  2001年   769篇
  2000年   687篇
  1999年   452篇
  1998年   412篇
  1997年   302篇
  1996年   366篇
  1995年   238篇
  1994年   187篇
  1993年   187篇
  1992年   150篇
  1991年   137篇
  1990年   121篇
  1989年   108篇
  1988年   96篇
  1987年   90篇
  1986年   88篇
  1985年   68篇
  1984年   53篇
  1983年   51篇
  1982年   47篇
  1981年   40篇
  1980年   48篇
  1979年   45篇
  1914年   45篇
  1913年   40篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
181.
The Nambu-bracket quantization of the hydrogen atom is worked out as an illustration of the general method. The dynamics of topological open branes is controlled classically by Nambu brackets. Such branes then may be quantized through the consistent quantization of the underlying Nambu brackets: properly defined, the quantum Nambu-brackets comprise an associative structure, although the naive derivation property is mooted through operator entwinement. For superintegrable systems, such as the hydrogen atom, the results coincide with those furnished by Hamiltonian quantization - but the method is not limited to Hamiltonian systems.  相似文献   
182.
§ 1 IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th…  相似文献   
183.
In this paper a tripartite qualitative design combining abservation, stimulated recall and interview is presented and discussed. This three-step-design makes it possible to get insight into the interaction of internal and external processes when solving mathematical tasks. The data analysis depends on the research question and the methodological approach. In the light of two research projects in mathematics education two different methods of data analysis are presented and methodologically reflected.  相似文献   
184.
185.
 We prove that for any simple theory which is constructed via Fr?issé-Hrushovski method, if the forking independence is the same as the d-independence then the stable forking property holds. Received: 22 January 2001 / Published online: 19 December 2002 This article is part of the author's D-Phil thesis, written at the University of Oxford and supported by the Ministry of Higher Education of Iran. The author would like to thank the Institute for Studies in Theoretical Physics and Mathematics (IPM), Tehran, Iran, for its financial support whilst working on this article. Mathematics Subject Classification (2000): 03C45 Key words or phrases: Generic structures – Fr?issé-Hrushovski method – Predimension – Simple theories – Stable theories – Stable forking conjecture  相似文献   
186.
The classical economic order quantity (EOQ) model assumes that items produced are of perfect quality and that the unit cost of production is independent of demand. However, in realistic situations, product quality is never perfect, but is directly affected by the reliability of the production process. In this paper, we consider an EOQ model with imperfect production process and the unit production cost is directly related to process reliability and inversely related to the demand rate. In addition, a numerical example is given to illustrate the developed model. Sensitivity analysis is also performed and discussed.  相似文献   
187.
188.
Problem-structuring techniques are an integral aspect of ‘Soft-OR’. SSM, SAST, Strategic Choice, and JOURNEY Making, all depend for their success on a group developing a shared view of a problem through some form of explicit modelling. The negotiated problem structure becomes the basis for problem resolution. Implicit to this process is an assumption that members of the group share and build their knowledge about the problem domain. This paper explores the extent to which this assumption is reasonable. The research is based on detailed records from the use of JOURNEY Making, where it has used special purpose Group Support software to aid the group problem structuring. This software continuously tracks the contributions of each member of the group and thus the extent to which they appear to be ‘connecting’ and augmenting their own knowledge with that of other members of the group. Software records of problem resolution in real organisational settings are used to explore the sharing of knowledge among senior managers. These explorations suggest a typology of knowledge sharing. The implications of this typology for problem structuring and an agenda for future research are considered.  相似文献   
189.
 The inner radius of univalence of a domain D with Poincaré density ρ D is the possible largest number σ such that the condition ∥ S f D  = sup w∈ D ρ D (w) −2S f (z) ∥ ≤ σ implies univalence of f for a nonconstant meromorphic function f on D, where S f is the Schwarzian derivative of f. In this note, we give a lower bound of the inner radius of univalence for strongly starlike domains of order α in terms of the order α. The author was partially supported by the Ministry of Education, Grant-in-Aid for Encouragement of Young Scientists, 11740088. A part of this work was carried out during his visit to the University of Helsinki under the exchange programme of scientists between the Academy of Finland and the JSPS. Received November 26, 2001; in revised form September 24, 2002 Published online May 9, 2003  相似文献   
190.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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