全文获取类型
收费全文 | 20029篇 |
免费 | 2536篇 |
国内免费 | 893篇 |
专业分类
化学 | 2475篇 |
晶体学 | 177篇 |
力学 | 3385篇 |
综合类 | 300篇 |
数学 | 11448篇 |
物理学 | 5673篇 |
出版年
2024年 | 50篇 |
2023年 | 194篇 |
2022年 | 519篇 |
2021年 | 520篇 |
2020年 | 475篇 |
2019年 | 453篇 |
2018年 | 452篇 |
2017年 | 640篇 |
2016年 | 647篇 |
2015年 | 475篇 |
2014年 | 889篇 |
2013年 | 1256篇 |
2012年 | 1127篇 |
2011年 | 966篇 |
2010年 | 924篇 |
2009年 | 1073篇 |
2008年 | 1121篇 |
2007年 | 1275篇 |
2006年 | 1098篇 |
2005年 | 1051篇 |
2004年 | 874篇 |
2003年 | 896篇 |
2002年 | 798篇 |
2001年 | 701篇 |
2000年 | 682篇 |
1999年 | 582篇 |
1998年 | 510篇 |
1997年 | 479篇 |
1996年 | 330篇 |
1995年 | 326篇 |
1994年 | 258篇 |
1993年 | 252篇 |
1992年 | 201篇 |
1991年 | 174篇 |
1990年 | 149篇 |
1989年 | 98篇 |
1988年 | 99篇 |
1987年 | 86篇 |
1986年 | 76篇 |
1985年 | 114篇 |
1984年 | 100篇 |
1983年 | 39篇 |
1982年 | 55篇 |
1981年 | 64篇 |
1980年 | 40篇 |
1979年 | 64篇 |
1978年 | 59篇 |
1977年 | 59篇 |
1976年 | 37篇 |
1974年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
81.
刘国志 《数学的实践与认识》2006,36(12):1-5
提出一个新的具有积压定单的关于模糊订购量的模糊存储模型.在模糊函数原理下,给出了模糊总存储成本.为了寻找最优解,把最优模糊存储模型转化为双目标最优化模型,利用L ingo8.0求解不等式约束问题,我们发现最优解都是确定的实数.此外,当模糊订购量和模糊总需求都是三角形(或权重均为1/2梯形)模糊数时,我们提出模型的最优解与经典的具有积压定单存储模型具有相同的结果. 相似文献
82.
In single-objective optimization it is possible to find a global optimum, while in the multi-objective case no optimal solution is clearly defined, but several that simultaneously optimize all the objectives. However, the majority of this kind of problems cannot be solved exactly as they have very large and highly complex search spaces. Recently, meta-heuristic approaches have become important tools for solving multi-objective problems encountered in industry as well as in the theoretical field. Most of these meta-heuristics use a population of solutions, and hence the runtime increases when the population size grows. An interesting way to overcome this problem is to apply parallel processing. This paper analyzes the performance of several parallel paradigms in the context of population-based multi-objective meta-heuristics. In particular, we evaluate four alternative parallelizations of the Pareto simulated annealing algorithm, in terms of quality of the solutions, and speedup. 相似文献
83.
Ivan Nunes da Silva Wagner Caradori do AmaralLucia Valeria de Arruda 《Applied Mathematical Modelling》2007
This paper presents an efficient approach based on recurrent neural network for solving nonlinear optimization. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid subspace technique. These parameters guarantee the convergence of the network to the equilibrium points that represent an optimal feasible solution. The main advantage of the developed network is that it treats optimization and constraint terms in different stages with no interference with each other. Moreover, the proposed approach does not require specification of penalty and weighting parameters for its initialization. A study of the modified Hopfield model is also developed to analyze its stability and convergence. Simulation results are provided to demonstrate the performance of the proposed neural network. 相似文献
84.
85.
A family of skew Hadamard difference sets 总被引:1,自引:0,他引:1
Cunsheng Ding 《Journal of Combinatorial Theory, Series A》2006,113(7):1526-1535
In 1933 a family of skew Hadamard difference sets was described by Paley using matrix language and was called the Paley-Hadamard difference sets in the literature. During the last 70 years, no new skew Hadamard difference sets were found. It was conjectured that there are no further examples of skew Hadamard difference sets. This conjecture was proved to be true for the cyclic case in 1954, and further progress in favor of this conjecture was made in the past 50 years. However, the conjecture remains open until today. In this paper, we present a family of new perfect nonlinear (also called planar) functions, and construct a family of skew Hadamard difference sets using these perfect nonlinear functions. We show that some of the skew Hadamard difference sets presented in this paper are inequivalent to the Paley-Hadamard difference sets. These new examples of skew Hadamard difference sets discovered 70 years after the Paley construction disprove the longstanding conjecture on skew Hadamard difference sets. The class of new perfect nonlinear functions has applications in cryptography, coding theory, and combinatorics. 相似文献
86.
In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence
number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce
several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches
to the maximum independent set problem. 相似文献
87.
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms 总被引:2,自引:0,他引:2
Hoang Tuy 《Journal of Global Optimization》1991,1(1):23-36
We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exhaustive processes. This result provides the basis for constructing flexible subdivision strategies that can be adapted to take advantage of various problem conditions. 相似文献
88.
本文我们给出一个修正的非线性扩散方程模型,与Cotte Lions和Morel的模型相比该模型有许多实质上的优点。主要的想法是把原来去噪声部分:卷积Gauss过程替代为解一个有界区域上的线性抛物方程问题,因此避开了对初始数值如何全平面延拓的问题。我们从数学上的证明该问题解的存在性和适定性,同时给出对矩形域情况的解的级数形式。最后我们给基于本模型的数值计算差分模型,并且给出几个具体图像在该模型下处理结果。 相似文献
89.
本主要介绍原木经销商在周期内原木变价销售情况下的最佳期初贮存量的决策方法,在建立期望机会成本的数学模型基础上,探讨原木随机存贮策略的最优化问题。 相似文献
90.
Jinyan Fan 《Computational Optimization and Applications》2006,34(2):215-227
In this paper, we present the new trust region method for nonlinear equations with the trust region converging to zero. The
new method preserves the global convergence of the traditional trust region methods in which the trust region radius will
be larger than a positive constant. We study the convergence rate of the new method under the local error bound condition
which is weaker than the nonsingularity. An example given by Y.X. Yuan shows that the convergence rate can not be quadratic.
Finally, some numerical results are given.
This work is supported by Chinese NSFC grants 10401023 and 10371076, Research Grants for Young Teachers of Shanghai Jiao Tong
University, and E-Institute of Computational Sciences of Shanghai Universities.
An erratum to this article is available at . 相似文献