首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5436篇
  免费   370篇
  国内免费   522篇
化学   404篇
晶体学   4篇
力学   297篇
综合类   127篇
数学   5181篇
物理学   315篇
  2024年   5篇
  2023年   62篇
  2022年   68篇
  2021年   97篇
  2020年   112篇
  2019年   120篇
  2018年   141篇
  2017年   148篇
  2016年   149篇
  2015年   109篇
  2014年   212篇
  2013年   379篇
  2012年   233篇
  2011年   301篇
  2010年   269篇
  2009年   371篇
  2008年   361篇
  2007年   352篇
  2006年   342篇
  2005年   276篇
  2004年   246篇
  2003年   276篇
  2002年   232篇
  2001年   221篇
  2000年   179篇
  1999年   176篇
  1998年   186篇
  1997年   159篇
  1996年   98篇
  1995年   70篇
  1994年   57篇
  1993年   48篇
  1992年   37篇
  1991年   27篇
  1990年   20篇
  1989年   14篇
  1988年   15篇
  1987年   11篇
  1986年   9篇
  1985年   24篇
  1984年   20篇
  1983年   12篇
  1982年   22篇
  1981年   16篇
  1980年   19篇
  1979年   6篇
  1978年   8篇
  1977年   4篇
  1976年   4篇
  1974年   3篇
排序方式: 共有6328条查询结果,搜索用时 46 毫秒
1.
2.
We relate the distribution characters and the wave front sets of unitary representation for real reductive dual pairs of type I in the stable range.  相似文献   
3.
《Discrete Mathematics》2021,344(12):112589
Let N be the set of positive integers. For a nonempty set A of integers and every integer u, denote by dA(u) the number of (a,a) with a,aA such that u=aa. For a sequence S of positive integers, let S(x) be the counting function of S. The set AN is called a perfect difference set if dA(u)=1 for every positive integer u. In 2008, Cilleruelo and Nathanson (2008) [4] constructed dense perfect difference sets from dense Sidon sets. In this paper, as a main result, we prove that: let f:NN be an increasing function satisfying f(n)2 for any positive integer n, then for every Sidon set B and every function ω(x), there exists a set AN such that dA(u)=f(u) for every positive integer u and B(x/3)ω(x)A(x)B(x/3)+ω(x) for all xCf,B,ω.  相似文献   
4.
数据包络分析(DEA)是评价供应链系统(Supply chain system)间相对有效性的一种重要的工具,但是传统的DEA不考虑供应链的内部结构,对系统效率评价偏高;而本文所研究两阶段串联供应链系统,考虑把部分中间产品作为最终产品输出,增加额外中间投入的情形.基于所提出的供应链系统结构,本文建立相应的串联结构下的网络DEA模型,并针对所建立模型进行相关理论的研究,给出了串联结构下的生产可能集和规模收益情况判定方法.最后,进行数值实验,以验证我们提出的结论.  相似文献   
5.
Multivariate curve resolution methods, frequently used in analyzing bilinear data sets, result in ambiguous decomposition in general. Implementing the adequate constraints may lead to reduce the so-called rotational ambiguity drastically, and in the most favorable cases to the unique solution. However, in some special cases, non-negativity constraint as minimal information of the system is a sufficient condition to resolve profiles uniquely. Although, several studies on exploring the uniqueness of the bilinear non-negatively constrained multivariate curve resolution methods have been made in the literature, it has still remained a mysterious question. In 1995, Manne published his profile-based theorems giving the necessary and sufficient conditions of the unique resolution. In this study, a new term, i.e., data-based uniqueness is defined and investigated in details, and a general procedure is suggested for detection of uniquely recovered profile(s) on the basis of data set structure in the abstract space. Close inspection of Borgen plots of these data sets leads to realize the comprehensive information of local rank, and these argumentations furnish a basis for data-based uniqueness theorem. The reported phenomenon and its exploration is a new stage (it can be said fundament) in understanding and describing the bilinear (matrix-type) chemical data in general.  相似文献   
6.
7.
Balaganskii  V. S. 《Mathematical Notes》2002,72(5-6):752-756
Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.  相似文献   
8.
We consider immersions: and construct a subspace of which corresponds to a set of embedded manifolds which are either parallel to f, tubes around f or, in general, partial tubes around f. This space is invariant under the action of the normal holonomy group, We investigate the case where is non-trivial and obtain some results on the number of connected components of . Received 24 March 2000.  相似文献   
9.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008  相似文献   
10.
An edge e of a perfect graph G is critical if Ge is imperfect. We would like to decide whether Ge is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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