全文获取类型
收费全文 | 11407篇 |
免费 | 753篇 |
国内免费 | 885篇 |
专业分类
化学 | 611篇 |
晶体学 | 7篇 |
力学 | 536篇 |
综合类 | 131篇 |
数学 | 6299篇 |
物理学 | 2025篇 |
综合类 | 3436篇 |
出版年
2024年 | 12篇 |
2023年 | 84篇 |
2022年 | 111篇 |
2021年 | 120篇 |
2020年 | 169篇 |
2019年 | 171篇 |
2018年 | 152篇 |
2017年 | 175篇 |
2016年 | 232篇 |
2015年 | 210篇 |
2014年 | 385篇 |
2013年 | 682篇 |
2012年 | 505篇 |
2011年 | 573篇 |
2010年 | 513篇 |
2009年 | 718篇 |
2008年 | 741篇 |
2007年 | 848篇 |
2006年 | 771篇 |
2005年 | 616篇 |
2004年 | 553篇 |
2003年 | 511篇 |
2002年 | 509篇 |
2001年 | 433篇 |
2000年 | 389篇 |
1999年 | 366篇 |
1998年 | 357篇 |
1997年 | 280篇 |
1996年 | 277篇 |
1995年 | 202篇 |
1994年 | 194篇 |
1993年 | 180篇 |
1992年 | 146篇 |
1991年 | 115篇 |
1990年 | 113篇 |
1989年 | 87篇 |
1988年 | 108篇 |
1987年 | 68篇 |
1986年 | 50篇 |
1985年 | 51篇 |
1984年 | 54篇 |
1983年 | 20篇 |
1982年 | 37篇 |
1981年 | 25篇 |
1980年 | 26篇 |
1979年 | 27篇 |
1978年 | 18篇 |
1977年 | 21篇 |
1976年 | 14篇 |
1974年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 156 毫秒
41.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
42.
侯象乾 《宁夏大学学报(自然科学版)》1992,13(1):1-5
本文探讨由正偶核确定的奇异积分算子对连续函数的逼近常数与对p幂可积函数的逼近常数之间的关系,并由此得到Fejér算子、Jackson算子和Vallee-Poussin算子对p幂可积函数逼近常数的上界。 相似文献
43.
石靖华 《湖北大学学报(自然科学版)》1992,(3)
本文得到Banach空间中右端具Carathěodory条件常微分方程的Galerkin逼近,解的存在性,以及相应两方程解之间的关系。 相似文献
44.
We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1. 相似文献
45.
46.
李冲 《哈尔滨商业大学学报(自然科学版)》1992,(4)
对 C(R)中一类非凸子集,在一特定的距离下,给出了最佳逼近的特征,其中包括 Kolmogorov 型与 Chebyshev 交错型特征定理。作为推论,我们得到了在这距离下有理最佳逼近的特征. 相似文献
47.
庞乾骏 《上海交通大学学报》1996,30(9):24-29,33
提出了一种掺杂离子导体(DIC)的粒子交叠广义晶格模型,由此模型,推导随机-电阻-网络(RRN)理论中3种导电键各自组分的几率,并采用有效介质近似(EMA)计算了DIC系统的电导及其粒子尺度效应。 相似文献
48.
The aim of this paper is to present construction of finite element multiscaling function with three coefficients. In order to illuminate the result, two examples are given finally. 相似文献
49.
Browder-Petryshyn 型的严格伪压缩映射的粘滞迭代逼近方法 总被引:1,自引:0,他引:1
主要研究Browder-Petryshyn型的严格伪压缩映射的粘滞迭代逼近过程,证明了Browder-Petryshyn型的严格伪压缩映射的不动点集F(T)是闭凸集.在q-一致光滑且一致凸的Banach空间中,对于严格伪压缩映射T,利用徐洪坤在2004年引进的粘滞迭代得到的序列弱收敛于T的某个不动点.同时证明了Hilbert空间中Browder-Petryshyn型的严格伪压缩映射的相应迭代序列强收敛到T的某个不动点,其结果推广与改进了徐洪坤2004年的相应结果. 相似文献
50.
Joseph Y.-T. Leung 《Discrete Applied Mathematics》2007,155(8):945-970
We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space. 相似文献