首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10993篇
  免费   193篇
  国内免费   43篇
化学   6926篇
晶体学   154篇
力学   326篇
数学   1353篇
物理学   2470篇
  2021年   65篇
  2020年   103篇
  2019年   105篇
  2017年   62篇
  2016年   120篇
  2015年   124篇
  2014年   164篇
  2013年   470篇
  2012年   380篇
  2011年   480篇
  2010年   244篇
  2009年   264篇
  2008年   466篇
  2007年   492篇
  2006年   484篇
  2005年   430篇
  2004年   394篇
  2003年   365篇
  2002年   346篇
  2001年   219篇
  2000年   226篇
  1999年   122篇
  1998年   120篇
  1997年   127篇
  1996年   181篇
  1995年   145篇
  1994年   190篇
  1993年   203篇
  1992年   188篇
  1991年   138篇
  1990年   137篇
  1989年   154篇
  1988年   118篇
  1987年   149篇
  1986年   132篇
  1985年   226篇
  1984年   192篇
  1983年   137篇
  1982年   162篇
  1981年   151篇
  1980年   150篇
  1979年   160篇
  1978年   168篇
  1977年   141篇
  1976年   161篇
  1975年   150篇
  1974年   155篇
  1973年   147篇
  1972年   66篇
  1971年   74篇
排序方式: 共有10000条查询结果,搜索用时 281 毫秒
21.
22.
This paper examines the effect of infinitesimal functional variations in a rigid rotor He-HF potential surface on several different types of observables: inelastic cross sections, rate constants, and rotational energy level populations. The dynamics and kinetic observables studied were found to be sensitive to a large number of Legendre components of the potential with the region of highest sensitivity dependent upon the energy or temperature as well as the states related by the individual observable. Sensitivity to the entire surface tends to show a large degree of structure due to competition among sensitivities to the individual potential components. Significant information loss has been observed in the transition from microscopic to macroscopic observables.  相似文献   
23.
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.  相似文献   
24.
25.
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.  相似文献   
26.
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  相似文献   
27.
Summary The pH versus fluorescence intensity profiles of a series of new pH-indicators are reported. They are characterized by two pKa-values in the 3.7–4.9 and 6.9–7.9 range, respectively. The strong change in fluorescence intensity with pH allows the determination of pH's over a much wider range (typically 2–9) than with one-step indicators. They are therefore considered to be of potential utility for measurement of pH over the neutral and slightly acidity range which occurs, for instance, in bioliquids such as urine.
Eine neue Gruppe fluorescierender pH-Indicatoren für einen erweiterten pH-Bereich
Zusammenfassung Die Fluorescenzintensitätsprofile als Funktion des pH-Wertes einer Reihe von neuen pH-Indicatoren werden untersucht. Sie sind charakterisiert durch zwei pKa-Werte im Bereich 3,7–4,9 bzw. 6,9–7,9. Die gefundene starke Änderung der Fluorescenzintensität mit dem pH-Wert erlaubt eine pH-Bestimmung über einen viel weiteren Bereich (typischerweise 2 – 9) als mit einstufigen Indicatoren. Aus diesem Grund werden sie als potentiell nützlich angesehen zur Messung von pH-Werten im neutralen und schwach sauren Bereich, wie er z.B. in biologischen Flüssigkeiten, etwa im Urin, gegeben ist.
  相似文献   
28.
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.  相似文献   
29.
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.  相似文献   
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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