全文获取类型
收费全文 | 40443篇 |
免费 | 3010篇 |
国内免费 | 2489篇 |
专业分类
化学 | 1997篇 |
晶体学 | 43篇 |
力学 | 2002篇 |
综合类 | 433篇 |
数学 | 11462篇 |
物理学 | 4125篇 |
综合类 | 25880篇 |
出版年
2024年 | 229篇 |
2023年 | 529篇 |
2022年 | 1021篇 |
2021年 | 1109篇 |
2020年 | 910篇 |
2019年 | 926篇 |
2018年 | 917篇 |
2017年 | 1228篇 |
2016年 | 1274篇 |
2015年 | 1262篇 |
2014年 | 2123篇 |
2013年 | 2155篇 |
2012年 | 2414篇 |
2011年 | 2493篇 |
2010年 | 1957篇 |
2009年 | 2341篇 |
2008年 | 2359篇 |
2007年 | 2936篇 |
2006年 | 2583篇 |
2005年 | 2090篇 |
2004年 | 1796篇 |
2003年 | 1529篇 |
2002年 | 1347篇 |
2001年 | 1188篇 |
2000年 | 1029篇 |
1999年 | 884篇 |
1998年 | 802篇 |
1997年 | 714篇 |
1996年 | 570篇 |
1995年 | 507篇 |
1994年 | 401篇 |
1993年 | 396篇 |
1992年 | 334篇 |
1991年 | 274篇 |
1990年 | 258篇 |
1989年 | 214篇 |
1988年 | 183篇 |
1987年 | 135篇 |
1986年 | 93篇 |
1985年 | 91篇 |
1984年 | 77篇 |
1983年 | 23篇 |
1982年 | 39篇 |
1981年 | 24篇 |
1980年 | 22篇 |
1979年 | 36篇 |
1978年 | 21篇 |
1977年 | 34篇 |
1976年 | 20篇 |
1955年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
Java程序的优化 总被引:2,自引:0,他引:2
张青 《青海师范大学学报(自然科学版)》2004,(4):42-44
本文通过使用Jayap对Java语言的字节代码进行分析,找到程序中产生瓶颈的原因,给出程序的优化方法。 相似文献
102.
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. 相似文献
103.
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. 相似文献
104.
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. 相似文献
105.
This paper studies the problem of how changes in the design of the genetic algorithm (GA) have an effect on the results obtained in real-life applications. In this study, focused on the application of a GA to the tuning of technical trading rules in the context of financial markets, our tentative thesis is that the GA is robust with respect to design changes. The optimization of technical trading systems is a suitable area for the application of the GA metaheuristic, as the complexity of the problem grows exponentially as new technical rules are added to the system and as the answer time is crucial when applying the system to real-time data. Up to now, most of GAs applications to this subject obviated the question of possible “design dependence” in their results. The data we report, based on our experiments, do not allow us to refute the hypothesis of robustness of the GA to design implementation, when applying to technical trading systems tuning. 相似文献
106.
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. 相似文献
107.
Adam B. Levy 《Mathematical Programming》2007,110(3):615-639
Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies
essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex
enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies
a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations)
cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods,
barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework
relies on addition and chain rules for constraint incorporation which we develop here. 相似文献
108.
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. 相似文献
109.
The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems. 相似文献
110.
数据加密的密码体制与DES算法 总被引:1,自引:0,他引:1
本文论述了保密通信中数据加密的密码体制,并对各种体制地行了比较,指出其优劣,重点论述了数据加密标准DES的算法和特点. 相似文献