全文获取类型
收费全文 | 5857篇 |
免费 | 362篇 |
国内免费 | 527篇 |
专业分类
化学 | 514篇 |
晶体学 | 11篇 |
力学 | 311篇 |
综合类 | 122篇 |
数学 | 5215篇 |
物理学 | 573篇 |
出版年
2024年 | 6篇 |
2023年 | 64篇 |
2022年 | 85篇 |
2021年 | 108篇 |
2020年 | 116篇 |
2019年 | 124篇 |
2018年 | 145篇 |
2017年 | 133篇 |
2016年 | 142篇 |
2015年 | 118篇 |
2014年 | 237篇 |
2013年 | 430篇 |
2012年 | 270篇 |
2011年 | 326篇 |
2010年 | 286篇 |
2009年 | 395篇 |
2008年 | 394篇 |
2007年 | 358篇 |
2006年 | 364篇 |
2005年 | 290篇 |
2004年 | 241篇 |
2003年 | 282篇 |
2002年 | 245篇 |
2001年 | 221篇 |
2000年 | 186篇 |
1999年 | 190篇 |
1998年 | 197篇 |
1997年 | 160篇 |
1996年 | 107篇 |
1995年 | 74篇 |
1994年 | 73篇 |
1993年 | 54篇 |
1992年 | 37篇 |
1991年 | 30篇 |
1990年 | 23篇 |
1989年 | 14篇 |
1988年 | 18篇 |
1987年 | 14篇 |
1986年 | 15篇 |
1985年 | 29篇 |
1984年 | 27篇 |
1983年 | 15篇 |
1982年 | 23篇 |
1981年 | 21篇 |
1980年 | 22篇 |
1979年 | 12篇 |
1978年 | 12篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1974年 | 3篇 |
排序方式: 共有6746条查询结果,搜索用时 31 毫秒
1.
2.
Tomasz Przebinda 《Journal of Functional Analysis》2018,274(5):1284-1305
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 be the set of positive integers. For a nonempty set A of integers and every integer u, denote by the number of with such that . For a sequence S of positive integers, let be the counting function of S. The set is called a perfect difference set if 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 be an increasing function satisfying for any positive integer n, then for every Sidon set B and every function , there exists a set such that for every positive integer u and for all . 相似文献
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.
Matthew J. Katz 《Computational Geometry》1997,8(6):299-316
We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λs(n)log3n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λs(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λs(n)log2n). The query time in the first problem is O(log4n), the query time in the second and third problems is O(log3n + klog2n), and the query time in the fourth problem is O(log3n).
We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K1, K2 and K1 lies vertically above K2, then K1 precedes K2.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm. 相似文献
7.
本文研究作为双层桥模型的梁方程耦合系统,利用Leray-Schauder不动点定理,得到了一个关于这种系统的解的存在性定理,它类似于McKenna和Walter文2中关于吊桥方程的一个定理。 相似文献
8.
9.
Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained. 相似文献
10.
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. 相似文献