全文获取类型
收费全文 | 11454篇 |
免费 | 783篇 |
国内免费 | 448篇 |
专业分类
化学 | 2214篇 |
晶体学 | 62篇 |
力学 | 1285篇 |
综合类 | 146篇 |
数学 | 6858篇 |
物理学 | 2120篇 |
出版年
2024年 | 25篇 |
2023年 | 160篇 |
2022年 | 372篇 |
2021年 | 385篇 |
2020年 | 272篇 |
2019年 | 274篇 |
2018年 | 296篇 |
2017年 | 380篇 |
2016年 | 368篇 |
2015年 | 277篇 |
2014年 | 550篇 |
2013年 | 657篇 |
2012年 | 715篇 |
2011年 | 630篇 |
2010年 | 527篇 |
2009年 | 656篇 |
2008年 | 658篇 |
2007年 | 699篇 |
2006年 | 568篇 |
2005年 | 471篇 |
2004年 | 382篇 |
2003年 | 345篇 |
2002年 | 319篇 |
2001年 | 293篇 |
2000年 | 292篇 |
1999年 | 224篇 |
1998年 | 249篇 |
1997年 | 223篇 |
1996年 | 157篇 |
1995年 | 179篇 |
1994年 | 143篇 |
1993年 | 134篇 |
1992年 | 114篇 |
1991年 | 87篇 |
1990年 | 81篇 |
1989年 | 67篇 |
1988年 | 54篇 |
1987年 | 43篇 |
1986年 | 44篇 |
1985年 | 56篇 |
1984年 | 51篇 |
1983年 | 15篇 |
1982年 | 24篇 |
1981年 | 22篇 |
1980年 | 19篇 |
1979年 | 38篇 |
1978年 | 20篇 |
1977年 | 31篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
31.
This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly 相似文献
32.
Whilst the space volume of muffler in noise control system is often constrained for maintenance in practical engineering work, the maximization on muffler’s performance becomes important and essential. In this paper, a novel approach genetic algorithms (GAs) based on the principles of natural biological evolution will be used to tackle this optimization of muffler design [M. Mitchell, An Introduction to Genetic Algorithms, The MIT Press, Cambridge, MA, 1996]. Here, the shape optimization of multi-segments muffler coupled with the GA searching technique is presented. The techniques of binary genetic algorithms (BGA) together with the commercial MATLAB package [G. Lindfield, J. Penny, Numerical Method Using Matlab, second ed., Prentice Hall, Englewood Cliffs, NJ, 2000] are applied in GA searching. In addition, a numerical case of pure tone elimination with 2-5 segments on muffler is introduced and fully discussed. To achieve the best optimization in GA, several GA parameters are on trial in various values. Results show that the GA operators, including crossover mutation and elitism, are essential in accuracy. Consequently, results verify that the optimal sound transmission loss at the designed frequency of 500 Hz is exactly maximized. The GA optimization on multi-segments muffler proposed in this study surely provides a quick and correct approach. 相似文献
33.
L.G. Casado I. García T. Csendes V.G. Ruíz 《Journal of Optimization Theory and Applications》2003,118(1):27-43
Based on the investigation carried out in Ref. 1, this paper incorporates new studies about the properties of inclusion functions on subintervals while a branch-and-bound algorithm is solving global optimization problems. It is found that the relative place of the global minimum value within the inclusion function value of the objective function at the current interval indicates mostly whether the given interval is close to a minimizer point. This information is used in a heuristic interval rejection rule that can save a considerable amount of computation. Illustrative examples are discussed and an extended numerical study shows the advantages of the new approach. 相似文献
34.
The system design must be started from the concept with low cost and high performance. In this point, the topological shape of the structure is very important in the view of the structural rigidities and light-weight design.In this paper, the optimization methodology is presented in the design stage of the large optical mirror. We obtain the optimal layout through the topology optimization and then design the details through the size or shape optimization for structural rigidity. 相似文献
35.
Andrea Grosso Marco Locatelli Fabio Schoen 《Computational Optimization and Applications》2007,38(3):351-370
In this paper we perform a computational analysis of a population based approach for global optimization, Population Basin
Hopping (PBH), which was proven to be very efficient on very challenging global optimization problems by the authors (see
). The experimental analysis aims at understanding more deeply how the approach works and why it is successful on challenging
problems. 相似文献
36.
In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques. 相似文献
37.
C. Bogani M. G. Gasparo A. Papini 《Journal of Optimization Theory and Applications》2007,134(1):47-59
We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search
methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that
it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to
ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical
experiments seem to be encouraging.
This work was supported by M.U.R.S.T., Rome, Italy. 相似文献
38.
Protein Conformation of a Lattice Model Using Tabu Search 总被引:1,自引:0,他引:1
We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model. 相似文献
39.
聚醚醚酮链结构与反应的模型化合物的量子化学研究 总被引:1,自引:1,他引:0
利用AM1方法对聚醚醚酮模型化合物全优化,结果为:芳环平均相互扭转角为33.0度,桥键角117.0-118.0度,其分子结构拓扑图形表明:所有苯环(核)为平面构型,但其内角扭曲;其氢原子对苯环构型无实质性贡献,在更长链的计算中,冻结苯核与氢原子也得出满意结果,根据Mulliken键序与电荷讨论了醚交换与磺化反应。 相似文献
40.
Charles Blair 《Mathematical Programming》1995,71(2):127-136
We identify a class of formulas computable in polynomial time such that the functions defined by these formulas are precisely the value functions of mixed-integer programs with rational constraint coefficients. 相似文献