全文获取类型
收费全文 | 404篇 |
免费 | 46篇 |
专业分类
化学 | 152篇 |
力学 | 2篇 |
数学 | 195篇 |
物理学 | 101篇 |
出版年
2023年 | 5篇 |
2022年 | 10篇 |
2021年 | 20篇 |
2020年 | 9篇 |
2019年 | 22篇 |
2018年 | 9篇 |
2017年 | 5篇 |
2016年 | 17篇 |
2015年 | 25篇 |
2014年 | 15篇 |
2013年 | 24篇 |
2012年 | 15篇 |
2011年 | 24篇 |
2010年 | 24篇 |
2009年 | 29篇 |
2008年 | 31篇 |
2007年 | 24篇 |
2006年 | 15篇 |
2005年 | 13篇 |
2004年 | 12篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 6篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1996年 | 10篇 |
1995年 | 7篇 |
1994年 | 6篇 |
1993年 | 9篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 2篇 |
1989年 | 8篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1978年 | 1篇 |
1977年 | 2篇 |
排序方式: 共有450条查询结果,搜索用时 15 毫秒
301.
Anish Ghosh 《Journal of Number Theory》2007,124(2):454-469
The conjectures of Sprind?uk in the metric theory of Diophantine approximation are established over a local field of positive characteristic. In the real case, these were settled by D. Kleinbock and G.A. Margulis using a new technique which involved nondivergence estimates for quasi-polynomial flows on the space of lattices. We extend their technique to the positive characteristic setting. 相似文献
302.
Summary Chiral -lactones from the raw flavour extract of strawberries and commercially available fruit-containing products are stereoanalyzed directly by on-line coupling of liquid chromatography (LC) to gas chromatography (GC) and enantiomer separation with 2,6-di-O-pentyl-3-O-acetyl--cyclodextrin as the chiral stationary phase. 相似文献
303.
The Letter studies the problem of numerical approximations of the critical transition temperature and the energy gap function in the Bardeen-Cooper-Schrieffer equation arising in superconductivity theory. The positive kernel function leads to a phonon-dominant state at zero temperature. Much attention is paid to the equation defined on a bounded region. Two discretized versions of the equation are introduced. The first version approximates the desired solution from below, while the second, from above. Numerical examples are presented to illustrate the efficiency of the method. Besides, the approximations of a full space solution and the associated critical temperature by solution sequences constructed on bounded domains are also investigated.Part of this work was done while this author was visiting the Department of Mathematics, Carnegie Mellon University, Pittsburgh, PA, 15213, USA 相似文献
304.
A partial matrix is a matrix where only some of the entries are given. We determine the maximum rank of the symmetric completions of a symmetric partial matrix where only the diagonal blocks are given and the minimum rank and the maximum rank of the antisymmetric completions of an antisymmetric partial matrix where only the diagonal blocks are given. 相似文献
305.
306.
The local tree-width of
a graph G=(V,E) is the function
ltwG : that associates
with every r the maximal
tree-width of an r-neighborhood in
G. Our main grapht heoretic
result is a decomposition theorem for graphs with excluded
minors, which says that such graphs can be decomposed into trees
of graphs of almost bounded local tree-width.As an application of this theorem, we show that a number
of combinatorial optimization problems, suchas
Minimum Vertex Cover,
Minimum Dominating Set,
and Maximum Independent
Set have a polynomial time approximation scheme when
restricted to a class of graphs with an excluded minor. 相似文献
307.
It has been known that every planar 4-graph has a 2-bend 2-D orthogonal drawing, with the only exception being the octahedron, every planar 3-graph has a 1-bend 2-D orthogonal drawing with the only exception being K4, and every outerplanar 3-graph with no triangles has a 0-bend 2-D orthogonal drawing. We show in this paper that every series-parallel 4-graph has a 1-bend 2-D orthogonal drawing. 相似文献
308.
In 2001, Borwein, Choi, and Yazdani looked at an extremal property of a class of polynomial with ±1 coefficients. Their key result was:
Theorem.
(See Borwein, Choi, Yazdani, 2001.) Letf(z)=±z±z2±?±zN−1, and ζ a primitive Nth root of unity. If N is an odd positive integer then
309.
A.V. Kostochka 《Journal of Graph Theory》2014,75(4):377-386
Let denote the graph obtained from the complete graph by deleting the edges of some ‐subgraph. The author proved earlier that for each fixed s and , every graph with chromatic number has a minor. This confirmed a partial case of the corresponding conjecture by Woodall and Seymour. In this paper, we show that the statement holds already for much smaller t, namely, for . 相似文献
310.
Let (X,d) be a metric space and (Ω,d) a compact subspace of X which supports a non-atomic finite measure m. We consider ‘natural’ classes of badly approximable subsets of Ω. Loosely speaking, these consist of points in Ω which ‘stay clear’ of some given set of points in X. The classical set Bad of ‘badly approximable’ numbers in the theory of Diophantine approximation falls within our framework as do the sets Bad(i,j) of simultaneously badly approximable numbers. Under various natural conditions we prove that the badly approximable subsets of Ω have full Hausdorff dimension. Applications of our general framework include those from number theory (classical, complex, p-adic and formal power series) and dynamical systems (iterated function schemes, rational maps and Kleinian groups). 相似文献