首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   77883篇
  免费   2556篇
  国内免费   252篇
化学   50046篇
晶体学   459篇
力学   1520篇
综合类   1篇
数学   14067篇
物理学   14598篇
  2023年   488篇
  2022年   485篇
  2021年   857篇
  2020年   1150篇
  2019年   1069篇
  2018年   1300篇
  2017年   1213篇
  2016年   2457篇
  2015年   2090篇
  2014年   2125篇
  2013年   4710篇
  2012年   4656篇
  2011年   4964篇
  2010年   2896篇
  2009年   2458篇
  2008年   4311篇
  2007年   4099篇
  2006年   3857篇
  2005年   3780篇
  2004年   3242篇
  2003年   2773篇
  2002年   2490篇
  2001年   1352篇
  2000年   1337篇
  1999年   1017篇
  1998年   842篇
  1997年   788篇
  1996年   1060篇
  1995年   749篇
  1994年   780篇
  1993年   709篇
  1992年   733篇
  1991年   633篇
  1990年   645篇
  1989年   562篇
  1988年   599篇
  1987年   526篇
  1986年   498篇
  1985年   793篇
  1984年   749篇
  1983年   566篇
  1982年   636篇
  1981年   662篇
  1980年   577篇
  1979年   553篇
  1978年   528篇
  1977年   487篇
  1976年   485篇
  1974年   460篇
  1973年   471篇
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
91.
Sauer, Shelah, Vapnik and Chervonenkis proved that if a set system on n vertices contains many sets, then the set system has full trace on a large set. Although the restriction on the size of the groundset cannot be lifted, Frankl and Pach found a trace structure that is guaranteed to occur in uniform set systems even if we do not bound the size of the groundset. In this note we shall give three sequences of structures such that every set system consisting of sufficiently many sets contains at least one of these structures with many sets.  相似文献   
92.
93.
The auction algorithm for the transportation problem   总被引:1,自引:0,他引:1  
The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.  相似文献   
94.
95.
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.  相似文献   
96.
97.
Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.

  相似文献   

98.
99.
Background: Although microemulsion-based nanoparticles (MEs) may be useful for drug delivery or scavenging, these benefits must be balanced against potential nanotoxicological effects in biological tissue (bio-nano interface). We investigated the actions of assembled MEs and their individual components at the bio-nano interface of thrombosis and hemolysis in human blood. Methods: Oil-in-water MEs were synthesized using ethylbutyrate, sodium caprylate, and pluronic F-68 (ME4) or F-127 (ME6) in 0.9% NaClw/v. The effects of MEs or components on thrombosis were determined using thrombo-elastography, platelet contractile force, clot elastic modulus, and platelet counting. For hemolysis, ME or components were incubated with erythrocytes, centrifuged, and washed for measurement of free hemoglobin by spectroscopy. Results and conclusions: The mean particle diameters (polydispersity index) for ME6 and ME4 were 23.6 ± 2.5 nm (0.362) and 14.0 ± 1.0 nm (0.008), respectively. MEs (0, 0.03, 0.3, 3 mM) markedly reduced the thromboelastograph maximal amplitude in a concentration-dependent manner (49.0 ± 4.2, 39.0 ± 5.6, 15.0 ± 8.7, 3.8 ± 1.3 mm, respectively), an effect highly correlated (r2 = 0.94) with similar changes caused by pluronic surfactants (48.7 ± 10.9, 30.7 ± 15.8, 20.0 ± 11.3, 2.0 ± 0.5) alone. Neither oil nor sodium caprylate alone affected the thromboelastograph. The clot contractile force was reduced by ME (27.3 ± 11.1–6.7 ± 3.4 kdynes/cm2, P = 0.02, n = 5) whereas the platelet population not affected (175 ± 28–182 ± 23 106/ml, P = 0.12, n = 6). This data suggests that MEs reduced platelet activity due to associated pluronic surfactants, but caused minimal changes in protein function necessary for coagulation. Although pharmacological concentrations of sodium caprylate caused hemolysis (EC50 = 213 mM), MEs and pluronic surfactants did not disrupt erythrocytes. Knowledge of nanoparticle activity and potential associated nanotoxicity at this bio-nano interface enables rational ME design for in vivo applications.  相似文献   
100.
This article addresses two questions: Has the effectiveness of the US governments federal research and development (R&;D) spending suffered from the post-1980 strategic change from freely shared and publicly owned to privately owned scientific advances? What criteria would a federal R&;D program use to design a strategy that most effectively enhances the well-being of farmers and rural communities? Several studies found that the pre-1980 US Department of Agriculture research strategy was very effective. No comparable studies have analyzed the comparative effectiveness of the post-1980 strategy of restricting access to the results of public research. Recent experience and several analytical studies suggest that to significantly enhance the health of rural economies from an expanded use of plant matter as an industrial material, federal policy should channel scientific and engineering research into small- and medium-sized production and processing technologies and should encourage farmer-owned, value-added enterprises.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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