首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   78502篇
  免费   334篇
  国内免费   380篇
化学   24582篇
晶体学   795篇
力学   6729篇
数学   31961篇
物理学   15149篇
  2018年   10434篇
  2017年   10261篇
  2016年   6068篇
  2015年   843篇
  2014年   295篇
  2013年   339篇
  2012年   3788篇
  2011年   10504篇
  2010年   5638篇
  2009年   6058篇
  2008年   6600篇
  2007年   8776篇
  2006年   233篇
  2005年   1321篇
  2004年   1548篇
  2003年   1982篇
  2002年   1047篇
  2001年   269篇
  2000年   312篇
  1999年   163篇
  1998年   204篇
  1997年   150篇
  1996年   209篇
  1995年   123篇
  1994年   84篇
  1993年   104篇
  1992年   70篇
  1991年   78篇
  1990年   61篇
  1989年   70篇
  1988年   65篇
  1987年   70篇
  1986年   65篇
  1985年   64篇
  1984年   50篇
  1983年   44篇
  1982年   53篇
  1981年   44篇
  1980年   52篇
  1979年   52篇
  1978年   46篇
  1977年   26篇
  1973年   32篇
  1914年   45篇
  1913年   40篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
  1907年   32篇
  1904年   28篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
141.
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.  相似文献   
142.
§ 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…  相似文献   
143.
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.  相似文献   
144.
145.
 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  相似文献   
146.
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.  相似文献   
147.
148.
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.  相似文献   
149.
 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  相似文献   
150.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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