首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   28444篇
  免费   773篇
  国内免费   144篇
化学   19459篇
晶体学   312篇
力学   660篇
综合类   1篇
数学   3953篇
物理学   4976篇
  2022年   198篇
  2021年   246篇
  2020年   369篇
  2019年   372篇
  2018年   229篇
  2017年   228篇
  2016年   496篇
  2015年   449篇
  2014年   578篇
  2013年   1325篇
  2012年   1286篇
  2011年   1636篇
  2010年   815篇
  2009年   738篇
  2008年   1373篇
  2007年   1470篇
  2006年   1446篇
  2005年   1386篇
  2004年   1189篇
  2003年   1020篇
  2002年   1003篇
  2001年   442篇
  2000年   457篇
  1999年   334篇
  1998年   318篇
  1997年   354篇
  1996年   420篇
  1995年   342篇
  1994年   373篇
  1993年   417篇
  1992年   368篇
  1991年   302篇
  1990年   279篇
  1989年   267篇
  1988年   235篇
  1987年   278篇
  1986年   246篇
  1985年   388篇
  1984年   401篇
  1983年   279篇
  1982年   345篇
  1981年   359篇
  1980年   315篇
  1979年   308篇
  1978年   342篇
  1977年   271篇
  1976年   286篇
  1975年   265篇
  1974年   294篇
  1973年   268篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?2 has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   
82.
We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular, we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first to construct a network and transmit an initial set of flows through the network. The enemy acts next to destroy a set of constructed arcs in the designer’s network, and the designer acts last to transmit a final set of flows in the network. Most studies of this nature assume that the enemy will act optimally; however, in real-world scenarios one cannot necessarily assume rationality on the part of the enemy. Hence, we prescribe optimal network design algorithms for three different profiles of enemy action: an enemy destroying arcs based on capacities, based on initial flows, or acting optimally to minimize our maximum profits obtained from transmitting flows.  相似文献   
83.
A Yang–Mills theory in a purely symplectic framework is developed. The corresponding Euler–Lagrange equations are derived and first integrals are given. We relate the results to the work of Bourgeois and Cahen on preferred symplectic connections.  相似文献   
84.
85.
Due to the hot, arid nature of its bordering lands, seawater in the Arabian Gulf can have significant evaporation rates leading to hypersaline conditions. If additional desalination plants were to operate along its coast, then the extraction of desalinated water and returned brine waste stream into the Gulf would increase the salinity. This paper uses a tidally and cross-sectionally averaged mathematical model that reveals multiplicative dependence of the salinity on factors associated with river flow, evaporation rates and each of the desalination plants. Present-day desalinated water production rates are in the linear regime, but hypersalinity has exponential sensitivity to the position and volumetric rate of desalinated water extraction.  相似文献   
86.
We study (relative) zeta regularized determinants of Laplace type operators on compact conic manifolds. We establish gluing formulae for relative zeta regularized determinants. For arbitrary self-adjoint extensions of the Laplace-Beltrami operator, we express the relative ζ-determinants for these as a ratio of the determinants of certain finite matrices. For the self-adjoint extensions corresponding to Dirichlet and Neumann conditions, the formula is particularly simple and elegant.  相似文献   
87.
When depicted on maps as homogenous territorial wholes, ancient states are visually summarized as static entities in a way that conceals the highly fluid dynamics of polity formation, maintenance, and growth. Models derived from studies of animal behavior show that “territory” does not consist of an undifferentiated use of the landscape. Instead, the concept of territory can be parsed into a series of resource‐rich nodes linked by corridors of access, surrounded by unutilized regions and boundaries marked at points of competition. Ancient human groups also can be analyzed as having perceived and occupied landscapes through strategies of flexible networks in which nodes and corridors were surrounded by unutilized spaces around which boundaries were selectively identified and defended. This strategy is identifiable in human social groups at different levels of complexity ranging from hunter‐gatherers through ancient chiefdoms and states. © 2007 Wiley Periodicals, Inc. Complexity 12: 28–35, 2007  相似文献   
88.
89.
The anti-Parkinson’s agent SIB-1508Y was prepared in six steps from (S)-nicotine in 20% overall yield. The strategy involves a regioselective formylation at C-5 of a 1,4-dihydronicotine intermediate.  相似文献   
90.
Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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