全文获取类型
收费全文 | 23585篇 |
免费 | 1394篇 |
国内免费 | 1074篇 |
专业分类
化学 | 1517篇 |
晶体学 | 32篇 |
力学 | 1113篇 |
综合类 | 200篇 |
数学 | 6703篇 |
物理学 | 1643篇 |
综合类 | 14845篇 |
出版年
2024年 | 116篇 |
2023年 | 311篇 |
2022年 | 588篇 |
2021年 | 641篇 |
2020年 | 496篇 |
2019年 | 496篇 |
2018年 | 500篇 |
2017年 | 651篇 |
2016年 | 632篇 |
2015年 | 645篇 |
2014年 | 1158篇 |
2013年 | 1152篇 |
2012年 | 1395篇 |
2011年 | 1343篇 |
2010年 | 1104篇 |
2009年 | 1233篇 |
2008年 | 1267篇 |
2007年 | 1587篇 |
2006年 | 1382篇 |
2005年 | 1154篇 |
2004年 | 1077篇 |
2003年 | 952篇 |
2002年 | 823篇 |
2001年 | 770篇 |
2000年 | 636篇 |
1999年 | 523篇 |
1998年 | 487篇 |
1997年 | 422篇 |
1996年 | 347篇 |
1995年 | 330篇 |
1994年 | 273篇 |
1993年 | 248篇 |
1992年 | 233篇 |
1991年 | 195篇 |
1990年 | 162篇 |
1989年 | 152篇 |
1988年 | 117篇 |
1987年 | 84篇 |
1986年 | 61篇 |
1985年 | 59篇 |
1984年 | 51篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1955年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
文章给出了一个解决一般约束最优化问题的含调节参数型的牛顿算法.算法有两个重要特征,首先,算法借助Lagrange函数和NcP中的F-B函数,通过构造等价于点条件的线性方程组采处理一般约束优化问题,其次,利用F-B函数的光滑性质,定义了调节参数,从而弱化了K-T点条件.文章在适当的条件下,证明了该算法具有全局收敛性.数值实验表明算法有效. 相似文献
122.
In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see
[Polyak in Math Program 54:177–222, 1992; Polyak in Math Program Ser A 92:197–235, 2002; Polyak and Teboulle in Math Program
76:265–284, 1997] and references therein). The formulation of the linear SVM based on the NR method leads to an algorithm
which reduces the number of support vectors without compromising the classification performance compared to the linear soft-margin
SVM formulation. The NR algorithm computes both the primal and the dual approximation at each step. The dual variables associated
with the given data-set provide important information about each data point and play the key role in selecting the set of
support vectors. Experimental results on ten benchmark classification problems show that the NR formulation is feasible. The
quality of discrimination, in most instances, is comparable to the linear soft-margin SVM while the number of support vectors
in several instances were substantially reduced. 相似文献
123.
124.
杨莉 《科技情报开发与经济》2007,17(23):34-35
分析了外文书刊书目回溯建库的必要性,介绍了江汉大学图书馆外文书目数据库建设现状,对其外文书刊书目回溯建库提出了几点建议。 相似文献
125.
王富强 《科技情报开发与经济》2007,17(1):235-236
讨论了建立采掘GIS数据库的必要性,分析了采掘GIS数据库的建立过程,论述了数据库的空间分析和管理功能。 相似文献
126.
J. Haslinger T. Kozubek K. Kunisch G. Peichl 《Journal of Mathematical Analysis and Applications》2004,290(2):665-685
This contribution combines a shape optimization approach to free boundary value problems of Bernoulli type with an embedding domain technique. A theoretical framework is developed which allows to prove continuous dependence of the primal and dual variables in the resulting saddle point problems with respect to the domain. This ensures the existence of a solution of a related shape optimization problem in a sufficiently large class of admissible domains. 相似文献
127.
Grundel D. A. Oliveira C. A. S. Pardalos P. M. 《Journal of Optimization Theory and Applications》2004,122(3):487-500
The multidimensional assignment problem (MAP) is a NP-hard combinatorial optimization problem, occurring in many applications, such as data association. In this paper, we prove two conjectures made in Ref. 1 and based on data from computational experiments on MAPs. We show that the mean optimal objective function cost of random instances of the MAP goes to zero as the problem size increases, when assignment costs are independent exponentially or uniformly distributed random variables. We prove also that the mean optimal solution goes to negative infinity when assignment costs are independent normally distributed random variables. 相似文献
128.
Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques
to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and
search graphs. We propose Branch and Win, a general formulation for understanding and synthesising the different tree search
procedures that have been presented in the literature of operations research as well as in that of artificial intelligence.
Several general ideas are also presented, whose application allows designing new hybrid search algorithms, in order to implement
the procedure. 相似文献
129.
We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples. 相似文献
130.
Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems 总被引:2,自引:0,他引:2
This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems.
We first present a brief review of MILP and MINLP for the case when these problems are modeled with algebraic equations and
inequalities. Since algebraic representations have some limitations such as difficulty of formulation and numerical singularities
for the nonlinear case, we consider logic-based modeling as an alternative approach, particularly Generalized Disjunctive
Programming (GDP), which the authors have extensively investigated over the last few years. Solution strategies for GDP models
are reviewed, including the continuous relaxation of the disjunctive constraints. Also, we briefly review a hybrid model that
integrates disjunctive programming and mixed-integer programming. Finally, the global optimization of nonconvex GDP problems
is discussed through a two-level branch and bound procedure. 相似文献