全文获取类型
收费全文 | 15047篇 |
免费 | 1843篇 |
国内免费 | 428篇 |
专业分类
化学 | 1371篇 |
晶体学 | 31篇 |
力学 | 1171篇 |
综合类 | 160篇 |
数学 | 7081篇 |
物理学 | 1766篇 |
无线电 | 5738篇 |
出版年
2024年 | 75篇 |
2023年 | 276篇 |
2022年 | 488篇 |
2021年 | 557篇 |
2020年 | 472篇 |
2019年 | 449篇 |
2018年 | 477篇 |
2017年 | 624篇 |
2016年 | 667篇 |
2015年 | 601篇 |
2014年 | 969篇 |
2013年 | 965篇 |
2012年 | 1089篇 |
2011年 | 906篇 |
2010年 | 708篇 |
2009年 | 818篇 |
2008年 | 870篇 |
2007年 | 874篇 |
2006年 | 704篇 |
2005年 | 624篇 |
2004年 | 464篇 |
2003年 | 435篇 |
2002年 | 394篇 |
2001年 | 352篇 |
2000年 | 328篇 |
1999年 | 242篇 |
1998年 | 264篇 |
1997年 | 220篇 |
1996年 | 165篇 |
1995年 | 177篇 |
1994年 | 152篇 |
1993年 | 130篇 |
1992年 | 113篇 |
1991年 | 92篇 |
1990年 | 77篇 |
1989年 | 66篇 |
1988年 | 51篇 |
1987年 | 41篇 |
1986年 | 38篇 |
1985年 | 58篇 |
1984年 | 53篇 |
1983年 | 15篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
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. 相似文献
102.
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. 相似文献
103.
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. 相似文献
104.
本文介绍了可在微机上实现大规模电信网践模拟的实用化软件SIMUNET,及基所采用的无时钟事件追踪法。该软件可用规划中的电信网络和实际网路的模拟及性能评价,也可用于不同流量控制算法的评价。文中给出一个评价实例。 相似文献
105.
设计IIR数字滤波器的遗传优化算法 总被引:2,自引:0,他引:2
提出了IIR数字滤波器设计的遗传优化法。这是一种模拟自然遗传和达尔文进化理论的随机并行优化算法。首先,详细描述了遗传算法并给出了计算步骤,然后将遗传算法用于IIR数字滤波器的优化设计,最后给出了模拟计算结果。 相似文献
106.
本文主要研究了 Banach 空间上交换算子组的张量积以及 Banach 代数的张量积中交换元组的 Taylor 联合谱,推广了 Vasilescu,F.H.及 Wrobel,V.等人结果。 相似文献
107.
聚醚醚酮链结构与反应的模型化合物的量子化学研究 总被引:1,自引:1,他引:0
利用AM1方法对聚醚醚酮模型化合物全优化,结果为:芳环平均相互扭转角为33.0度,桥键角117.0-118.0度,其分子结构拓扑图形表明:所有苯环(核)为平面构型,但其内角扭曲;其氢原子对苯环构型无实质性贡献,在更长链的计算中,冻结苯核与氢原子也得出满意结果,根据Mulliken键序与电荷讨论了醚交换与磺化反应。 相似文献
108.
109.
Youssef Saab 《Journal of Heuristics》1997,3(3):207-224
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem. 相似文献
110.
We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature. 相似文献