首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   13389篇
  免费   648篇
  国内免费   48篇
化学   9345篇
晶体学   129篇
力学   278篇
数学   1919篇
物理学   2414篇
  2023年   87篇
  2022年   109篇
  2021年   178篇
  2020年   281篇
  2019年   238篇
  2018年   169篇
  2017年   147篇
  2016年   489篇
  2015年   441篇
  2014年   467篇
  2013年   597篇
  2012年   786篇
  2011年   888篇
  2010年   609篇
  2009年   514篇
  2008年   782篇
  2007年   699篇
  2006年   679篇
  2005年   667篇
  2004年   587篇
  2003年   441篇
  2002年   401篇
  2001年   229篇
  2000年   219篇
  1999年   204篇
  1998年   161篇
  1997年   206篇
  1996年   170篇
  1995年   161篇
  1994年   151篇
  1993年   148篇
  1992年   138篇
  1991年   105篇
  1990年   88篇
  1989年   120篇
  1988年   109篇
  1987年   85篇
  1986年   78篇
  1985年   86篇
  1984年   63篇
  1983年   68篇
  1982年   79篇
  1981年   88篇
  1980年   66篇
  1979年   77篇
  1978年   78篇
  1977年   61篇
  1976年   56篇
  1975年   52篇
  1973年   53篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.  相似文献   
12.
The finite-size corrections, central chargesc, and scaling dimensionsx of tricritical hard squares and critical hard hexagons are calculated analytically. This is achieved by solving the special functional equation or inversion identity satisfied by the commuting row transfer matrices of these lattice models at criticality. The results are expressed in terms of Rogers dilogarithms. For tricritical hard squares we obtainc=7/10,x=3/40, 1/5, 7/8, 6/5 and for hard hexagons we obtainc=4/5,x=2/15, 4/5, 17/15, 4/3, 9/5, in accord with the predictions of conformal and modular invariance.  相似文献   
13.
In complex biological systems, entities that are conceptually distinct but empirically related—such as sunlight and plant growth or antigene and immune response—are being explicitly linked through the identification of highly specific uninterrupted interaction sequences that take place between their macromolecular system components. These uninterrupted sequences of causation include common elements that are shared by the empirically related but conceptually distinct entities. Through the identification of specific shared elements, “conceptual continuity” is established between these entities. Examples are introduced to suggest that in sociopolitical systems, an analogous conceptual continuity can be established between distinct sociopolitical entities. The identification of specific shared elements, essential for the well being of each of the entities, can play a significant role in resolving conflicts between those separated by seemingly insurmountable obstacles such as race or religion or ideology. © 2006 Wiley Periodicals, Inc. Complexity 11:20–24, 2006  相似文献   
14.
Aspects of Generic Entanglement   总被引:4,自引:4,他引:0  
We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the ``concentration of measure' phenomenon, meaning that on a large-probability set these parameters are close to their expectation. For the entropy of entanglement, this has the counterintuitive consequence that there exist large subspaces in which all pure states are close to maximally entangled. This, in turn, implies the existence of mixed states with entanglement of formation near that of a maximally entangled state, but with negligible quantum mutual information and, therefore, negligible distillable entanglement, secret key, and common randomness. It also implies a very strong locking effect for the entanglement of formation: its value can jump from maximal to near zero by tracing over a number of qubits negligible compared to the size of the total system. Furthermore, such properties are generic. Similar phenomena are observed for random multiparty states, leading us to speculate on the possibility that the theory of entanglement is much simplified when restricted to asymptotically generic states. Further consequences of our results include a complete derandomization of the protocol for universal superdense coding of quantum states.  相似文献   
15.
We investigate an operator renormalization group method to extract and describe the relevant degrees of freedom in the evolution of partial differential equations. The proposed renormalization group approach is formulated as an analytical method providing the fundamental concepts of a numerical algorithm applicable to various dynamical systems. We examine dynamical scaling characteristics in the short-time and the long-time evolution regime providing only a reduced number of degrees of freedom to the evolution process.  相似文献   
16.
17.
In this paper we present a method to solve numerically elliptic problems with multi-scale data using multiple levels of not necessarily nested grids. The method consists in calculating successive corrections to the solution in patches whose discretizations are not necessarily conforming. It resembles the FAC method (see Math. Comp. 46 (174) (1986) 439–456) and its convergence is obtained by a domain decomposition technique (see Math. Comp. 57 (195) (1991) 1–21). However it is of much more flexible use in comparison to the latter. To cite this article: R. Glowinski et al., C. R. Acad. Sci. Paris, Ser. I 337 (2003).  相似文献   
18.
19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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