首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   128923篇
  免费   2240篇
  国内免费   392篇
化学   58237篇
晶体学   1031篇
力学   8163篇
数学   39108篇
物理学   25016篇
  2023年   426篇
  2022年   334篇
  2021年   549篇
  2020年   766篇
  2019年   748篇
  2018年   11096篇
  2017年   10773篇
  2016年   7565篇
  2015年   2430篇
  2014年   1924篇
  2013年   3639篇
  2012年   7444篇
  2011年   13854篇
  2010年   7711篇
  2009年   7670篇
  2008年   9642篇
  2007年   11647篇
  2006年   3150篇
  2005年   4061篇
  2004年   3886篇
  2003年   3858篇
  2002年   2671篇
  2001年   1196篇
  2000年   1092篇
  1999年   741篇
  1998年   625篇
  1997年   548篇
  1996年   700篇
  1995年   440篇
  1994年   448篇
  1993年   475篇
  1992年   452篇
  1991年   411篇
  1990年   383篇
  1989年   385篇
  1988年   325篇
  1987年   324篇
  1986年   307篇
  1985年   456篇
  1984年   423篇
  1983年   292篇
  1982年   388篇
  1981年   376篇
  1980年   328篇
  1979年   322篇
  1978年   290篇
  1976年   288篇
  1975年   266篇
  1974年   264篇
  1973年   266篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
We give necessary and sufficient conditions on class S of maps of a category C so that a good calculus of fractions is possible in C[S -1], and a geometric characterization of the communitative diagrams in the category of fractions. These conditions are also described simply in terms of Grothendiek topologies.We characterize the categories which arise in this manner by the fact that the functor C C[S -1] is uniformly flat and give some applications of this result.  相似文献   
992.
Let be a rank three incidence geometry of points, lines and planes whose planes are linear spaces and whose point residues are dual linear spaces (notice that we do not require anything on the line residues). We assume that the residual linear spaces of belong to a natural class of finite linear spaces, namely those linear spaces whose full automorphism group acts flag-transitively and whose orders are polynomial functions of some prime number. This class consists of six families of linear spaces. In the amalgamation of two such linear spaces imposes an equality on their orders leading, in particular, to a series of diophantine equations, the solutions of which provide a reduction theorem on the possible amalgams of linear spaces that can occur in .We prove that one of the following holds (up to a permutation of the words point and plane):A) the planes of and the dual of the point residues belong to the same family and have the same orders,B) the diagram of is in one of six families,C) the diagram of belongs to a list of seven sporadic cases.Finally, we consider the particular case where the line residues of are generalized digons.  相似文献   
993.
Let { s,t ,(s,t + 2 } be a white noise on + 2 . We consider the hyperbolic stochastic partial differential equation {ie863-3} The purpose of this paper is to study the law of the solution to this equation. We analyze the existence and smoothness of the density using the tools of Malliavin Calculus. Finally we prove a large deviation principle on the space of continuous functions, for the family of probabilities obtained by perturbation of the noise in the equation.This work has been partially supported by the grant of the DGICYT No. PB 930052 and the EU Science project CT 910459.  相似文献   
994.
Willem L. Fouché 《Order》1996,13(3):255-266
For natural numbers s and r and a finite poset P of height h, there exists a finite poset P of height H(s, r, h) such that for an arbitrary r-colouring of the s-chains of P, a monochromatically embedded copy of P can be found in P. A best possible upper bound for H(s, r, h) in terms of the well-known Ramsey numbers is given.  相似文献   
995.
We study a problem of scheduling deteriorating jobs, i.e. jobs whose processing times are an increasing function of their starting times. We consider the case of a single machine and linear job-independent deterioration. The objective is to minimize the sum of weighted completion times, with weights proportional to the basic processing times. The optimal schedule is shown to be Λ-shaped, i.e. the sequence of the basic processing times has a single local maximum. Moreover, we show that the problem is solved in O(N log N) time. In the last section we test heuristics for the case of general weights.  相似文献   
996.
997.
998.
999.
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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