全文获取类型
收费全文 | 13628篇 |
免费 | 1511篇 |
国内免费 | 389篇 |
专业分类
化学 | 1321篇 |
晶体学 | 31篇 |
力学 | 1098篇 |
综合类 | 145篇 |
数学 | 6717篇 |
物理学 | 1521篇 |
无线电 | 4695篇 |
出版年
2024年 | 60篇 |
2023年 | 233篇 |
2022年 | 429篇 |
2021年 | 480篇 |
2020年 | 401篇 |
2019年 | 391篇 |
2018年 | 387篇 |
2017年 | 514篇 |
2016年 | 556篇 |
2015年 | 488篇 |
2014年 | 837篇 |
2013年 | 842篇 |
2012年 | 971篇 |
2011年 | 819篇 |
2010年 | 636篇 |
2009年 | 754篇 |
2008年 | 775篇 |
2007年 | 808篇 |
2006年 | 659篇 |
2005年 | 586篇 |
2004年 | 436篇 |
2003年 | 411篇 |
2002年 | 370篇 |
2001年 | 331篇 |
2000年 | 301篇 |
1999年 | 227篇 |
1998年 | 251篇 |
1997年 | 209篇 |
1996年 | 156篇 |
1995年 | 172篇 |
1994年 | 143篇 |
1993年 | 127篇 |
1992年 | 107篇 |
1991年 | 90篇 |
1990年 | 76篇 |
1989年 | 64篇 |
1988年 | 50篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 56篇 |
1984年 | 50篇 |
1983年 | 15篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 31篇 |
1976年 | 19篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
22.
We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included. 相似文献
23.
We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters. 相似文献
24.
The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant. 相似文献
25.
26.
This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method. 相似文献
27.
具有模糊数的模糊多目标群体决策优选模型与方法 总被引:5,自引:0,他引:5
多目标群体决策问题是运筹学的一个重要研究领域,目前已经提出了一些有效的决策方法。但对目标值和权重均为模糊数的模糊多目标群体决策问题却研究不多,本对此类模糊多目标群体决策问题进行了探讨,利用相对正理想方案与相对负理想方案概念定义了相对差异距离,进而建立了模糊多目标群体决策优选模型与方法,并通过战役决心方案的评价说明了该方法是可行、有效的,可作为军事决策与决策支持系统的备选方法。 相似文献
28.
As borders between different entities, lines are an important element of natural images. Indeed, the neurons of the mammalian
visual cortex are tuned to respond best to lines of a given orientation. This preferred orientation varies continuously across
most of the cortex, but also has vortex-like singularities known as pinwheels. In attempting to describe such patterns of
orientation preference, we are led to consider underlying rotation symmetries: Oriented segments in natural images tend to
be collinear; neurons are more likely to be connected if their preferred orientations are aligned to their topographic separation.
These are indications of a reduced symmetry requiring joint rotations of both orientation preference and the underlying topography.
This is verified by direct statistical tests in both natural images and in cortical maps. Using the statistics of natural
scenes we construct filters that are best suited to extracting information from such images, and find qualitative similarities
to mammalian vision.
PACS84.35+i 89.70.+c 87.57.Nk 相似文献
29.
When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution. 相似文献
30.
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.