全文获取类型
收费全文 | 12731篇 |
免费 | 1199篇 |
国内免费 | 541篇 |
专业分类
化学 | 1454篇 |
晶体学 | 32篇 |
力学 | 1335篇 |
综合类 | 241篇 |
数学 | 9713篇 |
物理学 | 1696篇 |
出版年
2024年 | 24篇 |
2023年 | 131篇 |
2022年 | 223篇 |
2021年 | 387篇 |
2020年 | 295篇 |
2019年 | 308篇 |
2018年 | 354篇 |
2017年 | 473篇 |
2016年 | 453篇 |
2015年 | 315篇 |
2014年 | 585篇 |
2013年 | 847篇 |
2012年 | 743篇 |
2011年 | 630篇 |
2010年 | 579篇 |
2009年 | 706篇 |
2008年 | 719篇 |
2007年 | 806篇 |
2006年 | 676篇 |
2005年 | 582篇 |
2004年 | 468篇 |
2003年 | 472篇 |
2002年 | 439篇 |
2001年 | 401篇 |
2000年 | 371篇 |
1999年 | 296篇 |
1998年 | 297篇 |
1997年 | 267篇 |
1996年 | 185篇 |
1995年 | 208篇 |
1994年 | 166篇 |
1993年 | 138篇 |
1992年 | 126篇 |
1991年 | 106篇 |
1990年 | 92篇 |
1989年 | 70篇 |
1988年 | 60篇 |
1987年 | 46篇 |
1986年 | 43篇 |
1985年 | 66篇 |
1984年 | 64篇 |
1983年 | 17篇 |
1982年 | 32篇 |
1981年 | 29篇 |
1980年 | 35篇 |
1979年 | 39篇 |
1978年 | 24篇 |
1977年 | 36篇 |
1976年 | 19篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 578 毫秒
31.
32.
We consider the problem of minimizing an SC1 function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm. 相似文献
33.
Lihong Wang 《Annals of the Institute of Statistical Mathematics》2004,56(2):251-264
The purpose of this paper is to investigate the asymptotic properties of the least squares estimates (L
2-estimates) and the least absolute deviation estimates (L
1-estimates) of the parameters of a nonlinear regression model subject to a set of equality and inequality restrictions, which
has a long-range dependent stationary process as its stochastic errors. Then we will compare the asymptotic relative efficiencies
of the above estimators. 相似文献
34.
Anna L. Mazzucato 《Transactions of the American Mathematical Society》2003,355(4):1297-1364
This paper is devoted to the analysis of function spaces modeled on Besov spaces and their applications to non-linear partial differential equations, with emphasis on the incompressible, isotropic Navier-Stokes system and semi-linear heat equations. Specifically, we consider the class, introduced by Hideo Kozono and Masao Yamazaki, of Besov spaces based on Morrey spaces, which we call Besov-Morrey or BM spaces. We obtain equivalent representations in terms of the Weierstrass semigroup and wavelets, and various embeddings in classical spaces. We then establish pseudo-differential and para-differential estimates. Our results cover non-regular and exotic symbols. Although the heat semigroup is not strongly continuous on Morrey spaces, we show that its action defines an equivalent norm. In particular, homogeneous BM spaces belong to a larger class constructed by Grzegorz Karch to analyze scaling in parabolic equations. We compare Karch's results with those of Kozono and Yamazaki and generalize them by obtaining short-time existence and uniqueness of solutions for arbitrary data with subcritical regularity. We exploit pseudo-differential calculus to extend the analysis to compact, smooth, boundaryless, Riemannian manifolds. BM spaces are defined by means of partitions of unity and coordinate patches, and intrinsically in terms of functions of the Laplace operator.
35.
本对于全局优化问题提出一个改进的进化规划算法,该算法以概率p接收基于电磁理论求出合力方向作为随机搜索方向,以概率1-p接收按正态分布产生的随机搜索方向。改进算法不仅克服了传统进化规划算法随机搜索的盲目性,而且保留了传统进化规划算法全局搜索性。本算法应用于几个典型例题,数值结果表明本算法是可行的,有效的。 相似文献
36.
从决策有限理性角度,引入行为金融理论于机构投资风险优化系统,对多心理账户条件下机构投资的风险优化设计进行了研究。以Friedman和Savage之谜为释例,对机构投资风险优化中的诸多非标准金融异像进行了解释。以Shefrin和Statman行为证券组合理论为核心,建立了多心理账户条件下机构投资的风险优化模型,为机构投资的风险优化实践提供了一种量化分析工具。 相似文献
37.
研究了Banach空间中非线性混合型微分-积分方程初值问题u′=f(t,u,Tu,Su),u(0)=x0的整体解,完全没有要求f的任何增性,利用Mnch不动点定理和比较结果得到了初值问题整体解的存在性和唯一解,并且给出了一致收敛于唯一解的迭代序列,改进推广和统一了已有的许多结果. 相似文献
38.
39.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
40.
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large. 相似文献