首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   84335篇
  免费   1654篇
  国内免费   1059篇
化学   28774篇
晶体学   826篇
力学   7101篇
综合类   44篇
数学   32761篇
物理学   17542篇
  2023年   138篇
  2022年   203篇
  2021年   254篇
  2020年   345篇
  2019年   253篇
  2018年   10600篇
  2017年   10414篇
  2016年   6348篇
  2015年   1182篇
  2014年   662篇
  2013年   784篇
  2012年   4384篇
  2011年   11135篇
  2010年   6055篇
  2009年   6413篇
  2008年   6992篇
  2007年   9117篇
  2006年   600篇
  2005年   1567篇
  2004年   1761篇
  2003年   2111篇
  2002年   1183篇
  2001年   358篇
  2000年   418篇
  1999年   295篇
  1998年   315篇
  1997年   284篇
  1996年   320篇
  1995年   230篇
  1994年   174篇
  1993年   191篇
  1992年   120篇
  1991年   121篇
  1990年   106篇
  1989年   91篇
  1988年   90篇
  1987年   88篇
  1986年   68篇
  1985年   70篇
  1984年   52篇
  1983年   42篇
  1982年   45篇
  1981年   44篇
  1980年   47篇
  1979年   45篇
  1914年   45篇
  1913年   40篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 484 毫秒
281.
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.  相似文献   
282.
§ 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…  相似文献   
283.
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.  相似文献   
284.
We draw upon the concepts of knowledge market, organizational tacit knowledge, credit assignment, and single-loop learning in proposing a market-based conceptual model for collaborative organizational learning. Our proposed model is characterized by the local competition among seller agents and the global collaboration among winner agents in forming a plan, through a chain of ‘upstream–downstream’ working relationship, for task accomplishment. This feature is achieved through three closely coupled processes: the expert selection process, the capital reallocation process, and the plan formation process. Our model is intended for multiple-step learning environment in which each task consists of a sequence of single-step learning tasks. Learning at the global level is the result of a sequence of nested single-loop learning at the local level.  相似文献   
285.
In this paper, we investigate the exact distribution of the waiting time for ther-th ℓ-overlapping occurrence of success-runs of a specified length in a sequence of two state Markov dependent trials. The probability generating functions are derived explicitly, and as asymptotic results, relationships of a negative binomial distribution of orderk and an extended Poisson distribution of orderk are discussed. We provide further insights into the run-related problems from the viewpoint of the ℓ-overlapping enumeration scheme. We also study the exact distribution of the number of ℓ-overlapping occurrences of success-runs in a fixed number of trials and derive the probability generating functions. The present work extends several properties of distributions of orderk and leads us a new type of geneses of the discrete distributions.  相似文献   
286.
287.
 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  相似文献   
288.
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.  相似文献   
289.
290.
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号