全文获取类型
收费全文 | 901篇 |
免费 | 88篇 |
国内免费 | 75篇 |
专业分类
化学 | 29篇 |
力学 | 56篇 |
综合类 | 7篇 |
数学 | 376篇 |
物理学 | 134篇 |
综合类 | 462篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 13篇 |
2021年 | 12篇 |
2020年 | 12篇 |
2019年 | 24篇 |
2018年 | 24篇 |
2017年 | 34篇 |
2016年 | 24篇 |
2015年 | 30篇 |
2014年 | 57篇 |
2013年 | 66篇 |
2012年 | 52篇 |
2011年 | 60篇 |
2010年 | 66篇 |
2009年 | 46篇 |
2008年 | 47篇 |
2007年 | 62篇 |
2006年 | 51篇 |
2005年 | 43篇 |
2004年 | 36篇 |
2003年 | 43篇 |
2002年 | 31篇 |
2001年 | 27篇 |
2000年 | 31篇 |
1999年 | 27篇 |
1998年 | 20篇 |
1997年 | 19篇 |
1996年 | 13篇 |
1995年 | 6篇 |
1994年 | 14篇 |
1993年 | 12篇 |
1992年 | 4篇 |
1991年 | 11篇 |
1990年 | 9篇 |
1989年 | 8篇 |
1988年 | 4篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 5篇 |
1982年 | 1篇 |
1980年 | 1篇 |
排序方式: 共有1064条查询结果,搜索用时 484 毫秒
1.
2.
非线性互补问题的一种全局收敛的显式光滑Newton方法 总被引:2,自引:0,他引:2
本针对Po函数非线性互补问题,给出了一种显式光滑Newton方法,该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程,并在适当的假设条件下,证明了算法的全局收敛性。 相似文献
3.
XIANG Guang-li CHEN Xin-meng ZHU Ping MA Jie 《武汉大学学报:自然科学英文版》2006,11(1):181-184
The existing homomorphie eneryption scheme is based on ring of the integer, and the possible operators are restricted to addition and multiplication only. In this paper, a new operation is defined Similar Modul. Base on the Similar Modul, the number sets of the homomorphic encryption scheme is extended to real number, and the possible operators are extended to addition, subtraction, multiplication and division. Our new approach provides a practical ways of implementation because of the extension of the operators and the number sets. 相似文献
4.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically
by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually
employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be
“close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence
many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report
results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process
can be improved to better reflect the actual properties sought.
In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend
themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms
of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling
approach may possibly lead to algorithms with improved efficiency.
AMS subject classification (2000) 65L05, 65M32, 65N21, 65N22, 65D18 相似文献
5.
Testing for additivity with B-splines 总被引:1,自引:0,他引:1
Regression splines are often used for fitting nonparametric functions, and they work especially well for additivity models. In this paper, we consider two simple tests of additivity: an adaptation of Tukey's one degree of freedom test and a nonparametric version of Rao's score test. While the Tukey-type test can detect most forms of the local non-additivity at the parametric rate of O(n-1/2), the score test is consistent for all alternative at a nonparametric rate. The asymptotic distribution of these test statistics is derived under both the null and local alternative hypotheses. A simulation study is conducted to compare their finite-sample performances with some existing kernel-based tests. The score test is found to have a good overall performance. 相似文献
6.
This paper proposes a method for estimation of a class of partially linear single-index models with randomly censored samples. The method provides a flexible way for modelling the association between a response and a set of predictor variables when the response variable is randomly censored. It presents a technique for “dimension reduction” in semiparametric censored regression models and generalizes the existing accelerated failure-time models for survival analysis. The estimation procedure involves three stages: first, transform the censored data into synthetic data or pseudo-responses unbiasedly; second, obtain quasi-likelihood estimates of the regression coefficients in both linear and single-index components by an iteratively algorithm; finally, estimate the unknown nonparametric regression function using techniques for univariate censored nonparametric regression. The estimators for the regression coefficients are shown to be jointly root-n consistent and asymptotically normal. In addition, the estimator for the unknown regression function is a local linear kernel regression estimator and can be estimated with the same efficiency as all the parameters are known. Monte Carlo simulations are conducted to illustrate the proposed methodology. 相似文献
7.
周叶 《西安石油大学学报(自然科学版)》1993,(3)
本文提出了一种建立反向马尔可夫模型的新方法.并用点估计理论证明了离散时间系统的固定区间平滑状态估计可以分解为两个最优估计的线性组合. 相似文献
8.
Dirk P. Kroese Sergey Porotsky Reuven Y. Rubinstein 《Methodology and Computing in Applied Probability》2006,8(3):383-407
In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In
this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness
of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear
constraints.
相似文献
9.
We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples. 相似文献
10.
In this paper we consider the problem of estimating an unknown joint distribution which is defined over mixed discrete and continuous variables. A nonparametric kernel approach is proposed with smoothing parameters obtained from the cross-validated minimization of the estimator's integrated squared error. We derive the rate of convergence of the cross-validated smoothing parameters to their ‘benchmark’ optimal values, and we also establish the asymptotic normality of the resulting nonparametric kernel density estimator. Monte Carlo simulations illustrate that the proposed estimator performs substantially better than the conventional nonparametric frequency estimator in a range of settings. The simulations also demonstrate that the proposed approach does not suffer from known limitations of the likelihood cross-validation method which breaks down with commonly used kernels when the continuous variables are drawn from fat-tailed distributions. An empirical application demonstrates that the proposed method can yield superior predictions relative to commonly used parametric models. 相似文献