全文获取类型
收费全文 | 6969篇 |
免费 | 457篇 |
国内免费 | 657篇 |
专业分类
化学 | 444篇 |
晶体学 | 4篇 |
力学 | 531篇 |
综合类 | 174篇 |
数学 | 6360篇 |
物理学 | 570篇 |
出版年
2024年 | 8篇 |
2023年 | 77篇 |
2022年 | 97篇 |
2021年 | 129篇 |
2020年 | 139篇 |
2019年 | 152篇 |
2018年 | 165篇 |
2017年 | 181篇 |
2016年 | 178篇 |
2015年 | 153篇 |
2014年 | 296篇 |
2013年 | 446篇 |
2012年 | 290篇 |
2011年 | 396篇 |
2010年 | 357篇 |
2009年 | 456篇 |
2008年 | 460篇 |
2007年 | 443篇 |
2006年 | 443篇 |
2005年 | 383篇 |
2004年 | 295篇 |
2003年 | 336篇 |
2002年 | 304篇 |
2001年 | 284篇 |
2000年 | 239篇 |
1999年 | 236篇 |
1998年 | 215篇 |
1997年 | 203篇 |
1996年 | 136篇 |
1995年 | 104篇 |
1994年 | 82篇 |
1993年 | 69篇 |
1992年 | 50篇 |
1991年 | 29篇 |
1990年 | 31篇 |
1989年 | 17篇 |
1988年 | 17篇 |
1987年 | 15篇 |
1986年 | 16篇 |
1985年 | 28篇 |
1984年 | 26篇 |
1983年 | 15篇 |
1982年 | 21篇 |
1981年 | 17篇 |
1980年 | 21篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1974年 | 3篇 |
排序方式: 共有8083条查询结果,搜索用时 11 毫秒
41.
In this paper, we prove convergence rates for spherical spline Hermite interpolation on the sphere Sd−1 via an error estimate given in a technical report by Luo and Levesley. The functionals in the Hermite interpolation are either point evaluations of pseudodifferential operators or rotational differential operators, the desirable feature of these operators being that they map polynomials to polynomials. Convergence rates for certain derivatives are given in terms of maximum point separation. 相似文献
42.
In this article, the inverse problem of the differential inclusion theory is studied. For a given ε>0 and a continuous set valued map t→W(t), t∈[t0,θ], where W(t)⊂Rn is compact and convex for every t∈[t0,θ], it is required to define differential inclusion so that the Hausdorff distance between the attainable set of the differential inclusion at the time moment t with initial set (t0,W(t0)) and W(t) would be less than ε for every t∈[t0,θ]. 相似文献
43.
A. Babakhani 《Journal of Mathematical Analysis and Applications》2003,278(2):434-442
Existence of positive solutions for the nonlinear fractional differential equation Dsu(x)=f(x,u(x)), 0<s<1, has been studied (S. Zhang, J. Math. Anal. Appl. 252 (2000) 804-812), where Ds denotes Riemann-Liouville fractional derivative. In the present work we study existence of positive solutions in case of the nonlinear fractional differential equation:
L(D)u=f(x,u),u(0)=0,0<x<1, 相似文献
44.
We propose a minimum mean absolute error linear interpolator (MMAELI), based on theL
1 approach. A linear functional of the observed time series due to non-normal innovations is derived. The solution equation
for the coefficients of this linear functional is established in terms of the innovation series. It is found that information
implied in the innovation series is useful for the interpolation of missing values. The MMAELIs of the AR(1) model with innovations
following mixed normal andt distributions are studied in detail. The MMAELI also approximates the minimum mean squared error linear interpolator (MMSELI)
well in mean squared error but outperforms the MMSELI in mean absolute error. An application to a real series is presented.
Extensions to the general ARMA model and other time series models are discussed.
This research was supported by a CityU Research Grant and Natural Science Foundation of China. 相似文献
45.
Endre Boros Khaled Elbassioni Vladimir Gurvich Leonid Khachiyan 《Mathematical Programming》2003,98(1-3):355-368
A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =1××n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=1××n for a system of polymatroid inequalities does not exceed max{Q,logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2c(c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}n, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides .
This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20 相似文献
46.
A. Kopotowski M G. Nadkarni K. P. S. Bhaskara Rao 《Proceedings Mathematical Sciences》2003,113(1):77-86
We discuss subsetsS of ℝn such that every real valued functionf onS is of the formf(x1, x2, ..., xn) =u
1(x1) +u
2(x2) +...+u
n(xn), and the related concepts and situations in analysis. 相似文献
47.
The stable set problem is to find in a simple graph a maximum subset of pairwise non-adjacent vertices. The problem is known to be NP-hard in general and can be solved in polynomial time on some special classes, like cographs or claw-free graphs. Usually, efficient algorithms assume membership of a given graph in a special class. Robust algorithms apply to any graph G and either solve the problem for G or find in it special forbidden configurations. In the present paper we describe several efficient robust algorithms, extending some known results. 相似文献
48.
We study the action of translation operators on wavelet subspaces. This action gives rise to an equivalence relation on the
set of all wavelets. We show by explicit construction that each of the associated equivalence classes is non-empty. 相似文献
49.
In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms—one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling—are compared using as a case study the move‐to‐front (MTF) self‐organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user‐chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003 相似文献
50.
In this note we show that the characterization results for P-matrices due to K.G. Murty and A. Tamir which state that a given square matrixM of ordern is a P-matrix if and only if the linear complementarity problem (q, M) has a unique solution for allq in a specified finite subset of
n
depending onM are incorrect whenn > 3.Research supported by Dr. K.S. Krishnan (DAE) fellowship for research in Mathematics and Computer Science, Bombay, India. 相似文献