全文获取类型
收费全文 | 6772篇 |
免费 | 465篇 |
国内免费 | 234篇 |
专业分类
化学 | 808篇 |
晶体学 | 55篇 |
力学 | 749篇 |
综合类 | 38篇 |
数学 | 4234篇 |
物理学 | 1587篇 |
出版年
2024年 | 6篇 |
2023年 | 59篇 |
2022年 | 103篇 |
2021年 | 121篇 |
2020年 | 190篇 |
2019年 | 194篇 |
2018年 | 173篇 |
2017年 | 169篇 |
2016年 | 188篇 |
2015年 | 199篇 |
2014年 | 349篇 |
2013年 | 807篇 |
2012年 | 351篇 |
2011年 | 417篇 |
2010年 | 395篇 |
2009年 | 463篇 |
2008年 | 430篇 |
2007年 | 445篇 |
2006年 | 314篇 |
2005年 | 209篇 |
2004年 | 212篇 |
2003年 | 191篇 |
2002年 | 181篇 |
2001年 | 145篇 |
2000年 | 134篇 |
1999年 | 98篇 |
1998年 | 110篇 |
1997年 | 95篇 |
1996年 | 93篇 |
1995年 | 73篇 |
1994年 | 73篇 |
1993年 | 60篇 |
1992年 | 51篇 |
1991年 | 43篇 |
1990年 | 51篇 |
1989年 | 20篇 |
1988年 | 28篇 |
1987年 | 38篇 |
1986年 | 18篇 |
1985年 | 19篇 |
1984年 | 26篇 |
1983年 | 9篇 |
1982年 | 15篇 |
1981年 | 19篇 |
1980年 | 16篇 |
1979年 | 14篇 |
1978年 | 17篇 |
1977年 | 16篇 |
1976年 | 14篇 |
1975年 | 5篇 |
排序方式: 共有7471条查询结果,搜索用时 109 毫秒
991.
Haisen Zhang 《Numerical Functional Analysis & Optimization》2013,34(6):752-776
In this article, a stochastic theta method for a reflected stochastic differential equation is proposed. When the parameter θ = 0, this method coincides with the projection Euler scheme; while when the parameter θ = 1, it is called an implicit projection Euler scheme which is first proposed in this article. Under some conditions, the strong convergence and the A-stability of this numerical scheme are proved. 相似文献
992.
Martin Hanke 《Numerical Functional Analysis & Optimization》2013,34(9-10):971-993
This paper develops truncated Newton methods as an appropriate tool for nonlinear inverse problems which are ill-posed in the sense of Hadamard. In each Newton step an approximate solution for the linearized problem is computed with the conjugate gradient method as an inner iteration. The conjugate gradient iteration is terminated when the residual has been reduced to a prescribed percentage. Under certain assumptions on the nonlinear operator it is shown that the algorithm converges and is stable if the discrepancy principle is used to terminate the outer iteration. These assumptions are fulfilled, e.g., for the inverse problem of identifying the diffusion coefficient in a parabolic differential equation from distributed data. 相似文献
993.
Necessary conditions for optimal control problems with state-control variable inequality constraints are obtained via mathematical programming formulation and functional analysis in Banach space. These conditions are general ones that hold without any constraint qualifications but differentiability. Furthermore, these conditions are shown to be equivalent to the classical result in the presence of the linear independence constraint qualification. 相似文献
994.
Wei Pan 《Journal of computational and graphical statistics》2013,22(1):109-120
Abstract The iterative convex minorant (ICM) algorithm proposed by Groeneboom and Wellner is fast in computing the NPMLE of the distribution function for interval censored data without covariates. We reformulate the ICM as a generalized gradient projection method (GGP), which leads to a natural extension to the Cox model. It is also easily extended to support Tibshirani's Lasso method. Some simulation results are also shown. For illustration we reanalyze two real datasets. 相似文献
995.
Gael M. Martin Brendan P. M. McCabe David T. Frazier Worapree Maneesoonthorn Christian P. Robert 《Journal of computational and graphical statistics》2013,22(3):508-522
A computationally simple approach to inference in state space models is proposed, using approximate Bayesian computation (ABC). ABC avoids evaluation of an intractable likelihood by matching summary statistics for the observed data with statistics computed from data simulated from the true process, based on parameter draws from the prior. Draws that produce a “match” between observed and simulated summaries are retained, and used to estimate the inaccessible posterior. With no reduction to a low-dimensional set ofsufficient statistics being possible in the state space setting, we define the summaries as the maximum of an auxiliary likelihood function, and thereby exploit the asymptotic sufficiency of this estimator for the auxiliary parameter vector. We derive conditions under which this approach—including a computationally efficient version based on the auxiliary score—achieves Bayesian consistency. To reduce the well-documented inaccuracy of ABC in multiparameter settings, we propose the separate treatment of each parameter dimension using an integrated likelihood technique. Three stochastic volatility models for which exact Bayesian inference is either computationally challenging, or infeasible, are used for illustration. We demonstrate that our approach compares favorably against an extensive set of approximate and exact comparators. An empirical illustration completes the article. Supplementary materials for this article are available online. 相似文献
996.
Cong Xu Paul Baines Jane-Ling Wang 《Journal of computational and graphical statistics》2013,22(3):771-791
In this article, we present a novel method to obtain both improved estimates and reliable stopping rules for stochastic optimization algorithms such as the Monte Carlo EM (MCEM) algorithm. By characterizing a stationary point, θ*, of the algorithm as the solution to a fixed point equation, we provide a parameter estimation procedure by solving for the fixed point of the update mapping. We investigate various ways to model the update mapping, including the use of a local linear (regression) smoother. This simple approach allows increased stability in estimating the value of θ* as well as providing a natural quantification of the estimation uncertainty. These uncertainty measures can then also be used to construct convergence criteria that reflect the inherent randomness in the algorithm. We establish convergence properties of our modified estimator. In contrast to existing literature, our convergence results do not require the Monte Carlo sample size to go to infinity. Simulation studies are provided to illustrate the improved stability and reliability of our estimator. 相似文献
997.
《Journal of computational and graphical statistics》2013,22(1):140-153
Boosting is a successful method for dealing with problems of high-dimensional classification of independent data. However, existing variants do not address the correlations in the context of longitudinal or cluster study-designs with measurements collected across two or more time points or in clusters. This article presents two new variants of boosting with a focus on high-dimensional classification problems with matched-pair binary responses or, more generally, any correlated binary responses. The first method is based on the generic functional gradient descent algorithm and the second method is based on a direct likelihood optimization approach. The performance and the computational requirements of the algorithms were evaluated using simulations. Whereas the performance of the two methods is similar, the computational efficiency of the generic-functional-gradient-descent-based algorithm far exceeds that of the direct-likelihood-optimization-based algorithm. The former method is illustrated using data on gene expression changes in de novo and relapsed childhood acute lymphoblastic leukemia. Computer code implementing the algorithms and the relevant dataset are available online as supplemental materials. 相似文献
998.
《Journal of computational and graphical statistics》2013,22(3):608-632
The problem of marginal density estimation for a multivariate density function f(x) can be generally stated as a problem of density function estimation for a random vector λ(x) of dimension lower than that of x. In this article, we propose a technique, the so-called continuous Contour Monte Carlo (CCMC) algorithm, for solving this problem. CCMC can be viewed as a continuous version of the contour Monte Carlo (CMC) algorithm recently proposed in the literature. CCMC abandons the use of sample space partitioning and incorporates the techniques of kernel density estimation into its simulations. CCMC is more general than other marginal density estimation algorithms. First, it works for any density functions, even for those having a rugged or unbalanced energy landscape. Second, it works for any transformation λ(x) regardless of the availability of the analytical form of the inverse transformation. In this article, CCMC is applied to estimate the unknown normalizing constant function for a spatial autologistic model, and the estimate is then used in a Bayesian analysis for the spatial autologistic model in place of the true normalizing constant function. Numerical results on the U.S. cancer mortality data indicate that the Bayesian method can produce much more accurate estimates than the MPLE and MCMLE methods for the parameters of the spatial autologistic model. 相似文献
999.
《Journal of computational and graphical statistics》2013,22(4):751-769
This article presents a new particle filter algorithm which uses random quasi-Monte-Carlo to propagate particles. The filter can be used generally, but here it is shown that for one-dimensional state-space models, if the number of particles is N, then the rate of convergence of this algorithm is N?1. This compares favorably with the N?1/2 convergence rate of standard particle filters. The computational complexity of the new filter is quadratic in the number of particles, as opposed to the linear computational complexity of standard methods. I demonstrate the new filter on two important financial time series models, an ARCH model and a stochastic volatility model. Simulation studies show that for fixed CPU time, the new filter can be orders of magnitude more accurate than existing particle filters. The new filter is particularly efficient at estimating smooth functions of the states, where empirical rates of convergence are N?3/2; and for performing smoothing, where both the new and existing filters have the same computational complexity. 相似文献
1000.
This is the third part of a trilogy on parallel solution of the linear elasticity problem. We consider the separate displacement ordering for a plain isotropic problem with full Dirichlet boundary conditions. The parallel solution methods presented in the first two parts of the trilogy are here generalised to higher order by using hierarchical finite elements. We discuss node numberings on regular grids for high degree of parallelism and even processor load as well as the problem of stability of the modified incomplete Cholesky factorisations used. Several preconditioning techniques for the conjugate gradient method are studied and compared for quadratic finite elements. Bounds for the condition numbers of the corresponding preconditioning methods are derived, and computer experiments are performed in order to confirm the theory and give recommendations on the choice of method. The parallel implementation is performed by message passing interface. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献