全文获取类型
收费全文 | 1419篇 |
免费 | 38篇 |
国内免费 | 5篇 |
专业分类
化学 | 898篇 |
晶体学 | 2篇 |
力学 | 39篇 |
数学 | 328篇 |
物理学 | 195篇 |
出版年
2022年 | 12篇 |
2021年 | 14篇 |
2020年 | 8篇 |
2019年 | 21篇 |
2018年 | 16篇 |
2017年 | 15篇 |
2016年 | 32篇 |
2015年 | 40篇 |
2014年 | 39篇 |
2013年 | 100篇 |
2012年 | 89篇 |
2011年 | 118篇 |
2010年 | 67篇 |
2009年 | 64篇 |
2008年 | 111篇 |
2007年 | 84篇 |
2006年 | 76篇 |
2005年 | 71篇 |
2004年 | 85篇 |
2003年 | 41篇 |
2002年 | 49篇 |
2001年 | 14篇 |
2000年 | 22篇 |
1999年 | 18篇 |
1998年 | 18篇 |
1997年 | 10篇 |
1996年 | 13篇 |
1995年 | 11篇 |
1994年 | 15篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 8篇 |
1989年 | 6篇 |
1988年 | 4篇 |
1985年 | 8篇 |
1984年 | 13篇 |
1983年 | 6篇 |
1982年 | 4篇 |
1981年 | 9篇 |
1980年 | 9篇 |
1979年 | 9篇 |
1978年 | 17篇 |
1977年 | 4篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 7篇 |
1971年 | 4篇 |
1936年 | 3篇 |
排序方式: 共有1462条查询结果,搜索用时 0 毫秒
61.
Serge Lawrencenko Michael D. Plummer Xiaoya Zha 《Discrete and Computational Geometry》2002,28(3):313-330
Abstract. Let G be an infinite locally finite plane graph with one end and let H be a finite plane subgraph of G . Denote by a(H) the number of finite faces of H and by l(H) the number of the edges of H that are on the boundary of the infinite face or a finite face not in H . Define the isoperimetric constant h (G) to be inf
H
l(H) / a(H) and define the isoperimetric constant h (δ) to be inf
G
h (G) where the infimum is taken over all infinite locally finite plane graphs G having minimum degree δ and exactly one end. We establish the following bounds on h (δ) for δ ≥ 7 :
相似文献
62.
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time. 相似文献
63.
Xiaoyu Liu Serge Guillas Ming-Jun Lai 《Journal of computational and graphical statistics》2016,25(4):1176-1194
Gaussian fields (GFs) are frequently used in spatial statistics for their versatility. The associated computational cost can be a bottleneck, especially in realistic applications. It has been shown that computational efficiency can be gained by doing the computations using Gaussian Markov random fields (GMRFs) as the GFs can be seen as weak solutions to corresponding stochastic partial differential equations (SPDEs) using piecewise linear finite elements. We introduce a new class of representations of GFs with bivariate splines instead of finite elements. This allows an easier implementation of piecewise polynomial representations of various degrees. It leads to GMRFs that can be inferred efficiently and can be easily extended to nonstationary fields. The solutions approximated with higher order bivariate splines converge faster, hence the computational cost can be alleviated. Numerical simulations using both real and simulated data also demonstrate that our framework increases the flexibility and efficiency. Supplementary materials are available online. 相似文献
64.
We study sequences of empirical measures of Euler schemes associated to some non-Markovian SDEs: SDEs driven by Gaussian processes with stationary increments. We obtain the functional convergence of this sequence to a stationary solution to the SDE. Then, we end the paper by some specific properties of this stationary solution. We show that, in contrast to Markovian SDEs, its initial random value and the driving Gaussian process are always dependent. However, under an integral representation assumption, we also obtain that the past of the solution is independent of the future of the underlying innovation process of the Gaussian driving process. 相似文献
65.
Galtchouk Leonid I. Pergamenshchikov Serge M. 《Statistical Inference for Stochastic Processes》2022,25(1):127-158
Statistical Inference for Stochastic Processes - We consider drift estimation problems for high dimension ergodic diffusion processes in nonparametric setting based on observations at discrete... 相似文献
66.
This paper provides computable representations for the evaluation of the probability content of cones in isotropic random fields. A decomposition of quadratic forms in spherically symmetric random vectors is obtained and a representation of their moments is derived in terms of finite sums. These results are combined to obtain the distribution function of quadratic forms in spherically symmetric or central elliptically contoured random vectors. Some numerical examples involving the sample serial covariance are provided. Ratios of quadratic forms are also discussed. 相似文献
67.
The solution of a stationary boundary value problem on a domain with conical points has singularities near these points. Here we first consider existence results in appropriate weighted Sobolev spaces in order to incorporate the singularities. We secondly use these results to prove existence, uniqueness and regularity of solutions of non-autonomous second order evolution equations on such domains. 相似文献
68.
Serge Tabachnikov 《Geometriae Dedicata》2000,80(1-3):201-209
Given a polygon A
1,...,A
n, consider the chain of circles: S
1 inscribed in the angle A
1, S
2 inscribed in the angle A
2 and tangent to S
1, S
3 inscribed in the angle A
3 and tangent to S
2, etc. We describe a class of n-gons for which this process is 2n-periodic. We extend the result to the case when the sides of a polygon are arcs of circles. The case of triangles is known as the Money-Coutts theorem. 相似文献
69.
70.
Serge Gratton Selime G��rol Philippe L. Toint 《Computational Optimization and Applications》2013,54(1):1-25
When solving nonlinear least-squares problems, it is often useful to regularize the problem using a quadratic term, a practice which is especially common in applications arising in inverse calculations. A solution method derived from a trust-region Gauss-Newton algorithm is analyzed for such applications, where, contrary to the standard algorithm, the least-squares subproblem solved at each iteration of the method is rewritten as a quadratic minimization subject to linear equality constraints. This allows the exploitation of duality properties of the associated linearized problems. This paper considers a recent conjugate-gradient-like method which performs the quadratic minimization in the dual space and produces, in exact arithmetic, the same iterates as those produced by a standard conjugate-gradients method in the primal space. This dual algorithm is computationally interesting whenever the dimension of the dual space is significantly smaller than that of the primal space, yielding gains in terms of both memory usage and computational cost. The relation between this dual space solver and PSAS (Physical-space Statistical Analysis System), another well-known dual space technique used in data assimilation problems, is explained. The use of an effective preconditioning technique is proposed and refined convergence bounds derived, which results in a practical solution method. Finally, stopping rules adequate for a trust-region solver are proposed in the dual space, providing iterates that are equivalent to those obtained with a Steihaug-Toint truncated conjugate-gradient method in the primal space. 相似文献