全文获取类型
收费全文 | 9758篇 |
免费 | 734篇 |
国内免费 | 273篇 |
专业分类
化学 | 1265篇 |
晶体学 | 28篇 |
力学 | 1081篇 |
综合类 | 149篇 |
数学 | 6869篇 |
物理学 | 1373篇 |
出版年
2024年 | 15篇 |
2023年 | 100篇 |
2022年 | 208篇 |
2021年 | 331篇 |
2020年 | 199篇 |
2019年 | 218篇 |
2018年 | 235篇 |
2017年 | 329篇 |
2016年 | 306篇 |
2015年 | 222篇 |
2014年 | 450篇 |
2013年 | 555篇 |
2012年 | 614篇 |
2011年 | 471篇 |
2010年 | 444篇 |
2009年 | 556篇 |
2008年 | 554篇 |
2007年 | 608篇 |
2006年 | 493篇 |
2005年 | 438篇 |
2004年 | 339篇 |
2003年 | 318篇 |
2002年 | 294篇 |
2001年 | 273篇 |
2000年 | 265篇 |
1999年 | 205篇 |
1998年 | 219篇 |
1997年 | 203篇 |
1996年 | 142篇 |
1995年 | 163篇 |
1994年 | 138篇 |
1993年 | 114篇 |
1992年 | 103篇 |
1991年 | 86篇 |
1990年 | 76篇 |
1989年 | 62篇 |
1988年 | 47篇 |
1987年 | 41篇 |
1986年 | 38篇 |
1985年 | 53篇 |
1984年 | 50篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 171 毫秒
971.
Hideaki Iiduka 《Applied mathematics and computation》2011,217(13):6315-6327
Many constrained sets in problems such as signal processing and optimal control can be represented as a fixed point set of a certain nonexpansive mapping, and a number of iterative algorithms have been presented for solving a convex optimization problem over a fixed point set. This paper presents a novel gradient method with a three-term conjugate gradient direction that is used to accelerate conjugate gradient methods for solving unconstrained optimization problems. It is guaranteed that the algorithm strongly converges to the solution to the problem under the standard assumptions. Numerical comparisons with the existing gradient methods demonstrate the effectiveness and fast convergence of this algorithm. 相似文献
972.
This paper presents extended artificial physics optimization (EAPO), a population-based, stochastic, evolutionary algorithm (EA) for multidimensional search and optimization. EAPO extends the physicomimetics-based Artificial Physics Optimization (APO) algorithm by including each individual’s best fitness history. Including the history improves EAPO’s search capability compared to APO. EAPO and APO invoke a gravitational metaphor in which the force of gravity may be attractive or repulsive, the aggregate effect of which is to move individuals toward local and global optima. A proof of convergence is presented that reveals the conditions under which EAPO is guaranteed to converge. Discrete-time linear system theory is used to develop a second-order difference equation for an individual’s stochastic position vector as a function of time step. Stable solutions require eigenvalues inside the unit circle, leading to explicit convergence criteria relating the run parameters {mi, w, G}. EAPO is tested against several benchmark functions with excellent results. The algorithm converges more quickly than APO and with better diversity. 相似文献
973.
《Applied mathematics and computation》2011,217(22):9368-9379
The Ising model, introduced almost 100 years ago by Wilhelm Lenz and Ernst Ising, is the formalism still popular as a tool to describe magnetic properties of a wide class of materials. Among many issues which arise when using this model there exist problems related to the process of finding minimum energy of the system. Since these problems are NP-hard, optimizations can either be performed for some approximated cases or be the subject of global optimization techniques. In this paper we present an analysis of the effect of different crossover operators on the efficiency of genetic algorithm used to minimize energy in the Ising model. Although it is not a benchmark tool, we hope it may be interesting as a testing tool. 相似文献
974.
Tzyy-Chyang LuJyh-Ching Juang 《Applied mathematics and computation》2011,218(6):2516-2532
This work presents the evolutionary quantum-inspired space search algorithm (QSSA) for solving numerical optimization problems. In the proposed algorithm, the feasible solution space is decomposed into regions in terms of quantum representation. As the search progresses from one generation to the next, the quantum bits evolve gradually to increase the probability of selecting the regions that render good fitness values. Through the inherent probabilistic mechanism, the QSSA initially behaves as a global search algorithm and gradually evolves into a local search algorithm, yielding a good balance between exploration and exploitation. To prevent a premature convergence and to speed up the overall search speed, an overlapping strategy is also proposed. The QSSA is applied to a series of numerical optimization problems. The experiments show that the results obtained by the QSSA are quite competitive compared to those obtained using state-of-the-art IPOP-CMA-ES and QEA. 相似文献
975.
Samira El Moumen Rachid EllaiaRajae Aboulaich 《Applied mathematics and computation》2011,218(7):3265-3276
In this paper we present a new hybrid method, called the SASP method. The purpose of this method is the hybridization of the simulated annealing (SA) with the descent method, where we estimate the gradient using simultaneous perturbation. Firstly, the new hybrid method finds a local minimum using the descent method, then SA is executed in order to escape from the currently discovered local minimum to a better one, from which the descent method restarts a new local search, and so on until convergence.The new hybrid method can be widely applied to a class of global optimization problems for continuous functions with constraints. Experiments on 30 benchmark functions, including high dimensional functions, show that the new method is able to find near optimal solutions efficiently. In addition, its performance as a viable optimization method is demonstrated by comparing it with other existing algorithms. Numerical results improve the robustness and efficiency of the method presented. 相似文献
976.
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling 总被引:1,自引:0,他引:1
We extend the classical linear assignment problem to the case where the cost of assigning agent j to task i is a multiplication of task i’s cost parameter by a cost function of agent j. The cost function of agent j is a linear function of the amount of resource allocated to the agent. A solution for our assignment problem is defined by the assignment of agents to tasks and by a resource allocation to each agent. The quality of a solution is measured by two criteria. The first criterion is the total assignment cost and the second is the total weighted resource consumption. We address these criteria via four different problem variations. We prove that our assignment problem is NP-hard for three of the four variations, even if all the resource consumption weights are equal. However, and somewhat surprisingly, we find that the fourth variation is solvable in polynomial time. In addition, we find that our assignment problem is equivalent to a large set of important scheduling problems whose complexity has been an open question until now, for three of the four variations. 相似文献
977.
978.
We examine the model-building issue related to multi-objective estimation of distribution algorithms (MOEDAs) and show that some of their, as yet overlooked, characteristics render most current MOEDAs unviable when addressing optimization problems with many objectives. We propose a novel model-building growing neural gas (MB-GNG) network that is specially devised for properly dealing with that issue and therefore yields a better performance. Experiments are conducted in order to show from an empirical point of view the advantages of the new algorithm. 相似文献
979.
The aim of this paper is to propose a variational piecewise constant level set method for solving elliptic shape and topology optimization problems. The original model is approximated by a two-phase optimal shape design problem by the ersatz material approach. Under the piecewise constant level set framework, we first reformulate the two-phase design problem to be a new constrained optimization problem with respect to the piecewise constant level set function. Then we solve it by the projection Lagrangian method. A gradient-type iterative algorithm is presented. Comparisons between our numerical results and those obtained by level set approaches show the effectiveness, accuracy and efficiency of our algorithm. 相似文献
980.
Yigui Ou 《Applied Numerical Mathematics》2011,61(7):900-909
This paper presents a hybrid trust region algorithm for unconstrained optimization problems. It can be regarded as a combination of ODE-based methods, line search and trust region techniques. A feature of the proposed method is that at each iteration, a system of linear equations is solved only once to obtain a trial step. Further, when the trial step is not accepted, the method performs an inexact line search along it instead of resolving a new linear system. Under reasonable assumptions, the algorithm is proven to be globally and superlinearly convergent. Numerical results are also reported that show the efficiency of this proposed method. 相似文献