首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   98833篇
  免费   2080篇
  国内免费   1666篇
化学   30814篇
晶体学   891篇
力学   7177篇
综合类   115篇
数学   33006篇
物理学   17994篇
无线电   12582篇
  2024年   55篇
  2023年   288篇
  2022年   354篇
  2021年   446篇
  2020年   467篇
  2019年   445篇
  2018年   12108篇
  2017年   11739篇
  2016年   7440篇
  2015年   1435篇
  2014年   1079篇
  2013年   1184篇
  2012年   5159篇
  2011年   12587篇
  2010年   7550篇
  2009年   7391篇
  2008年   7931篇
  2007年   10238篇
  2006年   817篇
  2005年   2055篇
  2004年   2193篇
  2003年   2602篇
  2002年   1520篇
  2001年   641篇
  2000年   526篇
  1999年   440篇
  1998年   381篇
  1997年   298篇
  1996年   369篇
  1995年   260篇
  1994年   209篇
  1993年   197篇
  1992年   146篇
  1991年   151篇
  1990年   101篇
  1989年   112篇
  1988年   95篇
  1987年   89篇
  1986年   93篇
  1985年   79篇
  1984年   53篇
  1983年   42篇
  1982年   50篇
  1981年   47篇
  1980年   53篇
  1979年   49篇
  1914年   45篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
31.
32.
33.
A subgroupH of a groupG is said to bepermutable ifHX=XH for every subgroupX ofG. In this paper the structure of groups in which every subgroup either is abelian or permutable is investigated. This work was done while the last author was visiting the University of Napoli Federico II. He thanks the “Dipartimento di Matematica e Applicazioni” for its financial support.  相似文献   
34.
35.
§ 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…  相似文献   
36.
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.  相似文献   
37.
 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  相似文献   
38.
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.  相似文献   
39.
40.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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