全文获取类型
收费全文 | 1905篇 |
免费 | 69篇 |
国内免费 | 18篇 |
专业分类
化学 | 1405篇 |
晶体学 | 4篇 |
力学 | 33篇 |
数学 | 289篇 |
物理学 | 261篇 |
出版年
2022年 | 15篇 |
2021年 | 23篇 |
2020年 | 24篇 |
2019年 | 23篇 |
2018年 | 9篇 |
2017年 | 19篇 |
2016年 | 53篇 |
2015年 | 41篇 |
2014年 | 51篇 |
2013年 | 62篇 |
2012年 | 94篇 |
2011年 | 125篇 |
2010年 | 49篇 |
2009年 | 48篇 |
2008年 | 106篇 |
2007年 | 90篇 |
2006年 | 120篇 |
2005年 | 100篇 |
2004年 | 91篇 |
2003年 | 71篇 |
2002年 | 81篇 |
2001年 | 38篇 |
2000年 | 40篇 |
1999年 | 23篇 |
1998年 | 26篇 |
1997年 | 28篇 |
1996年 | 23篇 |
1995年 | 30篇 |
1994年 | 27篇 |
1993年 | 28篇 |
1992年 | 19篇 |
1991年 | 16篇 |
1990年 | 24篇 |
1989年 | 20篇 |
1988年 | 26篇 |
1987年 | 24篇 |
1986年 | 18篇 |
1985年 | 21篇 |
1984年 | 20篇 |
1983年 | 15篇 |
1982年 | 14篇 |
1981年 | 13篇 |
1980年 | 12篇 |
1979年 | 11篇 |
1978年 | 13篇 |
1977年 | 12篇 |
1976年 | 14篇 |
1975年 | 16篇 |
1973年 | 10篇 |
1972年 | 8篇 |
排序方式: 共有1992条查询结果,搜索用时 15 毫秒
1.
2.
3.
Hansen Karin Vels Kreka Kosova Jacobsen Torben 《Journal of Solid State Electrochemistry》2019,23(3):811-822
Journal of Solid State Electrochemistry - Local cathodic polarizations of yttria-stabilized zirconia were carried out with a PtIr probe as the working electrode in a controlled atmosphere high... 相似文献
4.
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. 相似文献
5.
Partially supported by the general research fund at the University of Kansas 相似文献
6.
We study the relation between the cohomology of general linear and symmetric groups and their respective quantizations, using Schur algebras and standard homological techniques to build appropriate spectral sequences. As our methods fit inside a much more general context within the theory of finite-dimensional algebras, we develop our results first in that general setting, and then specialize to the above situations. From this we obtain new proofs of several known results in modular representation theory of symmetric groups. Moreover, we reduce certain questions about computing extensions for symmetric groups and Hecke algebras to questions about extensions for general linear groups and their quantizations. 相似文献
7.
Karin Cvetko-Vah 《Semigroup Forum》2004,68(2):268-279
Given a ring $R$, let $S\subseteq R$ be a pure multiplicative band that is
closed under the cubic join operation $x\nabla y = x+y+yx-xyx-yxy.$ We show that
$\left( S,\cdot,\nabla\right) $ forms a pure skew lattice if and only if $S$
satisfies the polynomial identity $\left(xy-yx\right)^{2}z = z\left(xy-yx\right)^{2}$.
We also examine properties of pure skew lattices
in rings. 相似文献
8.
9.
10.