首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   91963篇
  免费   983篇
  国内免费   419篇
化学   33871篇
晶体学   1027篇
力学   7124篇
综合类   1篇
数学   32938篇
物理学   18404篇
  2023年   166篇
  2022年   383篇
  2021年   438篇
  2020年   484篇
  2019年   533篇
  2018年   10759篇
  2017年   10558篇
  2016年   6690篇
  2015年   1322篇
  2014年   1055篇
  2013年   1616篇
  2012年   4847篇
  2011年   11525篇
  2010年   6337篇
  2009年   6602篇
  2008年   7260篇
  2007年   9408篇
  2006年   783篇
  2005年   1788篇
  2004年   1892篇
  2003年   2263篇
  2002年   1264篇
  2001年   401篇
  2000年   425篇
  1999年   254篇
  1998年   265篇
  1997年   245篇
  1996年   295篇
  1995年   200篇
  1994年   152篇
  1993年   190篇
  1992年   154篇
  1991年   145篇
  1990年   123篇
  1989年   133篇
  1988年   110篇
  1987年   107篇
  1986年   100篇
  1985年   112篇
  1984年   111篇
  1983年   100篇
  1982年   94篇
  1981年   83篇
  1980年   103篇
  1979年   109篇
  1978年   85篇
  1977年   75篇
  1976年   62篇
  1975年   56篇
  1973年   55篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
In this paper, we study a problem central to crossdocking that aims to eliminate or minimize storage and order picking activity using JIT scheduling. The problem is modelled naturally as a machine scheduling problem. As the problem is NP-hard, and for real-time applications, we designed and implemented two heuristics. The first uses Squeaky Wheel Optimization embedded in a Genetic Algorithm and the second uses Linear Programming within a Genetic Algorithm. Both heuristics offer good solutions in experiments where comparisons are made with the CPLEX solver.  相似文献   
152.
In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.  相似文献   
153.
Siaw-Lynn Ng 《Order》2004,21(1):1-5
We present a characterisation of posets of size n with linear discrepancy n − 2. These are the posets that are “furthest” from a linear order without being an antichain. This revised version was published online in September 2006 with corrections to the Cover Date.  相似文献   
154.
155.
We will prove a result concerning the inclusion of non-trivial invariant ideals inside non-trivial ideals of a twisted crossed product. We will also give results concerning the primeness and simplicity of crossed products of twisted actions of locally compact groups on -algebras. Received: 25 January 2002; in final form: 22 May 2002/Published online: 2 December 2002 This work is partially supported by Hong Kong RGC Direct Grant.  相似文献   
156.
The influence of the sample orientation on the effective value of the hydrostatic piezoelectric coefficients d h (i) of Sn2P2S6 crystals has been studied. The hydrostatic piezoelectric coefficients d h (1) and d′ h (3) , were measured, d h (1) =(244±3) pC/N and d′ h (3) =(92±1) pC/N. The hydrostatic piezoelectric coefficient d h (3) for orthogonal axis system was calculated to be d h (3) =(87±2) pC/N. The, optimal orientation of the sample has been found as (Xy l)−20°-cut. Maximal value of the effective hydrostatic piezoelectric coefficient d h (1) equals 260 pC/N. Double rotated samples were also studied. The orientation of the samples insensitive to the pressure has been found. The theoretical mean value of hydrostatic piezoelectric coefficient (d h ) mean corresponding to randomly oriented Sn2P2S6 grains in a poled composite has been calculated to be (d h ) mean =136 pC/N.  相似文献   
157.
In this paper we find homological restrictions on Lagrangians in cotangent bundles of spheres and Lens spaces. This research was supported by the Israel Science Foundation (grand No. 205/02).  相似文献   
158.
A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices have the same degree. Clearly, a weakly regular triangulation is degree-regular. In [8], Lutz has classified all the weakly regular triangulations on at most 15 vertices. In [5], Datta and Nilakantan have classified all the degree-regular triangulations of closed surfaces on at most 11 vertices. In this article, we have proved that any degree-regular triangulation of the torus is weakly regular. We have shown that there exists ann-vertex degree-regular triangulation of the Klein bottle if and only if n is a composite number ≥ 9. We have constructed two distinctn-vertex weakly regular triangulations of the torus for eachn ≥ 12 and a (4m + 2)-vertex weakly regular triangulation of the Klein bottle for eachm ≥ 2. For 12 ≤n ≤ 15, we have classified all then-vertex degree-regular triangulations of the torus and the Klein bottle. There are exactly 19 such triangulations, 12 of which are triangulations of the torus and remaining 7 are triangulations of the Klein bottle. Among the last 7, only one is weakly regular.  相似文献   
159.
Scheduling the production of several items requires the determination of production quantities in different periods in the presence of resource constraints. Several approximate and heuristic algorithms have been proposed to solve this problem. However, no method for finding an optimal solution has as yet been developed. It is shown that the problem may be solved advantageously using Benders' decomposition. The subproblem in Benders' decomposition is shown to be a transportation problem, and some strategies for solving the master problem are indicated. The paper concludes with a sample problem demonstrating the application of the method.  相似文献   
160.
A partnership in a cooperative game is a coalition that possesses an internal structure and, simultaneously, behaves as an individual member. Forming partnerships leads to a modification of the original game which differs from the quotient game that arises when one or more coalitions are actually formed. In this paper, the Shapley value is used to discuss the convenience to form either coalitions or partnerships. To this end, the difference between the additive Shapley value of the partnership in the partnership game and the Shapley alliance value of the coalition, and also between the corresponding value of the internal and external players, are analysed. Simple games are especially considered. Research partially supported by Grant BFM 2003-01314 of the Science and Technology Spanish Ministry and the European Regional Development Fund.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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